From 96df60657966f3934451ecd6da92d63a500adcf7 Mon Sep 17 00:00:00 2001 From: Franciszek Malinka Date: Fri, 26 Mar 2021 18:09:15 +0100 Subject: changed dirs names --- .gitignore | 4 + Semestr 4/Pstwo/Lista 1/L1Z4.pdf | Bin 413391 -> 0 bytes Semestr 4/Pstwo/Lista 1/RP1R_01.pdf | Bin 124161 -> 0 bytes Semestr 4/Pstwo/Lista 2/L2Z11.pdf | Bin 409088 -> 0 bytes Semestr 4/Pstwo/Lista 2/RP1R_02.pdf | Bin 135145 -> 0 bytes Semestr 4/Pstwo/Lista 3/L3Z4.pdf | Bin 1548668 -> 0 bytes Semestr 4/Pstwo/Lista 3/RP1R_03.pdf | Bin 122308 -> 0 bytes Semestr 4/Pstwo/Lista 4/RP1R_04.pdf | Bin 125285 -> 0 bytes "Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 2.pdf" | Bin 3943486 -> 0 bytes "Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 3.pdf" | Bin 2970744 -> 0 bytes "Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 4.pdf" | Bin 3276716 -> 0 bytes .../Pstwo/Wyk\305\202ady/Wyk\305\202ad 1.pdf" | Bin 1673358 -> 0 bytes "Semestr 4/Pstwo/Wyk\305\202ady/w1.svg" | 4229 -------------------- Semestr 4/ask/lista 0/Lista 0.pdf | Bin 362255 -> 0 bytes Semestr 4/ask/lista 0/ask21_lista_0.pdf | Bin 94705 -> 0 bytes Semestr 4/ask/lista 0/rozw | Bin 16800 -> 0 bytes Semestr 4/ask/lista 0/rozw.c | 78 - Semestr 4/ask/lista 1/ask21_lista_1.pdf | Bin 118889 -> 0 bytes Semestr 4/ask/lista 1/rozw.c | 217 - Semestr 4/ask/lista 1/test.c | 11 - Semestr 4/ask/lista 1/zad7.txt | 21 - Semestr 4/ask/lista 2/ask21_lista_2.pdf | Bin 137597 -> 0 bytes Semestr 4/ask/lista 2/pom.c | 38 - Semestr 4/ask/lista0/Lista 0.pdf | Bin 0 -> 362255 bytes Semestr 4/ask/lista0/ask21_lista_0.pdf | Bin 0 -> 94705 bytes Semestr 4/ask/lista0/rozw.c | 78 + Semestr 4/ask/lista1/ask21_lista_1.pdf | Bin 0 -> 118889 bytes Semestr 4/ask/lista1/rozw.c | 217 + Semestr 4/ask/lista1/test.c | 11 + Semestr 4/ask/lista1/zad7.txt | 21 + Semestr 4/ask/lista2/ask21_lista_2.pdf | Bin 0 -> 137597 bytes Semestr 4/ask/lista2/pom.c | 38 + Semestr 4/ask/lista3/ask21_lista_3.pdf | Bin 0 -> 152374 bytes Semestr 4/ask/lista4/ask21_lista_4.pdf | Bin 0 -> 149361 bytes Semestr 4/ask/lista5/ask21_lista_5.pdf | Bin 0 -> 91135 bytes Semestr 4/pstwo/lista1/L1Z4.pdf | Bin 0 -> 413391 bytes Semestr 4/pstwo/lista1/RP1R_01.pdf | Bin 0 -> 124161 bytes Semestr 4/pstwo/lista2/L2Z11.pdf | Bin 0 -> 409088 bytes Semestr 4/pstwo/lista2/RP1R_02.pdf | Bin 0 -> 135145 bytes Semestr 4/pstwo/lista3/L3Z4.pdf | Bin 0 -> 1548668 bytes Semestr 4/pstwo/lista3/RP1R_03.pdf | Bin 0 -> 122308 bytes Semestr 4/pstwo/lista4/RP1R_04.pdf | Bin 0 -> 125285 bytes Semestr 4/pstwo/wyklady/Wyklad 2.pdf | Bin 0 -> 3943486 bytes Semestr 4/pstwo/wyklady/Wyklad 3.pdf | Bin 0 -> 2970744 bytes Semestr 4/pstwo/wyklady/Wyklad 4.pdf | Bin 0 -> 3276716 bytes "Semestr 4/pstwo/wyklady/Wyk\305\202ad 1.pdf" | Bin 0 -> 1673358 bytes Semestr 4/pstwo/wyklady/w1.svg | 4229 ++++++++++++++++++++ Semestr 4/rownania rozniczkowe/lista 1/L1Z3.pdf | Bin 1210433 -> 0 bytes Semestr 4/rownania rozniczkowe/lista 1/RR1R-01.pdf | Bin 100982 -> 0 bytes Semestr 4/rownania rozniczkowe/lista 2/L2Z4.pdf | Bin 137162 -> 0 bytes Semestr 4/rownania rozniczkowe/lista 2/RR1R-02.pdf | Bin 100435 -> 0 bytes Semestr 4/rownania rozniczkowe/lista 3/RR1R-03.pdf | Bin 90514 -> 0 bytes Semestr 4/rr1r/lista1/L1Z3.pdf | Bin 0 -> 1210433 bytes Semestr 4/rr1r/lista1/RR1R-01.pdf | Bin 0 -> 100982 bytes Semestr 4/rr1r/lista2/L2Z4.pdf | Bin 0 -> 137162 bytes Semestr 4/rr1r/lista2/RR1R-02.pdf | Bin 0 -> 100435 bytes Semestr 4/rr1r/lista3/RR1R-03.pdf | Bin 0 -> 90514 bytes Semestr 4/sieci/cwiczenia1/out.pdf | Bin 0 -> 1613073 bytes Semestr 4/sieci/cwiczenia1/rozw.pdf | Bin 0 -> 26846 bytes Semestr 4/sieci/vm.pdf | Bin 112439 -> 0 bytes "Semestr 4/sieci/wyk\305\202ad1.pdf" | Bin 8280250 -> 0 bytes "Semestr 4/sieci/wyk\305\202ad2.pdf" | Bin 5058364 -> 0 bytes 62 files changed, 4598 insertions(+), 4594 deletions(-) delete mode 100644 Semestr 4/Pstwo/Lista 1/L1Z4.pdf delete mode 100644 Semestr 4/Pstwo/Lista 1/RP1R_01.pdf delete mode 100644 Semestr 4/Pstwo/Lista 2/L2Z11.pdf delete mode 100644 Semestr 4/Pstwo/Lista 2/RP1R_02.pdf delete mode 100644 Semestr 4/Pstwo/Lista 3/L3Z4.pdf delete mode 100644 Semestr 4/Pstwo/Lista 3/RP1R_03.pdf delete mode 100644 Semestr 4/Pstwo/Lista 4/RP1R_04.pdf delete mode 100644 "Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 2.pdf" delete mode 100644 "Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 3.pdf" delete mode 100644 "Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 4.pdf" delete mode 100644 "Semestr 4/Pstwo/Wyk\305\202ady/Wyk\305\202ad 1.pdf" delete mode 100644 "Semestr 4/Pstwo/Wyk\305\202ady/w1.svg" delete mode 100644 Semestr 4/ask/lista 0/Lista 0.pdf delete mode 100644 Semestr 4/ask/lista 0/ask21_lista_0.pdf delete mode 100644 Semestr 4/ask/lista 0/rozw delete mode 100644 Semestr 4/ask/lista 0/rozw.c delete mode 100644 Semestr 4/ask/lista 1/ask21_lista_1.pdf delete mode 100644 Semestr 4/ask/lista 1/rozw.c delete mode 100644 Semestr 4/ask/lista 1/test.c delete mode 100644 Semestr 4/ask/lista 1/zad7.txt delete mode 100644 Semestr 4/ask/lista 2/ask21_lista_2.pdf delete mode 100644 Semestr 4/ask/lista 2/pom.c create mode 100644 Semestr 4/ask/lista0/Lista 0.pdf create mode 100644 Semestr 4/ask/lista0/ask21_lista_0.pdf create mode 100644 Semestr 4/ask/lista0/rozw.c create mode 100644 Semestr 4/ask/lista1/ask21_lista_1.pdf create mode 100644 Semestr 4/ask/lista1/rozw.c create mode 100644 Semestr 4/ask/lista1/test.c create mode 100644 Semestr 4/ask/lista1/zad7.txt create mode 100644 Semestr 4/ask/lista2/ask21_lista_2.pdf create mode 100644 Semestr 4/ask/lista2/pom.c create mode 100644 Semestr 4/ask/lista3/ask21_lista_3.pdf create mode 100644 Semestr 4/ask/lista4/ask21_lista_4.pdf create mode 100644 Semestr 4/ask/lista5/ask21_lista_5.pdf create mode 100644 Semestr 4/pstwo/lista1/L1Z4.pdf create mode 100644 Semestr 4/pstwo/lista1/RP1R_01.pdf create mode 100644 Semestr 4/pstwo/lista2/L2Z11.pdf create mode 100644 Semestr 4/pstwo/lista2/RP1R_02.pdf create mode 100644 Semestr 4/pstwo/lista3/L3Z4.pdf create mode 100644 Semestr 4/pstwo/lista3/RP1R_03.pdf create mode 100644 Semestr 4/pstwo/lista4/RP1R_04.pdf create mode 100644 Semestr 4/pstwo/wyklady/Wyklad 2.pdf create mode 100644 Semestr 4/pstwo/wyklady/Wyklad 3.pdf create mode 100644 Semestr 4/pstwo/wyklady/Wyklad 4.pdf create mode 100644 "Semestr 4/pstwo/wyklady/Wyk\305\202ad 1.pdf" create mode 100644 Semestr 4/pstwo/wyklady/w1.svg delete mode 100644 Semestr 4/rownania rozniczkowe/lista 1/L1Z3.pdf delete mode 100644 Semestr 4/rownania rozniczkowe/lista 1/RR1R-01.pdf delete mode 100644 Semestr 4/rownania rozniczkowe/lista 2/L2Z4.pdf delete mode 100644 Semestr 4/rownania rozniczkowe/lista 2/RR1R-02.pdf delete mode 100644 Semestr 4/rownania rozniczkowe/lista 3/RR1R-03.pdf create mode 100644 Semestr 4/rr1r/lista1/L1Z3.pdf create mode 100644 Semestr 4/rr1r/lista1/RR1R-01.pdf create mode 100644 Semestr 4/rr1r/lista2/L2Z4.pdf create mode 100644 Semestr 4/rr1r/lista2/RR1R-02.pdf create mode 100644 Semestr 4/rr1r/lista3/RR1R-03.pdf create mode 100644 Semestr 4/sieci/cwiczenia1/out.pdf create mode 100644 Semestr 4/sieci/cwiczenia1/rozw.pdf delete mode 100644 Semestr 4/sieci/vm.pdf delete mode 100644 "Semestr 4/sieci/wyk\305\202ad1.pdf" delete mode 100644 "Semestr 4/sieci/wyk\305\202ad2.pdf" diff --git a/.gitignore b/.gitignore index 7672739..747284e 100644 --- a/.gitignore +++ b/.gitignore @@ -9,3 +9,7 @@ Semestr 4/sieci/vol/ *.vscode* + +*.zip +*.in +*.out diff --git a/Semestr 4/Pstwo/Lista 1/L1Z4.pdf b/Semestr 4/Pstwo/Lista 1/L1Z4.pdf deleted file mode 100644 index 6fe5c29..0000000 Binary files a/Semestr 4/Pstwo/Lista 1/L1Z4.pdf and /dev/null differ diff --git a/Semestr 4/Pstwo/Lista 1/RP1R_01.pdf b/Semestr 4/Pstwo/Lista 1/RP1R_01.pdf deleted file mode 100644 index ecce64c..0000000 Binary files a/Semestr 4/Pstwo/Lista 1/RP1R_01.pdf and /dev/null differ diff --git a/Semestr 4/Pstwo/Lista 2/L2Z11.pdf b/Semestr 4/Pstwo/Lista 2/L2Z11.pdf deleted file mode 100644 index bf6f8d3..0000000 Binary files a/Semestr 4/Pstwo/Lista 2/L2Z11.pdf and /dev/null differ diff --git a/Semestr 4/Pstwo/Lista 2/RP1R_02.pdf b/Semestr 4/Pstwo/Lista 2/RP1R_02.pdf deleted file mode 100644 index 1deaa87..0000000 Binary files a/Semestr 4/Pstwo/Lista 2/RP1R_02.pdf and /dev/null differ diff --git a/Semestr 4/Pstwo/Lista 3/L3Z4.pdf b/Semestr 4/Pstwo/Lista 3/L3Z4.pdf deleted file mode 100644 index 59a2004..0000000 Binary files a/Semestr 4/Pstwo/Lista 3/L3Z4.pdf and /dev/null differ diff --git a/Semestr 4/Pstwo/Lista 3/RP1R_03.pdf b/Semestr 4/Pstwo/Lista 3/RP1R_03.pdf deleted file mode 100644 index 164c2cd..0000000 Binary files a/Semestr 4/Pstwo/Lista 3/RP1R_03.pdf and /dev/null differ diff --git a/Semestr 4/Pstwo/Lista 4/RP1R_04.pdf b/Semestr 4/Pstwo/Lista 4/RP1R_04.pdf deleted file mode 100644 index a093a1b..0000000 Binary files a/Semestr 4/Pstwo/Lista 4/RP1R_04.pdf and /dev/null differ diff --git "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 2.pdf" "b/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 2.pdf" deleted file mode 100644 index df38730..0000000 Binary files "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 2.pdf" and /dev/null differ diff --git "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 3.pdf" "b/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 3.pdf" deleted file mode 100644 index 32e902d..0000000 Binary files "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 3.pdf" and /dev/null differ diff --git "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 4.pdf" "b/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 4.pdf" deleted file mode 100644 index a368c05..0000000 Binary files "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyklad 4.pdf" and /dev/null differ diff --git "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyk\305\202ad 1.pdf" "b/Semestr 4/Pstwo/Wyk\305\202ady/Wyk\305\202ad 1.pdf" deleted file mode 100644 index d04dccd..0000000 Binary files "a/Semestr 4/Pstwo/Wyk\305\202ady/Wyk\305\202ad 1.pdf" and /dev/null differ diff --git "a/Semestr 4/Pstwo/Wyk\305\202ady/w1.svg" "b/Semestr 4/Pstwo/Wyk\305\202ady/w1.svg" deleted file mode 100644 index 701e596..0000000 --- "a/Semestr 4/Pstwo/Wyk\305\202ady/w1.svg" +++ /dev/null @@ -1,4229 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/Semestr 4/ask/lista 0/Lista 0.pdf b/Semestr 4/ask/lista 0/Lista 0.pdf deleted file mode 100644 index bffa5cb..0000000 Binary files a/Semestr 4/ask/lista 0/Lista 0.pdf and /dev/null differ diff --git a/Semestr 4/ask/lista 0/ask21_lista_0.pdf b/Semestr 4/ask/lista 0/ask21_lista_0.pdf deleted file mode 100644 index cc9b182..0000000 Binary files a/Semestr 4/ask/lista 0/ask21_lista_0.pdf and /dev/null differ diff --git a/Semestr 4/ask/lista 0/rozw b/Semestr 4/ask/lista 0/rozw deleted file mode 100644 index 76b73b3..0000000 Binary files a/Semestr 4/ask/lista 0/rozw and /dev/null differ diff --git a/Semestr 4/ask/lista 0/rozw.c b/Semestr 4/ask/lista 0/rozw.c deleted file mode 100644 index c71940a..0000000 --- a/Semestr 4/ask/lista 0/rozw.c +++ /dev/null @@ -1,78 +0,0 @@ -#include -#include - - -int main() { - /* Zad. 3 */ - - uint32_t x, k; - scanf("%d%d", &x, &k); - - x &= ~(1<>= y; // floor(x / 2^y) - x &= (1<> y; // ceil(x/2^y) = floor((x + 2^y - 1)/2^y) - - /* Zad. 5 */ - - scanf("%d", &x); - /* jesli x = 2^k, to x = 1000...0. Wtedy x - 1 = 0111...1, zatem x & (x - 1) == 0 - * gdy x jest potęgą dwójki. Łatwo widać, że jeśli x nie jest potęgą dwójki, - * to wiodący bit będzie ten sam, więc koniunkcja bitowa będzie niezerowa */ - printf("%d", (x & (x - 1))); - - /* Zad. 6 */ - - int rev = ((0xff000000 & x) >> 24u) | // można pominąć tę koniunkcję. - ((0xff0000 & x) >> 8u) | - ((0xff00 & x) << 8u) | - ((0xff & x) << 24u); - - /* Zad. 7 */ - - /* Kod sterujący - kod, który nie niesie informacji o znaku, ale niesie jakąś - * instrukcję sterującą dla urządzenia, np. do terminala. - * ASCII (American Standard Code for Information Interchange) - zestaw znaków, - * który stał się standardem w komunikacji elektronicznej. - * 0, NUL - znak nie niosący żadnej informacji. Może informować np. o końcu danych tekstowych - * 4, EOT (end of thread/end of transmission), ^D - informuje o końcu transmisji danych, - * które mogły zawierać więcej niż jeden tekst. - * 7, BEL (bell), ^G - instruuje urządzenie do wysłania dźwięku. - * 10, LF (line feed), \n - instruuje urządzenie do przejścia do nowej linii, - * ale nie do jej początku. Z tego względu jest często wiązany z CR (carriage return), - * który instruuje urządzenie do powrotu do początku wiersza. W systemach UNIX sam \n - * wystarczy. - * 12, FF (Form feed) - instruuje np. drukarki do przejścia do pierwszego wiersza - * następnej kartkii. - */ - - /* Zad. 8 */ - - /* UTF-8 (8-bit Unicode Transformation Format) - alternatywny zestaw znaków, - * w pełni kompatybilny z ASCII. Wykorzystuje od 1 do 4 bajtów do zakodowania - * pojedyńczego znaku. ASCII ma do dyspozycji jedynie 128 możliwych znaków, co - * zdecydowanie jest mniejsze niż potrzebna liczba znaków do zakodowania. - * Wykorzystanie 4 bajtów pozwala na gwałtowne zwiększenie tej liczby. - * - * Proszę zapłacić 5€! ę - U+0119 (0000 0001 0001 1001), spacja - U+0020, - * ł - U+0142 (0000 0001 0100 0010), € - U+20AC (0010 0000 1010 1100) - * 01010000 01110010 01101111 01110011 01111010 [1100 0100 1001 1001] - * 00100000 - * 01111010 01010001 01110000 [1100 0101 1000 0010] 01010001 01010011 01011001 [1100 0100 1000 0111] - * 00100000 - * 00110101 [1110 0010 1000 0010 1010 1100] 00100001 - */ - - return 0; -} \ No newline at end of file diff --git a/Semestr 4/ask/lista 1/ask21_lista_1.pdf b/Semestr 4/ask/lista 1/ask21_lista_1.pdf deleted file mode 100644 index 9afcd65..0000000 Binary files a/Semestr 4/ask/lista 1/ask21_lista_1.pdf and /dev/null differ diff --git a/Semestr 4/ask/lista 1/rozw.c b/Semestr 4/ask/lista 1/rozw.c deleted file mode 100644 index 0b4c208..0000000 --- a/Semestr 4/ask/lista 1/rozw.c +++ /dev/null @@ -1,217 +0,0 @@ -#include -#include - - -static const int S[] = {1, 2, 4, 8, 16}; // Magic Binary Numbers -static const int B[] = {0x55555555, 0x33333333, 0x0F0F0F0F, 0x00FF00FF, 0x0000FFFF}; - -char* utb(uint32_t x) { - static char rep[36]; - int cnt = 34; - for (int i = 0; i < 32; i += 1) { - if (i > 0 && i % 8 == 0) { - rep[cnt] = ' '; - cnt -= 1; - } - rep[cnt] = (x & 1) + '0'; - cnt -= 1; - x >>= 1; - } - rep[35] = '\0'; - return rep; -} - -void pb(uint32_t x) { - printf("%s : %d\n", utb(x), x); -} - -struct A { - int8_t a; - void *b; - int8_t c; - int16_t d; -}; - -struct B { - void *c; - double b; - int16_t a; -}; - -struct C { - int8_t a; - int8_t c; - int16_t d; - void *b; -}; - -// zaklada count > 0 -void secret(uint8_t *to, uint8_t *from, size_t count) { - size_t n = (count + 7) / 8; - switch (count % 8) { - case 0: do { *to++ = *from++; - case 7: *to++ = *from++; - case 6: *to++ = *from++; - case 5: *to++ = *from++; - case 4: *to++ = *from++; - case 3: *to++ = *from++; - case 2: *to++ = *from++; - case 1: *to++ = *from++; - } while (--n > 0); - } -} - -// zaklada count > 0 -void goto_secret(uint8_t *to, uint8_t *from, size_t count) { - size_t n = (count + 7) / 8; - static void *array[] = { &&finito, &&c0, &&c1, &&c2, &&c3, &&c4, &&c5, &&c6, &&c7 }; - goto *array[count % 8 + 1]; - c0: *to++ = *from++; - c7: *to++ = *from++; - c6: *to++ = *from++; - c5: *to++ = *from++; - c4: *to++ = *from++; - c3: *to++ = *from++; - c2: *to++ = *from++; - c1: *to++ = *from++; - goto *array[(--n > 0)]; - finito: return; -} - -int main() { - /* Zadanie 1 */ - printf("Zadanie 1:\n"); - - uint32_t i = 7, k = 15, x = 15689126; - - pb(x); - uint32_t c = (((1<> i) << k; // 0010 0000 - x = (x & ~(1<> 1) & B[0]); pb(c); - c = ((c >> S[1]) & B[1]) + (c & B[1]); pb(c); - c = ((c >> S[2]) + c) & B[2]; pb(c); - c = ((c >> S[3]) + c) & B[3]; pb(c); - c = ((c >> S[4]) + c) & B[4]; pb(c); - printf("-----------------\n"); - // wersja dla koksow - v = v - ((v >> 1) & 0x55555555); pb(v);// reuse input as temporary - v = ((v >> 2) & 0x33333333) + (v & 0x33333333); pb(v); // temp - c = ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; pb(c); // count - - - /* Zadanie 3 */ - printf("Zadanie 3:\n"); - - struct A a; - struct B b; - struct C d; - int8_t x1; - void *x2; - int16_t x3; - printf("%lu %lu %lu\n", sizeof x1, sizeof x2, sizeof x3); - printf("%lu %lu %lu\n", sizeof a, sizeof b, sizeof d); - - - /* Zadanie 4 */ - - - /* Zadanie 5 */ - - /* s += b[j + 1] + b[--j]; - * - * t1 := j + 1 - * t2 := t1 * 4 - * t3 := b[t2] - * j := j - 1 - * t4 := j * 4 - * t5 := b[t4] - * t6 := t4 + t5 // Czy na pewno tak? - * s := s + t6 - * - * a[i++] -= *b * (c[j*2] + 1); - * - * t1 := *b - * t2 := j * 2 - * t3 := t2 * 4 - * t4 := c[t3] - * t5 := t4 + 1 - * t6 := t1 * t5 - * a := a - t6 - * i := i + 1 - */ - - /* Zadanie 6 */ - /* vs->d = us[1].a + us[j].c; - * t1 := 1 * 12 - * t2 := us + t1 - * t2' := us + 0 // chcemy dostać się do a, ale jest na poczatku, wiec nic dodawac nie trzeba - * t3 := *t2 - * t4 := j * 12 - * t5 := us + t4 - * t6 := t5 + 8 - * t7 := *t6 - * t8 := t3 + t7 - * t9 := vs + 9 - * *t9 := t8 - */ - - /* Zadanie 7 */ - - /* I := 0 ; <> - goto ITest - ILoop: J := I ; <> - goto WTest - WLoop: t1 := 4 * J ; <> - Temp := arr[t1] ; arr[J] - t2 := J - 1 - t3 := 4 * t2 - t4 := arr[t3] ; arr[J - 1] - arr[t1] := t4 ; arr[J] := arr[J - 1] - arr[t3] := Temp ; arr[J - 1] := Temp - J := J - 1 - WTest: if J <= 0 goto IPlus ; <> - t4 := 4 * J ; <> - t5 := arr[t4] - t6 := J - 1 - t7 = 4 * t6 - t8 := arr[t7] - if t5 >= t8 goto IPlus - goto WLoop ; <> - IPlus: I := I + 1 ; <> - ITest: if I < length goto ILoop ; <> - */ - - - /* Zadanie 8 */ - printf("Zadanie 8:\n"); - - // secret kopiuje wartości na które wskazuje from do miejsca w które wskazuje to, - // przesuwa oba wskaźniki i powtarza tak count razy (czyli efektywnie kopiuje np. tablice) - - uint8_t t1[10] = {1,2,3,0,5,100,7,8,9,10}, t2[10]; - uint8_t* to = t2 + 2, *from = t1 + 3; - size_t count = 4; - - goto_secret(to, from, count); - - for (int i = 0; i < 10; i++) - printf("%hhd ", t1[i]); - printf("\n"); - for (int i = 0; i < 10; i++) - printf("%hhd ", t2[i]); - printf("\n"); - - i = 3; - t1[i++] = i; - printf("%hhd\n", t1[i-1]); -} \ No newline at end of file diff --git a/Semestr 4/ask/lista 1/test.c b/Semestr 4/ask/lista 1/test.c deleted file mode 100644 index 0f3c11e..0000000 --- a/Semestr 4/ask/lista 1/test.c +++ /dev/null @@ -1,11 +0,0 @@ -#include -#include - -int main() -{ - int x; - short y; - x = -10; - y = (short)x; - printf("%d %hd", x, y); -} \ No newline at end of file diff --git a/Semestr 4/ask/lista 1/zad7.txt b/Semestr 4/ask/lista 1/zad7.txt deleted file mode 100644 index 1e9c4b3..0000000 --- a/Semestr 4/ask/lista 1/zad7.txt +++ /dev/null @@ -1,21 +0,0 @@ - I := 0 - goto ITest -ILoop: J := I - goto WTest -WLoop: t1 := 4 * J - Temp := arr[t1] - t2 := J - 1 - t3 := 4 * t2 - arr[t1] := arr[t3] - arr[t3] := Temp - J := J - 1 -WTest: if J <= 0 goto IPlus - t4 := 4 * J - t5 := arr[t4] - t6 := J - 1 - t7 = 4 * t6 - t8 := arr[t7] - if t5 >= t8 goto IPlus - goto WLoop -IPlus: I := I + 1 -ITest: if I < length goto ILoop \ No newline at end of file diff --git a/Semestr 4/ask/lista 2/ask21_lista_2.pdf b/Semestr 4/ask/lista 2/ask21_lista_2.pdf deleted file mode 100644 index e6df9d7..0000000 Binary files a/Semestr 4/ask/lista 2/ask21_lista_2.pdf and /dev/null differ diff --git a/Semestr 4/ask/lista 2/pom.c b/Semestr 4/ask/lista 2/pom.c deleted file mode 100644 index 87d542d..0000000 --- a/Semestr 4/ask/lista 2/pom.c +++ /dev/null @@ -1,38 +0,0 @@ -#include -#include -#include - -char* utb(uint32_t x) { - static char rep[36]; - int cnt = 34; - for (int i = 0; i < 32; i += 1) { - if (i > 0 && i % 8 == 0) { - rep[cnt] = ' '; - cnt -= 1; - } - rep[cnt] = (x & 1) + '0'; - cnt -= 1; - x >>= 1; - } - rep[35] = '\0'; - return rep; -} - -void pb(uint32_t x) { - printf("%s : %d\n", utb(x), x); -} - -// int main() { -// /* Zadanie 1 */ - -// int32_t x; -// x = (1<<31); -// printf("%d, %d, %d %d\n", x, (x > 0), x-1, (x - 1 < 0)); -// } - -int main() { - /* Zadanie 1 */ - int32_t x; - scanf("%d", &x); - printf("%d %d\n", x*x, INT_MIN); -} \ No newline at end of file diff --git a/Semestr 4/ask/lista0/Lista 0.pdf b/Semestr 4/ask/lista0/Lista 0.pdf new file mode 100644 index 0000000..bffa5cb Binary files /dev/null and b/Semestr 4/ask/lista0/Lista 0.pdf differ diff --git a/Semestr 4/ask/lista0/ask21_lista_0.pdf b/Semestr 4/ask/lista0/ask21_lista_0.pdf new file mode 100644 index 0000000..cc9b182 Binary files /dev/null and b/Semestr 4/ask/lista0/ask21_lista_0.pdf differ diff --git a/Semestr 4/ask/lista0/rozw.c b/Semestr 4/ask/lista0/rozw.c new file mode 100644 index 0000000..c71940a --- /dev/null +++ b/Semestr 4/ask/lista0/rozw.c @@ -0,0 +1,78 @@ +#include +#include + + +int main() { + /* Zad. 3 */ + + uint32_t x, k; + scanf("%d%d", &x, &k); + + x &= ~(1<>= y; // floor(x / 2^y) + x &= (1<> y; // ceil(x/2^y) = floor((x + 2^y - 1)/2^y) + + /* Zad. 5 */ + + scanf("%d", &x); + /* jesli x = 2^k, to x = 1000...0. Wtedy x - 1 = 0111...1, zatem x & (x - 1) == 0 + * gdy x jest potęgą dwójki. Łatwo widać, że jeśli x nie jest potęgą dwójki, + * to wiodący bit będzie ten sam, więc koniunkcja bitowa będzie niezerowa */ + printf("%d", (x & (x - 1))); + + /* Zad. 6 */ + + int rev = ((0xff000000 & x) >> 24u) | // można pominąć tę koniunkcję. + ((0xff0000 & x) >> 8u) | + ((0xff00 & x) << 8u) | + ((0xff & x) << 24u); + + /* Zad. 7 */ + + /* Kod sterujący - kod, który nie niesie informacji o znaku, ale niesie jakąś + * instrukcję sterującą dla urządzenia, np. do terminala. + * ASCII (American Standard Code for Information Interchange) - zestaw znaków, + * który stał się standardem w komunikacji elektronicznej. + * 0, NUL - znak nie niosący żadnej informacji. Może informować np. o końcu danych tekstowych + * 4, EOT (end of thread/end of transmission), ^D - informuje o końcu transmisji danych, + * które mogły zawierać więcej niż jeden tekst. + * 7, BEL (bell), ^G - instruuje urządzenie do wysłania dźwięku. + * 10, LF (line feed), \n - instruuje urządzenie do przejścia do nowej linii, + * ale nie do jej początku. Z tego względu jest często wiązany z CR (carriage return), + * który instruuje urządzenie do powrotu do początku wiersza. W systemach UNIX sam \n + * wystarczy. + * 12, FF (Form feed) - instruuje np. drukarki do przejścia do pierwszego wiersza + * następnej kartkii. + */ + + /* Zad. 8 */ + + /* UTF-8 (8-bit Unicode Transformation Format) - alternatywny zestaw znaków, + * w pełni kompatybilny z ASCII. Wykorzystuje od 1 do 4 bajtów do zakodowania + * pojedyńczego znaku. ASCII ma do dyspozycji jedynie 128 możliwych znaków, co + * zdecydowanie jest mniejsze niż potrzebna liczba znaków do zakodowania. + * Wykorzystanie 4 bajtów pozwala na gwałtowne zwiększenie tej liczby. + * + * Proszę zapłacić 5€! ę - U+0119 (0000 0001 0001 1001), spacja - U+0020, + * ł - U+0142 (0000 0001 0100 0010), € - U+20AC (0010 0000 1010 1100) + * 01010000 01110010 01101111 01110011 01111010 [1100 0100 1001 1001] + * 00100000 + * 01111010 01010001 01110000 [1100 0101 1000 0010] 01010001 01010011 01011001 [1100 0100 1000 0111] + * 00100000 + * 00110101 [1110 0010 1000 0010 1010 1100] 00100001 + */ + + return 0; +} \ No newline at end of file diff --git a/Semestr 4/ask/lista1/ask21_lista_1.pdf b/Semestr 4/ask/lista1/ask21_lista_1.pdf new file mode 100644 index 0000000..9afcd65 Binary files /dev/null and b/Semestr 4/ask/lista1/ask21_lista_1.pdf differ diff --git a/Semestr 4/ask/lista1/rozw.c b/Semestr 4/ask/lista1/rozw.c new file mode 100644 index 0000000..0b4c208 --- /dev/null +++ b/Semestr 4/ask/lista1/rozw.c @@ -0,0 +1,217 @@ +#include +#include + + +static const int S[] = {1, 2, 4, 8, 16}; // Magic Binary Numbers +static const int B[] = {0x55555555, 0x33333333, 0x0F0F0F0F, 0x00FF00FF, 0x0000FFFF}; + +char* utb(uint32_t x) { + static char rep[36]; + int cnt = 34; + for (int i = 0; i < 32; i += 1) { + if (i > 0 && i % 8 == 0) { + rep[cnt] = ' '; + cnt -= 1; + } + rep[cnt] = (x & 1) + '0'; + cnt -= 1; + x >>= 1; + } + rep[35] = '\0'; + return rep; +} + +void pb(uint32_t x) { + printf("%s : %d\n", utb(x), x); +} + +struct A { + int8_t a; + void *b; + int8_t c; + int16_t d; +}; + +struct B { + void *c; + double b; + int16_t a; +}; + +struct C { + int8_t a; + int8_t c; + int16_t d; + void *b; +}; + +// zaklada count > 0 +void secret(uint8_t *to, uint8_t *from, size_t count) { + size_t n = (count + 7) / 8; + switch (count % 8) { + case 0: do { *to++ = *from++; + case 7: *to++ = *from++; + case 6: *to++ = *from++; + case 5: *to++ = *from++; + case 4: *to++ = *from++; + case 3: *to++ = *from++; + case 2: *to++ = *from++; + case 1: *to++ = *from++; + } while (--n > 0); + } +} + +// zaklada count > 0 +void goto_secret(uint8_t *to, uint8_t *from, size_t count) { + size_t n = (count + 7) / 8; + static void *array[] = { &&finito, &&c0, &&c1, &&c2, &&c3, &&c4, &&c5, &&c6, &&c7 }; + goto *array[count % 8 + 1]; + c0: *to++ = *from++; + c7: *to++ = *from++; + c6: *to++ = *from++; + c5: *to++ = *from++; + c4: *to++ = *from++; + c3: *to++ = *from++; + c2: *to++ = *from++; + c1: *to++ = *from++; + goto *array[(--n > 0)]; + finito: return; +} + +int main() { + /* Zadanie 1 */ + printf("Zadanie 1:\n"); + + uint32_t i = 7, k = 15, x = 15689126; + + pb(x); + uint32_t c = (((1<> i) << k; // 0010 0000 + x = (x & ~(1<> 1) & B[0]); pb(c); + c = ((c >> S[1]) & B[1]) + (c & B[1]); pb(c); + c = ((c >> S[2]) + c) & B[2]; pb(c); + c = ((c >> S[3]) + c) & B[3]; pb(c); + c = ((c >> S[4]) + c) & B[4]; pb(c); + printf("-----------------\n"); + // wersja dla koksow + v = v - ((v >> 1) & 0x55555555); pb(v);// reuse input as temporary + v = ((v >> 2) & 0x33333333) + (v & 0x33333333); pb(v); // temp + c = ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; pb(c); // count + + + /* Zadanie 3 */ + printf("Zadanie 3:\n"); + + struct A a; + struct B b; + struct C d; + int8_t x1; + void *x2; + int16_t x3; + printf("%lu %lu %lu\n", sizeof x1, sizeof x2, sizeof x3); + printf("%lu %lu %lu\n", sizeof a, sizeof b, sizeof d); + + + /* Zadanie 4 */ + + + /* Zadanie 5 */ + + /* s += b[j + 1] + b[--j]; + * + * t1 := j + 1 + * t2 := t1 * 4 + * t3 := b[t2] + * j := j - 1 + * t4 := j * 4 + * t5 := b[t4] + * t6 := t4 + t5 // Czy na pewno tak? + * s := s + t6 + * + * a[i++] -= *b * (c[j*2] + 1); + * + * t1 := *b + * t2 := j * 2 + * t3 := t2 * 4 + * t4 := c[t3] + * t5 := t4 + 1 + * t6 := t1 * t5 + * a := a - t6 + * i := i + 1 + */ + + /* Zadanie 6 */ + /* vs->d = us[1].a + us[j].c; + * t1 := 1 * 12 + * t2 := us + t1 + * t2' := us + 0 // chcemy dostać się do a, ale jest na poczatku, wiec nic dodawac nie trzeba + * t3 := *t2 + * t4 := j * 12 + * t5 := us + t4 + * t6 := t5 + 8 + * t7 := *t6 + * t8 := t3 + t7 + * t9 := vs + 9 + * *t9 := t8 + */ + + /* Zadanie 7 */ + + /* I := 0 ; <> + goto ITest + ILoop: J := I ; <> + goto WTest + WLoop: t1 := 4 * J ; <> + Temp := arr[t1] ; arr[J] + t2 := J - 1 + t3 := 4 * t2 + t4 := arr[t3] ; arr[J - 1] + arr[t1] := t4 ; arr[J] := arr[J - 1] + arr[t3] := Temp ; arr[J - 1] := Temp + J := J - 1 + WTest: if J <= 0 goto IPlus ; <> + t4 := 4 * J ; <> + t5 := arr[t4] + t6 := J - 1 + t7 = 4 * t6 + t8 := arr[t7] + if t5 >= t8 goto IPlus + goto WLoop ; <> + IPlus: I := I + 1 ; <> + ITest: if I < length goto ILoop ; <> + */ + + + /* Zadanie 8 */ + printf("Zadanie 8:\n"); + + // secret kopiuje wartości na które wskazuje from do miejsca w które wskazuje to, + // przesuwa oba wskaźniki i powtarza tak count razy (czyli efektywnie kopiuje np. tablice) + + uint8_t t1[10] = {1,2,3,0,5,100,7,8,9,10}, t2[10]; + uint8_t* to = t2 + 2, *from = t1 + 3; + size_t count = 4; + + goto_secret(to, from, count); + + for (int i = 0; i < 10; i++) + printf("%hhd ", t1[i]); + printf("\n"); + for (int i = 0; i < 10; i++) + printf("%hhd ", t2[i]); + printf("\n"); + + i = 3; + t1[i++] = i; + printf("%hhd\n", t1[i-1]); +} \ No newline at end of file diff --git a/Semestr 4/ask/lista1/test.c b/Semestr 4/ask/lista1/test.c new file mode 100644 index 0000000..0f3c11e --- /dev/null +++ b/Semestr 4/ask/lista1/test.c @@ -0,0 +1,11 @@ +#include +#include + +int main() +{ + int x; + short y; + x = -10; + y = (short)x; + printf("%d %hd", x, y); +} \ No newline at end of file diff --git a/Semestr 4/ask/lista1/zad7.txt b/Semestr 4/ask/lista1/zad7.txt new file mode 100644 index 0000000..1e9c4b3 --- /dev/null +++ b/Semestr 4/ask/lista1/zad7.txt @@ -0,0 +1,21 @@ + I := 0 + goto ITest +ILoop: J := I + goto WTest +WLoop: t1 := 4 * J + Temp := arr[t1] + t2 := J - 1 + t3 := 4 * t2 + arr[t1] := arr[t3] + arr[t3] := Temp + J := J - 1 +WTest: if J <= 0 goto IPlus + t4 := 4 * J + t5 := arr[t4] + t6 := J - 1 + t7 = 4 * t6 + t8 := arr[t7] + if t5 >= t8 goto IPlus + goto WLoop +IPlus: I := I + 1 +ITest: if I < length goto ILoop \ No newline at end of file diff --git a/Semestr 4/ask/lista2/ask21_lista_2.pdf b/Semestr 4/ask/lista2/ask21_lista_2.pdf new file mode 100644 index 0000000..e6df9d7 Binary files /dev/null and b/Semestr 4/ask/lista2/ask21_lista_2.pdf differ diff --git a/Semestr 4/ask/lista2/pom.c b/Semestr 4/ask/lista2/pom.c new file mode 100644 index 0000000..87d542d --- /dev/null +++ b/Semestr 4/ask/lista2/pom.c @@ -0,0 +1,38 @@ +#include +#include +#include + +char* utb(uint32_t x) { + static char rep[36]; + int cnt = 34; + for (int i = 0; i < 32; i += 1) { + if (i > 0 && i % 8 == 0) { + rep[cnt] = ' '; + cnt -= 1; + } + rep[cnt] = (x & 1) + '0'; + cnt -= 1; + x >>= 1; + } + rep[35] = '\0'; + return rep; +} + +void pb(uint32_t x) { + printf("%s : %d\n", utb(x), x); +} + +// int main() { +// /* Zadanie 1 */ + +// int32_t x; +// x = (1<<31); +// printf("%d, %d, %d %d\n", x, (x > 0), x-1, (x - 1 < 0)); +// } + +int main() { + /* Zadanie 1 */ + int32_t x; + scanf("%d", &x); + printf("%d %d\n", x*x, INT_MIN); +} \ No newline at end of file diff --git a/Semestr 4/ask/lista3/ask21_lista_3.pdf b/Semestr 4/ask/lista3/ask21_lista_3.pdf new file mode 100644 index 0000000..d83e9f8 Binary files /dev/null and b/Semestr 4/ask/lista3/ask21_lista_3.pdf differ diff --git a/Semestr 4/ask/lista4/ask21_lista_4.pdf b/Semestr 4/ask/lista4/ask21_lista_4.pdf new file mode 100644 index 0000000..87e0e4a Binary files /dev/null and b/Semestr 4/ask/lista4/ask21_lista_4.pdf differ diff --git a/Semestr 4/ask/lista5/ask21_lista_5.pdf b/Semestr 4/ask/lista5/ask21_lista_5.pdf new file mode 100644 index 0000000..b8c1977 Binary files /dev/null and b/Semestr 4/ask/lista5/ask21_lista_5.pdf differ diff --git a/Semestr 4/pstwo/lista1/L1Z4.pdf b/Semestr 4/pstwo/lista1/L1Z4.pdf new file mode 100644 index 0000000..6fe5c29 Binary files /dev/null and b/Semestr 4/pstwo/lista1/L1Z4.pdf differ diff --git a/Semestr 4/pstwo/lista1/RP1R_01.pdf b/Semestr 4/pstwo/lista1/RP1R_01.pdf new file mode 100644 index 0000000..ecce64c Binary files /dev/null and b/Semestr 4/pstwo/lista1/RP1R_01.pdf differ diff --git a/Semestr 4/pstwo/lista2/L2Z11.pdf b/Semestr 4/pstwo/lista2/L2Z11.pdf new file mode 100644 index 0000000..bf6f8d3 Binary files /dev/null and b/Semestr 4/pstwo/lista2/L2Z11.pdf differ diff --git a/Semestr 4/pstwo/lista2/RP1R_02.pdf b/Semestr 4/pstwo/lista2/RP1R_02.pdf new file mode 100644 index 0000000..1deaa87 Binary files /dev/null and b/Semestr 4/pstwo/lista2/RP1R_02.pdf differ diff --git a/Semestr 4/pstwo/lista3/L3Z4.pdf b/Semestr 4/pstwo/lista3/L3Z4.pdf new file mode 100644 index 0000000..59a2004 Binary files /dev/null and b/Semestr 4/pstwo/lista3/L3Z4.pdf differ diff --git a/Semestr 4/pstwo/lista3/RP1R_03.pdf b/Semestr 4/pstwo/lista3/RP1R_03.pdf new file mode 100644 index 0000000..164c2cd Binary files /dev/null and b/Semestr 4/pstwo/lista3/RP1R_03.pdf differ diff --git a/Semestr 4/pstwo/lista4/RP1R_04.pdf b/Semestr 4/pstwo/lista4/RP1R_04.pdf new file mode 100644 index 0000000..a093a1b Binary files /dev/null and b/Semestr 4/pstwo/lista4/RP1R_04.pdf differ diff --git a/Semestr 4/pstwo/wyklady/Wyklad 2.pdf b/Semestr 4/pstwo/wyklady/Wyklad 2.pdf new file mode 100644 index 0000000..df38730 Binary files /dev/null and b/Semestr 4/pstwo/wyklady/Wyklad 2.pdf differ diff --git a/Semestr 4/pstwo/wyklady/Wyklad 3.pdf b/Semestr 4/pstwo/wyklady/Wyklad 3.pdf new file mode 100644 index 0000000..32e902d Binary files /dev/null and b/Semestr 4/pstwo/wyklady/Wyklad 3.pdf differ diff --git a/Semestr 4/pstwo/wyklady/Wyklad 4.pdf b/Semestr 4/pstwo/wyklady/Wyklad 4.pdf new file mode 100644 index 0000000..a368c05 Binary files /dev/null and b/Semestr 4/pstwo/wyklady/Wyklad 4.pdf differ diff --git "a/Semestr 4/pstwo/wyklady/Wyk\305\202ad 1.pdf" "b/Semestr 4/pstwo/wyklady/Wyk\305\202ad 1.pdf" new file mode 100644 index 0000000..d04dccd Binary files /dev/null and "b/Semestr 4/pstwo/wyklady/Wyk\305\202ad 1.pdf" differ diff --git a/Semestr 4/pstwo/wyklady/w1.svg b/Semestr 4/pstwo/wyklady/w1.svg new file mode 100644 index 0000000..701e596 --- /dev/null +++ b/Semestr 4/pstwo/wyklady/w1.svg @@ -0,0 +1,4229 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Semestr 4/rownania rozniczkowe/lista 1/L1Z3.pdf b/Semestr 4/rownania rozniczkowe/lista 1/L1Z3.pdf deleted file mode 100644 index 5646667..0000000 Binary files a/Semestr 4/rownania rozniczkowe/lista 1/L1Z3.pdf and /dev/null differ diff --git a/Semestr 4/rownania rozniczkowe/lista 1/RR1R-01.pdf b/Semestr 4/rownania rozniczkowe/lista 1/RR1R-01.pdf deleted file mode 100644 index 464de00..0000000 Binary files a/Semestr 4/rownania rozniczkowe/lista 1/RR1R-01.pdf and /dev/null differ diff --git a/Semestr 4/rownania rozniczkowe/lista 2/L2Z4.pdf b/Semestr 4/rownania rozniczkowe/lista 2/L2Z4.pdf deleted file mode 100644 index bfa182a..0000000 Binary files a/Semestr 4/rownania rozniczkowe/lista 2/L2Z4.pdf and /dev/null differ diff --git a/Semestr 4/rownania rozniczkowe/lista 2/RR1R-02.pdf b/Semestr 4/rownania rozniczkowe/lista 2/RR1R-02.pdf deleted file mode 100644 index 7d1a845..0000000 Binary files a/Semestr 4/rownania rozniczkowe/lista 2/RR1R-02.pdf and /dev/null differ diff --git a/Semestr 4/rownania rozniczkowe/lista 3/RR1R-03.pdf b/Semestr 4/rownania rozniczkowe/lista 3/RR1R-03.pdf deleted file mode 100644 index 22c3214..0000000 Binary files a/Semestr 4/rownania rozniczkowe/lista 3/RR1R-03.pdf and /dev/null differ diff --git a/Semestr 4/rr1r/lista1/L1Z3.pdf b/Semestr 4/rr1r/lista1/L1Z3.pdf new file mode 100644 index 0000000..5646667 Binary files /dev/null and b/Semestr 4/rr1r/lista1/L1Z3.pdf differ diff --git a/Semestr 4/rr1r/lista1/RR1R-01.pdf b/Semestr 4/rr1r/lista1/RR1R-01.pdf new file mode 100644 index 0000000..464de00 Binary files /dev/null and b/Semestr 4/rr1r/lista1/RR1R-01.pdf differ diff --git a/Semestr 4/rr1r/lista2/L2Z4.pdf b/Semestr 4/rr1r/lista2/L2Z4.pdf new file mode 100644 index 0000000..bfa182a Binary files /dev/null and b/Semestr 4/rr1r/lista2/L2Z4.pdf differ diff --git a/Semestr 4/rr1r/lista2/RR1R-02.pdf b/Semestr 4/rr1r/lista2/RR1R-02.pdf new file mode 100644 index 0000000..7d1a845 Binary files /dev/null and b/Semestr 4/rr1r/lista2/RR1R-02.pdf differ diff --git a/Semestr 4/rr1r/lista3/RR1R-03.pdf b/Semestr 4/rr1r/lista3/RR1R-03.pdf new file mode 100644 index 0000000..22c3214 Binary files /dev/null and b/Semestr 4/rr1r/lista3/RR1R-03.pdf differ diff --git a/Semestr 4/sieci/cwiczenia1/out.pdf b/Semestr 4/sieci/cwiczenia1/out.pdf new file mode 100644 index 0000000..ea7781d Binary files /dev/null and b/Semestr 4/sieci/cwiczenia1/out.pdf differ diff --git a/Semestr 4/sieci/cwiczenia1/rozw.pdf b/Semestr 4/sieci/cwiczenia1/rozw.pdf new file mode 100644 index 0000000..f2d1a62 Binary files /dev/null and b/Semestr 4/sieci/cwiczenia1/rozw.pdf differ diff --git a/Semestr 4/sieci/vm.pdf b/Semestr 4/sieci/vm.pdf deleted file mode 100644 index 5eacd95..0000000 Binary files a/Semestr 4/sieci/vm.pdf and /dev/null differ diff --git "a/Semestr 4/sieci/wyk\305\202ad1.pdf" "b/Semestr 4/sieci/wyk\305\202ad1.pdf" deleted file mode 100644 index 5da8f03..0000000 Binary files "a/Semestr 4/sieci/wyk\305\202ad1.pdf" and /dev/null differ diff --git "a/Semestr 4/sieci/wyk\305\202ad2.pdf" "b/Semestr 4/sieci/wyk\305\202ad2.pdf" deleted file mode 100644 index edb1398..0000000 Binary files "a/Semestr 4/sieci/wyk\305\202ad2.pdf" and /dev/null differ -- cgit v1.2.3