🎨 style: improve format of the code

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

@@ -1,4 +1,4 @@
-#include <iostream>
+#include <cstdio>
 using namespace std;
 int main() {
 	int a, b;

AdvancedLevel_C++/1027. Colors in Mars (20).cpp

@@ -1,4 +1,4 @@
-#include <iostream>
+#include <cstdio>
 using namespace std;
 int main() {
     char c[14] = {"0123456789ABC"};

AdvancedLevel_C++/1104. Sum of Number Segments (20).cpp

@@ -3,11 +3,10 @@ using namespace std;
 int main() {
     int n;
     cin >> n;
-    double a[100001];
-    double sum = 0.0;
-    for (int i = 1; i <= n; i++) {
-        cin >> a[i];
-        sum = sum + a[i] * i * (n - i + 1);
+    double sum = 0.0, temp;
+    for (int i = 1; i <= n; i++) { 
+        cin >> temp;
+        sum = sum + temp * i * (n - i + 1);
     }
     printf("%.2f", sum);
     return 0;

AdvancedLevel_C++/1109. Group Photo (25).cpp

@@ -1,40 +1,44 @@
 #include <iostream>
-#include <vector>
 #include <algorithm>
+#include <vector>
 using namespace std;
 struct node {
     string name;
     int height;
 };
-int cmp(node a, node b) {
+int cmp(struct node a, struct node b) {
     return a.height != b.height ? a.height > b.height : a.name < b.name;
 }
 int main() {
-    int n, k, m, i, j;
+    int n, k, m;
     cin >> n >> k;
     vector<node> stu(n);
-    for(i = 0; i < n; i++)
-        cin >> stu[i].name >> stu[i].height;
+    for(int i = 0; i < n; i++) {
+        cin >> stu[i].name;
+        cin >> stu[i].height;
+    }
     sort(stu.begin(), stu.end(), cmp);
     int t = 0, row = k;
     while(row) {
-        if(row == k)
+        if(row == k) {
             m = n - n / k * (k - 1);
-        else
+        } else {
             m = n / k;
-        vector<string> stemp(m);
-        stemp[m / 2] = stu[t].name;
+        }
+        vector<string> ans(m);
+        ans[m / 2] = stu[t].name;
         // 左边一列
-        j = m / 2 - 1;
-        for(i = t + 1; i < t + m; i = i + 2)
-            stemp[j--] = stu[i].name;
+        int j = m / 2 - 1;
+        for(int i = t + 1; i < t + m; i = i + 2)
+            ans[j--] = stu[i].name;
         // 右边一列
         j = m / 2 + 1;
-        for(i = t + 2; i < t + m; i = i + 2)
-            stemp[j++] = stu[i].name;
+        for(int i = t + 2; i < t + m; i = i + 2)
+            ans[j++] = stu[i].name;
         // 输出当前排
-        cout << stemp[0];
-        for(i = 1; i < m; i++) cout << " " << stemp[i];
+        cout << ans[0];
+        for(int i = 1; i < m; i++)
+            cout << " " << ans[i];
         cout << endl;
         t = t + m;
         row--;

AdvancedLevel_C++/1113. Integer Set Partition (25) .cpp

@@ -1,4 +1,4 @@
-#include <cstdio>
+#include <iostream>
 #include <algorithm>
 #include <vector>
 using namespace std;

AdvancedLevel_C++/1148. Werewolf - Simple Version (20).cpp

@@ -1,6 +1,6 @@
 #include <iostream>
-#include <cmath>
 #include <vector>
+#include <cmath>
 using namespace std;
 int main() {
     int n;
@@ -21,4 +21,4 @@ int main() {
     }
     cout << "No Solution";
     return 0;
-}
+}

BasicLevel_C++/1022. D进制的A+B (20).cpp

@@ -14,8 +14,7 @@ int main() {
         s[i++] = t % d;
         t = t / d;
     }
-    for (int j = i - 1; j >= 0; j--) {
+    for (int j = i - 1; j >= 0; j--)
         cout << s[j];
-    }
     return 0;
 }

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

@@ -3,7 +3,7 @@
 using namespace std;
 int main() {
   string bad, should;
-  getline(cin, bad);  //为了防止第一行是空的，不能用cin >> ,用getline(cin, ...)
+  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;

BasicLevel_C++/1050. 螺旋矩阵(25).cpp

@@ -1,44 +1,33 @@
-#include <cmath>
-#include <vector>
 #include <iostream>
 #include <algorithm>
+#include <cmath>
+#include <vector>
 using namespace std;
-int func(int N) {
-    int i = sqrt((double)N);
-    while(i >= 1) {
-        if(N % i == 0)
-            return i;
-        i--;
-    }
-    return 1;
-}
-
 int cmp(int a, int b) {return a > b;}
-
 int main() {
     int N, m, n, t = 0;
     scanf("%d", &N);
-    n = func(N);
-    m = N / n;
+    for (n = sqrt((double)N); n >= 1; n--) {
+        if (N % n == 0) {
+            m = N / n;
+            break;
+        }
+    }
     vector<int> a(N);
     for (int i = 0; i < N; i++)
         scanf("%d", &a[i]);
     sort(a.begin(), a.end(), cmp);
     vector<vector<int> > b(m, vector<int>(n));
     int level = m / 2 + m % 2;
     for (int i = 0; i < level; i++) {
-        for (int j = i; j <= n - 1 - i && t <= N - 1; j++) {
-            b[i][j] = a[t++];
-        }
-        for (int j = i + 1; j <= m - 2 - i && t <= N - 1; j++) {
-            b[j][n - 1 - i] = a[t++];
-        }
-        for (int j = n - i - 1; j >= i && t <= N - 1; j--) {
-            b[m - 1 - i][j] = a[t++];
-        }
-        for (int j = m - 2 - i; j >= i + 1 && t <= N - 1; j--) {
-            b[j][i] = a[t++];
-        }
+        for (int j = i; j <= n - 1 - i && t <= N - 1; j++)
+                b[i][j] = a[t++];
+        for (int j = i + 1; j <= m - 2 - i && t <= N - 1; j++)
+                b[j][n - 1 - i] = a[t++];
+        for (int j = n - i - 1; j >= i && t <= N - 1; j--)
+                b[m - 1 - i][j] = a[t++];
+        for (int j = m - 2 - i; j >= i + 1 && t <= N - 1; j--)
+                b[j][i] = a[t++];
     }
     for (int i = 0; i < m; i++) {
         for (int j = 0 ; j < n; j++) {