Solve problems 898A, 898B, 898C and 898E from codeforces

Author: AliOsm

CodeForces/898A. Rounding.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, m, tmp;
+
+int main() {
+  scanf("%d", &n);
+  tmp = n;
+  m = n;
+
+  while(n % 10 != 0)
+	  ++n;
+
+  while(m % 10 != 0)
+	  --m;
+
+  if(n - tmp < tmp - m)
+	  printf("%d\n", n);
+  else
+	  printf("%d\n", m);
+
+  return 0;
+}
+

CodeForces/898B. Proper Nutrition.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+typedef long long ll;
+
+using namespace std;
+
+int n, a, b;
+
+int main() {
+	scanf("%d %d %d", &n, &a, &b);
+
+	for(int i = 0; i <= n; ++i)
+		if(n - (1ll * a * i) >= 0 && (n - (1ll * a * i)) % b == 0) {
+			printf("YES\n%d %d\n", i, (n - (1ll * a * i)) / b);
+			return 0;
+		}
+
+	puts("NO");
+
+	return 0;
+}
+

CodeForces/898C. Phone Numbers.cpp

@@ -0,0 +1,66 @@
+#include <bits/stdc++.h>
+
+typedef long long ll;
+
+using namespace std;
+
+int n;
+map<string, vector<string> > mp;
+vector<string> tmp;
+set<string> sol;
+
+int main() {
+	cin >> n;
+
+	string name, cur;
+	int ent;
+	for(int i = 0; i < n; ++i) {
+		cin >> name >> ent;
+		for(int j = 0; j < ent; ++j) {
+			cin >> cur;
+			mp[name].push_back(cur);
+		}
+	}
+
+	cout << mp.size() << endl;
+	for(map<string, vector<string> >::iterator it = mp.begin(); it != mp.end(); ++it) {
+		tmp.clear();
+		tmp = it->second;
+
+		sort(tmp.begin(), tmp.end());
+		tmp.resize(unique(tmp.begin(), tmp.end()) - tmp.begin());
+
+		sol.clear();
+		for(int i = 0; i < (int)tmp.size(); ++i) {
+			bool ok = true;
+			for(int j = 0; j < (int)tmp.size(); ++j) {
+				if(i != j) {
+					if(tmp[i] == tmp[j])
+						break;
+					if(tmp[j].size() > tmp[i].size()) {
+						bool ok1 = true;
+						for(int k = tmp[j].size() - 1, l = tmp[i].size() - 1; l >= 0; --k, --l) {
+							if(tmp[j][k] != tmp[i][l]) {
+								ok1 = false;
+								break;
+							}
+						}
+						if(ok1) {
+							ok = false;
+							break;
+						}
+					}
+				}
+			}
+			if(ok)
+				sol.insert(tmp[i]);
+		}
+
+		cout << it->first << ' ' << sol.size();
+		for(set<string>::iterator it = sol.begin(); it != sol.end(); ++it)
+			cout << ' ' << *it;
+		cout << endl;
+	}
+
+	return 0;
+}

CodeForces/898E. Squares and not squares.cpp

@@ -0,0 +1,76 @@
+#include <bits/stdc++.h>
+
+typedef long long ll;
+
+using namespace std;
+
+long long const N = 3e5 + 1;
+long long n, a[N], mn[N], sqrs[32001], cnt = 0;
+bool vis[N];
+
+int main() {
+	for(int i = 0; i < 32001; ++i)
+		sqrs[i] = i * i;
+
+	scanf("%lld", &n);
+	for(int i = 0; i < n; ++i) {
+		scanf("%lld", a + i);
+		if(binary_search(sqrs, sqrs + 32001, a[i])) {
+			vis[i] = true;
+			++cnt;
+		}
+	}
+
+	if(cnt == n / 2) {
+		puts("0");
+		return 0;
+	}
+
+	for(int i = 0, idx; i < n; ++i) {
+		idx = lower_bound(sqrs, sqrs + 32001, a[i]) - sqrs;
+		if(idx < 32001 && sqrs[idx] == a[i])
+			mn[i] = 0;
+		else {
+			long long after = 2e16, before = 2e16;
+			if(idx < 32001)
+				after = abs(sqrs[idx] - a[i]);
+
+			if(idx - 1 >= 0)
+				before = abs(a[i] - sqrs[idx - 1]);
+
+			mn[i] = min(after, before);
+		}
+	}
+
+	long long sol = 0;
+
+	if(cnt > n / 2) {
+		cnt -= (n / 2);
+		for(int i = 0; cnt > 0 && i < n; ++i) {
+			if(vis[i] && a[i] != 0) {
+				++sol;
+				--cnt;
+			}
+		}
+
+		for(int i = 0; cnt > 0 && i < n; ++i) {
+			if(vis[i] && a[i] == 0) {
+				sol += 2;
+				--cnt;
+			}
+		}
+
+		printf("%lld\n", sol);
+		return 0;
+	}
+
+	sort(mn, mn + n);
+
+	for(int i = 0; i < n / 2; ++i)
+		sol += mn[i];
+
+	printf("%lld\n", sol);
+
+	return 0;
+}
+

CodeForces/README.md

@@ -316,3 +316,7 @@
 - [864C. Bus](http://codeforces.com/contest/864/problem/C)
 - [890A. ACM ICPC](http://codeforces.com/contest/890/problem/A)
 - [890B. Vlad and Cafes](http://codeforces.com/contest/890/problem/B)
+- [898A. Rounding](http://codeforces.com/contest/898/problem/A)
+- [898B. Proper Nutrition](http://codeforces.com/contest/898/problem/B)
+- [898C. Phone Numbers](http://codeforces.com/contest/898/problem/C)
+- [898E. Squares and not squares](http://codeforces.com/contest/898/problem/E)