Solved problems 1003[A, B, C, D]

Author: AliOsm

CodeForces/1003A. Polycarp's Pockets.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, a[101];
+set<int> st;
+
+int main() {
+  int cnt = 0;
+  cin >> n;
+  for(int i = 0; i < n; ++i)
+    cin >> a[i];
+
+  int res = 0;
+  while(cnt != n) {
+    st.clear();
+    for(int i = 0; i < n; ++i)
+      if(a[i] != -1 && st.count(a[i]) == 0)
+        st.insert(a[i]), a[i] = -1, ++cnt;
+    ++res;
+  }
+
+  cout << res << endl;
+
+  return 0;
+}

CodeForces/1003B. Binary String Constructing.cpp

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  int a, b, x;
+  cin >> a >> b >> x;
+
+  string s;
+  if(a > b)
+    s = "0", --a;
+  else
+    s = "1", --b;
+
+  for(int i = 0; i < x; ++i) {
+    if(b > 0 && s.back() == '0')
+      --b, s += '1';
+    else if(a > 0)
+      --a, s += '0';
+  }
+
+  for(int i = 0; i < s.length(); ++i) {
+    cout << s[i];
+    if(a > 0 && s[i] == '0')
+      while(a-- != 0)
+        cout << '0';
+    if(b > 0 && s[i] == '1')
+      while(b-- != 0)
+        cout << '1';
+  }
+  cout << endl;
+
+  return 0;
+}

CodeForces/1003C. Intense Heat.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 5001;
+int n, k, a[N], cs[N];
+
+int main() {
+  cin >> n >> k;
+  for(int i = 0; i < n; ++i)
+    cin >> a[i];
+
+  for(int i = 1; i <= n; ++i)
+    cs[i] = cs[i - 1] + a[i - 1];
+
+  long double res = 0, mul = 1.0;
+  for(int i = 1; i <= n; ++i)
+    for(int j = i; j <= n; ++j) {
+      if(j - i + 1 < k)
+        continue;
+
+      res = max(res, mul * (cs[j] - cs[i - 1]) / (j - i + 1));
+    }
+
+  cout << fixed << setprecision(15) << res << endl;
+
+  return 0;
+}

CodeForces/1003D. Coins and Queries.cpp

@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 2e5 + 1;
+int n, q, a[N], fr[35], fr1[35];
+
+bool check() {
+  for(int i = 0; i < 35; ++i)
+    if(fr1[i] != 0)
+      return false;
+  return true;
+}
+
+int main() {
+  scanf("%d %d", &n, &q);
+  for(int i = 0; i < n; ++i) {
+    scanf("%d", a + i);
+    bitset<32> bs(a[i]);
+    for(int i = 0; i < 32; ++i)
+      if(bs[i] == 1)
+        ++fr[i];
+  }
+
+  while(q-- != 0) {
+    int tmp;
+    scanf("%d", &tmp);
+    bitset<32> bs(tmp);
+
+    memset(fr1, 0, sizeof fr1);
+    for(int i = 0; i < 32; ++i)
+      fr1[i] = bs[i];
+    
+    int cnt = 0;
+    for(int i = 31; i >= 0; --i) {
+      if(i > 0 && fr1[i] != 0 && fr[i] == 0) {
+        fr1[i - 1] += fr1[i] * 2;
+        fr1[i] = 0;
+      } else if(i > 0 && fr1[i] != 0 && fr[i] < fr1[i]) {
+        fr1[i - 1] += (fr1[i] - fr[i]) * 2;
+        cnt += fr[i];
+        fr1[i] = 0;
+      } else if(fr1[i] != 0 && fr[i] >= fr1[i]) {
+        cnt += fr1[i];
+        fr1[i] = 0;
+      }
+    }
+
+    if(check())
+      printf("%d\n", cnt);
+    else
+      puts("-1");
+  }
+
+  return 0;
+}

CodeForces/README.md

@@ -469,3 +469,7 @@
 - [988C. Equal Sums](http://codeforces.com/contest/988/problem/C)
 - [988D. Points and Powers of Two](http://codeforces.com/contest/988/problem/D)
 - [988E. Divisibility by 25](http://codeforces.com/contest/988/problem/E)
+- [1003A. Polycarp's Pockets](http://codeforces.com/contest/1003/problem/A)
+- [1003B. Binary String Constructing](http://codeforces.com/contest/1003/problem/B)
+- [1003C. Intense Heat.cpp](http://codeforces.com/contest/1003/problem/C)
+- [1003D. Coins and Queries](http://codeforces.com/contest/1003/problem/D)