'commit'

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao14STEMA202301/BC4.cpp

@@ -9,7 +9,7 @@ int main() {
 
     for (int i = 0; i < n; i++)
         for (int j = 0; j < m; j++)
-            cin >> a[i][j];
+            cin >> a[i][j]; // a,b,c
 
     for (int e = 2; e <= min(m, n); e++) {     // 枚举每个小正方形的边长
         for (int i = 0; i <= n - e; i++) {     // 起点i

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao14STEMA202301/ggs.cpp

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+using namespace std;
+const int N = 120;
+int a[N], b[N];
+const int INF = 0x3f3f3f3f;
+int n, sum, avg;
+int main() {
+    cin >> n;
+    for (int i = 0; i < n; i++) {
+        cin >> a[i];
+        sum += a[i];
+        a[i + n] = a[i];
+    }
+    avg = sum / n;
+    int mi = INF;
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n; j++) b[j] = a[i + j];
+        int cnt = 0;
+        for (int j = 0; j < n - 1; j++) {
+            cnt += abs(b[j] - avg);
+            b[j + 1] += b[j] - avg;
+            b[j] = avg;
+        }
+        mi = min(mi, cnt);
+    }
+
+    cout << mi << endl;
+    return 0;
+}

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao14STEMA202301/题目.md

@@ -1 +1,3 @@
-https://ccgao.blog.csdn.net/article/details/134725679
+https://ccgao.blog.csdn.net/article/details/134725679
+
+https://tiku.scratchor.com/paper/view/z8k4y0xsf0ue8xlh

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao14STEMA202303/ggsddu.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+const int N = 31;
+char a[N][N];
+int n, m, cnt;
+
+int main() {
+    cin >> n >> m;
+    for (int i = 0; i < n; i++)
+    for (int j = 0; j < m; j++)
+        cin >> a[i][j];
+    for (int e = 2; e <= min(m, n);e++){
+        for (int i = 0; i <= n - e;i++){
+            for (int j = 0; j <= m - e;j++){
+                bool f = true;
+                for (int x = 0; x < e;x++){
+                    for (int y = 0; y < e;y++){
+                        if(a[i][j]!=a[i+x][j+y]){
+                            f = false;
+                            break;
+                        }
+                    }
+                    if (!f) break;
+                }
+                if (f) cnt++;
+            }
+        }
+    }
+    cout << cnt << endl;
+    return 0;
+}