diff options
Diffstat (limited to 'semestr-4/sieci')
97 files changed, 4441 insertions, 0 deletions
diff --git a/semestr-4/sieci/cwiczenia1/c1.pdf b/semestr-4/sieci/cwiczenia1/c1.pdf Binary files differnew file mode 100644 index 0000000..ace2fa7 --- /dev/null +++ b/semestr-4/sieci/cwiczenia1/c1.pdf diff --git a/semestr-4/sieci/cwiczenia1/cw1.pdf b/semestr-4/sieci/cwiczenia1/cw1.pdf Binary files differnew file mode 100644 index 0000000..d217892 --- /dev/null +++ b/semestr-4/sieci/cwiczenia1/cw1.pdf diff --git a/semestr-4/sieci/cwiczenia1/out.pdf b/semestr-4/sieci/cwiczenia1/out.pdf Binary files differnew file mode 100644 index 0000000..ea7781d --- /dev/null +++ b/semestr-4/sieci/cwiczenia1/out.pdf diff --git a/semestr-4/sieci/cwiczenia1/rozw.pdf b/semestr-4/sieci/cwiczenia1/rozw.pdf Binary files differnew file mode 100644 index 0000000..f2d1a62 --- /dev/null +++ b/semestr-4/sieci/cwiczenia1/rozw.pdf diff --git a/semestr-4/sieci/cwiczenia2/.cpp.cpp b/semestr-4/sieci/cwiczenia2/.cpp.cpp new file mode 100644 index 0000000..9938f8b --- /dev/null +++ b/semestr-4/sieci/cwiczenia2/.cpp.cpp @@ -0,0 +1,41 @@ +#include<bits/stdc++.h>
+#define fi first
+#define se second
+using namespace std;
+const int N=1e5;
+vector<int> e[N+10];
+int g[N+10];
+int dfs(int x,int k)
+{
+ int ans=0;
+ g[x]=0;
+ for(auto v:e[x])
+ {
+ ans+=dfs(v,k);
+ if(g[v]+1==k)
+ {
+ if(x!=1)
+ ans++;
+ g[v]=-1;
+ }
+ g[x]=max(g[x],g[v]+1);
+ }
+ return ans;
+}
+int main()
+{
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ cout.tie(NULL);
+ int n,k;
+ cin>>n>>k;
+ for(int i=1;i<n;i++)
+ {
+ int a,b;
+ cin>>a>>b;
+ e[b].push_back(a);
+ }
+ cout<<dfs(1,k)<<"\n";
+ return 0;
+}
+
diff --git a/semestr-4/sieci/cwiczenia2/c2.pdf b/semestr-4/sieci/cwiczenia2/c2.pdf Binary files differnew file mode 100644 index 0000000..3216f6f --- /dev/null +++ b/semestr-4/sieci/cwiczenia2/c2.pdf diff --git a/semestr-4/sieci/pracownia1/makefile b/semestr-4/sieci/pracownia1/makefile new file mode 100644 index 0000000..3c48d74 --- /dev/null +++ b/semestr-4/sieci/pracownia1/makefile @@ -0,0 +1,19 @@ +CC=gcc +CFLAGS=-std=gnu17 -O2 -Wall -Wextra +TARGET=traceroute + +all: $(TARGET) + +$(TARGET): $(TARGET).o + $(CC) -o $(TARGET) $(TARGET).o + + +$(TARGET).o: $(TARGET).c + $(CC) $(CFLAGS) -c $(TARGET).c + +distclean: + $(RM) $(TARGET) + $(RM) $(TARGET).o + +clean: + $(RM) $(TARGET).o diff --git a/semestr-4/sieci/pracownia1/p1.pdf b/semestr-4/sieci/pracownia1/p1.pdf Binary files differnew file mode 100644 index 0000000..4b06555 --- /dev/null +++ b/semestr-4/sieci/pracownia1/p1.pdf diff --git a/semestr-4/sieci/pracownia1/traceroute.c b/semestr-4/sieci/pracownia1/traceroute.c new file mode 100644 index 0000000..0e51c14 --- /dev/null +++ b/semestr-4/sieci/pracownia1/traceroute.c @@ -0,0 +1,240 @@ +/* Pracownia programistyczna nr 1 - traceroute + * ImiÄ™ i nazwisko: Franciszek Malinka + * Nr indeksu: 316093 + */ + +#include <stdio.h> +#include <errno.h> +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <strings.h> +#include <string.h> +#include <stdlib.h> +#include <netinet/ip_icmp.h> +#include <assert.h> +#include <time.h> +#include <sys/types.h> +#include <unistd.h> +#include <stdbool.h> + +#define MAX_TTL 30 +#define MESSAGES_PER_TTL 3 +#define NO_MESSAGES -1 +#define TOO_FEW_MESSAGES -2137 + +void print_as_bytes (unsigned char* buff, ssize_t length) +{ + for (ssize_t i = 0; i < length; i++, buff++) + printf ("%.2x ", *buff); +} + +void debug_received(uint8_t *buffer, struct sockaddr_in *sender, int packet_len) { + char ip_str[20]; + inet_ntop(AF_INET, &(sender->sin_addr), ip_str, sizeof(ip_str)); + + printf("IP packet with ICMP content from: %s\n", ip_str); + struct ip* ip_header = (struct ip*) buffer; + ssize_t ip_header_len = 4 * ip_header->ip_hl; + + printf ("IP header: "); + print_as_bytes (buffer, ip_header_len); + printf("\n"); + + printf ("IP data: "); + print_as_bytes (buffer + ip_header_len, packet_len - ip_header_len); + printf("\n\n"); +} + +struct sockaddr_in get_sockaddr_from_ip(char *ip) { + struct sockaddr_in sock; + bzero(&sock, sizeof(sock)); + sock.sin_family = AF_INET; + if (!inet_pton(AF_INET, ip, &sock.sin_addr)) { + fprintf(stderr, "Given ip is invalid: %s\n", ip); + exit(EXIT_FAILURE); + } + return sock; +} + +int create_raw_icmp_socket() { + int sockfd = socket(AF_INET, SOCK_RAW, IPPROTO_ICMP); + if (sockfd < 0) { + fprintf(stderr, "socket error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + return sockfd; +} + +uint16_t compute_icmp_checksum(const void *buff, int length) +{ + uint32_t sum; + const uint16_t* ptr = buff; + assert (length % 2 == 0); + for (sum = 0; length > 0; length -= 2) + sum += *ptr++; + sum = (sum >> 16) + (sum & 0xffff); + return (uint16_t)(~(sum + (sum >> 16))); +} + +struct icmp create_icmp_header(uint16_t seq) { + struct icmp header; + header.icmp_type = ICMP_ECHO; + header.icmp_code = 0; + header.icmp_id = (uint16_t)getpid(); + header.icmp_seq = seq; + header.icmp_cksum = 0; + header.icmp_cksum = compute_icmp_checksum( + (uint16_t*)&header, sizeof(header)); + + return header; +} + +void send_icmp_packet(int sockfd, struct sockaddr_in *destination, int ttl) { + struct icmp header = create_icmp_header(ttl); + setsockopt(sockfd, IPPROTO_IP, IP_TTL, &ttl, sizeof(int)); + + ssize_t bytes_sent = sendto( + sockfd, + &header, + sizeof(header), + 0, + (struct sockaddr*)destination, + sizeof(*destination) + ); + if (bytes_sent == -1) { + fprintf(stderr, "Error while sending ICMP packet: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } +} + +/* Return ip address of the sender of recceived package */ +ssize_t recv_packet(int sockfd, struct sockaddr_in *sender, uint8_t *buffer) { + socklen_t sender_len = sizeof(*sender); + ssize_t packet_len = recvfrom(sockfd, buffer, IP_MAXPACKET, 0, + (struct sockaddr*)sender, &sender_len); + + if (packet_len == -1) { + fprintf(stderr, "Error while recieving a packet: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + return packet_len; +} + +void send_icmp_requests(int sockfd, struct sockaddr_in *destination, int ttl, int tries) { + for (int i = 0; i < tries; i++) { + send_icmp_packet(sockfd, destination, ttl); + } +} + +int try_select(int sockfd, struct timeval *tv) { + fd_set descriptors; + FD_ZERO(&descriptors); + FD_SET(sockfd, &descriptors); + return select(sockfd+1, &descriptors, NULL, NULL, tv); +} + +void pretty_print_router(int ttl, struct in_addr *senders, float mean_wait_time, int messages_received) { + char ip_str[20]; + printf("%d.\t", ttl); + if (messages_received == 0) { + printf("*\n"); + } + else { + for (int i = 0; i < messages_received; i++) { + bool already_printed = false; + for (int j = 0; j < i; j++) { + if (senders[i].s_addr == senders[j].s_addr) { + already_printed = true; + break; + } + } + if (already_printed) continue; + inet_ntop(AF_INET, senders + i, ip_str, sizeof(ip_str)); + printf("%-15s ", ip_str); + } + if (messages_received < MESSAGES_PER_TTL) printf("\t???\n"); + else printf("\t%.2fms\n", mean_wait_time); + } +} + +// This function decapsulates important data from the IMCP replies +void get_important_data(uint8_t *buffer, uint8_t *code, uint16_t *id, uint16_t *seq) { + struct ip* ip_header = (struct ip*) buffer; + ssize_t offset = 4 * ip_header->ip_hl; + *code = ((struct icmp *)(buffer + offset))->icmp_type; + if (*code != ICMP_ECHOREPLY && *code != ICMP_TIMXCEED) { + return; + } else if (*code == ICMP_TIMXCEED) { + offset += ICMP_MINLEN; + offset += 4 * ((struct ip *)(buffer + offset))->ip_hl; + *seq = ((struct icmp *)(buffer + offset))->icmp_seq; + *id = ((struct icmp *)(buffer + offset))->icmp_id; + } else { + *seq = ((struct icmp *)(buffer + offset))->icmp_seq; + *id = ((struct icmp *)(buffer + offset))->icmp_id; + } +} + +// timeout in milliseconds +float get_replies(int sockfd, long timeout, int ttl, int *messages_received, struct in_addr *senders) { + struct sockaddr_in sender; + uint8_t buffer[IP_MAXPACKET]; + int ready; + long mean_wait_time = 0; + struct timeval tv; tv.tv_sec = timeout / 1000; tv.tv_usec = 0; + *messages_received = 0; + + while ((ready = try_select(sockfd, &tv))) { + if (ready < 0) { + fprintf(stderr, "Select error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + recv_packet(sockfd, &sender, buffer); + uint8_t icmp_code = 0; + uint16_t seq = 0, id = 0; + + get_important_data(buffer, &icmp_code, &id, &seq); + if (seq == ttl) { + senders[(*messages_received)++] = sender.sin_addr; + mean_wait_time += timeout * 1000 - tv.tv_usec; + + if (*messages_received == MESSAGES_PER_TTL) break; + } + } + // changing from microseconds to miliseconds + return (float)mean_wait_time / 3.0 / 1000.0; +} + +// Core of the program. +void traceroute(struct sockaddr_in *destination) { + int sockfd = create_raw_icmp_socket(), messages_received = 0; + struct in_addr senders[MESSAGES_PER_TTL]; + + for (int ttl = 1; ttl <= MAX_TTL; ++ttl) { + send_icmp_requests(sockfd, destination, ttl, MESSAGES_PER_TTL); + float mean_wait_time = get_replies(sockfd, 1000, ttl, &messages_received, senders); + pretty_print_router(ttl, senders, mean_wait_time, messages_received); + + // what if our packet branched and we got to the destination faster by some path? + // we gotta make a loop, not an if + for (int i = 0; i < messages_received; i++) { + if (senders[i].s_addr == destination->sin_addr.s_addr) { + return; + } + } + } +} + +int main(int argc, char * argv[]) { + if (argc < 2) { + fprintf(stderr, "Usage:\n\t%s [host ip]\n", argv[0]); + return 1; + } + + struct sockaddr_in destination = get_sockaddr_from_ip(argv[1]); + fprintf(stdout, "traceroute to %s, %d hops max\n", argv[1], MAX_TTL); + traceroute(&destination); + + return 0; +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka.tar.xz b/semestr-4/sieci/pracownia2/franciszek_malinka.tar.xz Binary files differnew file mode 100644 index 0000000..ac3b1f7 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka.tar.xz diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/config.h b/semestr-4/sieci/pracownia2/franciszek_malinka/config.h new file mode 100644 index 0000000..ee4eac0 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/config.h @@ -0,0 +1,15 @@ +#ifndef CONFIG_H +#define CONFIG_H + +#define SERVER_PORT 54321 +#define TURN_LEN_S 20 + +#define INFINITY_DIST 16 +#define REACHABILITY_WAIT_TIME 3 + +#define DV_DATAGRAM_LEN 9 + +#define TURN_LEN_MS (1000 * TURN_LEN_S) +#define TURN_LEN_US (1000000 * TURN_LEN_S) + +#endif diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/dist_vector.c b/semestr-4/sieci/pracownia2/franciszek_malinka/dist_vector.c new file mode 100644 index 0000000..74ae82e --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/dist_vector.c @@ -0,0 +1,114 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "dist_vector.h" +#include <stdio.h> +#include <time.h> +#include <string.h> + +bool is_connected_directly(struct vector_item item) { + return item.is_connected_directly; +} + +bool is_reachable(struct vector_item item) { + return (item.distance < INFINITY_DIST); +} + +void init_dv(list_t *dv, int n_cnt, struct network_addr *neighbours) { + for (int i = 0; i < n_cnt; i++) { + struct vector_item new_item; + new_item.network = neighbours[i]; + new_item.distance = INFINITY_DIST; + new_item.is_connected_directly = true; + insert(dv, &new_item, sizeof(new_item)); + } +} + +void update_dv_reachability(list_t *distance_vector) { + reset(distance_vector); + while (distance_vector->it != NULL) { + struct vector_item *current = (struct vector_item *)distance_vector->it->data; + if(++current->reachable > REACHABILITY_WAIT_TIME) { + if (current->distance >= INFINITY_DIST) { + if (!is_connected_directly(*current)) { + erase_it(distance_vector); + } + } else { + current->distance = INFINITY_DIST; + current->reachable = 0; + } + } + iterate(distance_vector); + } +} + +void update_dv_new_item(list_t *distance_vector, struct vector_item new_item) { + bool new_entry = true; + reset(distance_vector); + while (distance_vector->it != NULL) { + struct vector_item *current = (struct vector_item *)distance_vector->it->data; + + /* If the network is already in the distance vector, then we possibly want to change it: + * - if the new item has better distance than the previous one, then we just want to change it no matter what, + * - if the new item has the same via ip, then we want to check two things: + * - if new item has infinity dist, then we want to set infinity (if it wasn't set, then we want to change reachable to 0) + * - if new item has < inf dist, then we want to change reachable to 0 and set our dist accordingly. + * - else we ignore the entry. + */ + if (get_network_address(current->network).s_addr == get_network_address(new_item.network).s_addr) { + if (current->distance > new_item.distance) { + *current = new_item; + current->reachable = 0; + } else if(current->via_ip.s_addr == new_item.via_ip.s_addr) { + if (new_item.distance >= INFINITY_DIST) { + if (current->distance < INFINITY_DIST) { + current->distance = INFINITY_DIST; + current->reachable = 0; + } + } else { + current->distance = new_item.distance; + current->reachable = 0; + } + } + new_entry = false; + } + + iterate(distance_vector); + } + + if (new_entry && new_item.reachable < INFINITY_DIST) { + insert(distance_vector, &new_item, sizeof(new_item)); + } +} + +void print_dv(list_t *distance_vector) { + time_t rawtime; + struct tm * timeinfo; + + time ( &rawtime ); + timeinfo = localtime ( &rawtime ); + char t[100]; + strcpy(t, asctime(timeinfo)); + t[strlen(t) - 1] = 0; + printf("Distance vector [%s]:\n", t); + reset(distance_vector); + while (distance_vector->it != NULL) { + char addr[20], via_addr[20]; + struct vector_item current = *(struct vector_item *)distance_vector->it->data; + struct in_addr net_addr = get_network_address(current.network); + inet_ntop(AF_INET, &net_addr, addr, sizeof(addr)); + printf("%s/%d ", addr, current.network.netmask); + + if (is_reachable(current)) printf("distance %d ", current.distance); + else printf("unreachable "); + + inet_ntop(AF_INET, ¤t.via_ip, via_addr, sizeof(via_addr)); + if (is_connected_directly(current)) printf("connected directly\n"); + else printf("via %s\n", via_addr); + + iterate(distance_vector); + } + printf("\n"); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/dist_vector.h b/semestr-4/sieci/pracownia2/franciszek_malinka/dist_vector.h new file mode 100644 index 0000000..14159b4 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/dist_vector.h @@ -0,0 +1,36 @@ +#ifndef DIST_VECTOR_H +#define DIST_VECTOR_H + +#include "linked_list.h" +#include "network_addr.h" +#include "config.h" + +/* Item of the distance vector. + * If <<reachable>> is set to 0, then it means that the network is reachable. + * If <<reachable>> has positive value, then it indicates that the network was + * unreachable for <<reachable>> turns. + */ +struct vector_item { + struct network_addr network; + struct in_addr via_ip; + uint16_t distance; + uint8_t reachable; + bool is_connected_directly; +}; + +/* Initis distance vector with given neighbours array. */ +void init_dv(list_t *dv, int n_cnt, struct network_addr *neighbours); + +/* Returns true if given distance vector item is connected directly, false otherwise. */ +bool is_connected_directly(struct vector_item item); + +/* Updates the distance vector. */ +void update_dv_new_item(list_t *distance_vector, struct vector_item new_item); + +/* Updates reachabilities. */ +void update_dv_reachability(list_t *distance_vector); + +/* Print distance vector. */ +void print_dv(list_t *distance_vector); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/linked_list.c b/semestr-4/sieci/pracownia2/franciszek_malinka/linked_list.c new file mode 100644 index 0000000..16113ac --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/linked_list.c @@ -0,0 +1,79 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "linked_list.h" +#include <stdlib.h> +#include <stdint.h> + +node_t *_next(node_t *node) { + return (node == NULL) ? NULL : node->next; +} + +void _insert(node_t **head, void *data, size_t data_size) { + node_t *new_node = (node_t *)malloc(sizeof(node_t)); + new_node->data = malloc(data_size); + for (int i = 0; i < data_size; i++) + *(uint8_t *)(new_node->data + i) = *(uint8_t *)(data + i); + new_node->next = *head; + *head = new_node; +} + +void _free_node(node_t *node) { + free(node->data); + free(node); +} + +void _erase(node_t **head) { + node_t *next_node = _next(*head); + _free_node(*head); + *head = next_node; +} + +void _free_list(node_t *head) { + if (head == NULL) return; + _free_list(head->next); + _free_node(head); +} + +list_t create_list() { + list_t ret; + ret.head = NULL; + ret.it = NULL; + return ret; +} + +void insert(list_t *list, void *data, size_t data_size) { + _insert(&list->head, data, data_size); +} + +void erase(list_t *list) { + _erase(&list->head); +} + +void erase_it(list_t *list) { + if(list->it == NULL) return; + if(list->prev_it == NULL) { + erase(list); + reset(list); + return; + } + list->prev_it->next = _next(list->it); + _free_node(list->it); + list->it = list->prev_it->next; +} + +void iterate(list_t *list) { + list->prev_it = list->it; + list->it = _next(list->it); +} + +void reset(list_t *list) { + list->prev_it = NULL; + list->it = list->head; +} + +void free_list(list_t *list) { + _free_list(list->head); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/linked_list.h b/semestr-4/sieci/pracownia2/franciszek_malinka/linked_list.h new file mode 100644 index 0000000..1574b2f --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/linked_list.h @@ -0,0 +1,42 @@ +#ifndef LINKED_LIST_H +#define LINKED_LIST_H + +#include <stddef.h> + +typedef struct node { + void *data; + struct node *next; +} node_t; + + +typedef struct list_t { + node_t *head; + node_t *it; + node_t *prev_it; +} list_t; + +/* Creates an empty list. */ +list_t create_list(); + +/* Insert a new node in the begining of a list. */ +void insert(list_t *list, void *data, size_t data_size); + +/* Erases first node from the list. */ +void erase(list_t *list); + +/* Erases element under iterator and sets iterator to the next one. */ +void erase_it(list_t *list); + +/* Moves iterator one step. */ +void iterate(list_t *list); + +/* Resets the iterator. + * Should execute the function after if you want to itarate unless you didnt insert or erase anything from the list. + */ +void reset(list_t *list); + +/* Deletes the whole list. */ +void free_list(list_t *list); + + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/makefile b/semestr-4/sieci/pracownia2/franciszek_malinka/makefile new file mode 100644 index 0000000..bf6a327 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/makefile @@ -0,0 +1,34 @@ +CC := gcc +CFLAGS := -O2 -std=gnu17 -Wall -Wall -Wno-unused-result +TARGET := router +TEST := test +DEPS := config.h + +ODIR := obj +_OBJ := router.o utils.o linked_list.o network_addr.o dist_vector.o +OBJ := $(patsubst %,$(ODIR)/%,$(_OBJ)) + +_TEST_OBJ := test.o linked_list.o +TEST_OBJ := $(patsubst %,$(ODIR)/%,$(_TEST_OBJ)) + + +all: $(TARGET) +test: $(TEST) + +$(ODIR)/%.o: %.c $(DEPS) + $(CC) $(CFLAGS) -c -o $@ $< + +$(TARGET): $(OBJ) + $(CC) -o $@ $^ $(CFLAGS) + +$(TEST): $(TEST_OBJ) + $(CC) -o $@ $^ $(CFLAGS) + +clean: + rm -rf $(TARGET) + rm -rf test + +distclean: + rm -rf $(TARGET) + rm -rf test + rm -rf $(ODIR)/*.o diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/network_addr.c b/semestr-4/sieci/pracownia2/franciszek_malinka/network_addr.c new file mode 100644 index 0000000..cac1060 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/network_addr.c @@ -0,0 +1,65 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "network_addr.h" +#include <stdio.h> +#include <string.h> +#include <stdlib.h> + +struct in_addr _get_broadcast_address(struct in_addr addr, uint16_t netmask) { + struct in_addr result = addr; + result.s_addr = ntohl(result.s_addr); + /* bitshift by more than 31 is UB */ + if (netmask == 0) { + result.s_addr = -1; + } + else { + result.s_addr |= ((1 << (32 - netmask)) - 1); + } + result.s_addr = htonl(result.s_addr); + + return result; +} + +struct in_addr _get_network_address(struct in_addr addr, uint16_t netmask) { + struct in_addr result = addr; + result.s_addr = ntohl(result.s_addr); + + if (netmask == 0) { + result.s_addr = 0; + } + else { + result.s_addr &= ~((1 << (32 - netmask)) - 1); + } + result.s_addr = htonl(result.s_addr); + + return result; +} + +struct in_addr get_broadcast_address(struct network_addr na) { + return _get_broadcast_address(na.addr, na.netmask); +} + +struct in_addr get_network_address(struct network_addr na) { + return _get_network_address(na.addr, na.netmask); +} + +void pretty_print_network(struct network_addr na) { + char ip_addr[20]; + inet_ntop(AF_INET, &na.addr, ip_addr, sizeof(ip_addr)); + printf("%s/%d\n", ip_addr, na.netmask); +} + +struct network_addr stona(char *str) { + struct network_addr result; + char addr[20]; + size_t ip_preffix = strcspn(str, "/"); + + strncpy(addr, str, ip_preffix); + addr[ip_preffix] = 0; + inet_pton(AF_INET, addr, &(result.addr)); + result.netmask = atoi(str + ip_preffix + 1); + return result; +} diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/network_addr.h b/semestr-4/sieci/pracownia2/franciszek_malinka/network_addr.h new file mode 100644 index 0000000..6347bbd --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/network_addr.h @@ -0,0 +1,28 @@ +#ifndef ROUTER_ADDR_H +#define ROUTER_ADDR_H + +#include <arpa/inet.h> +#include <stdint.h> +#include <stdbool.h> + +/* Network address with netmask. */ +struct network_addr { + struct in_addr addr; + uint8_t netmask; +}; + +typedef struct network_addr router_addr; + +/* Returns broadcast address of a given network. */ +struct in_addr get_broadcast_address(struct network_addr na); + +/* Returns network address of a given network. */ +struct in_addr get_network_address(struct network_addr na); + +/* Prints network_addr via stdio. */ +void pretty_print_network(struct network_addr na); + +/* Converts string of ip in CIDR notation with a netmask to network_addr. */ +struct network_addr stona(char *str); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/router.c b/semestr-4/sieci/pracownia2/franciszek_malinka/router.c new file mode 100644 index 0000000..b5e732c --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/router.c @@ -0,0 +1,60 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include <stdio.h> +#include <errno.h> +#include <strings.h> +#include <string.h> +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdint.h> +#include <stdlib.h> +#include <unistd.h> +#include <limits.h> +#include "network_addr.h" +#include "utils.h" +#include "dist_vector.h" + +uint16_t read_configuration(struct network_addr** networks, uint16_t **dists) { + uint16_t n; + scanf("%hd", &n); + *networks = malloc(n * sizeof(struct network_addr)); + *dists = malloc(n * sizeof(uint16_t)); + for (int i = 0; i < n; i++) { + char addr[20]; + char _dist[10]; + uint16_t dist; + scanf(" %s %s %hd", addr, _dist, &dist); + (*networks)[i] = stona(addr); + (*dists)[i] = dist; + } + return n; +} + +void router_loop(int sockfd, int networks_number, struct network_addr *networks, uint16_t *dists) { + list_t dv = create_list(); + init_dv(&dv, networks_number, networks); + + printf("Starting the router loop...\n"); + for (;;) { + print_dv(&dv); + propagate_distance_vector(sockfd, networks_number, networks, dists, &dv); + listen_for_routers(sockfd, TURN_LEN_MS, networks_number, networks, dists, &dv); + } +} + +int main() { + struct network_addr* networks; + uint16_t *dists; + int n = read_configuration(&networks, &dists); + int sockfd = get_socket(); + bind_to_port(sockfd, SERVER_PORT); + + router_loop(sockfd, n, networks, dists); + + close(sockfd); + free(networks); + free(dists); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/test.c b/semestr-4/sieci/pracownia2/franciszek_malinka/test.c new file mode 100644 index 0000000..958ff36 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/test.c @@ -0,0 +1,52 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "linked_list.h" +#include <stdlib.h> +#include <stdio.h> + +/* Prints the list of ints to stdio */ +void print_list(list_t list) { + printf("List: "); + reset(&list); + while (list.it != NULL) { + printf("%d, ", *(int *)(list.it->data)); + iterate(&list); + } + printf("\n"); + reset(&list); +} + +int main() { + int n; + scanf("%d", &n); + list_t list = create_list(); + + for (int i = 0; i < n; i++) { + int t; + scanf("%d", &t); + // insert + if (t == 0) { + int val = 0; + scanf("%d", &val); + insert(&list, &val, sizeof(int)); + reset(&list); + } + if (t == 1) { + iterate(&list); + if (list.it != NULL) + printf("it: %d\n", *(int *)list.it->data); + else printf("End of list.\n"); + } + if (t == 2) { + erase_it(&list); + } + if (t == 3) { + print_list(list); + } + } + + free_list(&list); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/utils.c b/semestr-4/sieci/pracownia2/franciszek_malinka/utils.c new file mode 100644 index 0000000..0c0cae5 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/utils.c @@ -0,0 +1,208 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "utils.h" +#include <arpa/inet.h> +#include <netinet/ip.h> +#include <stdlib.h> +#include <errno.h> +#include <stdio.h> +#include <string.h> +#include <limits.h> + +int get_socket() { + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "Socket error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + return sockfd; +} + +void bind_to_port(int sockfd, uint16_t port) { + struct sockaddr_in server_address; + bzero(&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + server_address.sin_port = htons(port); + server_address.sin_addr.s_addr = htonl(INADDR_ANY); + + if (bind(sockfd, (struct sockaddr*)&server_address, sizeof(server_address)) < 0) { + fprintf(stderr, "Bind error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + int broadcastPermission = 1; + setsockopt (sockfd, SOL_SOCKET, SO_BROADCAST, (void *)&broadcastPermission, sizeof(broadcastPermission)); +} + +long get_time_interval(struct timespec start, struct timespec finish) { + return S_TO_MS(finish.tv_sec - start.tv_sec) + NS_TO_MS(finish.tv_nsec - start.tv_nsec); +} + +int poll_socket_modify_timeout(int sockfd, int *timeout) { + if (*timeout < 0) { + *timeout = 0; + return 0; + } + + struct pollfd fds; + struct timespec start; + struct timespec finish; + + fds.fd = sockfd; + fds.events = POLLIN; + fds.revents = 0; + + clock_gettime(CLOCK_REALTIME, &start); + int result = poll(&fds, 1, *timeout); + clock_gettime(CLOCK_REALTIME, &finish); + + if (result == -1) { + fprintf(stderr, "poll error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + if (result == 0) { + *timeout = 0; + return 0; + } + + *timeout -= get_time_interval(start, finish); + return result; +} + +size_t send_message(int sockfd, char *buffer, int buffer_len, struct in_addr network) { + struct sockaddr_in network_address; + bzero (&network_address, sizeof(network_address)); + network_address.sin_family = AF_INET; + network_address.sin_port = htons(SERVER_PORT); + network_address.sin_addr = network; + + return sendto(sockfd, buffer, buffer_len, 0, (struct sockaddr*) &network_address, sizeof(network_address)); +} + +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender) { + socklen_t sender_len = sizeof(*sender); + for (int i = 0; i < DV_DATAGRAM_LEN; i++) buffer[i] = 0; + size_t datagram_len = recvfrom(sockfd, buffer, IP_MAXPACKET, 0, + (struct sockaddr*)sender, &sender_len); + if (datagram_len < 0) { + fprintf(stderr, "recvfrom error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + return datagram_len; +} + +struct vector_item parse_message(char *buffer, struct sockaddr_in *sender) { + struct vector_item res; + uint32_t ip_addr = *(uint32_t *)buffer; + uint32_t dist = *(uint32_t *)(buffer + 5); + dist = ntohl(dist); + + res.network.addr.s_addr = ip_addr; + res.network.netmask = buffer[4]; + res.is_connected_directly = true; + res.via_ip = sender->sin_addr; + res.distance = (dist < INFINITY_DIST ? dist : INFINITY_DIST); + res.reachable = 0; + + char addr[20]; + inet_ntop(AF_INET, &res.network.addr, addr, sizeof(addr)); + char via[20]; + inet_ntop(AF_INET, &sender->sin_addr, via, sizeof(via)); + return res; +} + +void _get_message(struct vector_item item, char *message) { + *(uint32_t *)message = item.network.addr.s_addr; + message[4] = item.network.netmask; + uint32_t distance = htonl(item.distance >= INFINITY_DIST ? INT_MAX : item.distance); + for (int i = 0; i < 4; i++) { + *(message + 5 + i) = *((char *)(&distance) + i); + } +} + +int _send_item(int sockfd, struct network_addr network, struct vector_item item) { + char message[DV_DATAGRAM_LEN + 1]; + _get_message(item, message); + message[DV_DATAGRAM_LEN] = 0; + ssize_t message_len = DV_DATAGRAM_LEN; + + struct in_addr na = get_broadcast_address(network); + + char addr[20]; + inet_ntop(AF_INET, &na, addr, sizeof(addr)); + + int result; + if ((result = send_message(sockfd, message, message_len, na)) != message_len) { + // fprintf(stderr, "sendto error: %s\n", strerror(errno)); + } + return result; +} + +void listen_for_routers(int sockfd, int timeout, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv) { + char buffer[IP_MAXPACKET + 1]; + struct sockaddr_in sender; + + while (poll_socket_modify_timeout(sockfd, &timeout)) { + recv_message(sockfd, buffer, &sender); + struct vector_item new_item = parse_message(buffer, &sender); + + bool is_neighbour = false; + for (int i = 0; i < networks_number; i++) { + if (is_from_network(sender.sin_addr, networks[i])) { + is_neighbour = true; + break; + } + } + + /* Shouldn't happen, just in case. */ + if (!is_neighbour) { + char addr[20]; + inet_ntop(AF_INET, &sender.sin_addr, addr, sizeof(addr)); + fprintf(stderr, "Received datagram from %s, he is in none of my networks, ignoring\n. Maybe his VM routing table is configured incorrectly?\n", addr); + continue; + } + + if (!is_from_network(sender.sin_addr, new_item.network)) { + new_item.is_connected_directly = false; + + for (int i = 0; i < networks_number; i++) { + if (is_from_network(sender.sin_addr, networks[i])) { + new_item.distance += dists[i]; + break; + } + } + } + + update_dv_new_item(dv, new_item); + } + update_dv_reachability(dv); +} + +void propagate_distance_vector(int sockfd, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv) { + for (int i = 0; i < networks_number; i++) { + reset(dv); + while (dv->it != NULL) { + struct vector_item data = *(struct vector_item *)dv->it->data; + if (!(get_network_address(data.network).s_addr == get_network_address(networks[i]).s_addr) && data.reachable <= REACHABILITY_WAIT_TIME) { + _send_item(sockfd, networks[i], data); + } + iterate(dv); + } + + struct vector_item self_item; + self_item.distance = dists[i]; + self_item.network = networks[i]; + _send_item(sockfd, networks[i], self_item); + } +} + +bool is_from_network(struct in_addr ip_addr, struct network_addr network) { + struct network_addr temp; + temp.addr= ip_addr; + temp.netmask = network.netmask; + return (get_network_address(temp).s_addr == get_network_address(network).s_addr); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/franciszek_malinka/utils.h b/semestr-4/sieci/pracownia2/franciszek_malinka/utils.h new file mode 100644 index 0000000..edf90d0 --- /dev/null +++ b/semestr-4/sieci/pracownia2/franciszek_malinka/utils.h @@ -0,0 +1,52 @@ +#ifndef UTILS_H +#define UTILS_H +#define UTILS_H + +#include "config.h" +#include <stdint.h> +#include <time.h> +#include <poll.h> +#include "network_addr.h" +#include "dist_vector.h" + +#define NS_TO_MS(X) ((long)(X) / (long)1000000) +#define S_TO_MS(X) ((long)(X) * (long)1000) + +/* Returns a UDP socket. */ +int get_socket(); + +/* Binds socket to given port and set the broadcast permission. */ +void bind_to_port(int sockfd, uint16_t port); + +/* Computes the time elapsed between start and finish in miliseconds. */ +long get_time_interval(struct timespec start, struct timespec finish); + +/* Polls given socket with given timeout and changes the timeout accordingly. */ +int poll_socket_modify_timeout(int sockfd, int *timeout); + +/* For debug purposes only. Recieves and prints UDP message. */ +void recv_and_print(int sockfd, int networks_number, struct network_addr *networks); + +/* Sends message in buffer of length buffer_len to addr through given socket. + * IT DOES NOT TERMINATE THE PROGRAM IF SENDTO RETURNS ANY ERRORS! + * One must handle the errors on their own. + */ +size_t send_message(int sockfd, char *buffer, int buffer_len, struct in_addr addr); + +/* Receive message and write it to buffer. */ +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender); + +/* Parse datagram into a vector item. */ +struct vector_item parse_message(char *buffer, struct sockaddr_in *sender); + +/* Listnes for routers for timeout ms. */ +void listen_for_routers(int sockfd, int timeout, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv); + +/* Propagates dv to all connected networks. */ +void propagate_distance_vector(int sockfd, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv); + +/* Checks if given address is in network range. */ +bool is_from_network(struct in_addr ip_addr, struct network_addr network); + + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/p2.pdf b/semestr-4/sieci/pracownia2/p2.pdf Binary files differnew file mode 100644 index 0000000..f0cc942 --- /dev/null +++ b/semestr-4/sieci/pracownia2/p2.pdf diff --git a/semestr-4/sieci/pracownia2/router/config.h b/semestr-4/sieci/pracownia2/router/config.h new file mode 100644 index 0000000..f83c556 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/config.h @@ -0,0 +1,15 @@ +#ifndef CONFIG_H +#define CONFIG_H + +#define SERVER_PORT 54321 +#define TURN_LEN_S 5 + +#define INFINITY_DIST 16 +#define REACHABILITY_WAIT_TIME 3 + +#define DV_DATAGRAM_LEN 9 + +#define TURN_LEN_MS (1000 * TURN_LEN_S) +#define TURN_LEN_US (1000000 * TURN_LEN_S) + +#endif diff --git a/semestr-4/sieci/pracownia2/router/dist_vector.c b/semestr-4/sieci/pracownia2/router/dist_vector.c new file mode 100644 index 0000000..74ae82e --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/dist_vector.c @@ -0,0 +1,114 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "dist_vector.h" +#include <stdio.h> +#include <time.h> +#include <string.h> + +bool is_connected_directly(struct vector_item item) { + return item.is_connected_directly; +} + +bool is_reachable(struct vector_item item) { + return (item.distance < INFINITY_DIST); +} + +void init_dv(list_t *dv, int n_cnt, struct network_addr *neighbours) { + for (int i = 0; i < n_cnt; i++) { + struct vector_item new_item; + new_item.network = neighbours[i]; + new_item.distance = INFINITY_DIST; + new_item.is_connected_directly = true; + insert(dv, &new_item, sizeof(new_item)); + } +} + +void update_dv_reachability(list_t *distance_vector) { + reset(distance_vector); + while (distance_vector->it != NULL) { + struct vector_item *current = (struct vector_item *)distance_vector->it->data; + if(++current->reachable > REACHABILITY_WAIT_TIME) { + if (current->distance >= INFINITY_DIST) { + if (!is_connected_directly(*current)) { + erase_it(distance_vector); + } + } else { + current->distance = INFINITY_DIST; + current->reachable = 0; + } + } + iterate(distance_vector); + } +} + +void update_dv_new_item(list_t *distance_vector, struct vector_item new_item) { + bool new_entry = true; + reset(distance_vector); + while (distance_vector->it != NULL) { + struct vector_item *current = (struct vector_item *)distance_vector->it->data; + + /* If the network is already in the distance vector, then we possibly want to change it: + * - if the new item has better distance than the previous one, then we just want to change it no matter what, + * - if the new item has the same via ip, then we want to check two things: + * - if new item has infinity dist, then we want to set infinity (if it wasn't set, then we want to change reachable to 0) + * - if new item has < inf dist, then we want to change reachable to 0 and set our dist accordingly. + * - else we ignore the entry. + */ + if (get_network_address(current->network).s_addr == get_network_address(new_item.network).s_addr) { + if (current->distance > new_item.distance) { + *current = new_item; + current->reachable = 0; + } else if(current->via_ip.s_addr == new_item.via_ip.s_addr) { + if (new_item.distance >= INFINITY_DIST) { + if (current->distance < INFINITY_DIST) { + current->distance = INFINITY_DIST; + current->reachable = 0; + } + } else { + current->distance = new_item.distance; + current->reachable = 0; + } + } + new_entry = false; + } + + iterate(distance_vector); + } + + if (new_entry && new_item.reachable < INFINITY_DIST) { + insert(distance_vector, &new_item, sizeof(new_item)); + } +} + +void print_dv(list_t *distance_vector) { + time_t rawtime; + struct tm * timeinfo; + + time ( &rawtime ); + timeinfo = localtime ( &rawtime ); + char t[100]; + strcpy(t, asctime(timeinfo)); + t[strlen(t) - 1] = 0; + printf("Distance vector [%s]:\n", t); + reset(distance_vector); + while (distance_vector->it != NULL) { + char addr[20], via_addr[20]; + struct vector_item current = *(struct vector_item *)distance_vector->it->data; + struct in_addr net_addr = get_network_address(current.network); + inet_ntop(AF_INET, &net_addr, addr, sizeof(addr)); + printf("%s/%d ", addr, current.network.netmask); + + if (is_reachable(current)) printf("distance %d ", current.distance); + else printf("unreachable "); + + inet_ntop(AF_INET, ¤t.via_ip, via_addr, sizeof(via_addr)); + if (is_connected_directly(current)) printf("connected directly\n"); + else printf("via %s\n", via_addr); + + iterate(distance_vector); + } + printf("\n"); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/dist_vector.h b/semestr-4/sieci/pracownia2/router/dist_vector.h new file mode 100644 index 0000000..14159b4 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/dist_vector.h @@ -0,0 +1,36 @@ +#ifndef DIST_VECTOR_H +#define DIST_VECTOR_H + +#include "linked_list.h" +#include "network_addr.h" +#include "config.h" + +/* Item of the distance vector. + * If <<reachable>> is set to 0, then it means that the network is reachable. + * If <<reachable>> has positive value, then it indicates that the network was + * unreachable for <<reachable>> turns. + */ +struct vector_item { + struct network_addr network; + struct in_addr via_ip; + uint16_t distance; + uint8_t reachable; + bool is_connected_directly; +}; + +/* Initis distance vector with given neighbours array. */ +void init_dv(list_t *dv, int n_cnt, struct network_addr *neighbours); + +/* Returns true if given distance vector item is connected directly, false otherwise. */ +bool is_connected_directly(struct vector_item item); + +/* Updates the distance vector. */ +void update_dv_new_item(list_t *distance_vector, struct vector_item new_item); + +/* Updates reachabilities. */ +void update_dv_reachability(list_t *distance_vector); + +/* Print distance vector. */ +void print_dv(list_t *distance_vector); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/linked_list.c b/semestr-4/sieci/pracownia2/router/linked_list.c new file mode 100644 index 0000000..16113ac --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/linked_list.c @@ -0,0 +1,79 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "linked_list.h" +#include <stdlib.h> +#include <stdint.h> + +node_t *_next(node_t *node) { + return (node == NULL) ? NULL : node->next; +} + +void _insert(node_t **head, void *data, size_t data_size) { + node_t *new_node = (node_t *)malloc(sizeof(node_t)); + new_node->data = malloc(data_size); + for (int i = 0; i < data_size; i++) + *(uint8_t *)(new_node->data + i) = *(uint8_t *)(data + i); + new_node->next = *head; + *head = new_node; +} + +void _free_node(node_t *node) { + free(node->data); + free(node); +} + +void _erase(node_t **head) { + node_t *next_node = _next(*head); + _free_node(*head); + *head = next_node; +} + +void _free_list(node_t *head) { + if (head == NULL) return; + _free_list(head->next); + _free_node(head); +} + +list_t create_list() { + list_t ret; + ret.head = NULL; + ret.it = NULL; + return ret; +} + +void insert(list_t *list, void *data, size_t data_size) { + _insert(&list->head, data, data_size); +} + +void erase(list_t *list) { + _erase(&list->head); +} + +void erase_it(list_t *list) { + if(list->it == NULL) return; + if(list->prev_it == NULL) { + erase(list); + reset(list); + return; + } + list->prev_it->next = _next(list->it); + _free_node(list->it); + list->it = list->prev_it->next; +} + +void iterate(list_t *list) { + list->prev_it = list->it; + list->it = _next(list->it); +} + +void reset(list_t *list) { + list->prev_it = NULL; + list->it = list->head; +} + +void free_list(list_t *list) { + _free_list(list->head); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/linked_list.h b/semestr-4/sieci/pracownia2/router/linked_list.h new file mode 100644 index 0000000..1574b2f --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/linked_list.h @@ -0,0 +1,42 @@ +#ifndef LINKED_LIST_H +#define LINKED_LIST_H + +#include <stddef.h> + +typedef struct node { + void *data; + struct node *next; +} node_t; + + +typedef struct list_t { + node_t *head; + node_t *it; + node_t *prev_it; +} list_t; + +/* Creates an empty list. */ +list_t create_list(); + +/* Insert a new node in the begining of a list. */ +void insert(list_t *list, void *data, size_t data_size); + +/* Erases first node from the list. */ +void erase(list_t *list); + +/* Erases element under iterator and sets iterator to the next one. */ +void erase_it(list_t *list); + +/* Moves iterator one step. */ +void iterate(list_t *list); + +/* Resets the iterator. + * Should execute the function after if you want to itarate unless you didnt insert or erase anything from the list. + */ +void reset(list_t *list); + +/* Deletes the whole list. */ +void free_list(list_t *list); + + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/makefile b/semestr-4/sieci/pracownia2/router/makefile new file mode 100644 index 0000000..bf6a327 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/makefile @@ -0,0 +1,34 @@ +CC := gcc +CFLAGS := -O2 -std=gnu17 -Wall -Wall -Wno-unused-result +TARGET := router +TEST := test +DEPS := config.h + +ODIR := obj +_OBJ := router.o utils.o linked_list.o network_addr.o dist_vector.o +OBJ := $(patsubst %,$(ODIR)/%,$(_OBJ)) + +_TEST_OBJ := test.o linked_list.o +TEST_OBJ := $(patsubst %,$(ODIR)/%,$(_TEST_OBJ)) + + +all: $(TARGET) +test: $(TEST) + +$(ODIR)/%.o: %.c $(DEPS) + $(CC) $(CFLAGS) -c -o $@ $< + +$(TARGET): $(OBJ) + $(CC) -o $@ $^ $(CFLAGS) + +$(TEST): $(TEST_OBJ) + $(CC) -o $@ $^ $(CFLAGS) + +clean: + rm -rf $(TARGET) + rm -rf test + +distclean: + rm -rf $(TARGET) + rm -rf test + rm -rf $(ODIR)/*.o diff --git a/semestr-4/sieci/pracownia2/router/network_addr.c b/semestr-4/sieci/pracownia2/router/network_addr.c new file mode 100644 index 0000000..cac1060 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/network_addr.c @@ -0,0 +1,65 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "network_addr.h" +#include <stdio.h> +#include <string.h> +#include <stdlib.h> + +struct in_addr _get_broadcast_address(struct in_addr addr, uint16_t netmask) { + struct in_addr result = addr; + result.s_addr = ntohl(result.s_addr); + /* bitshift by more than 31 is UB */ + if (netmask == 0) { + result.s_addr = -1; + } + else { + result.s_addr |= ((1 << (32 - netmask)) - 1); + } + result.s_addr = htonl(result.s_addr); + + return result; +} + +struct in_addr _get_network_address(struct in_addr addr, uint16_t netmask) { + struct in_addr result = addr; + result.s_addr = ntohl(result.s_addr); + + if (netmask == 0) { + result.s_addr = 0; + } + else { + result.s_addr &= ~((1 << (32 - netmask)) - 1); + } + result.s_addr = htonl(result.s_addr); + + return result; +} + +struct in_addr get_broadcast_address(struct network_addr na) { + return _get_broadcast_address(na.addr, na.netmask); +} + +struct in_addr get_network_address(struct network_addr na) { + return _get_network_address(na.addr, na.netmask); +} + +void pretty_print_network(struct network_addr na) { + char ip_addr[20]; + inet_ntop(AF_INET, &na.addr, ip_addr, sizeof(ip_addr)); + printf("%s/%d\n", ip_addr, na.netmask); +} + +struct network_addr stona(char *str) { + struct network_addr result; + char addr[20]; + size_t ip_preffix = strcspn(str, "/"); + + strncpy(addr, str, ip_preffix); + addr[ip_preffix] = 0; + inet_pton(AF_INET, addr, &(result.addr)); + result.netmask = atoi(str + ip_preffix + 1); + return result; +} diff --git a/semestr-4/sieci/pracownia2/router/network_addr.h b/semestr-4/sieci/pracownia2/router/network_addr.h new file mode 100644 index 0000000..6347bbd --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/network_addr.h @@ -0,0 +1,28 @@ +#ifndef ROUTER_ADDR_H +#define ROUTER_ADDR_H + +#include <arpa/inet.h> +#include <stdint.h> +#include <stdbool.h> + +/* Network address with netmask. */ +struct network_addr { + struct in_addr addr; + uint8_t netmask; +}; + +typedef struct network_addr router_addr; + +/* Returns broadcast address of a given network. */ +struct in_addr get_broadcast_address(struct network_addr na); + +/* Returns network address of a given network. */ +struct in_addr get_network_address(struct network_addr na); + +/* Prints network_addr via stdio. */ +void pretty_print_network(struct network_addr na); + +/* Converts string of ip in CIDR notation with a netmask to network_addr. */ +struct network_addr stona(char *str); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/router.c b/semestr-4/sieci/pracownia2/router/router.c new file mode 100644 index 0000000..b5e732c --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/router.c @@ -0,0 +1,60 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include <stdio.h> +#include <errno.h> +#include <strings.h> +#include <string.h> +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdint.h> +#include <stdlib.h> +#include <unistd.h> +#include <limits.h> +#include "network_addr.h" +#include "utils.h" +#include "dist_vector.h" + +uint16_t read_configuration(struct network_addr** networks, uint16_t **dists) { + uint16_t n; + scanf("%hd", &n); + *networks = malloc(n * sizeof(struct network_addr)); + *dists = malloc(n * sizeof(uint16_t)); + for (int i = 0; i < n; i++) { + char addr[20]; + char _dist[10]; + uint16_t dist; + scanf(" %s %s %hd", addr, _dist, &dist); + (*networks)[i] = stona(addr); + (*dists)[i] = dist; + } + return n; +} + +void router_loop(int sockfd, int networks_number, struct network_addr *networks, uint16_t *dists) { + list_t dv = create_list(); + init_dv(&dv, networks_number, networks); + + printf("Starting the router loop...\n"); + for (;;) { + print_dv(&dv); + propagate_distance_vector(sockfd, networks_number, networks, dists, &dv); + listen_for_routers(sockfd, TURN_LEN_MS, networks_number, networks, dists, &dv); + } +} + +int main() { + struct network_addr* networks; + uint16_t *dists; + int n = read_configuration(&networks, &dists); + int sockfd = get_socket(); + bind_to_port(sockfd, SERVER_PORT); + + router_loop(sockfd, n, networks, dists); + + close(sockfd); + free(networks); + free(dists); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/test.c b/semestr-4/sieci/pracownia2/router/test.c new file mode 100644 index 0000000..958ff36 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/test.c @@ -0,0 +1,52 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "linked_list.h" +#include <stdlib.h> +#include <stdio.h> + +/* Prints the list of ints to stdio */ +void print_list(list_t list) { + printf("List: "); + reset(&list); + while (list.it != NULL) { + printf("%d, ", *(int *)(list.it->data)); + iterate(&list); + } + printf("\n"); + reset(&list); +} + +int main() { + int n; + scanf("%d", &n); + list_t list = create_list(); + + for (int i = 0; i < n; i++) { + int t; + scanf("%d", &t); + // insert + if (t == 0) { + int val = 0; + scanf("%d", &val); + insert(&list, &val, sizeof(int)); + reset(&list); + } + if (t == 1) { + iterate(&list); + if (list.it != NULL) + printf("it: %d\n", *(int *)list.it->data); + else printf("End of list.\n"); + } + if (t == 2) { + erase_it(&list); + } + if (t == 3) { + print_list(list); + } + } + + free_list(&list); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/utils.c b/semestr-4/sieci/pracownia2/router/utils.c new file mode 100644 index 0000000..0c0cae5 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/utils.c @@ -0,0 +1,208 @@ +/* + * Program: router + * Autor: Franciszek Malinka, 316093 + */ + +#include "utils.h" +#include <arpa/inet.h> +#include <netinet/ip.h> +#include <stdlib.h> +#include <errno.h> +#include <stdio.h> +#include <string.h> +#include <limits.h> + +int get_socket() { + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "Socket error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + return sockfd; +} + +void bind_to_port(int sockfd, uint16_t port) { + struct sockaddr_in server_address; + bzero(&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + server_address.sin_port = htons(port); + server_address.sin_addr.s_addr = htonl(INADDR_ANY); + + if (bind(sockfd, (struct sockaddr*)&server_address, sizeof(server_address)) < 0) { + fprintf(stderr, "Bind error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + int broadcastPermission = 1; + setsockopt (sockfd, SOL_SOCKET, SO_BROADCAST, (void *)&broadcastPermission, sizeof(broadcastPermission)); +} + +long get_time_interval(struct timespec start, struct timespec finish) { + return S_TO_MS(finish.tv_sec - start.tv_sec) + NS_TO_MS(finish.tv_nsec - start.tv_nsec); +} + +int poll_socket_modify_timeout(int sockfd, int *timeout) { + if (*timeout < 0) { + *timeout = 0; + return 0; + } + + struct pollfd fds; + struct timespec start; + struct timespec finish; + + fds.fd = sockfd; + fds.events = POLLIN; + fds.revents = 0; + + clock_gettime(CLOCK_REALTIME, &start); + int result = poll(&fds, 1, *timeout); + clock_gettime(CLOCK_REALTIME, &finish); + + if (result == -1) { + fprintf(stderr, "poll error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + if (result == 0) { + *timeout = 0; + return 0; + } + + *timeout -= get_time_interval(start, finish); + return result; +} + +size_t send_message(int sockfd, char *buffer, int buffer_len, struct in_addr network) { + struct sockaddr_in network_address; + bzero (&network_address, sizeof(network_address)); + network_address.sin_family = AF_INET; + network_address.sin_port = htons(SERVER_PORT); + network_address.sin_addr = network; + + return sendto(sockfd, buffer, buffer_len, 0, (struct sockaddr*) &network_address, sizeof(network_address)); +} + +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender) { + socklen_t sender_len = sizeof(*sender); + for (int i = 0; i < DV_DATAGRAM_LEN; i++) buffer[i] = 0; + size_t datagram_len = recvfrom(sockfd, buffer, IP_MAXPACKET, 0, + (struct sockaddr*)sender, &sender_len); + if (datagram_len < 0) { + fprintf(stderr, "recvfrom error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + return datagram_len; +} + +struct vector_item parse_message(char *buffer, struct sockaddr_in *sender) { + struct vector_item res; + uint32_t ip_addr = *(uint32_t *)buffer; + uint32_t dist = *(uint32_t *)(buffer + 5); + dist = ntohl(dist); + + res.network.addr.s_addr = ip_addr; + res.network.netmask = buffer[4]; + res.is_connected_directly = true; + res.via_ip = sender->sin_addr; + res.distance = (dist < INFINITY_DIST ? dist : INFINITY_DIST); + res.reachable = 0; + + char addr[20]; + inet_ntop(AF_INET, &res.network.addr, addr, sizeof(addr)); + char via[20]; + inet_ntop(AF_INET, &sender->sin_addr, via, sizeof(via)); + return res; +} + +void _get_message(struct vector_item item, char *message) { + *(uint32_t *)message = item.network.addr.s_addr; + message[4] = item.network.netmask; + uint32_t distance = htonl(item.distance >= INFINITY_DIST ? INT_MAX : item.distance); + for (int i = 0; i < 4; i++) { + *(message + 5 + i) = *((char *)(&distance) + i); + } +} + +int _send_item(int sockfd, struct network_addr network, struct vector_item item) { + char message[DV_DATAGRAM_LEN + 1]; + _get_message(item, message); + message[DV_DATAGRAM_LEN] = 0; + ssize_t message_len = DV_DATAGRAM_LEN; + + struct in_addr na = get_broadcast_address(network); + + char addr[20]; + inet_ntop(AF_INET, &na, addr, sizeof(addr)); + + int result; + if ((result = send_message(sockfd, message, message_len, na)) != message_len) { + // fprintf(stderr, "sendto error: %s\n", strerror(errno)); + } + return result; +} + +void listen_for_routers(int sockfd, int timeout, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv) { + char buffer[IP_MAXPACKET + 1]; + struct sockaddr_in sender; + + while (poll_socket_modify_timeout(sockfd, &timeout)) { + recv_message(sockfd, buffer, &sender); + struct vector_item new_item = parse_message(buffer, &sender); + + bool is_neighbour = false; + for (int i = 0; i < networks_number; i++) { + if (is_from_network(sender.sin_addr, networks[i])) { + is_neighbour = true; + break; + } + } + + /* Shouldn't happen, just in case. */ + if (!is_neighbour) { + char addr[20]; + inet_ntop(AF_INET, &sender.sin_addr, addr, sizeof(addr)); + fprintf(stderr, "Received datagram from %s, he is in none of my networks, ignoring\n. Maybe his VM routing table is configured incorrectly?\n", addr); + continue; + } + + if (!is_from_network(sender.sin_addr, new_item.network)) { + new_item.is_connected_directly = false; + + for (int i = 0; i < networks_number; i++) { + if (is_from_network(sender.sin_addr, networks[i])) { + new_item.distance += dists[i]; + break; + } + } + } + + update_dv_new_item(dv, new_item); + } + update_dv_reachability(dv); +} + +void propagate_distance_vector(int sockfd, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv) { + for (int i = 0; i < networks_number; i++) { + reset(dv); + while (dv->it != NULL) { + struct vector_item data = *(struct vector_item *)dv->it->data; + if (!(get_network_address(data.network).s_addr == get_network_address(networks[i]).s_addr) && data.reachable <= REACHABILITY_WAIT_TIME) { + _send_item(sockfd, networks[i], data); + } + iterate(dv); + } + + struct vector_item self_item; + self_item.distance = dists[i]; + self_item.network = networks[i]; + _send_item(sockfd, networks[i], self_item); + } +} + +bool is_from_network(struct in_addr ip_addr, struct network_addr network) { + struct network_addr temp; + temp.addr= ip_addr; + temp.netmask = network.netmask; + return (get_network_address(temp).s_addr == get_network_address(network).s_addr); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/router/utils.h b/semestr-4/sieci/pracownia2/router/utils.h new file mode 100644 index 0000000..edf90d0 --- /dev/null +++ b/semestr-4/sieci/pracownia2/router/utils.h @@ -0,0 +1,52 @@ +#ifndef UTILS_H +#define UTILS_H +#define UTILS_H + +#include "config.h" +#include <stdint.h> +#include <time.h> +#include <poll.h> +#include "network_addr.h" +#include "dist_vector.h" + +#define NS_TO_MS(X) ((long)(X) / (long)1000000) +#define S_TO_MS(X) ((long)(X) * (long)1000) + +/* Returns a UDP socket. */ +int get_socket(); + +/* Binds socket to given port and set the broadcast permission. */ +void bind_to_port(int sockfd, uint16_t port); + +/* Computes the time elapsed between start and finish in miliseconds. */ +long get_time_interval(struct timespec start, struct timespec finish); + +/* Polls given socket with given timeout and changes the timeout accordingly. */ +int poll_socket_modify_timeout(int sockfd, int *timeout); + +/* For debug purposes only. Recieves and prints UDP message. */ +void recv_and_print(int sockfd, int networks_number, struct network_addr *networks); + +/* Sends message in buffer of length buffer_len to addr through given socket. + * IT DOES NOT TERMINATE THE PROGRAM IF SENDTO RETURNS ANY ERRORS! + * One must handle the errors on their own. + */ +size_t send_message(int sockfd, char *buffer, int buffer_len, struct in_addr addr); + +/* Receive message and write it to buffer. */ +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender); + +/* Parse datagram into a vector item. */ +struct vector_item parse_message(char *buffer, struct sockaddr_in *sender); + +/* Listnes for routers for timeout ms. */ +void listen_for_routers(int sockfd, int timeout, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv); + +/* Propagates dv to all connected networks. */ +void propagate_distance_vector(int sockfd, int networks_number, struct network_addr *networks, uint16_t *dists, list_t *dv); + +/* Checks if given address is in network range. */ +bool is_from_network(struct in_addr ip_addr, struct network_addr network); + + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia2/udp_client.c b/semestr-4/sieci/pracownia2/udp_client.c new file mode 100755 index 0000000..4e7dce4 --- /dev/null +++ b/semestr-4/sieci/pracownia2/udp_client.c @@ -0,0 +1,41 @@ +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <unistd.h> +#include <errno.h> + +int main(int argc, char * argv[]) +{ + if (argc < 2) { + printf("Usage:\n\t%s [server ip]\n", argv[0]); + return -1; + } + + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "socket error: %s\n", strerror(errno)); + return EXIT_FAILURE; + } + + struct sockaddr_in server_address; + bzero (&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + server_address.sin_port = htons(54321); + if (!inet_pton(AF_INET, argv[1], &server_address.sin_addr)) { + printf("Inavlid ip address\n"); + return -1; + } + + char* message = "Hello server!"; + ssize_t message_len = strlen(message); + if (sendto(sockfd, message, message_len, 0, (struct sockaddr*) &server_address, sizeof(server_address)) != message_len) { + fprintf(stderr, "sendto error: %s\n", strerror(errno)); + return EXIT_FAILURE; + } + + close (sockfd); + return EXIT_SUCCESS; +} + diff --git a/semestr-4/sieci/pracownia2/udp_server.c b/semestr-4/sieci/pracownia2/udp_server.c new file mode 100755 index 0000000..b5ae6d1 --- /dev/null +++ b/semestr-4/sieci/pracownia2/udp_server.c @@ -0,0 +1,59 @@ +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <unistd.h> +#include <errno.h> + +int main() +{ + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "socket error: %s\n", strerror(errno)); + return EXIT_FAILURE; + } + + struct sockaddr_in server_address; + bzero (&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + server_address.sin_port = htons(54321); + server_address.sin_addr.s_addr = htonl(INADDR_ANY); + if (bind (sockfd, (struct sockaddr*)&server_address, sizeof(server_address)) < 0) { + fprintf(stderr, "bind error: %s\n", strerror(errno)); + return EXIT_FAILURE; + } + + for (;;) { + + struct sockaddr_in sender; + socklen_t sender_len = sizeof(sender); + u_int8_t buffer[IP_MAXPACKET+1]; + + ssize_t datagram_len = recvfrom (sockfd, buffer, IP_MAXPACKET, 0, (struct sockaddr*)&sender, &sender_len); + if (datagram_len < 0) { + fprintf(stderr, "recvfrom error: %s\n", strerror(errno)); + return EXIT_FAILURE; + } + + char sender_ip_str[20]; + inet_ntop(AF_INET, &(sender.sin_addr), sender_ip_str, sizeof(sender_ip_str)); + printf ("Received UDP packet from IP address: %s, port: %d\n", sender_ip_str, ntohs(sender.sin_port)); + + buffer[datagram_len] = 0; + printf ("%ld-byte message: +%s+\n", datagram_len, buffer); + + char* reply = "Thank you!"; + ssize_t reply_len = strlen(reply); + if (sendto(sockfd, reply, reply_len, 0, (struct sockaddr*)&sender, sender_len) != reply_len) { + fprintf(stderr, "sendto error: %s\n", strerror(errno)); + return EXIT_FAILURE; + } + + fflush(stdout); + } + + close (sockfd); + return EXIT_SUCCESS; +} + diff --git a/semestr-4/sieci/pracownia3/4pkt/config.h b/semestr-4/sieci/pracownia3/4pkt/config.h new file mode 100644 index 0000000..42ccd89 --- /dev/null +++ b/semestr-4/sieci/pracownia3/4pkt/config.h @@ -0,0 +1,7 @@ +#ifndef CONFIG_H +#define CONFIG_H + +#define DATAGRAM_LEN 1000 +#define HEADER_LEN 40 + +#endif diff --git a/semestr-4/sieci/pracownia3/4pkt/transport.c b/semestr-4/sieci/pracownia3/4pkt/transport.c new file mode 100644 index 0000000..806eb4e --- /dev/null +++ b/semestr-4/sieci/pracownia3/4pkt/transport.c @@ -0,0 +1,152 @@ +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <errno.h> +#include <time.h> +#include <poll.h> +#include <stdbool.h> +#include "config.h" + +#define NS_TO_MS(X) ((long)(X) / (long)1000000) +#define S_TO_MS(X) ((long)(X) * (long)1000) + +int get_socket() { + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "socket error: %s", strerror(errno)); + exit(EXIT_FAILURE); + } + return sockfd; +} + +size_t send_datagram(int sockfd, struct sockaddr_in server_address, char *buffer, size_t buffer_len) { + return sendto(sockfd, buffer, buffer_len, 0, (struct sockaddr*) &server_address, sizeof(server_address)); +} + +void send_data_request(int sockfd, struct sockaddr_in server_address, size_t pos, size_t bytes) { + char buffer[40]; + sprintf(buffer, "GET %ld %ld\n", pos, bytes); + size_t buffer_len = strlen(buffer); + if (send_datagram(sockfd, server_address, buffer, buffer_len) != buffer_len) { + fprintf(stderr, "sendto error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } +} + +long get_time_interval(struct timespec start, struct timespec finish) { + return S_TO_MS(finish.tv_sec - start.tv_sec) + NS_TO_MS(finish.tv_nsec - start.tv_nsec); +} + +int poll_socket_modify_timeout(int sockfd, int *timeout) { + if (*timeout < 0) { + *timeout = 0; + return 0; + } + + struct pollfd fds; + struct timespec start; + struct timespec finish; + + fds.fd = sockfd; + fds.events = POLLIN; + fds.revents = 0; + + clock_gettime(CLOCK_REALTIME, &start); + int result = poll(&fds, 1, *timeout); + clock_gettime(CLOCK_REALTIME, &finish); + + if (result == -1) { + fprintf(stderr, "poll error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + if (result == 0) { + *timeout = 0; + return 0; + } + + *timeout -= get_time_interval(start, finish); + return result; +} + +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender) { + socklen_t sender_len = sizeof(*sender); + bzero(buffer, HEADER_LEN + DATAGRAM_LEN); + bzero(sender, sizeof(*sender)); + size_t datagram_len = recvfrom(sockfd, buffer, IP_MAXPACKET, 0, + (struct sockaddr*)sender, &sender_len); + + if (datagram_len < 0) { + fprintf(stderr, "recvfrom error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + return datagram_len; +} + +inline size_t min(size_t x, size_t y) { return (x<y ? x : y); } + +void receive_file(int sockfd, struct sockaddr_in server_address, const char *file_name, size_t file_len) { + FILE *fd = fopen(file_name, "w"); + if (!fd) { + fprintf(stderr, "fopen error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + size_t bytes_writen = 0; + + size_t recv_pos, recv_len; + struct sockaddr_in sender; + char buffer[DATAGRAM_LEN + HEADER_LEN]; + int prev_len = 0; + + while (file_len) { + send_data_request(sockfd, server_address, bytes_writen, min(file_len, DATAGRAM_LEN)); + int timeout = 10; + while (poll_socket_modify_timeout(sockfd, &timeout)) { + size_t received_bytes = recv_message(sockfd, buffer, &sender); + if (sender.sin_addr.s_addr != server_address.sin_addr.s_addr || sender.sin_port != server_address.sin_port) continue; + sscanf(buffer, "DATA %ld %ld\n", &recv_pos, &recv_len); + if (recv_pos != bytes_writen) continue; + fwrite(buffer + received_bytes - recv_len, sizeof(char), recv_len, fd); + file_len -= recv_len; + bytes_writen += recv_len; + break; + } + if (prev_len != bytes_writen) { + prev_len = bytes_writen; + printf("%.3f%%\n", 100.0 * (float)(bytes_writen) / (float)(file_len+bytes_writen)); + } + } + + fclose(fd); +} + +int main(int argc, char *argv[]) { + if (argc != 5) { + printf("Usage:\n\t%s [server ip] [server port] [output file name] [file size]\n", argv[0]); + return -1; + } + + int sockfd = get_socket(); + struct sockaddr_in server_address; + bzero(&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + if (!inet_pton(AF_INET, argv[1], &server_address.sin_addr)) { + fprintf(stderr, "Invalid ip address: %s\n", argv[1]); + return -1; + } + server_address.sin_port = htons(atoi(argv[2])); + if (server_address.sin_port == 0) { + fprintf(stderr, "Invalid port: %s\n", argv[2]); + return -1; + } + + size_t file_len = atoi(argv[4]); + if (file_len == 0) { + printf("File len is 0, nothing to do here.\n"); + return 0; + } + + receive_file(sockfd, server_address, argv[3], file_len); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/config.h b/semestr-4/sieci/pracownia3/config.h new file mode 100644 index 0000000..3b81646 --- /dev/null +++ b/semestr-4/sieci/pracownia3/config.h @@ -0,0 +1,10 @@ +#ifndef CONFIG_H +#define CONFIG_H + +#define DATAGRAM_LEN 1000 +#define HEADER_LEN 40 + +#define WINDOW_SIZE 3000 +#define TIMEOUT 100 + +#endif diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka.tar.xz b/semestr-4/sieci/pracownia3/franciszek_malinka.tar.xz Binary files differnew file mode 100644 index 0000000..6db8320 --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka.tar.xz diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka/config.h b/semestr-4/sieci/pracownia3/franciszek_malinka/config.h new file mode 100644 index 0000000..3b81646 --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka/config.h @@ -0,0 +1,10 @@ +#ifndef CONFIG_H +#define CONFIG_H + +#define DATAGRAM_LEN 1000 +#define HEADER_LEN 40 + +#define WINDOW_SIZE 3000 +#define TIMEOUT 100 + +#endif diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka/transport.c b/semestr-4/sieci/pracownia3/franciszek_malinka/transport.c new file mode 100644 index 0000000..9226d69 --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka/transport.c @@ -0,0 +1,149 @@ +/* Projekt: Transport + * Autor: Franciszek Malinka 316093 + */ + +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <errno.h> +#include <stdbool.h> +#include "config.h" +#include "window.h" +#include "utils.h" + +size_t send_datagram(int sockfd, struct sockaddr_in server_address, char *buffer, size_t buffer_len) { + return sendto(sockfd, buffer, buffer_len, 0, (struct sockaddr*) &server_address, sizeof(server_address)); +} + +void send_data_request(int sockfd, struct sockaddr_in server_address, size_t pos, size_t bytes) { + char buffer[40]; + sprintf(buffer, "GET %ld %ld\n", pos, bytes); + size_t buffer_len = strlen(buffer); + if (send_datagram(sockfd, server_address, buffer, buffer_len) != buffer_len) { + fprintf(stderr, "sendto error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } +} + +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender) { + socklen_t sender_len = sizeof(*sender); + bzero(buffer, HEADER_LEN + DATAGRAM_LEN); + bzero(sender, sizeof(*sender)); + size_t datagram_len = recvfrom(sockfd, buffer, IP_MAXPACKET, 0, + (struct sockaddr*)sender, &sender_len); + + if (datagram_len < 0) { + fprintf(stderr, "recvfrom error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + return datagram_len; +} + +void request_data(int sockfd, struct sockaddr_in server_address, window_t *w, size_t bytes_writen, size_t remaining_bytes) { + int pos = w->first_pos; + for (int i = 0; i < w->size && i*DATAGRAM_LEN < remaining_bytes; i++) { + if (w->uptodate[pos] == false) { + size_t bytes_to_request = min(DATAGRAM_LEN, remaining_bytes - i*DATAGRAM_LEN); + send_data_request(sockfd, server_address, bytes_writen + i*DATAGRAM_LEN, bytes_to_request); + } + pos = (pos + 1) % w->size; + } +} + +void update_file(FILE *fd, window_t *w, size_t *bytes_writen, size_t *remaining_bytes) { + while (w->uptodate[w->first_pos] && *remaining_bytes > 0) { + // printf("Writing %ld\n", *bytes_writen); + size_t bytes_to_write = min(DATAGRAM_LEN, *remaining_bytes); + fwrite(w->ar[w->first_pos], sizeof(char), bytes_to_write, fd); + *bytes_writen += bytes_to_write; + *remaining_bytes -= bytes_to_write; + shift(w); + } +} + +size_t recv_datagram(int sockfd, char *buffer, struct sockaddr_in server_address) { + struct sockaddr_in sender; + + size_t received_bytes = recv_message(sockfd, buffer, &sender); + if (sender.sin_addr.s_addr != server_address.sin_addr.s_addr || sender.sin_port != server_address.sin_port) { + printf("Smieci!\n"); + return 0; + } + return received_bytes; +} + + +void receive_file(int sockfd, struct sockaddr_in server_address, const char *file_name, size_t remaining_bytes) { + FILE *fd = fopen(file_name, "w"); + if (!fd) { + fprintf(stderr, "fopen error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + size_t bytes_writen = 0; + + size_t recv_pos, recv_len; + char buffer[DATAGRAM_LEN + HEADER_LEN]; + int prev_len = 0; + window_t w; + init_window(&w, WINDOW_SIZE, DATAGRAM_LEN); + + while (remaining_bytes) { + request_data(sockfd, server_address, &w, bytes_writen, remaining_bytes); + int timeout = TIMEOUT; + while (poll_socket_modify_timeout(sockfd, &timeout)) { + size_t received_bytes = recv_datagram(sockfd, buffer, server_address); + if (received_bytes == 0) continue; + sscanf(buffer, "DATA %ld %ld\n", &recv_pos, &recv_len); + if (recv_pos < bytes_writen) continue; + + int pos = (recv_pos - bytes_writen) / DATAGRAM_LEN; + pos = (pos + w.first_pos) % w.size; + if (!w.uptodate[pos]) { + for (int i = 0; i < recv_len; i++) { + w.ar[pos][i] = buffer[i + received_bytes - recv_len]; + } + w.uptodate[pos] = true; + } + update_file(fd, &w, &bytes_writen, &remaining_bytes); + } + + if (prev_len != bytes_writen) { + prev_len = bytes_writen; + printf("%.3f%%\n", 100.0 * (float)(bytes_writen) / (float)(remaining_bytes+bytes_writen)); + } + } + destroy_window(&w); + fclose(fd); +} + +int main(int argc, char *argv[]) { + if (argc != 5) { + printf("Usage:\n\t%s [server ip] [server port] [output file name] [file size]\n", argv[0]); + return -1; + } + + int sockfd = get_socket(); + struct sockaddr_in server_address; + bzero(&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + if (!inet_pton(AF_INET, argv[1], &server_address.sin_addr)) { + fprintf(stderr, "Invalid ip address: %s\n", argv[1]); + return -1; + } + server_address.sin_port = htons(atoi(argv[2])); + if (server_address.sin_port == 0) { + fprintf(stderr, "Invalid port: %s\n", argv[2]); + return -1; + } + + size_t file_len = atoi(argv[4]); + if (file_len == 0) { + printf("File len is 0, nothing to do here.\n"); + return 0; + } + + receive_file(sockfd, server_address, argv[3], file_len); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka/utils.c b/semestr-4/sieci/pracownia3/franciszek_malinka/utils.c new file mode 100644 index 0000000..4c2f449 --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka/utils.c @@ -0,0 +1,58 @@ +/* Projekt: Transport + * Autor: Franciszek Malinka 316093 + */ + +#include "utils.h" +#include <poll.h> +#include <errno.h> +#include <stdio.h> +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdlib.h> +#include <string.h> + +size_t min(size_t x, size_t y) { return (x<y ? x : y); } + +int get_socket() { + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "socket error: %s", strerror(errno)); + exit(EXIT_FAILURE); + } + return sockfd; +} + +long get_time_interval(struct timespec start, struct timespec finish) { + return S_TO_MS(finish.tv_sec - start.tv_sec) + NS_TO_MS(finish.tv_nsec - start.tv_nsec); +} + +int poll_socket_modify_timeout(int sockfd, int *timeout) { + if (*timeout < 0) { + *timeout = 0; + return 0; + } + + struct pollfd fds; + struct timespec start; + struct timespec finish; + + fds.fd = sockfd; + fds.events = POLLIN; + fds.revents = 0; + + clock_gettime(CLOCK_REALTIME, &start); + int result = poll(&fds, 1, *timeout); + clock_gettime(CLOCK_REALTIME, &finish); + + if (result == -1) { + fprintf(stderr, "poll error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + if (result == 0) { + *timeout = 0; + return 0; + } + + *timeout -= get_time_interval(start, finish); + return result; +} diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka/utils.h b/semestr-4/sieci/pracownia3/franciszek_malinka/utils.h new file mode 100644 index 0000000..eccf347 --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka/utils.h @@ -0,0 +1,18 @@ +#ifndef UTILS_H +#define UTILS_H + +#include <stddef.h> +#include <time.h> + +#define NS_TO_MS(X) ((long)(X) / (long)1000000) +#define S_TO_MS(X) ((long)(X) * (long)1000) + +size_t min(size_t x, size_t y); + +int get_socket(); + +long get_time_interval(struct timespec start, struct timespec finish); + +int poll_socket_modify_timeout(int sockfd, int *timeout); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka/window.c b/semestr-4/sieci/pracownia3/franciszek_malinka/window.c new file mode 100644 index 0000000..c8bffad --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka/window.c @@ -0,0 +1,42 @@ +/* Projekt: Transport + * Autor: Franciszek Malinka 316093 + */ + +#include "window.h" +#include <stdlib.h> +#include <strings.h> + +void init_window(window_t *w, int window_size, int window_width) { + w->ar = malloc(window_size * sizeof(char *)); + for (int i = 0; i < window_size; i++) + w->ar[i] = malloc(window_width * sizeof(char)); + w->uptodate = malloc(window_size); + bzero (w->uptodate, window_size); + w->first_pos = 0; + w->size = window_size; +} + +void destroy_window(window_t *w) { + for (int i = 0; i < w->size; i++) + free(w->ar[i]); + free(w->ar); + free(w->uptodate); +} + +void shift_while_uptodate(window_t *w) { + while (w->uptodate[w->first_pos]) { + w->uptodate[w->first_pos] = false; + w->first_pos = (w->first_pos + 1) % w->size; + } +} + +void shift(window_t *w) { + w->uptodate[w->first_pos] = false; + w->first_pos = (w->first_pos + 1) % w->size; +} + +void update(window_t *w, int pos, char *buffer, size_t buf_size) { + pos = (w->first_pos + pos) % w->size; + for (int i = 0; i < buf_size; i++) w->ar[pos][i] = buffer[i]; + w->uptodate[pos] = true; +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/franciszek_malinka/window.h b/semestr-4/sieci/pracownia3/franciszek_malinka/window.h new file mode 100644 index 0000000..63e89cc --- /dev/null +++ b/semestr-4/sieci/pracownia3/franciszek_malinka/window.h @@ -0,0 +1,24 @@ +#ifndef WINDOW_H +#define WINDOW_H + +#include <stdbool.h> +#include <stddef.h> + +typedef struct { + char **ar; + bool *uptodate; + int size; + int first_pos; +} window_t; + +void init_window(window_t *w, int window_size, int window_width); + +void destroy_window(window_t *w); + +void shift_while_uptodate(window_t *w); + +void shift(window_t *w); + +void update(window_t *w, int pos, char *buffer, size_t buf_size); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/p3.pdf b/semestr-4/sieci/pracownia3/p3.pdf Binary files differnew file mode 100644 index 0000000..14f1261 --- /dev/null +++ b/semestr-4/sieci/pracownia3/p3.pdf diff --git a/semestr-4/sieci/pracownia3/transport.c b/semestr-4/sieci/pracownia3/transport.c new file mode 100644 index 0000000..9226d69 --- /dev/null +++ b/semestr-4/sieci/pracownia3/transport.c @@ -0,0 +1,149 @@ +/* Projekt: Transport + * Autor: Franciszek Malinka 316093 + */ + +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <errno.h> +#include <stdbool.h> +#include "config.h" +#include "window.h" +#include "utils.h" + +size_t send_datagram(int sockfd, struct sockaddr_in server_address, char *buffer, size_t buffer_len) { + return sendto(sockfd, buffer, buffer_len, 0, (struct sockaddr*) &server_address, sizeof(server_address)); +} + +void send_data_request(int sockfd, struct sockaddr_in server_address, size_t pos, size_t bytes) { + char buffer[40]; + sprintf(buffer, "GET %ld %ld\n", pos, bytes); + size_t buffer_len = strlen(buffer); + if (send_datagram(sockfd, server_address, buffer, buffer_len) != buffer_len) { + fprintf(stderr, "sendto error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } +} + +size_t recv_message(int sockfd, char *buffer, struct sockaddr_in *sender) { + socklen_t sender_len = sizeof(*sender); + bzero(buffer, HEADER_LEN + DATAGRAM_LEN); + bzero(sender, sizeof(*sender)); + size_t datagram_len = recvfrom(sockfd, buffer, IP_MAXPACKET, 0, + (struct sockaddr*)sender, &sender_len); + + if (datagram_len < 0) { + fprintf(stderr, "recvfrom error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + + return datagram_len; +} + +void request_data(int sockfd, struct sockaddr_in server_address, window_t *w, size_t bytes_writen, size_t remaining_bytes) { + int pos = w->first_pos; + for (int i = 0; i < w->size && i*DATAGRAM_LEN < remaining_bytes; i++) { + if (w->uptodate[pos] == false) { + size_t bytes_to_request = min(DATAGRAM_LEN, remaining_bytes - i*DATAGRAM_LEN); + send_data_request(sockfd, server_address, bytes_writen + i*DATAGRAM_LEN, bytes_to_request); + } + pos = (pos + 1) % w->size; + } +} + +void update_file(FILE *fd, window_t *w, size_t *bytes_writen, size_t *remaining_bytes) { + while (w->uptodate[w->first_pos] && *remaining_bytes > 0) { + // printf("Writing %ld\n", *bytes_writen); + size_t bytes_to_write = min(DATAGRAM_LEN, *remaining_bytes); + fwrite(w->ar[w->first_pos], sizeof(char), bytes_to_write, fd); + *bytes_writen += bytes_to_write; + *remaining_bytes -= bytes_to_write; + shift(w); + } +} + +size_t recv_datagram(int sockfd, char *buffer, struct sockaddr_in server_address) { + struct sockaddr_in sender; + + size_t received_bytes = recv_message(sockfd, buffer, &sender); + if (sender.sin_addr.s_addr != server_address.sin_addr.s_addr || sender.sin_port != server_address.sin_port) { + printf("Smieci!\n"); + return 0; + } + return received_bytes; +} + + +void receive_file(int sockfd, struct sockaddr_in server_address, const char *file_name, size_t remaining_bytes) { + FILE *fd = fopen(file_name, "w"); + if (!fd) { + fprintf(stderr, "fopen error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + size_t bytes_writen = 0; + + size_t recv_pos, recv_len; + char buffer[DATAGRAM_LEN + HEADER_LEN]; + int prev_len = 0; + window_t w; + init_window(&w, WINDOW_SIZE, DATAGRAM_LEN); + + while (remaining_bytes) { + request_data(sockfd, server_address, &w, bytes_writen, remaining_bytes); + int timeout = TIMEOUT; + while (poll_socket_modify_timeout(sockfd, &timeout)) { + size_t received_bytes = recv_datagram(sockfd, buffer, server_address); + if (received_bytes == 0) continue; + sscanf(buffer, "DATA %ld %ld\n", &recv_pos, &recv_len); + if (recv_pos < bytes_writen) continue; + + int pos = (recv_pos - bytes_writen) / DATAGRAM_LEN; + pos = (pos + w.first_pos) % w.size; + if (!w.uptodate[pos]) { + for (int i = 0; i < recv_len; i++) { + w.ar[pos][i] = buffer[i + received_bytes - recv_len]; + } + w.uptodate[pos] = true; + } + update_file(fd, &w, &bytes_writen, &remaining_bytes); + } + + if (prev_len != bytes_writen) { + prev_len = bytes_writen; + printf("%.3f%%\n", 100.0 * (float)(bytes_writen) / (float)(remaining_bytes+bytes_writen)); + } + } + destroy_window(&w); + fclose(fd); +} + +int main(int argc, char *argv[]) { + if (argc != 5) { + printf("Usage:\n\t%s [server ip] [server port] [output file name] [file size]\n", argv[0]); + return -1; + } + + int sockfd = get_socket(); + struct sockaddr_in server_address; + bzero(&server_address, sizeof(server_address)); + server_address.sin_family = AF_INET; + if (!inet_pton(AF_INET, argv[1], &server_address.sin_addr)) { + fprintf(stderr, "Invalid ip address: %s\n", argv[1]); + return -1; + } + server_address.sin_port = htons(atoi(argv[2])); + if (server_address.sin_port == 0) { + fprintf(stderr, "Invalid port: %s\n", argv[2]); + return -1; + } + + size_t file_len = atoi(argv[4]); + if (file_len == 0) { + printf("File len is 0, nothing to do here.\n"); + return 0; + } + + receive_file(sockfd, server_address, argv[3], file_len); +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/utils.c b/semestr-4/sieci/pracownia3/utils.c new file mode 100644 index 0000000..4c2f449 --- /dev/null +++ b/semestr-4/sieci/pracownia3/utils.c @@ -0,0 +1,58 @@ +/* Projekt: Transport + * Autor: Franciszek Malinka 316093 + */ + +#include "utils.h" +#include <poll.h> +#include <errno.h> +#include <stdio.h> +#include <netinet/ip.h> +#include <arpa/inet.h> +#include <stdlib.h> +#include <string.h> + +size_t min(size_t x, size_t y) { return (x<y ? x : y); } + +int get_socket() { + int sockfd = socket(AF_INET, SOCK_DGRAM, 0); + if (sockfd < 0) { + fprintf(stderr, "socket error: %s", strerror(errno)); + exit(EXIT_FAILURE); + } + return sockfd; +} + +long get_time_interval(struct timespec start, struct timespec finish) { + return S_TO_MS(finish.tv_sec - start.tv_sec) + NS_TO_MS(finish.tv_nsec - start.tv_nsec); +} + +int poll_socket_modify_timeout(int sockfd, int *timeout) { + if (*timeout < 0) { + *timeout = 0; + return 0; + } + + struct pollfd fds; + struct timespec start; + struct timespec finish; + + fds.fd = sockfd; + fds.events = POLLIN; + fds.revents = 0; + + clock_gettime(CLOCK_REALTIME, &start); + int result = poll(&fds, 1, *timeout); + clock_gettime(CLOCK_REALTIME, &finish); + + if (result == -1) { + fprintf(stderr, "poll error: %s\n", strerror(errno)); + exit(EXIT_FAILURE); + } + if (result == 0) { + *timeout = 0; + return 0; + } + + *timeout -= get_time_interval(start, finish); + return result; +} diff --git a/semestr-4/sieci/pracownia3/utils.h b/semestr-4/sieci/pracownia3/utils.h new file mode 100644 index 0000000..eccf347 --- /dev/null +++ b/semestr-4/sieci/pracownia3/utils.h @@ -0,0 +1,18 @@ +#ifndef UTILS_H +#define UTILS_H + +#include <stddef.h> +#include <time.h> + +#define NS_TO_MS(X) ((long)(X) / (long)1000000) +#define S_TO_MS(X) ((long)(X) * (long)1000) + +size_t min(size_t x, size_t y); + +int get_socket(); + +long get_time_interval(struct timespec start, struct timespec finish); + +int poll_socket_modify_timeout(int sockfd, int *timeout); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/window.c b/semestr-4/sieci/pracownia3/window.c new file mode 100644 index 0000000..c8bffad --- /dev/null +++ b/semestr-4/sieci/pracownia3/window.c @@ -0,0 +1,42 @@ +/* Projekt: Transport + * Autor: Franciszek Malinka 316093 + */ + +#include "window.h" +#include <stdlib.h> +#include <strings.h> + +void init_window(window_t *w, int window_size, int window_width) { + w->ar = malloc(window_size * sizeof(char *)); + for (int i = 0; i < window_size; i++) + w->ar[i] = malloc(window_width * sizeof(char)); + w->uptodate = malloc(window_size); + bzero (w->uptodate, window_size); + w->first_pos = 0; + w->size = window_size; +} + +void destroy_window(window_t *w) { + for (int i = 0; i < w->size; i++) + free(w->ar[i]); + free(w->ar); + free(w->uptodate); +} + +void shift_while_uptodate(window_t *w) { + while (w->uptodate[w->first_pos]) { + w->uptodate[w->first_pos] = false; + w->first_pos = (w->first_pos + 1) % w->size; + } +} + +void shift(window_t *w) { + w->uptodate[w->first_pos] = false; + w->first_pos = (w->first_pos + 1) % w->size; +} + +void update(window_t *w, int pos, char *buffer, size_t buf_size) { + pos = (w->first_pos + pos) % w->size; + for (int i = 0; i < buf_size; i++) w->ar[pos][i] = buffer[i]; + w->uptodate[pos] = true; +}
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia3/window.h b/semestr-4/sieci/pracownia3/window.h new file mode 100644 index 0000000..63e89cc --- /dev/null +++ b/semestr-4/sieci/pracownia3/window.h @@ -0,0 +1,24 @@ +#ifndef WINDOW_H +#define WINDOW_H + +#include <stdbool.h> +#include <stddef.h> + +typedef struct { + char **ar; + bool *uptodate; + int size; + int first_pos; +} window_t; + +void init_window(window_t *w, int window_size, int window_width); + +void destroy_window(window_t *w); + +void shift_while_uptodate(window_t *w); + +void shift(window_t *w); + +void update(window_t *w, int pos, char *buffer, size_t buf_size); + +#endif
\ No newline at end of file diff --git a/semestr-4/sieci/pracownia4/p4.pdf b/semestr-4/sieci/pracownia4/p4.pdf Binary files differnew file mode 100644 index 0000000..bdaa771 --- /dev/null +++ b/semestr-4/sieci/pracownia4/p4.pdf diff --git a/semestr-4/sieci/warsztaty1/w1.pdf b/semestr-4/sieci/warsztaty1/w1.pdf Binary files differnew file mode 100644 index 0000000..5b50091 --- /dev/null +++ b/semestr-4/sieci/warsztaty1/w1.pdf diff --git a/semestr-4/sieci/warsztaty2/w2.pdf b/semestr-4/sieci/warsztaty2/w2.pdf Binary files differnew file mode 100644 index 0000000..60cdc33 --- /dev/null +++ b/semestr-4/sieci/warsztaty2/w2.pdf diff --git a/semestr-4/sieci/warsztaty3/w3.pdf b/semestr-4/sieci/warsztaty3/w3.pdf Binary files differnew file mode 100644 index 0000000..b0266ad --- /dev/null +++ b/semestr-4/sieci/warsztaty3/w3.pdf diff --git a/semestr-4/sieci/warsztaty4/w4.pdf b/semestr-4/sieci/warsztaty4/w4.pdf Binary files differnew file mode 100644 index 0000000..1d6b54d --- /dev/null +++ b/semestr-4/sieci/warsztaty4/w4.pdf diff --git a/semestr-4/sieci/warsztaty5/w5.pdf b/semestr-4/sieci/warsztaty5/w5.pdf Binary files differnew file mode 100644 index 0000000..e55fb7b --- /dev/null +++ b/semestr-4/sieci/warsztaty5/w5.pdf diff --git a/semestr-4/sieci/warsztaty6/w6.pdf b/semestr-4/sieci/warsztaty6/w6.pdf Binary files differnew file mode 100644 index 0000000..2f6b6c9 --- /dev/null +++ b/semestr-4/sieci/warsztaty6/w6.pdf diff --git a/semestr-4/sieci/warsztaty7/lec10.pdf b/semestr-4/sieci/warsztaty7/lec10.pdf Binary files differnew file mode 100644 index 0000000..d64feee --- /dev/null +++ b/semestr-4/sieci/warsztaty7/lec10.pdf diff --git a/semestr-4/sieci/warsztaty7/lec11.pdf b/semestr-4/sieci/warsztaty7/lec11.pdf Binary files differnew file mode 100644 index 0000000..b48a825 --- /dev/null +++ b/semestr-4/sieci/warsztaty7/lec11.pdf diff --git a/semestr-4/sieci/warsztaty7/lec12.pdf b/semestr-4/sieci/warsztaty7/lec12.pdf Binary files differnew file mode 100644 index 0000000..8bb1580 --- /dev/null +++ b/semestr-4/sieci/warsztaty7/lec12.pdf diff --git a/semestr-4/sieci/warsztaty7/lec9.pdf b/semestr-4/sieci/warsztaty7/lec9.pdf Binary files differnew file mode 100644 index 0000000..c7601b3 --- /dev/null +++ b/semestr-4/sieci/warsztaty7/lec9.pdf diff --git a/semestr-4/sieci/warsztaty7/notes.pdf b/semestr-4/sieci/warsztaty7/notes.pdf Binary files differnew file mode 100644 index 0000000..a02808f --- /dev/null +++ b/semestr-4/sieci/warsztaty7/notes.pdf diff --git a/semestr-4/sieci/warsztaty7/w1.pdf b/semestr-4/sieci/warsztaty7/w1.pdf Binary files differnew file mode 100644 index 0000000..5b50091 --- /dev/null +++ b/semestr-4/sieci/warsztaty7/w1.pdf diff --git a/semestr-4/sieci/warsztaty7/w7.pdf b/semestr-4/sieci/warsztaty7/w7.pdf Binary files differnew file mode 100644 index 0000000..62f35c2 --- /dev/null +++ b/semestr-4/sieci/warsztaty7/w7.pdf diff --git a/semestr-4/sieci/warsztaty8/185551.cpp b/semestr-4/sieci/warsztaty8/185551.cpp new file mode 100644 index 0000000..5d5af6a --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185551.cpp @@ -0,0 +1,41 @@ +#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+#define pb push_back
+#define st first
+#define nd second
+
+const int N = 1000007;
+
+map<ll, int> M;
+ll tab[N];
+vector <ll> v;
+queue <pair<ll, int>> q;
+
+int main () {
+ ios_base::sync_with_stdio(false);
+ cin.tie(0);
+ ll n, a=-1, b=0;
+ M[0]=1;
+ cin>>n;
+ for(int i=0; i<n; i++) {
+ cin>>tab[i];
+ }
+ sort(tab, tab+n);
+ for(int i=0; i<n; i++) {
+ if(a!=tab[i]) b=0;
+ a=tab[i];
+ if(M[a]-b==0) {
+ for(auto u : M) {
+ if(u.nd>0) q.push({u.st+a, u.nd});
+ }
+ while(!q.empty()) M[q.front().st]+=q.front().nd, q.pop();
+ v.pb(a);
+ }
+ b++;
+ }
+ cout<<v.size()<<"\n";
+ for(auto u : v) {
+ cout<<u<<" ";
+ }
+}
diff --git a/semestr-4/sieci/warsztaty8/185786.cpp b/semestr-4/sieci/warsztaty8/185786.cpp new file mode 100644 index 0000000..c858652 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185786.cpp @@ -0,0 +1,59 @@ +#include <bits/stdc++.h>
+using namespace std;
+
+string jednosci[20] = {"", "jeden ", "dwa ", "trzy ", "cztery ", "piec ", "szesc ", "siedem ", "osiem ", "dziewiec "};
+string setki[20] = {"", "sto ", "dwiescie ", "trzysta ", "czterysta ", "piecset ", "szescset ", "siedemset ", "osiemset ", "dziewiecset "};
+string dziesiatki[20] = {"", "", "dwadziescia ", "trzydziesci ", "czterdziesci ", "piecdziesiat ", "szescdziesiat ", "siedemdziesiat ", "osiemdziesiat ", "dziewiecdziesiat "};
+string nastki[20] = {"dziesiec ", "jedenascie ", "dwanascie ", "trzynascie ", "czternascie ", "pietnascie ", "szesnascie ", "siedemnascie ", "osiemnascie ", "dziewietnascie "};
+string mil[20] = {"milionow ", "milionow ", "miliony ", "miliony ", "miliony ", "milionow ", "milionow ", "milionow ", "milionow ", "milionow "};
+string tys[20] = {"tysiecy ", "tysiecy ", "tysiace ", "tysiace ", "tysiace ", "tysiecy ", "tysiecy ", "tysiecy ", "tysiecy ", "tysiecy "};
+
+string do_stu(int n) {
+ string odp="";
+ if(n!=0) {
+ odp+=setki[n/100];
+ int dzies=(n/10)%10;
+ if(dzies!=1) {
+ odp+=dziesiatki[dzies];
+ odp+=jednosci[n%10];
+ }
+ else odp+=nastki[n%10];
+ }
+ return odp;
+}
+
+string miliony(int n) {
+ string odp="";
+ if(n==1) return "milion ";
+ if(n==0) return "";
+ odp+=do_stu(n);
+ int dzies = (n/10)%10;
+ if(dzies==1) odp+="milionow ";
+ else odp+=mil[n%10];
+ return odp;
+}
+
+string tysiace(int n) {
+ string odp="";
+ if(n==1) return "tysiac ";
+ if(n==0) return "";
+ odp+=do_stu(n);
+ int dzies = (n/10)%10;
+ if(dzies==1) odp+="tysiecy ";
+ else odp+=tys[n%10];
+ return odp;
+}
+
+int main () {
+ ios_base::sync_with_stdio(false);
+ cin.tie(0);
+ int n;
+ cin>>n;
+ if(n==0) {
+ cout<<"zero";
+ return 0;
+ }
+ string wynik= miliony(n/1000000)+tysiace((n/1000)%1000)+do_stu(n%1000);
+ cout<<wynik;
+}
+
diff --git a/semestr-4/sieci/warsztaty8/185814.cpp b/semestr-4/sieci/warsztaty8/185814.cpp new file mode 100644 index 0000000..2823f37 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185814.cpp @@ -0,0 +1,64 @@ +#include <bits/stdc++.h>
+using namespace std;
+
+string Jedn[] = {"","jeden","dwa","trzy","cztery","piec","szesc","siedem","osiem","dziewiec"};
+string Nasc[] = {"dziesiec","jedenascie","dwanascie","trzynascie","czternascie","pietnascie","szesnascie","siedemnascie","osiemnascie","dziewietnascie"};
+string Dzie[] = {"","","dwadziescia","trzydziesci","czterdziesci","piecdziesiat","szescdziesiat","siedemdziesiat","osiemdziesiat","dziewiecdziesiat"};
+string Setk[] = {"","sto","dwiescie","trzysta","czterysta","piecset","szescset","siedemset","osiemset","dziewiecset"};
+
+string fragment(int liczba){
+ string ret;
+ int s = liczba/100, d = (liczba/10)%10, j = liczba%10;
+ ret += Setk[s];
+ if(Setk[s] != "") ret += " ";
+
+ if(d == 1) ret += Nasc[j];
+ else{
+ ret += Dzie[d];
+ if(Dzie[d] != "") ret += " ";
+ ret += Jedn[j];
+ }
+ return ret;
+}
+
+string miliony(int ile){
+ if(ile == 0) return "";
+ if(ile == 1) return "milion";
+ int d = ile%10, j = (ile/10)%10;
+ if((d >= 2 && d <= 4) && j != 1) return "miliony";
+ return "milionow";
+}
+
+string tysiace(int ile){
+ if(ile == 0) return "";
+ if(ile == 1) return "tysiac";
+ int d = ile%10, j = (ile/10)%10;
+ if((d >= 2 && d <= 4) && j != 1) return "tysiace";
+ return "tysiecy";
+}
+
+int main(){
+ int n;
+ string wyr;
+ cin >> n;
+ int mln = n/1000000, tys = (n/1000)%1000, jed = n%1000;
+
+ if(n == 0){
+ cout << "zero";
+ return 0;
+ }
+
+ wyr = fragment(mln);
+ if(wyr != "jeden") cout << wyr;
+ if(wyr != "" && wyr != "jeden") cout << " ";
+ cout << miliony(mln);
+ if(wyr != "") cout << " ";
+
+ wyr = fragment(tys);
+ if(wyr != "jeden") cout << wyr;
+ if(wyr != "" && wyr != "jeden") cout << " ";
+ cout << tysiace(tys);
+ if(wyr != "") cout << " ";
+
+ cout << fragment(jed);
+}
\ No newline at end of file diff --git a/semestr-4/sieci/warsztaty8/185880.cpp b/semestr-4/sieci/warsztaty8/185880.cpp new file mode 100644 index 0000000..2643585 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185880.cpp @@ -0,0 +1,131 @@ +#include <bits/stdc++.h>
+using namespace std;
+
+void dziesiatki ( int x);
+void sety ( int x);
+
+string od1do9[]= { "zero", "jeden", "dwa", "trzy", "cztery", "piec", "szesc", "siedem", "osiem", "dziewiec"};
+string od10do19[]= { "dziesiec", "jedynascie", "dwanascie", "trzynascie", "czternascie", "pietnascie", "szesnascie", "siedemnaœcie", "osiemnascie", "dziewietnascie"};
+string od20do90[]= {"", "dwadziescia", "trzydziesci", "czterdziesci", "piecdziesciat", "szescdziesciat", "siedemdziesiat", "osiemdziesiat", "dziewiecdziesiat"};
+string od200do900[]= { "", "dwiescie", "trzysta", "czterysta", "piecset", "szescset", "siedemset", "osiemset", "dziewiecset"};
+
+void miliony ( int x) {
+ if ( x==1) {
+ cout<<"milion ";
+ return;
+ }
+
+ dziesiatki(x);
+ if ( x >= 2 && x<=4) {
+ cout<<"miliony ";
+ } else {
+ cout<<"milionow ";
+ }
+}
+
+void tysiace ( int x) {
+ if ( x==1) {
+ cout<<"tysiac ";
+ } else {
+ if ( x==100) {
+ cout<<"sto tysiecy";
+ } else {
+ if ( x<10) {
+ if ( x<=4) {
+ cout<<od1do9[x]<<" "<<"tysiace ";
+ } else {
+ cout<<od1do9[x]<<" "<<"tysiacy ";
+ }
+
+ } else {
+
+ if ( x>=10 && x<=99) {
+ dziesiatki(x);
+ } else {
+ cout<<od200do900[x/100-1]<<" ";
+ if ( x%100>=10) {
+ dziesiatki(x);
+ }
+ else {
+ if ( x%100>=1 && x%100<=9) {
+ cout<<od1do9[x]<<" ";
+ }
+ }
+
+ }
+ cout<<"tysiecy ";
+ }
+ }
+
+ }
+}
+
+void sety ( int x) {
+ if ( x<100) {
+ if ( x>=10) {
+ dziesiatki(x);
+ } else {
+ if (x!=0) {
+ cout<<od1do9[x]<<" ";
+ }
+
+ }
+ } else {
+
+ if ( x==100) {
+ cout<<"sto ";
+ } else {
+ if ( x/100==1) {
+ cout<<"sto ";
+ dziesiatki(x%100);
+ } else {
+ cout<<od200do900[x/100-1]<<" ";
+ dziesiatki(x%100);
+ }
+
+
+ }
+}
+}
+
+
+void dziesiatki ( int x) {
+ if ( x!=0) {
+ if ( x/10 == 1) {
+ cout<<od10do19[x%10]<<" ";
+ } else {
+ if ( x%10==0) {
+ cout<<od20do90[x/10-1]<<" ";
+ }
+ if ( x/10==0 && x%10!=0) {
+
+ cout<<od1do9[x/10]<<" ";
+ } else {
+ assert ( x/10!=0);
+ assert ( x%10!=0);
+ cout<<od20do90[x/10-1]<<" ";
+ cout<<od1do9[x%10]<<" ";
+ }
+
+ }
+}
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(0);
+ int n;
+ cin>>n;
+ if ( n>=1000000) {
+ miliony ( n/1000000);
+ }
+ n=n%1000000;
+ if ( n>=1000) {
+ tysiace( n/1000);
+ }
+ n=n%1000;
+
+ sety (n);
+}
+
+//b³edy 999999
diff --git a/semestr-4/sieci/warsztaty8/185951.cpp b/semestr-4/sieci/warsztaty8/185951.cpp new file mode 100644 index 0000000..df7c356 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185951.cpp @@ -0,0 +1,109 @@ +#include<iostream>
+using namespace std;
+
+int max_miesiac[12]={31,28,31,30,31,30,31,31,30,31,30,31};
+string dzien[2]={"dzien","dni"};
+string godziny[3]={"godzina","godziny","godzin"};
+string minuty[3]={"minuta","minuty","minut"};
+string sekundy[3]={"sekunda","sekundy","sekund"};
+
+string wypisz(int a, char wyz)
+{
+ int dz=a/10;
+ int j=a%10;
+ if(wyz=='g'){
+ if(j==1 and dz==0){
+ return godziny[0];
+ }else{
+ if(j>=2 and j<=4 and (dz>=2 or dz==0)){
+ return godziny[1];
+ }else{
+ return godziny[2];
+ }
+ }
+ }
+ if(wyz=='m'){
+ if(j==1 and dz==0){
+ return minuty[0];
+ }else{
+ if(j>=2 and j<=4 and (dz>=2 or dz==0)){
+ return minuty[1];
+ }else{
+ return minuty[2];
+ }
+ }
+ }
+ if(wyz=='s'){
+ if(j==1 and dz==0){
+ return sekundy[0];
+ }else{
+ if(j>=2 and j<=4 and (dz>=2 or dz==0)){
+ return sekundy[1];
+ }else{
+ return sekundy[2];
+ }
+ }
+ }
+ return "";
+}
+
+int main(){
+int rok,mies,dni,godz,mi,sek;
+long long time1=0,time2=0;
+char p;
+cin>>rok>>p>>mies>>p>>dni>>godz>>p>>mi>>p>>sek;
+time1=time1+sek+(mi*60)+(godz*3600)+((dni-1)*86400);
+for(int i=0;i<mies-1;i++){
+ if(i==1 and (rok%4==0 and rok!=1900)){
+ time1+=(29*86400);
+ }else{
+ time1+=(max_miesiac[i]*86400);
+ }
+}
+for(int i=1900;i<rok;i++){
+ if(i%4==0 and i!=1900){
+ time1+=(366*86400);
+ }else{
+ time1+=(365*86400);
+ }
+}
+cin>>rok>>p>>mies>>p>>dni>>godz>>p>>mi>>p>>sek;
+cin>>p;
+time2=time2+sek+(mi*60)+(godz*3600)+((dni-1)*86400);
+for(int i=0;i<mies-1;i++){
+ if(i==1 and (rok%4==0 and rok!=1900)){
+ time2+=(29*86400);
+ }else{
+ time2+=(max_miesiac[i]*86400);
+ }
+}
+for(int i=1900;i<rok;i++){
+ if(i%4==0 and i!=1900){
+ time2+=(366*86400);
+ }else{
+ time2+=(365*86400);
+ }
+}
+time1=time2-time1;
+dni=time1/86400;
+godz=(time1/3600)%24;
+mi=(time1/60)%60;
+sek=time1%60;
+if(dni>0){
+ if(dni==1){
+ cout<<dni<<" "<<dzien[0]<<" ";
+ }else{
+ cout<<dni<<" "<<dzien[1]<<" ";
+ }
+}
+if(godz>0){
+ cout<<godz<<" "<<wypisz(godz,'g')<<" ";
+}
+if(mi>0){
+ cout<<mi<<" "<<wypisz(mi,'m')<<" ";
+}
+if(sek>0){
+ cout<<sek<<" "<<wypisz(sek,'s')<<" ";
+}
+return 0;
+}
diff --git a/semestr-4/sieci/warsztaty8/185952.cpp b/semestr-4/sieci/warsztaty8/185952.cpp new file mode 100644 index 0000000..4dc8f72 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185952.cpp @@ -0,0 +1,113 @@ +#include<bits/stdc++.h>
+using namespace std;
+
+int tab[13]= {31,28,31,30,31,30,31,31,30,31,30,31};
+
+int czas(string dt,string g)
+{
+ int lata,msc,dni;
+ long long c1,c2;
+ lata=dt[0]*1000+dt[1]*100+dt[2]*10+dt[3]-'0'*1111-1900;
+ msc=dt[5]*10+dt[6]-11*'0';
+ dni=0;
+ c1=(dt[8]*10+dt[9]-11*'0'-1)*86400;
+ c1+=(g[0]*10+g[1]-11*'0')*3600;
+ c1+=(g[3]*10+g[4]-11*'0')*60;
+ c1+=g[6]*10+g[7]-11*'0';
+ for(int i=0; i<lata*12+msc-1; i++)
+ {
+ if(i%48==0 && dt[1]!=9 && dt[2]!=0 && dt[3]!=0)
+ {
+ c1+=86400;
+ }
+ c1+=tab[i%12]*86400;
+ }
+ return c1;
+}
+int main()
+{
+ long long wynik=0;
+ string dt,g;
+ cin >> dt >> g;
+ long long w1=czas(dt,g);
+ cin >> dt >> g;
+ int n;
+ cin >> n;
+ long long w2=czas(dt,g);
+ long long w=w2-w1;
+ int d=w/86400;
+ w%=86400;
+ int h=w/3600;
+ w%=3600;
+ int m=w/60;
+ w%=60;
+ int s=w;
+ if(d!=0)
+ {
+ cout << d << ' ';
+ if(d==1)
+ {
+ cout << "dzien ";
+ }
+ else
+ {
+ cout << "dni ";
+ }
+ }
+ if(h!=0)
+ {
+ cout << h << ' ';
+ if(h==1)
+ {
+ cout << "godzina ";
+ }
+ else if(h%10>=2 && h%10<=4 && (h<=11 || h>=15))
+ {
+ cout << "godziny ";
+ }
+ else
+ {
+ cout << "godzin ";
+ }
+
+ }
+ if(m!=0)
+ {
+ cout << m << ' ';
+ if(m==1)
+ {
+ cout << "minuta ";
+ }
+ else if(m%10>=2 && m%10<=4 && (m<=11 || m>=15))
+ {
+ cout << "minuty ";
+ }
+ else
+ {
+ cout << "minut ";
+ }
+
+ }
+ if(s!=0)
+ {
+ cout << s << ' ';
+ if(s==1)
+ {
+ cout << "sekunda ";
+ }
+ else if(h%10>=2 && h%10<=4 && (h<=11 || h>=15))
+ {
+ cout << "sekundy ";
+ }
+ else
+ {
+ cout << "sekund ";
+ }
+
+ }
+ cout << "\n";
+}
+
+
+
+
diff --git a/semestr-4/sieci/warsztaty8/185992.cpp b/semestr-4/sieci/warsztaty8/185992.cpp new file mode 100644 index 0000000..491f748 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/185992.cpp @@ -0,0 +1,117 @@ +#include <bits/stdc++.h>
+using namespace std;
+
+void dziesiatki ( int x);
+void sety ( int x);
+
+string od1do9[]= { "zero", "jeden", "dwa", "trzy", "cztery", "piec", "szesc", "siedem", "osiem", "dziewiec"};
+string od10do19[]= { "dziesiec", "jedenascie", "dwanascie", "trzynascie", "czternascie", "pietnascie", "szesnascie", "siedemnascie", "osiemnascie", "dziewietnascie"};
+string od20do90[]= {"", "dwadziescia", "trzydziesci", "czterdziesci", "piecdziesiat", "szescdziesiat", "siedemdziesiat", "osiemdziesiat", "dziewiecdziesiat"};
+string od200do900[]= { "", "dwiescie", "trzysta", "czterysta", "piecset", "szescset", "siedemset", "osiemset", "dziewiecset"};
+
+void miliony ( int x) {
+ if ( x==1) {
+ cout<<"milion ";
+ return;
+ }
+ dziesiatki(x);
+ if ( ( x >= 2 && x<=4) || ( x%10 >= 2 && x%10<=4) ) {
+ cout<<"miliony ";
+ return;
+ } else {
+ cout<<"milionow ";
+ return;
+ }
+
+}
+
+void tysiace ( int x) {
+ if ( x==1) {
+ cout<<"tysiac ";
+ return;
+ }
+ if ( x==100) {
+ cout<<"sto tysiecy";
+ return;
+ }
+ if ( x<10) {
+ if ( x<=4) {
+ cout<<od1do9[x]<<" "<<"tysiace ";
+ } else {
+ cout<<od1do9[x]<<" "<<"tysiecy ";
+ }
+ return;
+ }
+ if ( x>=10 && x<=99) {
+ dziesiatki(x);
+ if ( x%10>=2 && x%10<=4) {
+ cout<<"tysiece ";
+ return;
+ }
+ cout<<"tysiecy ";
+ return;
+ }
+ cout<<od200do900[x/100-1]<<" ";
+ dziesiatki(x%100);
+
+ cout<<"tysiecy ";
+}
+
+void sety ( int x) {
+ if ( x<100) {
+ if ( x>=10 ) {
+ dziesiatki(x);
+ return;
+ }
+ if (x!=0 && x<10) {
+ cout<<od1do9[x]<<" ";
+ return;
+ }
+ }
+
+ if ( x==100) {
+ cout<<"sto ";
+ return;
+ }
+ if ( x/100==1) {
+ cout<<"sto ";
+ dziesiatki(x%100);
+ return;
+ }
+ cout<<od200do900[x/100-1]<<" ";
+ dziesiatki(x%100);
+}
+
+
+void dziesiatki ( int x) {
+ if ( x!=0) {
+ if ( x/10 == 1) {
+ cout<<od10do19[x%10]<<" ";
+ return;
+ }
+ if ( x/10 == 0 && x%10 != 0) {
+ cout<<od1do9[x%10]<<" ";
+ return;
+ }
+ cout<<od20do90[x/10-1]<<" ";
+ if ( x%10!=0) {
+ cout<<od1do9[x%10]<<" ";
+ }
+}
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(0);
+ int n;
+ cin>>n;
+ if ( n>=1000000) {
+ miliony ( n/1000000);
+ }
+ n=n%1000000;
+ if ( n>=1000) {
+ tysiace( n/1000);
+ }
+ n=n%1000;
+ sety (n);
+}
diff --git a/semestr-4/sieci/warsztaty8/186033.cpp b/semestr-4/sieci/warsztaty8/186033.cpp new file mode 100644 index 0000000..85911e3 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/186033.cpp @@ -0,0 +1,101 @@ +#include <bits/stdc++.h>
+
+using namespace std;
+
+#define st first
+#define nd second
+#define pb push_back
+#define sz(x) (int)(x).size()
+#define ll long long
+ll mod=1000000007;
+int inf=1000000007;
+ll infl=1000000000000000007;
+
+int seg[4*600007];
+int lazy[4*600007];
+int pot=1;
+
+void push(int v,int sz)
+{
+ if(lazy[v]!=0)
+ {
+ seg[2*v]=sz/2*lazy[v];
+ lazy[2*v]=lazy[v];
+ seg[2*v+1]=sz/2*lazy[v];
+ lazy[2*v+1]=lazy[v];
+ }
+ lazy[v]=0;
+}
+
+void ins(int u,int a,int b,int l,int r,int v)
+{
+ if(a<=l&&b>=r)
+ {
+ lazy[u]=v;
+ seg[u]=(r-l+1)*v;
+ return ;
+ }
+ if(l>b||r<a) return ;
+ push(u,r-l+1);
+ ins(2*u,a,b,l,(l+r)/2,v);
+ ins(2*u+1,a,b,(l+r)/2+1,r,v);
+ seg[u]=seg[2*u]+seg[2*u+1];
+}
+
+int que(int u,int a,int b,int l,int r)
+{
+ if(a<=l&&b>=r) return seg[u];
+ if(l>b||r<a) return 0;
+ push(u,r-l+1);
+ return que(2*u,a,b,l,(l+r)/2)+que(2*u+1,a,b,(l+r)/2+1,r);
+}
+
+unordered_map<int,int>mapa;
+int l[100007];
+int r[100007];
+
+int main()
+{
+ ios_base::sync_with_stdio(0);
+ cin.tie(0);
+ cout.tie(0);
+ int n,h,ans=2;
+ cin>>n>>h;
+ set<int>S;
+ S.insert(1);
+ S.insert(h);
+ for(int i=1;i<=n;i++)
+ {
+ cin>>l[i]>>r[i];
+ l[i]++;
+ if(l[i]!=h) S.insert(l[i]+1);
+ if(l[i]!=1) S.insert(l[i]-1);
+ if(r[i]!=h) S.insert(r[i]+1);
+ if(r[i]!=1) S.insert(r[i]-1);
+ S.insert(l[i]);
+ S.insert(r[i]);
+ }
+ int it=0;
+ mapa.reserve(sz(S)+2);
+ for(auto x:S) mapa[x]=++it;
+ for(int i=1;i<=n;i++)
+ {
+ l[i]=mapa[l[i]];
+ r[i]=mapa[r[i]];
+ }
+ while(pot<it) pot*=2;
+ ins(1,1,it,1,pot,2);
+ for(int i=1;i<=n;i++)
+ {
+ ins(1,l[i],r[i],1,pot,1);
+ if(seg[1]==it)
+ {
+ ans+=2;
+ ins(1,1,l[i]-1,1,pot,2);
+ ins(1,r[i]+1,it,1,pot,2);
+ }
+ }
+ cout<<ans;
+
+ return 0;
+}
diff --git a/semestr-4/sieci/warsztaty8/186164.cpp b/semestr-4/sieci/warsztaty8/186164.cpp new file mode 100644 index 0000000..d747a00 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/186164.cpp @@ -0,0 +1,270 @@ +#include <bits/stdc++.h>
+
+using namespace std;
+
+#define st first
+#define nd second
+#define pb push_back
+#define sz(x) (int)(x).size()
+#define ll long long
+ll mod=1000000007;
+int inf=1000000007;
+ll infl=1000000000000000007;
+
+int a[77][77];
+int id[77][77];
+int id1[77][77];
+int id2[77][77];
+set<int>G[15007];
+int cap1[3507][3507];
+unordered_map<int,int>cap[15007];
+int o[15007];
+bool odw[15007];
+int s=1,t;
+char ans[77][77][3][3];
+
+bool dfs(int v)
+{
+ //cout<<v<<endl;
+ odw[v]=1;
+ if(v==t) return 1;
+ for(auto u:G[v])
+ {
+ if(odw[u]) continue;
+ o[u]=v;
+ if(dfs(u)) return 1;
+ }
+ return 0;
+}
+
+int flow()
+{
+ int F=0;
+ while(dfs(s))
+ {
+ memset(odw,0,sizeof odw);
+ int p=t,f=inf;
+ while(p!=s)
+ {
+ if(o[p]<=3500&&p<=3500) f=min(f,cap1[o[p]][p]);
+ else f=min(f,cap[o[p]][p]);
+ p=o[p];
+ }
+ F+=f;
+ p=t;
+ while(p!=s)
+ {
+ if(o[p]<=3500&&p<=3500)
+ {
+ cap1[o[p]][p]-=f;
+ if(cap1[o[p]][p]==0) G[o[p]].erase(p);
+ cap1[p][o[p]]+=f;
+ }
+ else
+ {
+ cap[o[p]][p]-=f;
+ if(cap[o[p]][p]==0) G[o[p]].erase(p);
+ cap[p][o[p]]+=f;
+ }
+ G[p].insert(o[p]);
+ p=o[p];
+ }
+ }
+ return F;
+}
+
+void gg()
+{
+ cout<<"NIE";
+ exit(0);
+}
+
+void edge(int u,int v,int c)
+{
+ G[u].insert(v);
+ if(u<=3500&&v<=3500) cap1[u][v]=c;
+ else cap[u][v]=c;
+}
+
+
+void connect(int x,int y,int x1,int y1)
+{
+ if(a[x][y]==2)
+ {
+ if(a[x1][y1]==2)
+ {
+ if(x==x1) edge(id2[x][y],id2[x1][y1],1);
+ else edge(id1[x][y],id1[x1][y1],1);
+ }
+ else
+ {
+ if(x==x1) edge(id2[x][y],id[x1][y1],1);
+ else edge(id1[x][y],id[x1][y1],1);
+ }
+ }
+ else
+ {
+ if(a[x1][y1]==2)
+ {
+ if(x==x1) edge(id[x][y],id2[x1][y1],1);
+ else edge(id[x][y],id1[x1][y1],1);
+ }
+ else edge(id[x][y],id[x1][y1],1);
+ }
+}
+bool is(int x,int y,int x1,int y1)
+{
+ if(a[x][y]==2)
+ {
+ if(a[x1][y1]==2)
+ {
+ if(x==x1) return G[id2[x][y]].count(id2[x1][y1]);
+ else return G[id1[x][y]].count(id1[x1][y1]);
+ }
+ else
+ {
+ if(x==x1) return G[id2[x][y]].count(id[x1][y1]);
+ else return G[id1[x][y]].count(id[x1][y1]);
+ }
+ }
+ else
+ {
+ if(a[x1][y1]==2)
+ {
+ if(x==x1) return G[id[x][y]].count(id2[x1][y1]);
+ else return G[id[x][y]].count(id1[x1][y1]);
+ }
+ else return G[id[x][y]].count(id[x1][y1]);
+ }
+}
+
+int main()
+{
+ ios_base::sync_with_stdio(0);
+ cin.tie(0);
+ cout.tie(0);
+ int n,m,sum[2]={0,0};
+ cin>>n>>m;
+ for(int i=1;i<=n;i++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ cin>>a[i][j];
+ for(int k=0;k<3;k++) for(int l=0;l<3;l++) ans[i][j][k][l]='.';
+ if(a[i][j]!=0) ans[i][j][1][1]='O';
+ sum[(i+j)%2]+=a[i][j];
+ }
+ }
+ if(sum[0]!=sum[1]) gg();
+ edge(1,2,sum[0]);
+ int it=2;
+ for(int i=1;i<=n;i++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ if(a[i][j]==0) continue;
+ id[i][j]=++it;
+ if(a[i][j]==2)
+ {
+ id1[i][j]=++it;
+ id2[i][j]=++it;
+ if((i+j)%2)
+ {
+ edge(id[i][j],id1[i][j],1);
+ edge(id[i][j],id2[i][j],1);
+ }
+ else
+ {
+ edge(id1[i][j],id[i][j],1);
+ edge(id2[i][j],id[i][j],1);
+ }
+ }
+ }
+ }
+ it+=2;
+ t=it;
+ edge(it-1,it,sum[0]);
+ for(int i=1;i<=n;i++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ if(a[i][j]==0) continue;
+ if((i+j)%2) edge(2,id[i][j],a[i][j]);
+ else edge(id[i][j],it-1,a[i][j]);
+ }
+ }
+ for(int i=1;i<=n;i++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ if((i+j)%2==0||a[i][j]==0) continue;
+ if(a[i-1][j]!=0) connect(i,j,i-1,j);
+ if(a[i+1][j]!=0) connect(i,j,i+1,j);
+ if(a[i][j-1]!=0) connect(i,j,i,j-1);
+ if(a[i][j+1]!=0) connect(i,j,i,j+1);
+ }
+ }
+ if(flow()!=sum[0]) gg();
+ //cout<<sum[0]<<endl;
+ for(int i=1;i<=n;i++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ if((i+j)%2==0||a[i][j]==0) continue;
+ if(a[i-1][j]!=0)
+ {
+ if(!is(i,j,i-1,j))
+ {
+ //cout<<i<<" "<<j<<" "<<i-1<<" "<<j<<endl;
+ ans[i][j][0][1]='X';
+ ans[i-1][j][2][1]='X';
+ }
+ }
+ if(a[i+1][j]!=0)
+ {
+ if(!is(i,j,i+1,j))
+ {
+ // cout<<i<<" "<<j<<" "<<i+1<<" "<<j<<endl;
+ ans[i][j][2][1]='X';
+ ans[i+1][j][0][1]='X';
+ }
+ }
+ if(a[i][j-1]!=0)
+ {
+ if(!is(i,j,i,j-1))
+ {
+ // cout<<i<<" "<<j<<" "<<i<<" "<<j-1<<endl;
+ ans[i][j][1][0]='X';
+ ans[i][j-1][1][2]='X';
+ }
+ }
+ if(a[i][j+1]!=0)
+ {
+ if(!is(i,j,i,j+1))
+ {
+ // cout<<i<<" "<<j<<" "<<i<<" "<<j+1<<endl;
+ ans[i][j][1][2]='X';
+ ans[i][j+1][1][0]='X';
+ }
+ }
+ }
+ }
+ for(int i=1;i<=n;i++)
+ {
+ for(int k=0;k<3;k++)
+ {
+ for(int j=1;j<=m;j++)
+ {
+ for(int l=0;l<3;l++)
+ {
+ cout<<ans[i][j][k][l];
+ }
+ }
+ cout<<endl;
+ }
+ }
+
+
+
+ return 0;
+}
diff --git a/semestr-4/sieci/warsztaty8/Twierdzenie_o_pierwiastkach_wymi.pdf b/semestr-4/sieci/warsztaty8/Twierdzenie_o_pierwiastkach_wymi.pdf Binary files differnew file mode 100644 index 0000000..ab7bb2c --- /dev/null +++ b/semestr-4/sieci/warsztaty8/Twierdzenie_o_pierwiastkach_wymi.pdf diff --git a/semestr-4/sieci/warsztaty8/dat0-check.cpp b/semestr-4/sieci/warsztaty8/dat0-check.cpp new file mode 100644 index 0000000..3ca4111 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/dat0-check.cpp @@ -0,0 +1,58 @@ +//Krzysztof Boryczka +#include <bits/stdc++.h> +using namespace std; + +typedef long long ll; +typedef long double ld; +typedef pair<int, int> ii; +typedef vector<int> vi; +typedef vector<ii> vii; +const int inf=0x3f3f3f3f; +const ll INF=0x3f3f3f3f3f3f3f3f; + +#define FOR(i, b, e) for(int i=b; i<=e; i++) +#define FORD(i, b, e) for(int i=b; i>=e; i--) +#define SIZE(x) ((int)x.size()) +#define pb push_back +#define st first +#define nd second +#define sp ' ' +#define ent '\n' + +ifstream out, wzor, in; + +int main(int argc, char *argv[]){ + assert(argc>=4); + + out.open(argv[1]); + wzor.open(argv[2]); + in.open(argv[3]); + + vector<string> ans, user; + string pom; + while(wzor>>pom) ans.pb(pom); + while(out>>pom) user.pb(pom); + FOR(i, 1, 5) in>>pom; + + if(ans!=user) + { + if(pom != "0" && pom != "1" && pom != "3" && pom != "5"){ + cout << "Zla odpowiedz\n"; + exit(1); + } + int d=0, g=0, m=0, s=0; + FOR(i, 0, SIZE(ans)-1){ + if(ans[i][0]=='d') d=stoi(ans[i-1]); + if(ans[i][0]=='g') g=stoi(ans[i-1]); + if(ans[i][0]=='m') m=stoi(ans[i-1]); + if(ans[i][0]=='s') s=stoi(ans[i-1]); + } + if(SIZE(user)!=4 || stoi(user[0])!=d || stoi(user[1])!=g || stoi(user[2])!=m || stoi(user[3])!=s){ + cout << "Zla odpowiedz\n"; + exit(1); + } + } + + cout << "OK\n"; + exit(0); +} diff --git a/semestr-4/sieci/warsztaty8/dat0-check.e b/semestr-4/sieci/warsztaty8/dat0-check.e Binary files differnew file mode 100644 index 0000000..b0dcc41 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/dat0-check.e diff --git a/semestr-4/sieci/warsztaty8/dat0-gen.sh b/semestr-4/sieci/warsztaty8/dat0-gen.sh new file mode 100644 index 0000000..a1640b1 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/dat0-gen.sh @@ -0,0 +1,107 @@ +#!/bin/bash + +echo -e "2019-01-08 00:00:00\n2019-01-09 00:00:00\n1" > dat1a.in +echo -e "2019-01-25 00:00:00\n2019-02-13 00:00:00\n1" > dat1b.in +echo -e "2019-01-25 00:00:00\n2019-03-13 00:00:00\n1" > dat1c.in +echo -e "2020-01-25 00:00:00\n2020-03-13 00:00:00\n1" > dat1d.in +echo -e "2000-01-25 00:00:00\n2000-03-13 00:00:00\n1" > dat1e.in +echo -e "2019-01-25 00:00:00\n2019-02-27 00:00:00\n1" > dat1f.in +echo -e "2019-01-25 00:00:00\n2019-03-27 00:00:00\n1" > dat1g.in +echo -e "2020-01-25 00:00:00\n2020-03-27 00:00:00\n1" > dat1h.in +echo -e "2000-01-25 00:00:00\n2000-03-27 00:00:00\n1" > dat1i.in +echo -e "2003-01-01 00:00:00\n2004-01-01 00:00:00\n1" > dat1j.in +echo -e "2004-01-01 00:00:00\n2005-01-01 00:00:00\n1" > dat1k.in +echo -e "2000-01-01 00:00:00\n2001-01-01 00:00:00\n1" > dat1l.in +echo -e "1999-01-01 00:00:00\n2000-01-01 00:00:00\n1" > dat1m.in +echo -e "1900-01-01 00:00:00\n2099-12-31 00:00:00\n1" > dat1n.in +echo -e "1945-04-17 00:00:00\n1974-01-17 00:00:00\n1" > dat1o.in +echo -e "2019-02-09 00:00:00\n2030-09-01 00:00:00\n1" > dat1p.in +echo -e "1992-11-13 00:00:00\n2049-01-13 00:00:00\n1" > dat1q.in + +echo -e "2019-01-08 00:00:00\n2019-01-09 00:00:00\n2" > dat2a.in +echo -e "2019-01-25 00:00:00\n2019-02-13 00:00:00\n2" > dat2b.in +echo -e "2019-01-25 00:00:00\n2019-03-13 00:00:00\n2" > dat2c.in +echo -e "2020-01-25 00:00:00\n2020-03-13 00:00:00\n2" > dat2d.in +echo -e "2000-01-25 00:00:00\n2000-03-13 00:00:00\n2" > dat2e.in +echo -e "2019-01-25 00:00:00\n2019-02-27 00:00:00\n2" > dat2f.in +echo -e "2019-01-25 00:00:00\n2019-03-27 00:00:00\n2" > dat2g.in +echo -e "2020-01-25 00:00:00\n2020-03-27 00:00:00\n2" > dat2h.in +echo -e "2000-01-25 00:00:00\n2000-03-27 00:00:00\n2" > dat2i.in +echo -e "2003-01-01 00:00:00\n2004-01-01 00:00:00\n2" > dat2j.in +echo -e "2004-01-01 00:00:00\n2005-01-01 00:00:00\n2" > dat2k.in +echo -e "2000-01-01 00:00:00\n2001-01-01 00:00:00\n2" > dat2l.in +echo -e "1999-01-01 00:00:00\n2000-01-01 00:00:00\n2" > dat2m.in +echo -e "1900-01-01 00:00:00\n2099-12-31 00:00:00\n2" > dat2n.in +echo -e "1945-04-17 00:00:00\n1974-01-17 00:00:00\n2" > dat2o.in +echo -e "2019-02-09 00:00:00\n2030-09-01 00:00:00\n2" > dat2p.in +echo -e "1992-11-13 00:00:00\n2049-01-13 00:00:00\n2" > dat2q.in + +echo -e "2000-01-01 00:00:00\n2000-01-01 00:00:01\n3" > dat3a.in +echo -e "2000-01-01 00:00:00\n2000-01-01 00:01:00\n3" > dat3b.in +echo -e "2000-01-01 00:00:00\n2000-01-01 01:00:00\n3" > dat3c.in +echo -e "2000-01-01 00:00:00\n2000-01-01 03:17:29\n3" > dat3d.in +echo -e "2000-01-01 00:00:00\n2000-01-01 19:15:59\n3" > dat3e.in +echo -e "2000-01-01 00:00:00\n2000-01-01 23:59:59\n3" > dat3f.in +echo -e "2000-01-01 00:00:01\n2000-01-01 00:01:00\n3" > dat3g.in +echo -e "2000-01-01 00:00:01\n2000-01-01 01:00:00\n3" > dat3h.in +echo -e "2000-01-01 00:00:01\n2000-01-01 03:17:29\n3" > dat3i.in +echo -e "2000-01-01 00:00:01\n2000-01-01 19:15:59\n3" > dat3j.in +echo -e "2000-01-01 00:00:01\n2000-01-01 23:59:59\n3" > dat3k.in +echo -e "2000-01-01 02:01:01\n2000-01-01 03:17:29\n3" > dat3l.in +echo -e "2000-01-01 04:01:01\n2000-01-01 19:15:59\n3" > dat3m.in +echo -e "2000-01-01 04:17:39\n2000-01-01 23:59:59\n3" > dat3n.in +echo -e "2000-01-01 02:01:57\n2000-01-01 03:17:29\n3" > dat3o.in + +echo -e "2000-01-01 00:00:00\n2000-01-01 00:00:01\n4" > dat4a.in +echo -e "2000-01-01 00:00:00\n2000-01-01 00:01:00\n4" > dat4b.in +echo -e "2000-01-01 00:00:00\n2000-01-01 01:00:00\n4" > dat4c.in +echo -e "2000-01-01 00:00:00\n2000-01-01 03:17:29\n4" > dat4d.in +echo -e "2000-01-01 00:00:00\n2000-01-01 19:15:59\n4" > dat4e.in +echo -e "2000-01-01 00:00:00\n2000-01-01 23:59:59\n4" > dat4f.in +echo -e "2000-01-01 00:00:01\n2000-01-01 00:01:00\n4" > dat4g.in +echo -e "2000-01-01 00:00:01\n2000-01-01 01:00:00\n4" > dat4h.in +echo -e "2000-01-01 00:00:01\n2000-01-01 03:17:29\n4" > dat4i.in +echo -e "2000-01-01 00:00:01\n2000-01-01 19:15:59\n4" > dat4j.in +echo -e "2000-01-01 00:00:01\n2000-01-01 23:59:59\n4" > dat4k.in +echo -e "2000-01-01 02:01:01\n2000-01-01 03:17:29\n4" > dat4l.in +echo -e "2000-01-01 04:01:01\n2000-01-01 19:15:59\n4" > dat4m.in +echo -e "2000-01-01 04:17:39\n2000-01-01 23:59:59\n4" > dat4n.in +echo -e "2000-01-01 02:01:57\n2000-01-01 03:17:29\n4" > dat4o.in + +echo -e "1917-06-04 13:25:19\n2045-04-19 11:17:39\n5" > dat5a.in +echo -e "1992-07-02 00:05:19\n2019-01-08 17:53:13\n5" > dat5b.in +echo -e "1900-01-01 00:00:00\n2099-12-31 23:59:59\n5" > dat5c.in +echo -e "1900-01-01 23:59:59\n2099-12-31 00:00:00\n5" > dat5d.in +echo -e "1959-10-13 17:14:40\n1965-10-25 19:10:53\n5" > dat5e.in +echo -e "2059-04-30 01:15:49\n2071-03-01 10:07:13\n5" > dat5f.in +echo -e "2010-02-19 20:49:10\n2061-02-28 15:40:49\n5" > dat5g.in + +echo -e "1917-06-04 13:25:19\n2045-04-19 11:17:39\n6" > dat6a.in +echo -e "1992-07-02 00:05:19\n2019-01-08 17:53:13\n6" > dat6b.in +echo -e "1900-01-01 00:00:00\n2099-12-31 23:59:59\n6" > dat6c.in +echo -e "1900-01-01 23:59:59\n2099-12-31 00:00:00\n6" > dat6d.in +echo -e "1959-10-13 17:14:40\n1965-10-25 19:10:53\n6" > dat6e.in +echo -e "2059-04-30 01:15:49\n2071-03-01 10:07:13\n6" > dat6f.in +echo -e "2010-02-19 20:49:10\n2061-02-28 15:40:49\n6" > dat6g.in + +echo -e "2010-10-10 11:59:59\n2010-11-02 10:22:21\n5" > dat5h.in +echo -e "1999-12-31 23:59:59\n2000-01-02 01:01:00\n5" > dat5i.in +echo -e "1985-01-15 21:55:53\n2009-11-12 23:21:10\n5" > dat5j.in +echo -e "2042-04-12 13:14:15\n2042-05-06 01:36:48\n5" > dat5k.in +echo -e "1931-01-01 23:01:58\n1931-01-01 23:59:58\n5" > dat5l.in +echo -e "2002-11-30 01:01:02\n2053-03-04 02:46:42\n5" > dat5m.in +echo -e "2022-02-22 22:59:23\n2022-03-01 04:03:26\n5" > dat5n.in +echo -e "1974-12-12 13:41:42\n2052-07-12 15:14:37\n5" > dat5o.in +echo -e "1922-12-31 23:59:59\n2022-01-02 00:00:00\n5" > dat5p.in + +echo -e "1997-01-12 22:59:23\n1997-02-15 00:01:26\n6" > dat6h.in +echo -e "1999-10-12 10:00:00\n2004-04-04 10:10:00\n6" > dat6i.in +echo -e "1923-03-14 11:22:53\n2009-11-12 11:21:34\n6" > dat6j.in +echo -e "2022-12-31 00:01:02\n2022-12-31 01:01:02\n6" > dat6k.in +echo -e "1988-11-11 12:11:59\n1989-01-01 11:10:02\n6" > dat6l.in +echo -e "2002-11-30 01:01:02\n2053-03-04 01:46:42\n6" > dat6m.in +echo -e "2022-02-22 22:59:23\n2022-03-01 03:03:26\n6" > dat6n.in +echo -e "1974-12-12 13:41:42\n2052-07-12 11:14:37\n6" > dat6o.in +echo -e "1922-12-31 23:59:59\n2022-01-02 20:00:00\n6" > dat6p.in + +g++ dat0-check.cpp -o dat0-check.e -O2 -std=c++11 diff --git a/semestr-4/sieci/warsztaty8/mie1.cpp b/semestr-4/sieci/warsztaty8/mie1.cpp new file mode 100644 index 0000000..f7eef7e --- /dev/null +++ b/semestr-4/sieci/warsztaty8/mie1.cpp @@ -0,0 +1,64 @@ +#include <cstdio> +#include <algorithm> +#include <cmath> +using namespace std; + +#define EPS 0.000001 + +int main() { + int numLiquids, reqCon, liquid[101]; + double sumSubst=0, sumLiquid=0, actCon; + + fill(liquid,liquid+101,0); + + scanf("%d%d",&numLiquids,&reqCon); + + for (int i=0;i<numLiquids;i++) { + int con, amount; + + scanf("%d%d",&con,&amount); + + liquid[con]+=amount; + sumSubst+=(double)(amount*con)/100; + sumLiquid+=(double)amount; + } + + if (sumLiquid==0) { + printf("0.000\n"); + return 0; + } + + actCon=(sumSubst/sumLiquid)*100; + + for (int i=0;i<=100;i++) { + if ((actCon<(double)reqCon)&&(liquid[i]>0)) { + double perc=(double)i/100, toSub=(double)((double)reqCon*sumLiquid-100*sumSubst)/((double)reqCon-(double)100*perc); + + toSub=min(toSub,(double)liquid[i]); + + sumLiquid-=toSub; + sumSubst-=(toSub*i)/100; + } + if ((actCon>(double)reqCon)&&(liquid[100-i]>0)) { + double perc=(double)(100-i)/100, toSub=(double)((double)reqCon*sumLiquid-100*sumSubst)/((double)reqCon-(double)100*perc); + + toSub=min(toSub,(double)liquid[100-i]); + + sumLiquid-=toSub; + sumSubst-=(toSub*(100-i))/100; + } + + if (sumLiquid==0) { + printf("0.000\n"); + return 0; + } + actCon=(sumSubst/sumLiquid)*100; + + if (fabs((double)reqCon-actCon)<EPS) + break; + } + + printf("%.3lf\n",sumLiquid); + + return 0; +} diff --git a/semestr-4/sieci/warsztaty8/prz8-wzo2.cpp b/semestr-4/sieci/warsztaty8/prz8-wzo2.cpp new file mode 100644 index 0000000..1b7193f --- /dev/null +++ b/semestr-4/sieci/warsztaty8/prz8-wzo2.cpp @@ -0,0 +1,177 @@ +#include <bits/stdc++.h>
+
+using namespace std;
+
+const int MAXN = 70;
+int tab[MAXN][MAXN];
+char out[3*MAXN][3*MAXN];
+int N, M;
+
+int id(int x, int y, int strona){ //0 - prawo, 1 - g�ra, 2 - lewo, 3 - d��
+ if(strona == 0){
+ if(x+1 >= N) return -1;
+ if(tab[x+1][y] == 0) return -1;
+ if(tab[x+1][y] == 1) return 5*(MAXN*(x+1)+y);
+ if(tab[x+1][y] == 2) return 5*(MAXN*(x+1)+y);
+ if(tab[x+1][y] == 3) return 5*(MAXN*(x+1)+y)+2;
+ if(tab[x+1][y] == 4) return 5*(MAXN*(x+1)+y)+2;
+ }
+ if(strona == 1){
+ if(y+1 >= M) return -1;
+ if(tab[x][y+1] == 0) return -1;
+ if(tab[x][y+1] == 1) return 5*(MAXN*x+y+1);
+ if(tab[x][y+1] == 2) return 5*(MAXN*x+y+1)+1;
+ if(tab[x][y+1] == 3) return 5*(MAXN*x+y+1)+3;
+ if(tab[x][y+1] == 4) return 5*(MAXN*x+y+1)+3;
+ }
+ if(strona == 2){
+ if(x-1 < 0) return -1;
+ if(tab[x-1][y] == 0) return -1;
+ if(tab[x-1][y] == 1) return 5*(MAXN*(x-1)+y);
+ if(tab[x-1][y] == 2) return 5*(MAXN*(x-1)+y);
+ if(tab[x-1][y] == 3) return 5*(MAXN*(x-1)+y);
+ if(tab[x-1][y] == 4) return 5*(MAXN*(x-1)+y);
+ }
+ if(strona == 3){
+ if(y-1 < 0) return -1;
+ if(tab[x][y-1] == 0) return -1;
+ if(tab[x][y-1] == 1) return 5*(MAXN*x+y-1);
+ if(tab[x][y-1] == 2) return 5*(MAXN*x+y-1)+1;
+ if(tab[x][y-1] == 3) return 5*(MAXN*x+y-1)+1;
+ if(tab[x][y-1] == 4) return 5*(MAXN*x+y-1)+1;
+ }
+}
+
+set<int> real_v;
+vector<int> edges[5*MAXN*MAXN+5];
+int match[5*MAXN*MAXN+5];
+bool mark[5*MAXN*MAXN+5];
+bool dfs(int v){
+ if(real_v.count(v) == 0) return false;
+ if(mark[v]) return false;
+ mark[v] = true;
+ for(auto &u : edges[v])
+ if(match[u] == -1 || dfs(match[u]))
+ return match[v] = u, match[u] = v, true;
+ return false;
+}
+
+int main(){
+ cin >> N >> M;
+ for(int i = 0; i < N; i++){
+ for(int j = 0; j < M; j++){
+ cin >> tab[i][j];
+ }
+ }
+
+ for(int i = 0; i < N; i++){
+ for(int j = 0; j < M; j++){
+ if(tab[i][j] == 1){
+ for(int k = 0; k < 4; k++){
+ if(id(i, j, k) != -1) edges[5*(MAXN*i+j)].push_back(id(i, j, k));
+ }
+ real_v.insert(5*(MAXN*i+j));
+ }
+ if(tab[i][j] == 2){
+ for(int k = 0; k < 4; k++){
+ if(id(i, j, k) != -1) edges[5*(MAXN*i+j)+(k%2)].push_back(id(i, j, k));
+ }
+ real_v.insert(5*(MAXN*i+j)), real_v.insert(5*(MAXN*i+j)+1);
+ }
+ if(tab[i][j] == 3){
+ for(int k = 0; k < 4; k++){
+ if(id(i, j, k) != -1) edges[5*(MAXN*i+j)+k].push_back(id(i, j, k));
+ edges[5*(MAXN*i+j)+k].push_back(5*(MAXN*i+j)+4);
+ edges[5*(MAXN*i+j)+4].push_back(5*(MAXN*i+j)+k);
+ }
+ real_v.insert(5*(MAXN*i+j)), real_v.insert(5*(MAXN*i+j)+1), real_v.insert(5*(MAXN*i+j)+2), real_v.insert(5*(MAXN*i+j)+3), real_v.insert(5*(MAXN*i+j)+4);
+ }
+ if(tab[i][j] == 4){
+ for(int k = 0; k < 4; k++){
+ if(id(i, j, k) != -1) edges[5*(MAXN*i+j)+k].push_back(id(i, j, k));
+ }
+ real_v.insert(5*(MAXN*i+j)), real_v.insert(5*(MAXN*i+j)+1), real_v.insert(5*(MAXN*i+j)+2), real_v.insert(5*(MAXN*i+j)+3);
+ }
+ }
+ }
+
+ /*for(int i = 0; i < 5*MAXN*MAXN+5; i++){
+ if(!edges[i].empty()){
+ cerr << "Edges of " << i << ": ";
+ for(int v : edges[i]) cerr << v << " ";
+ cerr << "\n";
+ }
+ }*/
+
+ for(int i = 0; i < 5*MAXN*MAXN+5; i++) match[i] = -1;
+ for(int i = 0; i < 5*MAXN*MAXN+5; i++)
+ if(match[i] == -1){
+ memset(mark, false, sizeof mark);
+ dfs(i);
+ }
+
+ for(int i : real_v) if(match[i] == -1){
+ cout << "NIE";
+ return 0;
+ }
+
+ for(int i = 0; i < N; i++){
+ for(int j = 0; j < M; j++){
+ if(tab[i][j] == 1){
+ int str;
+ for(int k = 0; k < 4; k++) if(match[5*(MAXN*i+j)] == id(i, j, k)){
+ str = k;
+ }
+ out[3*i+1][3*j+1] = 'O';
+ if(str == 0) out[3*i+2][3*j+1] = 'X';
+ if(str == 1) out[3*i+1][3*j+2] = 'X';
+ if(str == 2) out[3*i][3*j+1] = 'X';
+ if(str == 3) out[3*i+1][3*j] = 'X';
+ }
+ if(tab[i][j] == 2){
+ int strh, strv;
+ for(int k = 0; k < 4; k++) if(match[5*(MAXN*i+j)] == id(i, j, k)){
+ strh = k;
+ }
+ for(int k = 0; k < 4; k++) if(match[5*(MAXN*i+j)+1] == id(i, j, k)){
+ strv = k;
+ }
+ out[3*i+1][3*j+1] = 'O';
+ if(strh == 0) out[3*i+2][3*j+1] = 'X';
+ if(strv == 1) out[3*i+1][3*j+2] = 'X';
+ if(strh == 2) out[3*i][3*j+1] = 'X';
+ if(strv == 3) out[3*i+1][3*j] = 'X';
+ }
+ if(tab[i][j] == 3){
+ int str;
+ for(int k = 0; k < 4; k++) if(match[5*(MAXN*i+j)+4] == 5*(MAXN*i+j)+k){
+ str = k;
+ }
+ out[3*i+1][3*j+1] = 'O';
+ out[3*i+2][3*j+1] = 'X';
+ out[3*i+1][3*j+2] = 'X';
+ out[3*i][3*j+1] = 'X';
+ out[3*i+1][3*j] = 'X';
+ if(str == 0) out[3*i+2][3*j+1] = '.';
+ if(str == 1) out[3*i+1][3*j+2] = '.';
+ if(str == 2) out[3*i][3*j+1] = '.';
+ if(str == 3) out[3*i+1][3*j] = '.';
+ }
+ if(tab[i][j] == 4){
+ out[3*i+1][3*j+1] = 'O';
+ out[3*i+2][3*j+1] = 'X';
+ out[3*i+1][3*j+2] = 'X';
+ out[3*i][3*j+1] = 'X';
+ out[3*i+1][3*j] = 'X';
+ }
+ }
+ }
+
+ for(int i = 0; i < 3*N; i++){
+ for(int j = 0; j < 3*M; j++){
+ if(!out[i][j]) cout << ".";
+ else cout << out[i][j];
+ }
+ cout << "\n";
+ }
+}
diff --git a/semestr-4/sieci/warsztaty8/prz9.cpp b/semestr-4/sieci/warsztaty8/prz9.cpp new file mode 100644 index 0000000..952daac --- /dev/null +++ b/semestr-4/sieci/warsztaty8/prz9.cpp @@ -0,0 +1,97 @@ +// solution written by Michal 'misof' Forisek
+#include <vector>
+#include <set>
+#include <queue>
+#include <iostream>
+using namespace std;
+
+#define FOREACH(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
+
+class MaximumMatching {
+ int left_size, right_size;
+ vector< vector<int> > right_to_left;
+
+ public:
+ MaximumMatching() { left_size=right_size=0; right_to_left.clear(); }
+ void add_edge(int left, int right);
+ vector< pair<int,int> > maximum_matching();
+};
+
+void MaximumMatching::add_edge(int left, int right) {
+ if (left==-1 || right==-1) return;
+ if (left_size <= left) left_size = left+1;
+ if (right_size <= right) { right_size = right+1; right_to_left.resize(right_size); }
+ right_to_left[right].push_back(left);
+}
+
+vector< pair<int,int> >
+MaximumMatching::maximum_matching() {
+ int L = left_size, R = right_size;
+ vector<int> match(L,-1);
+ for (int r=0; r<R; r++) {
+ bool found = false;
+ vector<int> from(L,-1);
+ queue<int> Q;
+ FOREACH(it,right_to_left[r]) { Q.push(*it); from[*it]=*it; }
+ while (!Q.empty() && !found) {
+ int l = Q.front(); Q.pop();
+ if (match[l]==-1) {
+ found = true;
+ while (from[l]!=l) { match[l] = match[from[l]]; l = from[l]; }
+ match[l]=r;
+ } else {
+ FOREACH(it,right_to_left[ match[l] ]) if (from[*it]==-1) { Q.push(*it); from[*it]=l; }
+ }
+ }
+ }
+ vector< pair<int,int> > result;
+ for (int i=0; i<L; i++) if (match[i] != -1) result.push_back(make_pair(i,match[i]));
+ return result;
+}
+
+int R, C; // the dimensions of the island
+vector< vector<int> > A; // the map of the island
+
+int ENCODE(int r, int c, int n) { return (C*r+c)*5+n; }
+int LEFT(int r, int c) { if (A[r][c]==0) return -1; else if (A[r][c]<=2) return ENCODE(r,c,0); else return ENCODE(r,c,1); }
+int RIGHT(int r, int c) { if (A[r][c]==0) return -1; else if (A[r][c]<=2) return ENCODE(r,c,0); else return ENCODE(r,c,3); }
+int TOP(int r, int c) { if (A[r][c]==0) return -1; else if (A[r][c]==2) return ENCODE(r,c,1); else return ENCODE(r,c,0); }
+int BOTTOM(int r, int c) { if (A[r][c]==0) return -1; else if (A[r][c]<=2) return ENCODE(r,c,A[r][c]-1); else return ENCODE(r,c,2); }
+#define VERTEX(r,c,dir) ( ((r<0) || (c<0) || (r>=R) || (c>=C)) ? -1 : dir(r,c) )
+
+int main() {
+ // read the input
+ cin >> R >> C;
+ A.resize(R, vector<int>(C) );
+ for (int r=0; r<R; ++r) for (int c=0; c<C; ++c) cin >> A[r][c];
+
+ // create the bipartite graph
+ MaximumMatching MM;
+ for (int r=0; r<R; ++r) for (int c=0; c<C; ++c) {
+ int left, right;
+ left=VERTEX(r,c,LEFT); right=VERTEX(r,c-1,RIGHT); if ((r+c)%2) swap(left,right); MM.add_edge(left,right);
+ left=VERTEX(r,c,TOP); right=VERTEX(r-1,c,BOTTOM); if ((r+c)%2) swap(left,right); MM.add_edge(left,right);
+ if (A[r][c]==3) for (int d=0; d<4; ++d) {
+ left=ENCODE(r,c,d); right=ENCODE(r,c,4); if ((r+c)%2) swap(left,right); MM.add_edge(left,right);
+ }
+ }
+
+ // find a maximum matching and check its size
+ int expected_size = 0;
+ for (int r=0; r<R; ++r) for (int c=0; c<C; ++c) expected_size += A[r][c] + (A[r][c]==3 ? 2 : 0);
+ vector< pair<int,int> > matching = MM.maximum_matching();
+ if (2*matching.size() != expected_size) { cout << "NIE" << endl; return 0; }
+
+ // from the edges of the matching, reconstruct the map
+ set< pair<int,int> > edges;
+ FOREACH(it,matching) { edges.insert(make_pair(it->first,it->second)); edges.insert(make_pair(it->second,it->first)); }
+ vector<string> output(3*R, string(3*C,'.'));
+ for (int r=0; r<R; ++r) for (int c=0; c<C; ++c) if (A[r][c]) {
+ output[3*r+1][3*c+1]='O';
+ if (edges.count(make_pair(VERTEX(r,c,LEFT), VERTEX(r,c-1,RIGHT)))) output[3*r+1][3*c]='X';
+ if (edges.count(make_pair(VERTEX(r,c,RIGHT), VERTEX(r,c+1,LEFT)))) output[3*r+1][3*c+2]='X';
+ if (edges.count(make_pair(VERTEX(r,c,TOP), VERTEX(r-1,c,BOTTOM)))) output[3*r][3*c+1]='X';
+ if (edges.count(make_pair(VERTEX(r,c,BOTTOM),VERTEX(r+1,c,TOP)))) output[3*r+2][3*c+1]='X';
+ }
+ for (int r=0; r<3*R; ++r) cout << output[r] << endl;
+}
diff --git a/semestr-4/sieci/warsztaty8/psp0.cpp b/semestr-4/sieci/warsztaty8/psp0.cpp new file mode 100644 index 0000000..676bcb8 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/psp0.cpp @@ -0,0 +1,44 @@ +#include <cstdio> +#include <algorithm> +using namespace std; +#define rand_mod 1000000033 +int rozm, zapy, ds[200000], dl; +typedef long long LL; +LL sum, wcz[200000], rand_plus, ele[6]; +bool cmp(int x, int y) +{ + return wcz[x] < wcz[y]; +} +int main() +{ + scanf("%d%Ld", &rozm, &rand_plus); + scanf("%d", &zapy); + for (int i = 0; i < zapy; ++i) + { + scanf("%Ld%Ld", wcz + 2 * i, wcz + 2 * i + 1); + --wcz[2 * i]; + } + for (int i = 0; i < 2 * zapy; ++i) + ds[i] = i; + sort(ds, ds + 2 * zapy, cmp); + while (dl < 2 * zapy && !wcz[ds[dl]]) + ++dl; + + for (int i = 1; i <= rozm; ++i) + { + ele[0] = (ele[1] * ele[1]) % rand_mod; + ele[0] += ((ele[2] + ele[3]) * (ele[2] + ele[3])) % rand_mod; + ele[0] += (ele[4] * ele[5]) % rand_mod; + ele[0] += (rand_plus * rand_plus) % rand_mod; + ele[0] += i % rand_mod; + ele[0] %= rand_mod; + sum += ele[0]; + while (dl < 2 * zapy && wcz[ds[dl]] == i) + wcz[ds[dl++]] = sum; + for (int i = 4; i >= 0; i--) ele[i+1] = ele[i]; + ele[0] = 0; + } + for (int i = 0; i < zapy; ++i) + printf("%Ld\n", wcz[2 * i + 1] - wcz[2 * i]); + return 0; +} diff --git a/semestr-4/sieci/warsztaty8/w8.pdf b/semestr-4/sieci/warsztaty8/w8.pdf Binary files differnew file mode 100644 index 0000000..91676f4 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/w8.pdf diff --git a/semestr-4/sieci/warsztaty8/wie5.cpp b/semestr-4/sieci/warsztaty8/wie5.cpp new file mode 100644 index 0000000..0821777 --- /dev/null +++ b/semestr-4/sieci/warsztaty8/wie5.cpp @@ -0,0 +1,158 @@ +#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+mt19937 rng(rand());
+const int MAXDEG = 10000;
+long long poly[MAXDEG+1];
+int deg;
+
+int gcd(int a, int b){
+ return !b ? a : gcd(b, a%b);
+}
+
+struct rat{
+ int sign;
+ int num, den;
+
+ void cancel(){
+ int d = gcd(num, den);
+ this->num /= d;
+ this->den /= d;
+ }
+
+ rat(int a, int b){
+ this->sign = 1;
+ if(a == 0){
+ this->sign = 0;
+ this->num = 0;
+ this->den = 1;
+ return;
+ }
+ if(b < 0){
+ this->sign = -1;
+ }
+ this->den = abs(b);
+ if(a < 0){
+ this->sign = -(this->sign);
+ }
+ this->num = abs(a);
+ cancel();
+ }
+
+ bool operator<(const rat &x) const {
+ if(this->sign != x.sign) return this->sign < x.sign;
+
+ bool abs_less;
+ long long int left = (long long)(this->num) * (long long)(x.den);
+ long long int right = (long long)(x.num) * (long long)(this->den);
+ abs_less = left < right;
+
+ if(left == right) return false;
+ if(this->sign == -1) return !abs_less;
+ if(this->sign == 0) return false;
+ if(this->sign == 1) return abs_less;
+ }
+
+ bool operator==(const rat &x) const {
+ return this->sign == x.sign && this->num == x.num && this->den == x.den;
+ }
+
+ friend ostream& operator<<(ostream &stream, const rat &x){
+ if(x.sign == -1) stream << '-';
+ stream << x.num << "/" << x.den;
+ return stream;
+ }
+};
+
+ll W(rat x, int mod){
+ ll out = 0;
+ ll den_pow = 1;
+ ll num = x.num;
+ ll den = x.den;
+ if(x.sign == -1) num = mod-num;
+ for(int i = deg; i >= 0; i--){
+ out += (poly[i]*den_pow)%mod;
+ if(i) out *= num;
+ out %= mod;
+ den_pow = (den_pow * den)%mod;
+ }
+ //cerr << x << " " << mod << " " << out << endl;
+ return out;
+}
+
+bool check(rat x){
+ for(int i = 0; i < 20; i++){
+ int p = uniform_int_distribution<int>(2, 1000000000)(rng);
+ if(W(x, p)){
+ //cerr << x << " " << p << endl;
+ return false;
+ }
+ }
+ return true;
+}
+
+vector< int > nums;
+vector< int > dens;
+vector< rat > candidates_mult;
+vector< rat > candidates;
+void cands(){
+ for(int i = 1; i*i <= abs(poly[0]); i++){
+ if(abs(poly[0]) % i) continue;
+ nums.push_back(i);
+ nums.push_back(-i);
+ nums.push_back(poly[0]/i);
+ nums.push_back(-poly[0]/i);
+ }
+
+ for(int i = 1; i*i <= abs(poly[deg]); i++){
+ if(abs(poly[deg]) % i) continue;
+ dens.push_back(i);
+ dens.push_back(poly[deg]/i);
+ }
+
+ //cerr << nums.size() << " * " << dens.size() << " = " << (nums.size())*(dens.size()) << endl;
+
+ for(int p : nums){
+ for(int q : dens){
+ candidates_mult.push_back({p, q});
+ }
+ }
+ sort(candidates_mult.begin(), candidates_mult.end());
+ candidates.push_back(candidates_mult[0]);
+ for(int i = 1; i < candidates_mult.size(); i++){
+ if(!(candidates_mult[i-1] == candidates_mult[i])){
+ candidates.push_back(candidates_mult[i]);
+ }
+ }
+
+ //for(rat r : candidates) cerr << r << endl;
+}
+
+vector< rat > s;
+void solve(){
+ if(!poly[0]){
+ s.push_back({0, 1});
+ int k = 0;
+ while(poly[k] == 0) k++;
+ for(int i = 0; i <= deg-k; i++) poly[i] = poly[i+k];
+ deg -= k;
+ }
+
+ cands();
+ for(rat c : candidates) if(check(c)) s.push_back(c);
+ sort(s.begin(), s.end());
+ cout << s.size() << "\n";
+ for(rat i : s) cout << i << " ";
+}
+
+int main(){
+ ios_base::sync_with_stdio(0);
+ cin.tie(0);
+ cout.tie(0);
+
+ cin >> deg;
+ for(int i = 0; i <= deg; i++) cin >> poly[deg-i];
+ solve();
+}
diff --git a/semestr-4/sieci/warsztaty8/wie5.pdf b/semestr-4/sieci/warsztaty8/wie5.pdf Binary files differnew file mode 100644 index 0000000..cd5637b --- /dev/null +++ b/semestr-4/sieci/warsztaty8/wie5.pdf diff --git a/semestr-4/sieci/wyklady/ASD_kol2_2021-1.pdf b/semestr-4/sieci/wyklady/ASD_kol2_2021-1.pdf Binary files differnew file mode 100644 index 0000000..2fbe591 --- /dev/null +++ b/semestr-4/sieci/wyklady/ASD_kol2_2021-1.pdf diff --git a/semestr-4/sieci/wyklady/lec1.pdf b/semestr-4/sieci/wyklady/lec1.pdf Binary files differnew file mode 100644 index 0000000..5da8f03 --- /dev/null +++ b/semestr-4/sieci/wyklady/lec1.pdf diff --git a/semestr-4/sieci/wyklady/lec13.pdf b/semestr-4/sieci/wyklady/lec13.pdf Binary files differnew file mode 100644 index 0000000..245259f --- /dev/null +++ b/semestr-4/sieci/wyklady/lec13.pdf diff --git a/semestr-4/sieci/wyklady/lec2.pdf b/semestr-4/sieci/wyklady/lec2.pdf Binary files differnew file mode 100644 index 0000000..edb1398 --- /dev/null +++ b/semestr-4/sieci/wyklady/lec2.pdf diff --git a/semestr-4/sieci/wyklady/lec3.pdf b/semestr-4/sieci/wyklady/lec3.pdf Binary files differnew file mode 100644 index 0000000..ae48ec2 --- /dev/null +++ b/semestr-4/sieci/wyklady/lec3.pdf diff --git a/semestr-4/sieci/wyklady/lec4.pdf b/semestr-4/sieci/wyklady/lec4.pdf Binary files differnew file mode 100644 index 0000000..352b71d --- /dev/null +++ b/semestr-4/sieci/wyklady/lec4.pdf diff --git a/semestr-4/sieci/wyklady/lec5.pdf b/semestr-4/sieci/wyklady/lec5.pdf Binary files differnew file mode 100644 index 0000000..3a7b39b --- /dev/null +++ b/semestr-4/sieci/wyklady/lec5.pdf diff --git a/semestr-4/sieci/wyklady/lec6.pdf b/semestr-4/sieci/wyklady/lec6.pdf Binary files differnew file mode 100644 index 0000000..04975ce --- /dev/null +++ b/semestr-4/sieci/wyklady/lec6.pdf diff --git a/semestr-4/sieci/wyklady/lec7.pdf b/semestr-4/sieci/wyklady/lec7.pdf Binary files differnew file mode 100644 index 0000000..0b28c4d --- /dev/null +++ b/semestr-4/sieci/wyklady/lec7.pdf diff --git a/semestr-4/sieci/wyklady/lec8.pdf b/semestr-4/sieci/wyklady/lec8.pdf Binary files differnew file mode 100644 index 0000000..a4fbb9c --- /dev/null +++ b/semestr-4/sieci/wyklady/lec8.pdf |