[#10] Add abc200

Author: zeikar

ABC_200_A.cpp

@@ -0,0 +1,9 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+int main() {
+	double n;
+	cin >> n;
+	cout << (int)ceil(n/100) << endl;
+}

ABC_200_B.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	long long n, k;
+	cin >> n >> k;
+
+	while (k--)
+	{
+		if (n % 200 == 0)
+		{
+			n /= 200;
+		}
+		else
+		{
+			n *= 1000;
+			n += 200;
+		}
+	}
+
+	cout << n << endl;
+}

ABC_200_C.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+using namespace std;
+
+long long cnt[200];
+
+int main() {
+	int n;
+	cin >> n;
+
+	for (int i = 0; i < n; i++)
+	{
+		int a;
+		cin >> a;
+
+		cnt[a % 200]++;
+	}
+
+	long long result = 0;
+	for (int i = 0; i < 200; i++)
+	{
+		result += (cnt[i] * (cnt[i] - 1)) / 2;
+	}
+	cout << result << endl;
+}

ABC_200_D.cpp

@@ -0,0 +1,58 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int n;
+int a[200];
+vector<int> remains[200];
+
+int main() {
+	cin >> n;
+
+	for (int i = 0; i < n; i++)
+	{
+		cin >> a[i];
+		a[i] %= 200;
+	}
+
+	vector<int> b[200];
+
+	for (int i = 1; i <= (1 << min(8, n)); i++)
+	{
+		vector<int> temp;
+		long long tempSum = 0;
+
+		for (int j = 0; j < min(n, 8); j++)
+		{
+			if (i & (1 << j))
+			{
+				temp.push_back(j + 1);
+				tempSum = (tempSum + a[j]) % 200;
+			}
+		}
+
+		if (b[tempSum].size() == 0)
+		{
+			b[tempSum] = temp;
+		}
+		else
+		{
+			cout << "Yes" << endl;
+			cout << b[tempSum].size() << ' ';
+			for (int i = 0; i < b[tempSum].size(); i++)
+			{
+				cout << b[tempSum][i] << ' ';
+			}
+			cout << endl;
+			cout << temp.size() << ' ';
+			for (int i = 0; i < temp.size(); i++)
+			{
+				cout << temp[i] << ' ';
+			}
+			cout << endl;
+			return 0;
+		}
+	}
+
+	cout << "No" << endl;
+}