feat: 优化田地丈量算法，改用C风格输入输出并调整数据类型

Author: ttkqwe123

CCF-CSP/CSP201509A. 数列分段.cpp

@@ -0,0 +1,29 @@
+/*
+ * @Author: tkzzzzzz6
+ * @Date: 2026-05-28 18:07:24
+ * @LastEditors: tkzzzzzz6
+ * @LastEditTime: 2026-05-28 18:12:42
+ */
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cout.tie(0);
+
+    int n;
+    cin >> n;
+    int a = -1, b = -1;
+    int res = 0;
+    for (int i = 0; i < n; ++i) {
+        cin >> b;
+        if (b != a) ++res;
+        a = b;
+    }
+
+    cout << res << '\n';
+
+    return 0;
+}

CCF-CSP/CSP201509B. 日期计算.cpp

@@ -0,0 +1,34 @@
+/*
+ * @Author: tkzzzzzz6
+ * @Date: 2026-05-28 18:36:54
+ * @LastEditors: tkzzzzzz6
+ * @LastEditTime: 2026-05-28 18:44:04
+ */
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cout.tie(0);
+
+    int y, m, d;
+    cin >> y;
+    cin >> d;
+    m = 1;
+
+    bool isLeap = (y % 4 == 0 && y % 100 != 0) || (y % 400 == 0);
+
+    int month[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+    if (isLeap) month[2] = 29;
+    while (d > month[m]) { // when d == month[m] still in month m
+        d -= month[m];
+        ++m;
+    }
+
+    cout << m << '\n';
+    cout << d;
+
+    return 0;
+}

CCF-CSP/CSP2023-田地丈量.cpp

@@ -2,31 +2,30 @@
  * @Author: tkzzzzzz6
  * @Date: 2026-05-28 08:06:15
  * @LastEditors: tkzzzzzz6
- * @LastEditTime: 2026-05-28 13:10:13
+ * @LastEditTime: 2026-05-28 17:53:50
  */
-#include <iostream>
+#include <cstdio>
 #include <algorithm>
 
 using namespace std;
 
 int main() {
-    ios::sync_with_stdio(0);
-    cin.tie(0);
-
-    long long n, a, b;
-    long long ans = 0;
-    cin >> n >> a >> b;
+    int n;
+    int a, b;
+    scanf("%d%d%d", &n, &a, &b);
 
+    int ans = 0;
     for (int i = 0; i < n; ++i) {
-        long long x1, y1, x2, y2;
-        cin >> x1 >> y1 >> x2 >> y2;
-        long long xl = max(0LL, x1), yl = max(0LL, y1);
-        long long xr = min(a, x2), yr = min(b, y2);
+        int x1, y1, x2, y2;
+        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
+
+        int xl = max(0, x1), yl = max(0, y1);
+        int xr = min(a, x2), yr = min(b, y2);
 
         if (xl < xr && yl < yr)
             ans += (xr - xl) * (yr - yl);
     }
 
-    cout << ans << '\n';
+    printf("%d\n", ans);
     return 0;
 }