-

AdvancedLevel_C++/1019. General Palindromic Number (20).cpp

@@ -1,27 +1,27 @@
 #include <cstdio>
 using namespace std;
 int main() {
-	int a, b;
-	scanf("%d %d", &a, &b);
-	int arr[40], index = 0;
-	while(a != 0) {
-		arr[index++] = a % b;
-		a = a / b;
-	}
-	int flag = 0;
-	for(int i = 0; i < index / 2; i++) {
-		if(arr[i] != arr[index-i-1]) {
-			printf("No\n");
-			flag = 1;
-			break;
-		}
-	}
-	if(!flag) printf("Yes\n");
-	for(int i = index - 1; i >= 0; i--) {
-		printf("%d", arr[i]);
-		if(i != 0) printf(" ");
-	}
-	if(index == 0)
-		printf("0");
-	return 0;
+    int a, b;
+    scanf("%d %d", &a, &b);
+    int arr[40], index = 0;
+    while(a != 0) {
+        arr[index++] = a % b;
+        a = a / b;
+    }
+    int flag = 0;
+    for(int i = 0; i < index / 2; i++) {
+        if(arr[i] != arr[index-i-1]) {
+            printf("No\n");
+            flag = 1;
+            break;
+        }
+    }
+    if(!flag) printf("Yes\n");
+    for(int i = index - 1; i >= 0; i--) {
+        printf("%d", arr[i]);
+        if(i != 0) printf(" ");
+    }
+    if(index == 0)
+        printf("0");
+    return 0;
 }

AdvancedLevel_C++/1055. The World's Richest (25) .cpp

@@ -15,7 +15,6 @@ int cmp1(node a, node b) {
     else
         return (strcmp(a.name, b.name) < 0);
 }
-
 int main() {
     int n, k, num, amin, amax;
     scanf("%d %d", &n, &k);

AdvancedLevel_C++/1076. Forwards on Weibo (30) .cpp

@@ -29,7 +29,6 @@ int bfs(node tnode) {
     }
     return cnt;
 }
-
 int main() {
     scanf("%d %d", &n, &l);
     v.resize(n + 1);

AdvancedLevel_C++/1080. Graduate Admission (30) .cpp

@@ -11,7 +11,7 @@ bool cmp(peo& a, peo& b) {
     return a.ge > b.ge;
 }
 bool cmp2(peo& a, peo& b) {
-  return a.id < b.id;
+    return a.id < b.id;
 }
 int main(){
     int n, m, k, quota[110], cnt[110] = {0};

BasicLevel_C++/1025. 反转链表 (25).cpp

@@ -1,23 +1,23 @@
 #include <iostream>
 #include <algorithm>
 using namespace std;
+int Data[100005], Next[100005], list[100005];
 int main() {
     int first, k, n, temp;
     cin >> first >> n >> k;
-    int data[100005], next[100005], list[100005];
     for (int i = 0; i < n; i++) {
         cin >> temp;
-        cin >> data[temp] >> next[temp];
+        cin >> Data[temp] >> Next[temp];
     }
-    int sum = 0;//不一定所有的输入的结点都是有用的，加个计数器
+    int sum = 0;//不⼀定所有的输⼊的结点都是有⽤的，加个计数器
     while (first != -1) {
         list[sum++] = first;
-        first = next[first];
+        first = Next[first];
     }
     for (int i = 0; i < (sum - sum % k); i += k)
         reverse(begin(list) + i, begin(list) + i + k);
     for (int i = 0; i < sum - 1; i++)
-        printf("%05d %d %05d\n", list[i], data[list[i]], list[i + 1]);
-    printf("%05d %d -1", list[sum - 1], data[list[sum - 1]]);
+        printf("%05d %d %05d\n", list[i], Data[list[i]], list[i + 1]);
+    printf("%05d %d -1\n", list[sum - 1], Data[list[sum - 1]]);
     return 0;
 }

BasicLevel_C++/1033. 旧键盘打字(20).cpp

@@ -2,13 +2,13 @@
 #include <cctype>
 using namespace std;
 int main() {
-  string bad, should;
-  getline(cin, bad);
-  getline(cin, should);
-  for (int i = 0, length = should.length(); i < length; i++) {
-    if (bad.find(toupper(should[i])) != string::npos) continue;
-    if (isupper(should[i]) && bad.find('+') != string::npos) continue;
-    cout << should[i];
-  }
-  return 0;
+    string bad, should;
+    getline(cin, bad);
+    getline(cin, should);
+    for (int i = 0, length = should.length(); i < length; i++) {
+        if (bad.find(toupper(should[i])) != string::npos) continue;
+        if (isupper(should[i]) && bad.find('+') != string::npos) continue;
+        cout << should[i];
+    }
+    return 0;
 }