2448

Author: JooHui-void

2250.cpp

@@ -1,28 +1,80 @@
 #include <stdio.h>
 #include <vector>
+#include <queue>
+
 using namespace std;
-vector<int> v;
+int pos[10001];
 int node[10001][2];
+int cnt;
+int root;
+int check[10001];
+queue<pair<int, int> > q;
 void preOrder(int num) {
-	if(node[num][0]!=-1){
+	if (node[num][0] != -1) {
 		preOrder(node[num][0]);
 	}
-	v.push_back(num);
+	pos[num] = ++cnt;
 	if (node[num][1] != -1) {
 		preOrder(node[num][1]);
 	}
 }
 
 
 int main() {
-	int num,tmp;
+	int num, tmp;
 	scanf("%d ", &num);
 	for (int i = 0; i < num; i++) {
 		scanf("%d", &tmp);
-		scanf("%d %d", node[tmp][0], &node[tmp][1]);
+		scanf("%d %d", &node[tmp][0], &node[tmp][1]);
+		if (node[tmp][1] != -1) {
+			check[node[tmp][1]]++;
+		}
+		if (node[tmp][0] != -1) {
+			check[node[tmp][0]]++;
+		}
+	}
+
+	for (int i = 1; i <= num; i++) {
+		if (check[i] == 0) {
+			root = i;
+			break;
+		}
+	}
+	preOrder(root);
+	q.push(make_pair(root, 1));
+	int level = 1;
+	int start = 1, end = 1;
+	int Max = 0, Maxlevel = 0;
+	while (!q.empty()) {
+
+		if (node[q.front().first][0] != -1) {
+			q.push(make_pair(node[q.front().first][0], q.front().second + 1));
+		}
+		if (node[q.front().first][1] != -1) {
+			q.push(make_pair(node[q.front().first][1], q.front().second + 1));
+		}
+
+		if (level != q.front().second) {
+			int mid = pos[end] - pos[start] + 1;
+			/*printf("%d:%d\n", level, mid);*/
+			if (Max < mid) {
+				Max = mid;
+				Maxlevel = level;
+			}
+			start = q.front().first;
+			end = q.front().second;
+			level++;
+		}
+		else {
+			end = q.front().first;
+		}
+		q.pop();
 	}
-	preOrder(1);
-	for (int i = 0; i < v.size(); i++) {
-		printf("%d ", v[i]);
+	int mid = pos[end] - pos[start] + 1;
+	/*printf("%d:%d\n", level, mid);*/
+	if (Max < mid) {
+		Max = mid;
+		Maxlevel = level;
 	}
+	printf("%d %d", Maxlevel, Max);
 }

2448.cpp

@@ -0,0 +1,37 @@
+#include <stdio.h>
+char map[3072 +1][3072 * 2+1];
+
+void divide(int x, int y, int size) {
+	if (size == 3) {
+		map[x][y] = 1;
+		map[x + 1][y - 1] = 1;
+		map[x + 1][y + 1] = 1;
+		for (int i = y - 2; i <= y + 2; i++) {
+			map[x + 2][i] = 1;
+		}
+	}
+	else {
+		/*printf("1");*/
+		divide(x, y, size / 2);
+		divide(x + size / 2, y + size / 2, size / 2);
+		divide(x + size / 2, y - size / 2, size / 2);
+	}
+}
+int main() {
+	int num;
+	scanf("%d", &num);
+
+	divide(0, num, num);
+
+	for (int i = 0; i < num ; i++) {
+		for (int j = 1; j < num * 2; j++) {
+			if (map[i][j] == 1) {
+				printf("*");
+			}
+			else {
+				printf(" ");
+			}
+		}
+		printf("\n");
+	}
+}

2904.cpp

@@ -1,78 +1,38 @@
 #include <stdio.h>
-#include <vector>
-using namespace std;
-vector<int> v;
-int cnt[1000000];
-int prime[1000000];
-void make() {
-	for (int i = 2; i <= 1000000; i++) {
-		if (prime[i] == 0) {
-			v.push_back(i);
+#define Size 3072 * 2;
+char map[Size][Size];
+
+void divide(int x,int y, int size) {
+	if (size == 3) {
+		map[x][y] = 1;
+		map[x + 1][y - 1] = 1;
+		map[x + 1][y + 1] = 1;
+		for (int i = y - 2; i <= y + 2; i++) {
+			map[x + 2][i] = 1;
 		}
 	}
-}
-void makePrime() {
-	for (int i = 2; i < 1000000; i++) {
-		if (prime[i] == 0) {
-			int n = 2;
-			int tmp = i*n;
-			while (tmp <=1000000) {
-				prime[tmp] = 1;
-				n++;
-				tmp = i * n;
-			}
-		}
+	else {
+		/*printf("1");*/
+		divide(x, y, size / 2);
+		divide(x + size / 2, y + size / 2, size / 2);
+		divide(x + size / 2, y - size / 2, size / 2);
 	}
 }
-int primeSum[1000000]={0,};
-int primeSave[100][1000000];
 int main() {
 	int num;
 	scanf("%d", &num);
-	makePrime();
-	int tmp;
-	make();
-	primeSum[0] = 0;
-	for (int i = 0; i < num; i++) {
-		scanf("%d", &tmp);
-		int pos = 0;
-		
-		while (tmp != 1) {
-			if (tmp % v[pos] == 0) {
-				tmp = tmp / v[pos];
-				primeSave[i][pos]++;
-				primeSum[pos]++;
-				
+	
+	divide(0, num ,num);
+	
+	for (int i = 0; i < num * 2; i++) {
+		for (int j = 0; j < num * 2; j++) {
+			if (map[i][j] == 1) {
+				printf("*");
 			}
 			else {
-				pos++;
-			}
-		}
-		/*for (int j = 0; j < 10; j++) {
-			printf("%d ", primeSave[i][j]);
-		}
-		printf("\n");*/
-	}
-
-	/*for (int j = 0; j < 10; j++) {
-		printf("%d ", primeSum[j]);
-	}
-	printf("\n");*/
-
-	int count = 0;
-	int Max = 1;
-	for (int i = 0; i < 1001; i++) {
-		for (int j = 0; j < primeSum[i]/num; j++) {
-			Max = Max * v[i];
-		}
-	}
-	printf("%d ", Max);
-	for (int i = 0; i < num; i++) {
-		for (int j = 0; j < 1001; j++) {
-			if (primeSave[i][j] < primeSum[j] / num) {
-				count += primeSum[j] / num - primeSave[i][j];
+				printf(" ");
 			}
 		}
+		printf("\n");
 	}
-	printf("%d", count);
 }