Zmiana struktury folderu pstwo, dodane jakies listy

20 files changed, 166 insertions, 0 deletions

diff --git a/Semestr 4/Pstwo/L1Z4.pdf b/Semestr 4/Pstwo/Lista 1/L1Z4.pdf
index 6fe5c29..6fe5c29 100644
--- a/Semestr 4/Pstwo/L1Z4.pdf
+++ b/Semestr 4/Pstwo/Lista 1/L1Z4.pdf
diff --git a/Semestr 4/Pstwo/RP1R_01.pdf b/Semestr 4/Pstwo/Lista 1/RP1R_01.pdf
index ecce64c..ecce64c 100644
--- a/Semestr 4/Pstwo/RP1R_01.pdf
+++ b/Semestr 4/Pstwo/Lista 1/RP1R_01.pdf
diff --git a/Semestr 4/Pstwo/L2Z11.pdf b/Semestr 4/Pstwo/Lista 2/L2Z11.pdf
index bf6f8d3..bf6f8d3 100644
--- a/Semestr 4/Pstwo/L2Z11.pdf
+++ b/Semestr 4/Pstwo/Lista 2/L2Z11.pdf
diff --git a/Semestr 4/Pstwo/RP1R_02.pdf b/Semestr 4/Pstwo/Lista 2/RP1R_02.pdf
index 1deaa87..1deaa87 100644
--- a/Semestr 4/Pstwo/RP1R_02.pdf
+++ b/Semestr 4/Pstwo/Lista 2/RP1R_02.pdf
diff --git a/Semestr 4/Pstwo/Lista 3/L3Z4.pdf b/Semestr 4/Pstwo/Lista 3/L3Z4.pdf
new file mode 100644
index 0000000..59a2004
--- /dev/null
+++ b/Semestr 4/Pstwo/Lista 3/L3Z4.pdf
diff --git a/Semestr 4/Pstwo/RP1R_03.pdf b/Semestr 4/Pstwo/Lista 3/RP1R_03.pdf
index 164c2cd..164c2cd 100644
--- a/Semestr 4/Pstwo/RP1R_03.pdf
+++ b/Semestr 4/Pstwo/Lista 3/RP1R_03.pdf
diff --git a/Semestr 4/Pstwo/Wyklad 2.pdf b/Semestr 4/Pstwo/Wykłady/Wyklad 2.pdf
index df38730..df38730 100644
--- a/Semestr 4/Pstwo/Wyklad 2.pdf
+++ b/Semestr 4/Pstwo/Wykłady/Wyklad 2.pdf
diff --git a/Semestr 4/Pstwo/Wyklad 3.pdf b/Semestr 4/Pstwo/Wykłady/Wyklad 3.pdf
index 32e902d..32e902d 100644
--- a/Semestr 4/Pstwo/Wyklad 3.pdf
+++ b/Semestr 4/Pstwo/Wykłady/Wyklad 3.pdf
diff --git a/Semestr 4/Pstwo/Wyklad 4.pdf b/Semestr 4/Pstwo/Wykłady/Wyklad 4.pdf
index a368c05..a368c05 100644
--- a/Semestr 4/Pstwo/Wyklad 4.pdf
+++ b/Semestr 4/Pstwo/Wykłady/Wyklad 4.pdf
diff --git a/Semestr 4/Pstwo/Wykład1.pdf b/Semestr 4/Pstwo/Wykłady/Wykład 1.pdf
index d04dccd..d04dccd 100644
--- a/Semestr 4/Pstwo/Wykład1.pdf
+++ b/Semestr 4/Pstwo/Wykłady/Wykład 1.pdf
diff --git a/Semestr 4/Pstwo/w1.svg b/Semestr 4/Pstwo/Wykłady/w1.svg
index 701e596..701e596 100644
--- a/Semestr 4/Pstwo/w1.svg
+++ b/Semestr 4/Pstwo/Wykłady/w1.svg
diff --git a/Semestr 4/aisd/Lista 1/lista1.pdf b/Semestr 4/aisd/Lista 1/lista1.pdf
new file mode 100644
index 0000000..a7dc065
--- /dev/null
+++ b/Semestr 4/aisd/Lista 1/lista1.pdf
diff --git a/Semestr 4/aisd/Lista 2/Lista 2.pdf b/Semestr 4/aisd/Lista 2/Lista 2.pdf
new file mode 100644
index 0000000..ccf83b7
--- /dev/null
+++ b/Semestr 4/aisd/Lista 2/Lista 2.pdf
diff --git a/Semestr 4/aisd/Lista 2/lista2.pdf b/Semestr 4/aisd/Lista 2/lista2.pdf
new file mode 100644
index 0000000..2d8937f
--- /dev/null
+++ b/Semestr 4/aisd/Lista 2/lista2.pdf
diff --git a/Semestr 4/aisd/Wykłady/Notatka 5 - divide and conquer cd.pdf b/Semestr 4/aisd/Wykłady/Notatka 5 - divide and conquer cd.pdf
new file mode 100644
index 0000000..48fc8e4
--- /dev/null
+++ b/Semestr 4/aisd/Wykłady/Notatka 5 - divide and conquer cd.pdf
diff --git a/Semestr 4/aisd/Wykłady/Notatka 6 - Programowanie Dynamiczne.pdf b/Semestr 4/aisd/Wykłady/Notatka 6 - Programowanie Dynamiczne.pdf
new file mode 100644
index 0000000..d8b61ce
--- /dev/null
+++ b/Semestr 4/aisd/Wykłady/Notatka 6 - Programowanie Dynamiczne.pdf
diff --git a/Semestr 4/aisd/themis/AISDDEBIUT21.cpp b/Semestr 4/aisd/themis/AISDDEBIUT21.cpp
new file mode 100644
index 0000000..3666d69
--- /dev/null
+++ b/Semestr 4/aisd/themis/AISDDEBIUT21.cpp
@@ -0,0 +1,24 @@
+/*

+ *  Autor: Franciszek Malinka

+ *  Numer indeksu: 316093

+ *  Prowadzący: WJA

+ */

