diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/config.json" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/config.json" deleted file mode 100644 index f6416a1a57a86a638c71ad1c8742a38349a88fe3..0000000000000000000000000000000000000000 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/config.json" +++ /dev/null @@ -1,6 +0,0 @@ -{ - "node_id": "569d5e11c4fc5de7844053d9a733c5e8", - "keywords": [], - "children": [], - "export": [] -} \ No newline at end of file diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/desc.md" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/desc.md" deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.cpp" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.cpp" deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.java" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.java" deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.md" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.md" deleted file mode 100644 index 4cc1a8930eb58a7b89025cb9a24d5facade55b07..0000000000000000000000000000000000000000 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\345\235\227\345\210\206\345\211\262/solution.md" +++ /dev/null @@ -1,33 +0,0 @@ -# 方块分割 - - -## aop -### before -```cpp - -``` -### after -```cpp - -``` - -## 答案 -```cpp - -``` -## 选项 - -### A -```cpp - -``` - -### B -```cpp - -``` - -### C -```cpp - -``` diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.cpp" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.cpp" index 447ac242dc0042aea849e86eade9798be8a60477..3e340e80c69979657bd44477052c2011ede92a82 100644 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.cpp" +++ "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.cpp" @@ -29,12 +29,12 @@ bool check() int main() { for (int i = 0; i <= 9; i++) - a[i] = i; //初始化 + a[i] = i; do { if (check()) - ans++; //如果符合条件则答案加1 + ans++; } while (next_permutation(a, a + 10)); cout << ans; return 0; diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.md" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.md" index 51bc2b59b89b32d76b434f761c9bb20219111e8e..fe45053996bf903704f371992bbbef475d927a8e 100644 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.md" +++ "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\345\241\253\346\225\260/solution.md" @@ -9,30 +9,127 @@ ## aop ### before ```cpp +#include +#include +#include +using namespace std; + +int a[10]; +int ans; ``` ### after ```cpp +int main() +{ + for (int i = 0; i <= 9; i++) + a[i] = i; + do + { + if (check()) + ans++; + } while (next_permutation(a, a + 10)); + cout << ans; + return 0; +} ``` ## 答案 ```cpp - +bool check() +{ + if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1) + return false; + if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1) + return false; + if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1) + return false; + if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1) + return false; + if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1) + return false; + if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1) + return false; + if (abs(a[6] - a[9]) == 1) + return false; + if (abs(a[7] - a[8]) == 1 || abs(a[8] - a[9]) == 1) + return false; + return true; +} ``` ## 选项 ### A ```cpp - +bool check() +{ + if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1) + return false; + if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1) + return false; + if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1) + return false; + if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1) + return false; + if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1) + return false; + if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1) + return false; + if (abs(a[6] - a[7]) == 1) + return false; + if (abs(a[7] - a[8]) == 1 || abs(a[8] - a[9]) == 1) + return false; + return true; +} ``` ### B ```cpp - +bool check() +{ + if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1) + return false; + if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1) + return false; + if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1) + return false; + if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1) + return false; + if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1) + return false; + if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1) + return false; + if (abs(a[6] - a[7]) == 1) + return false; + if (abs(a[7] - a[8]) == 1) + return false; + if (abs(a[8] - a[9]) == 1) + return false; + return true; +} ``` ### C ```cpp - +bool check() +{ + if (abs(a[0] - a[1]) == 1 || abs(a[0] - a[3]) == 1 || abs(a[0] - a[4]) == 1 || abs(a[0] - a[5]) == 1) + return false; + if (abs(a[1] - a[2]) == 1 || abs(a[1] - a[4]) == 1 || abs(a[1] - a[5]) == 1 || abs(a[1] - a[6]) == 1) + return false; + if (abs(a[2] - a[5]) == 1 || abs(a[2] - a[6]) == 1) + return false; + if (abs(a[3] - a[4]) == 1 || abs(a[3] - a[7]) == 1 || abs(a[3] - a[8]) == 1) + return false; + if (abs(a[4] - a[5]) == 1 || abs(a[4] - a[7]) == 1 || abs(a[4] - a[8]) == 1 || abs(a[4] - a[9]) == 1) + return false; + if (abs(a[5] - a[6]) == 1 || abs(a[5] - a[8]) == 1 || abs(a[5] - a[9]) == 1) + return false; + if (abs(a[6] - a[9]) == 1) + return false; + if (abs(a[7] - a[8]) == 1) + return false; + return true; +} ``` diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/config.json" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/config.json" deleted file mode 100644 index f6416a1a57a86a638c71ad1c8742a38349a88fe3..0000000000000000000000000000000000000000 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/config.json" +++ /dev/null @@ -1,6 +0,0 @@ -{ - "node_id": "569d5e11c4fc5de7844053d9a733c5e8", - "keywords": [], - "children": [], - "export": [] -} \ No newline at end of file diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/desc.md" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/desc.md" deleted file mode 100644 index 8ff04f618ab4d815207c7a162bd69eca6cc74c5b..0000000000000000000000000000000000000000 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/desc.md" +++ /dev/null @@ -1,4 +0,0 @@ -如图所示，在二维平面上有无数个1x1的小方格。 -我们以某个小方格的一个顶点为圆心画一个半径为1000的圆。 -你能计算出这个圆里有多少个完整的小方格吗？ -![](https://upload-images.jianshu.io/upload_images/15659652-2abc8a1de9a368d2.png?imageMogr2/auto-orient/strip|imageView2/2/w/394/format/webp) \ No newline at end of file diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.cpp" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.cpp" deleted file mode 100644 index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000 diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.java" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.java" deleted file mode 100644 index d8ca3b326f8fabb2caddb8e3faa0e81b201ad6de..0000000000000000000000000000000000000000 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.java" +++ /dev/null @@ -1,18 +0,0 @@ -import java.util.*; - -public class Main { - public static void main(String[] args) { - int r = 1000; - int sum = 0; - for (int a = 1; a <= 1001; a++) { - for (int b = 1; b <= 1001; b++) { - if (a * a + b * b <= r * r) - sum++; - } - } - sum *= 4; - System.out.println(sum); - - } -} -// 3137548 diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.md" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.md" deleted file mode 100644 index c9ac5f7d7c618b95d33e30d4b0d4c46bb5156f21..0000000000000000000000000000000000000000 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\346\240\274\350\256\241\346\225\260/solution.md" +++ /dev/null @@ -1,36 +0,0 @@ -# 方格计数 -如图所示，在二维平面上有无数个1x1的小方格。 -我们以某个小方格的一个顶点为圆心画一个半径为1000的圆。 -你能计算出这个圆里有多少个完整的小方格吗？ -![](https://upload-images.jianshu.io/upload_images/15659652-2abc8a1de9a368d2.png?imageMogr2/auto-orient/strip|imageView2/2/w/394/format/webp) - -## aop -### before -```cpp - -``` -### after -```cpp - -``` - -## 答案 -```cpp - -``` -## 选项 - -### A -```cpp - -``` - -### B -```cpp - -``` - -### C -```cpp - -``` diff --git "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\351\230\265\350\275\254\347\275\256/solution.md" "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\351\230\265\350\275\254\347\275\256/solution.md" index c0035d2c94e0aef00b1b60da4bea620a9c653536..e6694b9a35d4ed7340de23209c95869b97e8156a 100644 --- "a/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\351\230\265\350\275\254\347\275\256/solution.md" +++ "b/data/1.\347\256\227\346\263\225\345\210\235\351\230\266/1.\350\223\235\346\241\245\346\235\257/\346\226\271\351\230\265\350\275\254\347\275\256/solution.md" @@ -25,7 +25,9 @@ ## aop ### before ```cpp +#include +using namespace std; ``` ### after ```cpp @@ -34,21 +36,110 @@ ## 答案 ```cpp +int main() +{ + int m, n; + int a[20][20]; + int i, j; + cin >> m >> n; + for (i = 0; i < m; i++) + { + for (j = 0; j < n; j++) + { + cin >> a[j][i]; + } + } + for (i = 0; i < n; i++) + { + for (j = 0; j < m; j++) + { + cout << a[i][j] << " "; + } + cout << endl; + } + return 0; +} ``` ## 选项 ### A ```cpp - +int main() +{ + int m, n; + int a[20][20]; + int i, j; + cin >> m >> n; + for (i = 0; i < m; i++) + { + for (j = 0; j < n; j++) + { + cin >> a[j][i]; + } + } + for (i = 0; i < n; i++) + { + for (j = m; j > 0; j--) + { + cout << a[i][j] << " "; + } + cout << endl; + } + return 0; +} ``` ### B ```cpp - +int main() +{ + int m, n; + int a[20][20]; + int i, j; + cin >> m >> n; + for (i = 0; i < m; i++) + { + for (j = 0; j < n; j++) + { + cin >> a[j][i]; + } + } + for (i = n; i > 0; i--) + { + for (j = 0; j < m; j++) + { + cout << a[i][j] << " "; + } + cout << endl; + } + return 0; +} ``` ### C ```cpp - +int main() +{ + int m, n; + int a[20][20]; + int i, j; + cin >> m >> n; + for (i = 0; i < m; i++) + { + for (j = 0; j < n; j++) + { + cin >> a[j][i]; + } + } + for (i = n; i > 0; i--) + { + for (j = m; j > 0; j--) + { + cout << a[i][j] << " "; + } + cout << endl; + } + return 0; +} ```