♻️ Beautify the code

Author: even-wei

100.cpp

@@ -4,55 +4,61 @@ using namespace std;
 
 int cnt[1000000];
 
-int val (int x) {
-	int tmpI, sum;
-
-	if (cnt[x] < 0) {
-		sum = 0;
-		tmpI = x;
-
-		while (tmpI > 1) {
-			if (tmpI % 2) {
-				sum += 2;
-				tmpI += (tmpI + 1) / 2;
-			} else {
-				sum ++;
-				tmpI /= 2;
-			}
-			if (tmpI < 1000000) {
-				sum += val(tmpI);
-				tmpI = 1;
-			}
-		}
-
-		cnt[x] = sum;
-		return sum;
-	} else
-		return cnt[x];	
+int val(int x)
+{
+    int tmpI, sum;
+
+    if (cnt[x] < 0) {
+        sum  = 0;
+        tmpI = x;
+
+        while (tmpI > 1) {
+            if (tmpI % 2) {
+                sum += 2;
+                tmpI += (tmpI + 1) / 2;
+            }
+            else {
+                sum++;
+                tmpI /= 2;
+            }
+            if (tmpI < 1000000) {
+                sum += val(tmpI);
+                tmpI = 1;
+            }
+        }
+
+        cnt[x] = sum;
+        return sum;
+    }
+    else
+        return cnt[x];
 }
 
-int main (void) {
-	int oL, oR, L, R, max, curr, i;
-	
-	cnt[1] = 1;
-	cnt[2] = 2;
-	for (i = 3; i < 1000000; ++i) cnt[i] = -1;
-
-	while (scanf("%d %d", &oL, &oR) != EOF) {
-		max = 0;
-		if (oL > oR) {
-			L = oR;
-			R = oL;
-		} else {
-			L = oL;
-			R = oR;
-		}
-		for (i = L; i <= R; ++i) {
-			curr = val(i);
-			if (max < curr) max = curr;
-		}
-		printf("%d %d %d\n", oL, oR, max);
-	}
-
-	return 0;
+int main(void)
+{
+    int oL, oR, L, R, max, curr, i;
+
+    cnt[1] = 1;
+    cnt[2] = 2;
+    for (i = 3; i < 1000000; ++i)
+        cnt[i] = -1;
+
+    while (scanf("%d %d", &oL, &oR) != EOF) {
+        max = 0;
+        if (oL > oR) {
+            L = oR;
+            R = oL;
+        }
+        else {
+            L = oL;
+            R = oR;
+        }
+        for (i = L; i <= R; ++i) {
+            curr = val(i);
+            if (max < curr) max = curr;
+        }
+        printf("%d %d %d\n", oL, oR, max);
+    }
+
+    return 0;
 }

10000.cpp

@@ -4,56 +4,58 @@
 using namespace std;
 
 struct node {
-	int l, v[101];
+    int l, v[101];
 };
 
-int main (void) {
-	bool table[101];
-	int n, s, i, j, u, v, max[101], queue[101], rear, lenQ, index;
-	node list[101];
-	
-	index = 0;
-	while (true) {
-		scanf("%d", &n);
-		if (!n) break;
-
-		for (i = 0; i <= n; ++i) list[i].l = 0;
-		memset(max, 0, sizeof(int) * (n + 1));
-		memset(table, true, sizeof(bool) * (n + 1));
-		scanf("%d", &s);
-		while (true) {
-			scanf("%d %d", &u, &v);
-			if (!u && !v) break;
-			list[u].v[list[u].l++] = v;
-		}
-
-		queue[0] = s;
-		rear = 0;
-		lenQ = 1;
-		while (lenQ) {
-			u = queue[rear];
-			table[u] = true;
-			rear = (rear + 1) % 100;
-			lenQ --;
-			for (i = 0; i < list[u].l; ++i) {
-				v = list[u].v[i];
-				if (max[v] < max[u] + 1) {
-					max[v] = max[u] + 1;
-					if (table[v]) {
-						table[v] = false;
-						queue[(rear + lenQ) % 100] = v;
-						lenQ ++;
-					}
-				}
-			}
-		}
-
-		u = 1;
-		for (i = 2; i <= n; ++i)
-		if (max[i] > max[u]) u = i;
-
-		printf("Case %d: The longest path from %d has length %d, finishing at %d.\n\n", ++index, s, max[u], u);
-	}
-
-	return 0;
+int main(void)
+{
+    bool table[101];
+    int  n, s, i, j, u, v, max[101], queue[101], rear, lenQ, index;
+    node list[101];
+
+    index = 0;
+    while (true) {
+        scanf("%d", &n);
+        if (!n) break;
+
+        for (i = 0; i <= n; ++i)
+            list[i].l = 0;
+        memset(max, 0, sizeof(int) * (n + 1));
+        memset(table, true, sizeof(bool) * (n + 1));
+        scanf("%d", &s);
+        while (true) {
+            scanf("%d %d", &u, &v);
+            if (!u && !v) break;
+            list[u].v[list[u].l++] = v;
+        }
+
+        queue[0] = s;
+        rear     = 0;
+        lenQ     = 1;
+        while (lenQ) {
+            u        = queue[rear];
+            table[u] = true;
+            rear     = (rear + 1) % 100;
+            lenQ--;
+            for (i = 0; i < list[u].l; ++i) {
+                v = list[u].v[i];
+                if (max[v] < max[u] + 1) {
+                    max[v] = max[u] + 1;
+                    if (table[v]) {
+                        table[v]                   = false;
+                        queue[(rear + lenQ) % 100] = v;
+                        lenQ++;
+                    }
+                }
+            }
+        }
+
+        u = 1;
+        for (i = 2; i <= n; ++i)
+            if (max[i] > max[u]) u = i;
+
+        printf("Case %d: The longest path from %d has length %d, finishing at %d.\n\n", ++index, s, max[u], u);
+    }
+
+    return 0;
 }

10003.cpp

@@ -1,40 +1,44 @@
-#include <cstdio>
 #include <algorithm>
+#include <cstdio>
 
 using namespace std;
 
 int cut[55], dp[55][55];
 
-int find (int beg, int end) {
-	int i, sum;
+int find(int beg, int end)
+{
+    int i, sum;
 
-	if (dp[beg][end] == -1) {
-		sum = min(find(beg + 1, end), find(beg, end - 1));
-		for (i = beg + 1; i < end; ++i)
-			sum = min(sum, find(beg, i - 1) + find(i + 1, end));
-		dp[beg][end] = sum + cut[end + 1] - cut[beg - 1];
-	}
+    if (dp[beg][end] == -1) {
+        sum = min(find(beg + 1, end), find(beg, end - 1));
+        for (i = beg + 1; i < end; ++i)
+            sum = min(sum, find(beg, i - 1) + find(i + 1, end));
+        dp[beg][end] = sum + cut[end + 1] - cut[beg - 1];
+    }
 
-	return dp[beg][end];
+    return dp[beg][end];
 }
 
-int main (void) {
-	int len, n, i, j;
+int main(void)
+{
+    int len, n, i, j;
 
-	while (scanf("%d", &len) != EOF) {
-		if (len < 1) break;
+    while (scanf("%d", &len) != EOF) {
+        if (len < 1) break;
 
-		scanf("%d", &n);
-		cut[0] = 0;
-		cut[n + 1] = len;
-		for (i = 1; i <= n; ++i) scanf("%d", cut + i);
-		for (i = 1; i <= n; ++i) {
-			for (j = 1; j <= n; ++j) dp[i][j] = -1; 
-			dp[i][i] = cut[i + 1] - cut[i - 1];
-		}
+        scanf("%d", &n);
+        cut[0]     = 0;
+        cut[n + 1] = len;
+        for (i = 1; i <= n; ++i)
+            scanf("%d", cut + i);
+        for (i = 1; i <= n; ++i) {
+            for (j = 1; j <= n; ++j)
+                dp[i][j] = -1;
+            dp[i][i] = cut[i + 1] - cut[i - 1];
+        }
 
-		printf("The minimum cutting is %d.\n", find(1, n));
-	}
+        printf("The minimum cutting is %d.\n", find(1, n));
+    }
 
-	return 0;
+    return 0;
 }