+

+#include <bits/stdc++.h>

+using namespace std;

+

+int main()

+{

+  ios_base::sync_with_stdio(false);

+  cin.tie();

+  int a, b;

+  cin >> a >> b;

+  for (int i = a; i <= b; i++)

+  {

+    if (i % 2021 == 0)

+    {

+      cout << i << " ";

+    }

+  }

+  cout << "\n";

+}
\ No newline at end of file
diff --git a/Semestr 4/aisd/themis/AISDPOTEGOWANIE.cpp b/Semestr 4/aisd/themis/AISDPOTEGOWANIE.cpp
new file mode 100644
index 0000000..c1b76fe
--- /dev/null
+++ b/Semestr 4/aisd/themis/AISDPOTEGOWANIE.cpp
@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>

+using namespace std;

+

+int fast_pow(int a, int b, int m)

+{

+  if (b == 0)

+  {

+    return 1;

+  }

+  long long p = fast_pow(a, b / 2, m);

+  p = (p * p) % m;

+  if (b % 2 == 0)

+    return (int)p;

+  return (p * (long long)a) % m;

+}

+

+int main()

+{

+  ios_base::sync_with_stdio(false);

+  cin.tie();

+  int t;

+  cin >> t;

+  while (t--)

+  {

+    int a, b, m;

+    cin >> a >> b >> m;

+    cout << fast_pow(a, b, m) << "\n";

+  }

+}
\ No newline at end of file
diff --git a/Semestr 4/aisd/themis/BELLMAN.cpp b/Semestr 4/aisd/themis/BELLMAN.cpp
new file mode 100644
index 0000000..5a65096
--- /dev/null
+++ b/Semestr 4/aisd/themis/BELLMAN.cpp
@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>

+using namespace std;

+

+const int N = 503;

+int dist[N];

+vector<pair<int, pair<int, int>>> edges;

+int main()

+{

+  ios_base::sync_with_stdio(false);

+  cin.tie();

+  int n, m, s;

+  cin >> n >> m >> s;

+  for (int i = 0; i <= n; i++)

+  {

+    dist[i] = 2e9;

+  }

+  dist[s] = 0;

+  for (int i = 0; i < m; i++)

+  {

+    int u, v, w;

+    cin >> u >> v >> w;

+    edges.push_back({w, {u, v}});

+    // edges.push_back({w, {v, u}});

+  }

+

+  for (int i = 0; i < n + 1; i++)

+  {

+    for (auto e : edges)

+    {

+      int w = e.first;

+      int u = e.second.first;

+      int v = e.second.second;

+      if (dist[v] > dist[u] + w)

+      {

+        dist[v] = dist[u] + w;

+      }

+    }

+  }

+  for (auto e : edges)

+  {

+    int w = e.first;

+    int u = e.second.first;

+    int v = e.second.second;

+    if (dist[v] > dist[u] + w)

+    {

+      cout << "NIE\n";

+      return 0;

+    }

+  }

+  for (int i = 0; i < n; i++)

+  {

+    if (i != s && dist[i] < 1e9)

+      cout << i << " " << dist[i] << "\n";

+  }

+}
\ No newline at end of file
diff --git a/Semestr 4/aisd/themis/FIB.cpp b/Semestr 4/aisd/themis/FIB.cpp
new file mode 100644
index 0000000..dd38c5c
--- /dev/null
+++ b/Semestr 4/aisd/themis/FIB.cpp
@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>

+using namespace std;

+typedef long long ll;

+

+class matrix

+{

+public:

+  ll a, b, c, d;

+  static ll m;

+

+  matrix(ll _a = 0, ll _b = 0, ll _c = 0, ll _d = 0) : a(_a), b(_b), c(_c), d(_d) {}

+

+  matrix operator*(const matrix &M) const

+  {

+    matrix res;

+    res.a = (a * M.a + b * M.c) % m;

+    res.b = (a * M.b + b * M.d) % m;

+    res.c = (c * M.a + d * M.c) % m;

+    res.d = (c * M.b + d * M.d) % m;

+    return res;

+  }

+};

+

+ll matrix::m = 1;

+

+matrix fast_pow(matrix M, int w)

+{

+  matrix res(1, 0, 0, 1);

+  while (w)

+  {

+    if (w % 2 == 1)

+      res = res * M;

+    M = M * M;

+    w >>= 1;

+  }

+  return res;

+}

+

+void solve()

+{

+  int n, m;

+  cin >> n >> m;

+  matrix M(0, 1, 1, 1);

+  matrix::m = m;

+  cout << fast_pow(M, n + 1).a << "\n";

+}

+

+int main()

+{

+  ios_base::sync_with_stdio(false);

+  cin.tie();

+  int t;

+  cin >> t;

+  while (t--)

+  {

+    solve();

+  }

+}
\ No newline at end of file