add 3 new hdu file

Author: AmazingCaddy

HDU/hdu_1128.cpp

@@ -0,0 +1,41 @@
+/*
+ *	time:	2013-12-18 19:51
+ *	author:	AmazingCaddy
+ *	solve:	make a answer table
+ */
+#include <iostream>
+#include <cstdio>
+#include <algorithm>
+#include <cmath>
+#include <cstdlib>
+using namespace std;
+
+const int maxn = 1000000 + 200;
+
+int vis[maxn];
+
+int get_solve(int n) {
+	int sum = n;
+	while (n) {
+		sum += n % 10;
+		n /= 10;
+	}
+	return sum;
+}
+
+void init() {
+	memset(vis, 0, sizeof(vis));
+	for (int i = 0; i <= 1000000; i ++) {
+		vis[get_solve(i)] = 1;
+	}
+}
+
+int main (int argc, char *argv[]) {
+	init();
+	for (int i = 0; i <= 1000000; i ++) {
+		if (!vis[i]) {
+			printf ("%d\n", i);
+		}
+	}
+	return 0;
+}

HDU/hdu_1215.cpp

@@ -0,0 +1,35 @@
+/*
+ *	time:	2013-12-18 20:10
+ *	author:	AmazingCaddy
+ *	solve:	make a answer table
+ */
+#include <iostream>
+#include <cstdio>
+#include <algorithm>
+#include <cmath>
+#include <cstdlib>
+using namespace std;
+
+const int maxn = 500000 + 200;
+
+int dp[maxn];
+
+void fac(int n) {
+	memset( dp, 0, sizeof( dp ) );
+	for( int i = 1; i < n; ++i ) {
+		for( int j = i; j < n; j += i ) {
+			dp[ j ] += i;
+		}
+	}
+}
+
+int main (int argc, char *argv[]) {
+	int cas, n;
+	fac(maxn);
+	scanf ("%d", &cas);
+	for (int t = 1; t <= cas; t ++){
+		scanf ("%d", &n);
+		printf("%d\n", dp[n] - n);
+	}
+	return 0;
+}

HDU/hdu_2104.cpp

@@ -0,0 +1,27 @@
+/*
+ *	time:	2013-12-18 20:44
+ *	author:	AmazingCaddy
+ *	solve:	gcd
+ */
+#include <iostream>
+#include <cstdio>
+#include <algorithm>
+#include <cmath>
+#include <cstdlib>
+using namespace std;
+
+int gcd(int a, int b) {
+	return b ? gcd(b, a % b) : a;
+}
+
+int main (int argc, char *argv[]) {
+	int n, m;
+	while (scanf ("%d%d", &n, &m) && n != -1 && m != -1) {
+		if (gcd(n, m) == 1) {
+			printf ("YES\n");
+		} else {
+			printf ("POOR Haha\n");
+		}
+	}
+	return 0;
+}