[#5] Add AtCoder Beginner Contest 180 codes

Author: zeikar

ABC_180_A.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+#include <string>
+#include <map>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+int main() {
+	int n, a, b;
+	cin >> n >> a >> b;
+
+	cout << n - a + b << endl;
+}

ABC_180_B.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <string>
+#include <map>
+#include <vector>
+#include <iomanip>
+#include <algorithm>
+#include <cmath>
+using namespace std;
+
+int main() {
+	int n;
+	long double a = 0, b = 0, c = 0;
+
+	cin >> n;
+
+	while (n--)
+	{
+		long double x;
+		cin >> x;
+
+		a += abs(x);
+		b += x * x;
+		c = max(c, abs(x));
+	}
+
+	cout << setprecision(12) << a << '\n' << sqrt(b) << '\n' << c << endl;
+}

ABC_180_C.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <string>
+#include <map>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+int main() {
+	long long n;
+	vector<long long > d;
+
+	cin >> n;
+
+	for (long long i = 1; i * i <= n; i++)
+	{
+		if (n % i == 0)
+		{
+			if (i == n / i)
+			{
+				d.push_back(i);
+
+			}
+			else
+			{
+				d.push_back(i);
+				d.push_back(n / i);
+
+			}
+		}
+	}
+
+	sort(d.begin(), d.end());
+
+	for (int i = 0; i < d.size(); i++)
+	{
+		cout << d[i] << endl;
+	}
+}

ABC_180_D.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <algorithm>
+#include <climits>
+#include <queue>
+using namespace std;
+
+int main()
+{
+	unsigned long long x, y, a, b;
+	unsigned long long ans = 0;
+
+	cin >> x >> y >> a >> b;
+
+	queue< pair<unsigned long long, unsigned  long long> >que;
+
+	que.push(make_pair(x, 0));
+
+	while (!que.empty())
+	{
+		unsigned long long str = que.front().first;
+		unsigned long long exp = que.front().second;
+		que.pop();
+
+		//cout << str << ' ' << exp << endl;
+
+		if (str >= y)
+		{
+			continue;
+		}
+
+		ans = max(ans, exp);
+
+		// overflow
+		if (!(ULLONG_MAX / a < str))
+		{
+			// multiple
+			que.push(make_pair(str * a, exp + 1));
+		}
+
+		// add....
+		unsigned long long c = (y - str) / b;
+		if (c == 0)
+		{
+			que.push(make_pair(str + b, exp + 1));
+		}
+		else if ((y - str) % b == 0 && c > 1) {
+			c--;
+			que.push(make_pair(str + b * c, exp + c));
+		}
+		else
+		{
+			que.push(make_pair(str + b * c, exp + c));
+		}
+	}
+
+	cout << ans << endl;
+}

ABC_180_E.cpp

@@ -0,0 +1,51 @@
+// source code based on https://www.acmicpc.net/problem/2098
+
+#include <iostream>
+#include <algorithm>
+#include <cmath>
+using namespace std;
+
+int dp[17][1 << 18];
+int N;
+int x[17];
+int y[17];
+int z[17];
+
+int TSP(int start, int path)
+{
+	if (dp[start][path] != 0)
+	{
+		return dp[start][path];
+	}
+
+	if (path == 0)
+	{
+		return abs(x[start] - x[0]) + abs(y[start] - y[0]) + max(0, z[0] - z[start]);
+	}
+
+	int ret = 987654321;
+
+	for (int i = 0; i < N; ++i)
+	{
+		if (((1 << i) & path) == 0 || (path ^ (1 << i)) == path)
+		{
+			continue;
+		}
+
+		ret = min(ret, TSP(i, path ^ (1 << i)) + abs(x[start] - x[i]) + abs(y[start] - y[i]) + max(0, z[i] - z[start]));
+	}
+
+	return dp[start][path] = ret;
+}
+
+int main()
+{
+	cin >> N;
+
+	for (int i = 0; i < N; ++i)
+	{
+		cin >> x[i] >> y[i] >> z[i];
+	}
+
+	cout << TSP(0, (1 << N) - 2) << endl;
+}