aboutsummaryrefslogtreecommitdiff
path: root/Semestr 4/aisd/pracownia1
diff options
context:
space:
mode:
authorFranciszek Malinka <franciszek.malinka@gmail.com>2021-03-30 20:00:11 +0200
committerFranciszek Malinka <franciszek.malinka@gmail.com>2021-03-30 20:00:11 +0200
commit3ece8214fbf6389d0fabb63a9040720757c7db71 (patch)
tree14d58d391aa7504c450dd704a2ffbcf3499a0621 /Semestr 4/aisd/pracownia1
parente18c47449761598ab0d4e50979f99f4858bc4c08 (diff)
zmiana nazw
Diffstat (limited to 'Semestr 4/aisd/pracownia1')
-rw-r--r--Semestr 4/aisd/pracownia1/pracownia1.pdfbin0 -> 55846 bytes
-rw-r--r--Semestr 4/aisd/pracownia1/rozw.cpp59
-rw-r--r--Semestr 4/aisd/pracownia1/rozw2.cpp33
3 files changed, 92 insertions, 0 deletions
diff --git a/Semestr 4/aisd/pracownia1/pracownia1.pdf b/Semestr 4/aisd/pracownia1/pracownia1.pdf
new file mode 100644
index 0000000..2b99ba4
--- /dev/null
+++ b/Semestr 4/aisd/pracownia1/pracownia1.pdf
Binary files differ
diff --git a/Semestr 4/aisd/pracownia1/rozw.cpp b/Semestr 4/aisd/pracownia1/rozw.cpp
new file mode 100644
index 0000000..acbd711
--- /dev/null
+++ b/Semestr 4/aisd/pracownia1/rozw.cpp
@@ -0,0 +1,59 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+vector<pair<int, pair<int, int>>> v;
+const int MAX_LEN = 85;
+int bits[100];
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie();
+ int n;
+ cin >> n;
+ for (int i = 0; i < n; i++) {
+ int d, nd;
+ cin >> d >> nd;
+ int k = 0;
+ while (d % 2 == 0) {
+ d /= 2;
+ k++;
+ }
+ v.push_back({d, {k, nd}});
+ }
+ sort(v.begin(), v.end());
+ int result = 0;
+
+ for (int i = 0; i < n; ) {
+ int h = i;
+ int d = v[i].first;
+ while (h < n && v[h].first == d) {
+ h++;
+ }
+ for (int k = 0; k < MAX_LEN; k++)
+ bits[k] = 0;
+ for (int j = i; j < h; ++j) {
+ ll x = (ll)(1LL << v[j].second.first) * (ll)v[j].second.second;
+ int k = 0;
+ while (x > 0) {
+ if (x % 2 == 1) {
+ bits[k]++;
+ }
+ x /= 2;
+ k++;
+ }
+ }
+
+ for (int k = 0; k < MAX_LEN; k++) {
+ if (bits[k] > 1) {
+ bits[k + 1] += bits[k]/2;
+ }
+ if (bits[k] % 2 == 1) {
+ result++;
+ }
+ }
+ i = h;
+ }
+
+ cout << result << "\n";
+} \ No newline at end of file
diff --git a/Semestr 4/aisd/pracownia1/rozw2.cpp b/Semestr 4/aisd/pracownia1/rozw2.cpp
new file mode 100644
index 0000000..35fd37e
--- /dev/null
+++ b/Semestr 4/aisd/pracownia1/rozw2.cpp
@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef unsigned long long ll;
+
+vector<pair<int, ll>> v;
+
+int main() {
+ int n;
+ scanf("%d", &n);
+ for (int i = 0; i < n; i++) {
+ int d, nd, k = 0;
+ scanf("%d %d", &d, &nd);
+ while (d % 2 == 0) {
+ k++;
+ d /= 2;
+ }
+ v.push_back({d, (ll)(1LL<<k) * (ll)nd});
+ }
+ sort(v.begin(), v.end());
+ int result = 0;
+ for (int i = 0; i < n; ) {
+ int j = i;
+ int cur = v[i].first;
+ ll count = 0;
+ while (j < n && v[j].first == cur) {
+ count += v[j].second;
+ ++j;
+ }
+ result += __builtin_popcountll(count);
+ i = j;
+ }
+ cout << result << "\n";
+} \ No newline at end of file