aboutsummaryrefslogtreecommitdiff
path: root/Semestr 4/aisd
diff options
context:
space:
mode:
Diffstat (limited to 'Semestr 4/aisd')
-rw-r--r--Semestr 4/aisd/Lista 0/Rozw L0.pdfbin1984913 -> 1983735 bytes
-rw-r--r--Semestr 4/aisd/Lista 1/Lista 1.pdfbin0 -> 810791 bytes
-rw-r--r--Semestr 4/aisd/Wykłady/Notatka 3 - Zachłany.pdfbin0 -> 243598 bytes
-rw-r--r--Semestr 4/aisd/Wykłady/Notatka 4 - divide and conquer.pdfbin0 -> 326839 bytes
-rw-r--r--Semestr 4/aisd/rozw.cpp70
5 files changed, 70 insertions, 0 deletions
diff --git a/Semestr 4/aisd/Lista 0/Rozw L0.pdf b/Semestr 4/aisd/Lista 0/Rozw L0.pdf
index 7472d55..d39c13b 100644
--- a/Semestr 4/aisd/Lista 0/Rozw L0.pdf
+++ b/Semestr 4/aisd/Lista 0/Rozw L0.pdf
Binary files differ
diff --git a/Semestr 4/aisd/Lista 1/Lista 1.pdf b/Semestr 4/aisd/Lista 1/Lista 1.pdf
new file mode 100644
index 0000000..7e2f5ae
--- /dev/null
+++ b/Semestr 4/aisd/Lista 1/Lista 1.pdf
Binary files differ
diff --git a/Semestr 4/aisd/Wykłady/Notatka 3 - Zachłany.pdf b/Semestr 4/aisd/Wykłady/Notatka 3 - Zachłany.pdf
new file mode 100644
index 0000000..5403789
--- /dev/null
+++ b/Semestr 4/aisd/Wykłady/Notatka 3 - Zachłany.pdf
Binary files differ
diff --git a/Semestr 4/aisd/Wykłady/Notatka 4 - divide and conquer.pdf b/Semestr 4/aisd/Wykłady/Notatka 4 - divide and conquer.pdf
new file mode 100644
index 0000000..205b505
--- /dev/null
+++ b/Semestr 4/aisd/Wykłady/Notatka 4 - divide and conquer.pdf
Binary files differ
diff --git a/Semestr 4/aisd/rozw.cpp b/Semestr 4/aisd/rozw.cpp
new file mode 100644
index 0000000..0b5c3ba
--- /dev/null
+++ b/Semestr 4/aisd/rozw.cpp
@@ -0,0 +1,70 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+vector<int> v;
+
+int p(int n, int k, int m) {
+ if (k == 0 && n != 0) return 0;
+ if (k == 0 && n == 0) {
+ for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
+ cout << "\n";
+ return 1;
+ }
+ int value = 0;
+ for (int i = 0; i <= min(n, m); i++) {
+ v.push_back(i);
+ if (i == 25) {
+ cout << "ELO\n";
+ }
+ value += p(n - i, k - 1, i);
+ v.pop_back();
+ }
+ return value;
+}
+
+int tab[30][30];
+int cnt = 0;
+
+
+int d(int n, int k) {
+ if (tab[n][k] != -1) return tab[n][k];
+ cout << n << " " << k << " " << ++cnt << "\n";
+ if (n == 0 && k == 0) return tab[n][k] = 1;
+ if (k > n || k <= 0) if (k >= 0) return tab[n][k] = 0;
+ return tab[n][k] = d(n-1, k-1) + d(n-k, k);
+}
+
+// int e(int n, int k) {
+// if (n == 0 && k == 0) return tab[n][k] = 1;
+// // if (n == 0 && k > 0) return tab[n][k] = 0;
+// if (n > 0 && k <= 0) {
+// if (k >= 0)
+// tab[n][k] = 0;
+// return 0;
+// }
+// if (n < 0) return 0;
+// if (tab[n][k] != -1) return tab[n][k];
+// return tab[n][k] = e(n, k-1) + e(n-k, k);
+// }
+// DP[i][j] = max(DP[i-1][j-1], DP[i-2][j], DP[i][j - 2], DP[i][j-2])
+
+int main() {
+ int n, k;
+ cin >> n >> k;
+ for (int i = 0; i < 30; i++) {
+ for (int j = 0; j < 30; j++)
+ tab[i][j] = -1;
+ }
+ cout << d(n,k) << "\n";
+ // cout << p(n, k, n) << "\n";
+ // cout << e(n,k) << "\n";
+
+ for (int i = 0; i < 26; i++) {
+ cout << i << ": ";
+ for (int j = 0; j < 6; j++) {
+ cout << tab[i][j] << " ";
+ }
+ cout << "\n";
+ }
+ // cout << p(n, k, n) << "\n";
+} \ No newline at end of file