{"id":306,"date":"2024-08-25T17:27:59","date_gmt":"2024-08-25T09:27:59","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=306"},"modified":"2024-08-25T22:55:45","modified_gmt":"2024-08-25T14:55:45","slug":"nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%952%e9%80%92%e5%bd%92a","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/08\/25\/nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%952%e9%80%92%e5%bd%92a\/","title":{"rendered":"NENUOJ \u4e4b \u7b97\u6cd52\u9012\u5f52A"},"content":{"rendered":"\n

\u524d\u8a00<\/h2>\n\n\n\n
\n

\u8003\u8651\u5230\u8fdb\u5165\u5927\u4e8c\u4e0a\u4e86\uff0c\u6240\u4ee5\u4ee3\u7801\u4e3b\u8981\u4ee5C++\u7684\u5f62\u5f0f\u7ed9\u51fa\uff0c\u5018\u82e5\u8bfb\u8005\u64c5\u957f\u4f7f\u7528C\u8bed\u8a00\uff0c\u5f71\u54cd\u4e5f\u4e0d\u4f1a\u5f88\u5927~<\/p>\n<\/blockquote>\n\n\n\n

A001 \u7334\u5b50\u5403\u6843<\/a><\/h2>\n\n\n\n
\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n

\u7334\u5b50\u7b2c1\u5929\u6458\u4e0b\u82e5\u5e72\u4e2a\u6843\u5b50\uff0c\u5f53\u5373\u5403\u4e86\u4e00\u534a\uff0c\u8fd8\u4e0d\u8fc7\u763e\uff0c\u53c8\u591a\u5403\u4e86\u4e00\u4e2a\u3002\u7b2c2\u5929\u53c8\u5c06\u5269\u4e0b\u7684\u6843\u5b50\u5403\u6389\u4e00\u534a\uff0c\u53c8\u591a\u5403\u4e86\u4e00\u4e2a\u3002\u4ee5\u540e\u6bcf\u5929\u65e9\u4e0a\u90fd\u5403\u4e86\u524d\u4e00\u5929\u5269\u4e0b\u7684\u4e00\u534a\u53e6\u52a0\u4e00\u4e2a\u3002\u5230\u7b2c10\u5929\u65e9\u4e0a\u60f3\u518d\u5403\u65f6\uff0c\u5c31\u53ea\u5269\u4e0b\u4e00\u4e2a\u6843\u5b50\u4e86\u3002\u6c42\u7b2c1\u5929\u5171\u6458\u4e86\u591a\u5c11\u4e2a\u6843\u5b50\u3002<\/p>\n\n\n\n

\u8f93\u5165<\/h4>\n\n\n\n

\u8f93\u5165\u7b2c\u4e00\u884c\u4e3a\u6b63\u6574\u6570n\uff0c\u4e3a\u6d4b\u8bd5\u6570\u636e\u7ec4\u6570\u3002\u540e\u9762n\u884c\u4e3a\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u5305\u62ec\u4e24\u4e2a\u6574\u6570m\uff0ck\uff0c\u5206\u522b\u8868\u793a\u7b2cm\uff08m>1)\u5929\u540e\u5269\u4f59\u7684\u6843\u5b50\u6570k(k>=0)\u3002<\/p>\n\n\n\n

\u8f93\u51fa<\/h4>\n\n\n\n

\u8f93\u51fa\u7334\u5b50\u7b2c\u4e00\u5929\u6458\u7684\u6843\u5b50\u6570\uff0c\u6bcf\u7ec4\u6570\u636e\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n

\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
2  2
3  0<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
6
6<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int n;\n    cin >> n;\n    while(n--){\n        int m,k;\n        cin >> m >> k;\n        for(int i = m ;i > 1;i--){\n            k += 1;\n            k *= 2;\n        }\n        cout << k << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A002 \u6700\u5927\u516c\u7ea6\u6570<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u8f93\u5165\u4e24\u4e2a\u6b63\u6574\u6570\uff0c\u6c42\u5176\u6700\u5927\u516c\u7ea6\u6570\u3002 \u6570\u8bba\u4e2d\u6709\u4e00\u4e2a\u6c42\u6700\u5927\u516c\u7ea6\u6570\u7684\u7b97\u6cd5\u79f0\u4e3a\u8f97\u8f6c\u76f8\u9664\u6cd5\uff0c\u53c8\u79f0\u6b27\u51e0\u91cc\u5fb7\u7b97\u6cd5\u3002\u5176\u57fa\u672c\u601d\u60f3\u53ca\u6267\u884c\u8fc7\u7a0b\u4e3a\uff08\u8bbem\u4e3a\u4e24\u6b63\u6574\u6570\u4e2d\u8f83\u5927\u8005\uff0cn\u4e3a\u8f83\u5c0f\u8005\uff09\uff1a \uff081\uff09\u4ee4u=m,v=n\uff1b \uff082\uff09\u53d6u\u5bf9v\u7684\u4f59\u6570\uff0c\u5373r=u%v\uff0c\u5982\u679cr\u7684\u503c\u4e3a0\uff0c\u5219\u6b64\u65f6v\u7684\u503c\u5c31\u662fm\u548cn\u7684\u6700\u5927\u516c\u7ea6\u6570\uff0c\u5426\u5219\u6267\u884c\u7b2c\uff083\uff09\u6b65\uff1b \uff083\uff09u=v\uff0cv=r\uff0c\u5373u\u7684\u503c\u4e3av\u7684\u503c\uff0c\u800cv\u7684\u503c\u4e3a\u4f59\u6570r\u3002\u5e76\u8f6c\u5411\u7b2c\uff082\uff09\u6b65\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570n\uff0c\u540e\u9762\u8ddf\u7740n\u884c\u8f93\u5165\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53601\u884c\uff0c\u5305\u62ec\u4e24\u4e2a\u6b63\u6574\u6570m\u548cn\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
n\u884c\uff0c\u6bcf\u884c\u8f93\u51fa\u5bf9\u5e94\u4e00\u4e2a\u8f93\u5165\u3002\u8f93\u51fa\u5e94\u662f\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u4e3am\u548cn\u7684\u6700\u5927\u516c\u7ea6\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
48 32
15 5<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
16
5<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++ \u4ee3\u7801\u4e00\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint ggcd(int a,int b){\n    return b == 0 ? a : ggcd(b,a % b);\n}\nint main(){\n    int n;\n    cin >> n;\n    while(n--){\n        int a,b;\n        cin >> a >> b;\n        cout << ggcd(a,b) << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C++ \u4ee3\u7801\u4e8c\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int n;\n    cin >> n;\n    while(n--){\n        int a,b;\n        cin >> a >> b;\n        cout << __gcd(a,b) << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A003 \u7ecf\u5178\u7684Hanoi(\u6c49\u8bfa\u5854)\u95ee\u9898<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6709\u4e00\u4e2a\u6c49\u8bfa\u5854\uff0c\u5854\u5185\u6709A,B,C\u4e09\u4e2a\u67f1\u5b50\u3002\u8d77\u521d\uff0cA\u67f1\u4e0a\u6709n\u4e2a\u76d8\u5b50\uff0c\u4f9d\u6b21\u7531\u5927\u5230\u5c0f\u3001\u4ece\u4e0b\u5f80\u4e0a\u5806\u653e\uff0c\u8981\u6c42\u5c06\u5b83\u4eec\u5168\u90e8\u79fb\u5230C\u67f1\u4e0a\uff1b\u5728\u79fb\u52a8\u8fc7\u7a0b\u4e2d\u53ef\u4ee5\u5229\u7528B\u67f1\uff0c\u4f46\u6bcf\u6b21\u53ea\u80fd\u79fb\u5230\u4e00\u4e2a\u76d8\u5b50\uff0c\u4e14\u5fc5\u987b\u4f7f\u4e09\u4e2a\u67f1\u5b50\u4e0a\u59cb\u7ec8\u4fdd\u6301\u5927\u76d8\u5728\u4e0b\uff0c\u5c0f\u76d8\u5728\u4e0a\u7684\u72b6\u6001\u3002\u8981\u6c42\u7f16\u7a0b\u8f93\u51fa\u79fb\u52a8\u7684\u6b65\u9aa4\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u591a\u884c\uff0c\u6bcf\u884c\u4e3a\u4e00\u4e2a\u6574\u6570n\uff0c\u4ee3\u8868\u521d\u59cbA\u67f1\u5b50\u4e0a\u7684\u76d8\u5b50\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u6574\u6570n\u5217\u51fa\u5177\u4f53\u7684\u6c49\u8bfa\u5854\u79fb\u52a8\u6b65\u9aa4\u3002\u4e24\u7ec4\u8f93\u51fa\u4e4b\u95f4\u6709\u4e00\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
3
1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
A-->C
A-->B
C-->B
A-->C
B-->A
B-->C
A-->C
\u200b
A-->C<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nvoid move(char a,char b){\n    cout << a << \"-->\" << b << \"\\n\";\n}\nvoid hanoi(int n, char a, char b, char c){\n\tif (n == 1)\n\t\tmove(a,c);\n\telse{\n\t\thanoi(n - 1,a,c,b);\n\t\tmove(a,c);\n\t\thanoi(n - 1,b,a,c);\n\t} \n}\nint main(){\n    int n;\n    while(cin >> n){\n        hanoi(n,'A','B','C');\n        cout << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A004 \u83f2\u6ce2\u90a3\u5951\u6570\u5217<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u83f2\u6ce2\u90a3\u5951\u6570\u5217\u662f\u6307\u8fd9\u6837\u7684\u6570\u5217: \u6570\u5217\u7684\u7b2c\u4e00\u4e2a\u548c\u7b2c\u4e8c\u4e2a\u6570\u90fd\u4e3a1\uff0c\u63a5\u4e0b\u6765\u6bcf\u4e2a\u6570\u90fd\u7b49\u4e8e\u524d\u97622\u4e2a\u6570\u4e4b\u548c\u3002\u7ed9\u51fa\u4e00\u4e2a\u6b63\u6574\u6570a\uff0c\u8981\u6c42\u83f2\u6ce2\u90a3\u5951\u6570\u5217\u4e2d\u7b2ca\u4e2a\u6570\u662f\u591a\u5c11\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570n\uff0c\u540e\u9762\u8ddf\u7740n\u884c\u8f93\u5165\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53601\u884c\uff0c\u5305\u62ec\u4e00\u4e2a\u6b63\u6574\u6570a(1 <= a <= 20)\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u6709n\u884c\uff0c\u6bcf\u884c\u8f93\u51fa\u5bf9\u5e94\u4e00\u4e2a\u8f93\u5165\u3002\u8f93\u51fa\u5e94\u662f\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u4e3a\u83f2\u6ce2\u90a3\u5951\u6570\u5217\u4e2d\u7b2ca\u4e2a\u6570\u7684\u5927\u5c0f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
4
5
2
19
1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
5
1
4181
1<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint f[1000];\nvoid cal(){\n    f[0] = 0;\n    f[1] = 1;\n    for(int i = 2;i <= 20;i++){\n        f[i] = f[i - 1] + f[i - 2];\n    }\n}\nint main(){\n    int n;\n    cin >> n;\n    cal();\n    while(n--){\n        int a;\n        cin >> a;\n        cout << f[a] << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A005 \u53e6\u4e00\u4e2aFibonacci\u6570\u5217<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5b9a\u4e49\u53e6\u5916\u4e00\u4e2aFibonacci\u6570\u5217\uff1aF(0)=7,F(1)=11,F(n)=F(n-1)+F(n-2)\uff0c\uff08n\u22652\uff09\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u591a\u884c\uff0c\u6bcf\u884c\u4e3a\u4e00\u4e2a\u6574\u6570n\uff0cn<1000000\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u6574\u6570n\uff0c\u5982\u679cF(n)\u80fd\u88ab3\u6574\u9664\uff0c\u8f93\u51fayes\uff0c\u5426\u5219\u8f93\u51fano\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
0
1
2
3<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
no
no
yes
no<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int n;\n    while(cin >> n){\n        if(n % 4 == 2) cout << \"yes\\n\";\n        else cout << \"no\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A006 \u5206\u5f62\uff08Fractal\uff09<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5206\u5f62\u662f\u5b58\u5728\u201c\u81ea\u76f8\u4f3c\u201d\u7684\u4e00\u4e2a\u7269\u4f53\u6216\u4e00\u79cd\u91cf\uff0c\u4ece\u67d0\u79cd\u6280\u672f\u89d2\u5ea6\u6765\u8bf4\uff0c\u8fd9\u79cd\u201c\u81ea\u76f8\u4f3c\u201d\u662f\u5168\u65b9\u4f4d\u7684\u3002 \u76d2\u5f62\u5206\u5f62\u5b9a\u4e49\u5982\u4e0b\uff1a \u5ea6\u6570\u4e3a1\u7684\u5206\u5f62\u5f88\u7b80\u5355\uff0c\u4e3a\uff1a X<\/p>\n\n\n\n
\u5ea6\u6570\u4e3a2\u7684\u5206\u5f62\u4e3a\uff1a<\/p>\n\n\n\n
X X<\/p>\n\n\n\n
X<\/p>\n\n\n\n
X X<\/p>\n\n\n\n
\u5982\u679c\u7528B(n-1)\u4ee3\u8868\u5ea6\u6570\u4e3an-1\u7684\u76d2\u5f62\u5206\u5f62\uff0c\u5219\u5ea6\u6570\u4e3an\u7684\u76d2\u5f62\u5206\u5f62\u53ef\u4ee5\u9012\u5f52\u5730\u5b9a\u4e49\u4e3a\uff1a<\/p>\n\n\n\n
B(n-1) B(n-1)<\/p>\n\n\n\n
B(n-1)<\/p>\n\n\n\n
B(n-1) B(n-1)<\/p>\n\n\n\n
\u4f60\u7684\u4efb\u52a1\u662f\u8f93\u51fa\u5ea6\u6570\u4e3an\u7684\u76d2\u5f62\u5206\u5f62\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b\u591a\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u5305\u542b\u4e00\u4e2a\u6b63\u6574\u6570n\uff0cn \u2264 7\u3002\u8f93\u5165\u6587\u4ef6\u7684\u6700\u540e\u4e00\u884c\u4e3a-1\uff0c\u4ee3\u8868\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u7528\u7b26\u53f7\u201cX\u201d\u8868\u793a\u8f93\u51fa\u76d2\u5f62\u5206\u5f62\u3002\u5728\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5bf9\u5e94\u7684\u8f93\u51fa\u4e4b\u540e\u8f93\u51fa\u4e00\u4e2a\u77ed\u5212\u7ebf\u7b26\u53f7\u201c-\u201d\uff0c\u5728\u6bcf\u884c\u7684\u672b\u5c3e\u4e0d\u8981\u8f93\u51fa\u4efb\u4f55\u591a\u4f59\u7684\u7a7a\u683c\uff0c\u5426\u5219\u5f97\u5230\u7684\u662f\u201c\u683c\u5f0f\u9519\u8bef\u201d\u7684\u7ed3\u679c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
3
-1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
X X
 X
X X
-
X X   X X
 X     X
X X   X X
   X X
    X
   X X
X X   X X
 X     X
X X   X X<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 1e3;\nchar a[MAXN][MAXN];\n \nvoid solve(int x,int y,int n){\n    int l = (int)pow(3,n - 2);\n    if(n == 1){\n        a[x][y] = 'X';\n        return;\n    }\n    if(n){\n        solve(x,y,n - 1);\n        solve(x + l,y + l,n - 1);\n        solve(x + 2*l,y,n - 1);\n        solve(x,y + 2*l,n - 1);\n        solve(x + 2*l,y + 2*l,n - 1);\n    }\n     \n}\nint main(){\n     \n    int n;\n    int cnt = 0;\n    while(cin >> n){\n        if(n == -1) break;\n        for(int i = 0;i < n;i++){\n            for(int j = 0;j < n;j++){\n                a[i][j] = ' ';\n            }\n        }\n        if(cnt != 0)cout << \"-\" << \"\\n\";\n        cnt++;\n        solve(0,0,n);\n        int m = (int)pow(3,n - 1);\n         for(int i = 0;i < m;i++){\n            int maxx = 0;\n            for(int j = 0;j < m;j++){\n                if(a[i][j] == 'X'){\n                    maxx = j;\n                }\n                else a[i][j] = ' ';\n            }\n            a[i][maxx + 1] = '\\0';\n        }\n        for(int i = 0;i < m;i ++){\n            cout << a[i] << \"\\n\";\n        }\n    }\n\n}<\/code><\/pre>\n\n\n\n
A007 \u4e8c\u53c9\u6811<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5982\u56fe\u6240\u793a\uff0c\u7531\u6b63\u6574\u65701, 2, 3, …\u7ec4\u6210\u4e86\u4e00\u68f5\u65e0\u9650\u5927\u7684\u4e8c\u53c9\u6811\u3002\u4ece\u67d0\u4e00\u4e2a\u7ed3\u70b9\u5230\u6839\u7ed3\u70b9\uff08\u7f16\u53f7\u662f1\u7684\u7ed3\u70b9\uff09\u90fd\u6709\u4e00\u6761\u552f\u4e00\u7684\u8def\u5f84\uff0c\u6bd4\u5982\u4ece10\u5230\u6839\u7ed3\u70b9\u7684\u8def\u5f84\u662f(10, 5, 2, 1)\uff0c\u4ece4\u5230\u6839\u7ed3\u70b9\u7684\u8def\u5f84\u662f(4, 2, 1)\uff0c\u4ece\u6839\u7ed3\u70b91\u5230\u6839\u7ed3\u70b9\u7684\u8def\u5f84\u4e0a\u53ea\u5305\u542b\u4e00\u4e2a\u7ed3\u70b91\uff0c\u56e0\u6b64\u8def\u5f84\u5c31\u662f(1)\u3002\u5bf9\u4e8e\u4e24\u4e2a\u7ed3\u70b9x\u548cy\uff0c\u5047\u8bbe\u4ed6\u4eec\u5230\u6839\u7ed3\u70b9\u7684\u8def\u5f84\u5206\u522b\u662f$(x_1, x_2, … ,1)$\u548c$(y_1, y_2, … ,1)$\uff08\u8fd9\u91cc\u663e\u7136\u6709$x = x_1$\uff0c$y = y_1$\uff09\uff0c\u90a3\u4e48\u5fc5\u7136\u5b58\u5728\u4e24\u4e2a\u6b63\u6574\u6570i\u548cj\uff0c\u4f7f\u5f97\u4ece$xi$ \u548c $yj$\u5f00\u59cb\uff0c\u6709$x_i = y_j , x_i + 1 = y_j + 1, x_i + 2 = y_j + 2,…$ \u73b0\u5728\u7684\u95ee\u9898\u5c31\u662f\uff0c\u7ed9\u5b9ax\u548cy\uff0c\u8981\u6c42$x_i$\uff08\u4e5f\u5c31\u662f$y_j$\uff09\u3002<\/p>\n\n\n\n
\"A007.jpg\"<\/div><\/figure>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u591a\u884c\uff0c\u6bcf\u884c\u5305\u62ec\u4e24\u4e2a\u6b63\u6574\u6570x\u548cy\uff0c\u8fd9\u4e24\u4e2a\u6b63\u6574\u6570\u90fd\u4e0d\u5927\u4e8e1000\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u6bcf\u884c\u8f93\u51fa\u53ea\u6709\u4e00\u4e2a\u6b63\u6574\u6570$x_i$\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
10 4<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
2<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint f[1000];\nint com(int x,int y){\n    if(x == y) return x;\n    if(x > y) return com(x \/ 2,y);\n    return com(x,y \/ 2);\n}\nint main(){\n     \n    int x,y;\n    while(cin >> x >> y)\n        cout << com(x,y) << \"\\n\";\n    return 0;\n}<\/code><\/pre>\n\n\n\n
A008 \u6ce2\u5170\u8868\u8fbe\u5f0f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6ce2\u5170\u8868\u8fbe\u5f0f\u662f\u4e00\u79cd\u628a\u8fd0\u7b97\u7b26\u524d\u7f6e\u7684\u7b97\u672f\u8868\u8fbe\u5f0f\uff0c\u4f8b\u5982\u666e\u901a\u7684\u8868\u8fbe\u5f0f2 + 3\u7684\u6ce2\u5170\u8868\u793a\u6cd5\u4e3a+ 2 3\u3002\u6ce2\u5170\u8868\u8fbe\u5f0f\u7684\u4f18\u70b9\u662f\u8fd0\u7b97\u7b26\u4e4b\u95f4\u4e0d\u5fc5\u6709\u4f18\u5148\u7ea7\u5173\u7cfb\uff0c\u4e5f\u4e0d\u5fc5\u7528\u62ec\u53f7\u6539\u53d8\u8fd0\u7b97\u6b21\u5e8f\uff0c\u4f8b\u5982(2 + 3) * 4\u7684\u6ce2\u5170\u8868\u793a\u6cd5\u4e3a* + 2 3 4\u3002\u672c\u9898\u6c42\u89e3\u6ce2\u5170\u8868\u8fbe\u5f0f\u7684\u503c\uff0c\u5176\u4e2d\u8fd0\u7b97\u7b26\u5305\u62ec+ – * \/\u56db\u4e2a\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u7b2c\u4e00\u884c\u4e3a\u4e00\u4e2a\u6574\u6570n\uff0c\u7136\u540e\u662fn\u884c\uff0c\u6bcf\u884c\u4e3a\u4e00\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u5176\u4e2d\u8fd0\u7b97\u7b26\u548c\u8fd0\u7b97\u6570\u4e4b\u95f4\u90fd\u7528\u7a7a\u683c\u5206\u9694\uff0c\u8fd0\u7b97\u6570\u662f\u6d6e\u70b9\u6570\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fan\u884c\uff0c\u6bcf\u884c\u8868\u8fbe\u5f0f\u7684\u503c\uff0c\u4fdd\u75593\u4f4d\u5c0f\u6570\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
1
* + 11.0 12.0 + 24.0 35.0<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
1357.000<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\ndouble solve()\n{\n    char s[10000];\n    cin >> s;\n    switch(s[0])\n    {\n        case '+': return solve() + solve();\n        case '-': return solve() - solve();\n        case '*': return solve() * solve();\n        case '\/': return solve() \/ solve();\n        default : return atof(s);\n    }\n}\n\nint main(){\n    \n    int n;\n    cin >> n;\n    while(n--){\n        printf(\"%.3lf\\n\",solve());\n    }\n    \n    return 0;\n}<\/code><\/pre>\n\n\n\n
A009 \u653e\u82f9\u679c<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u628aM\u4e2a\u540c\u6837\u7684\u82f9\u679c\u653e\u5728N\u4e2a\u540c\u6837\u7684\u76d8\u5b50\u91cc\uff0c\u5141\u8bb8\u6709\u7684\u76d8\u5b50\u7a7a\u7740\u4e0d\u653e\uff0c\u95ee\u5171\u6709\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u5206\u6cd5\uff08\u7528K\u8868\u793a\uff09\uff1f\u6ce8\u610f\uff1a5\uff0c1\uff0c1\u548c1\uff0c5\uff0c1 \u662f\u540c\u4e00\u79cd\u5206\u6cd5\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c\u4e00\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u6570\u76eet\uff080 <= t <= 20\uff09\u3002\u4ee5\u4e0b\u6bcf\u884c\u5747\u5305\u542b\u4e8c\u4e2a\u6574\u6570M\u548cN\uff0c\u4ee5\u7a7a\u683c\u5206\u5f00\u30021 <= M\uff0cN <= 10\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u7684\u6bcf\u7ec4\u6570\u636eM\u548cN\uff0c\u7528\u4e00\u884c\u8f93\u51fa\u76f8\u5e94\u7684K\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
1
7 3<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
8<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint dfs(int m,int n){\n    if(m==0 || n==1) {\n    \treturn 1;\t\n\t}\n\tif(n > m){\n    \treturn dfs(m,m);\t\n\t}\n\telse{\n\t    return dfs(m,n - 1) + dfs(m - n,n);\n\t}\n}\nvoid solve(){\n    int m,n;\n    cin >> m >> n;\n    cout << dfs(m,n) << \"\\n\";\n}\nint main(){\n    int t = 1;\n    cin >> t;\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
A010 \u9012\u5f52\u7ec3\u4e601<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u67095\u4e2a\u4eba\u5750\u5728\u4e00\u8d77\uff0c\u95ee\u7b2c5\u4e2a\u4eba\u591a\u5c11\u5c81\uff1f\u4ed6\u8bf4\u6bd4\u7b2c4\u4e2a\u4eba\u5927\u4e24\u5c81\u3002\u95ee\u7b2c4\u4e2a\u4eba\u7684\u5c81\u6570\uff0c\u4ed6\u8bf4\u6bd4\u7b2c3\u4e2a\u4eba\u5927\u4e24\u5c81\u3002\u95ee\u7b2c3\u4e2a\u4eba\u7684\u5c81\u6570\uff0c\u53c8\u8bf4\u6bd4\u7b2c2\u4e2a\u4eba\u5927\u4e24\u5c81\u3002\u95ee\u7b2c2\u4e2a\u4eba\u7684\u5c81\u6570\uff0c\u8bf4\u6bd4\u7b2c1\u4e2a\u4eba\u5927\u4e24\u5c81\u3002\u6700\u540e\u95ee\u7b2c1\u4e2a\u4eba\u7684\u5c81\u6570\uff0c\u4ed6\u8bf4\u662f10\u5c81\u3002\u8bf7\u95ee\u7b2c5\u4e2a\u4eba\u591a\u5c11\u5c81\uff1f<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u591a\u884c\uff0c\u6bcf\u884c3\u4e2a\u6574\u6570\uff0c\u4f9d\u6b21\u4e3am,n,k\u3002m\u8868\u793a\u4e00\u5171\u6709\u51e0\u4e2a\u4eba\uff0cn\u8868\u793a\u5927\u7684\u5c81\u6570\uff0ck\u8868\u793a\u7b2c\u4e00\u4e2a\u4eba\u7684\u5c81\u6570\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u7b2cm\u4e2a\u4eba\u7684\u5c81\u6570\uff0c\u6bcf\u4e2a\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
5 2 10<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
18<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int m,n,k;\n    while(cin >> m >> n >> k){\n        cout << k + (m - 1) * n << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A011 \u9012\u5f52\u7ec3\u4e602<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6839\u636e\u9012\u63a8\u5f0f\u5b50C(m,n)=C(m-1,n)+C(m-1,n-1)\uff0c\u6c42\u7ec4\u5408\u6570C(m,n)\u3002\u6ce8\u610f\u9012\u63a8\u7684\u7ec8\u6b62\u6761\u4ef6\u662fC(m,1)=m\uff1b\u4ee5\u53ca\u4e00\u4e9bm\u548cn\u53d6\u503c\u7684\u4e00\u4e9b\u7279\u6b8a\u60c5\u51b5\uff0c\u5982m < 0\u6216n < 0\u6216m < n\u65f6\uff0cC(m,n)\u503c\u4e3a0\uff0cm\u548cn\u76f8\u7b49\u65f6\uff0cC(m,n)=1\u7b49\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570n\uff0c\u540e\u9762\u8ddf\u7740n\u884c\u8f93\u5165\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53601\u884c\uff0c\u5305\u62ec\u4e00\u4e2a\u6b63\u6574\u6570m\u548c\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u7ec4\u5408\u6570C(m,n)\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
1 100
100 1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
0
100<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint C(int m,int n){\n    if(n == 1) return m;\n    if(m < 0 || n < 0 || m < n){\n        return 0;\n    }\n    if(m == n) return 1;\n    return C(m - 1,n) + C(m - 1,n - 1);\n}\nint main(){\n    int t;\n    cin >> t;\n    while(t--){\n        int m,n;\n        cin >> m >> n;\n        cout << C(m,n) << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A012 \u9012\u5f52\u7ec3\u4e603<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6838\u53cd\u5e94\u5806\u4e2d\u6709\u03b1\u548c\u03b2\u4e24\u79cd\u7c92\u5b50\u3002\u6bcf\u79d2\u949f\u5185\u4e00\u4e2a\u03b1\u7c92\u5b50\u53ef\u4ee5\u4ea7\u751f3\u4e2a\u03b2\u7c92\u5b50\uff0c\u800c\u4e00\u4e2a\u03b2\u7c92\u5b50\u53ef\u4ee5\u4ea7\u751f1\u4e2a\u03b1\u7c92\u5b50\u548c2\u4e2a\u03b2\u7c92\u5b50\u3002\u82e5\u5728t=0\u65f6\u523b\u53cd\u5e94\u5806\u4e2d\u6709\u4e00\u4e2a\u03b1\u7c92\u5b50\uff0c\u6c42t\u65f6\u523b\u53cd\u5e94\u5806\u4e2d\u5206\u522b\u6709\u591a\u5c11\u4e2a\u03b1\u7c92\u5b50\u548c\u03b2\u7c92\u5b50\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u591a\u4e2a\u6574\u6570t\uff0c\u6bcf\u4e2a\u4e00\u884c\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fat\u65f6\u523b\u53cd\u5e94\u5806\u91cc\u5206\u522b\u6709\u591a\u5c11\u4e2a\u03b1\u7c92\u5b50\u548c\u03b2\u7c92\u5b50\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
6<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
183 546<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int t;\n    int a[100],b[100];\n    while(cin >> t){\n        a[0] = 1;\n        b[0] = 0;\n        for(int i = 1;i <= t;i++){\n            a[i] = b[i - 1];\n            b[i] = 3 * a[i - 1] + 2 * b[i - 1];\n        }\n        cout << a[t] << \" \" << b[t] << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A013 \u7ea2\u4e0e\u9ed1<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6709\u4e00\u95f4\u957f\u65b9\u5f62\u7684\u623f\u5b50\uff0c\u5730\u4e0a\u94fa\u4e86\u7ea2\u8272\u3001\u9ed1\u8272\u4e24\u79cd\u989c\u8272\u7684\u6b63\u65b9\u5f62\u74f7\u7816\u3002\u4f60\u7ad9\u5728\u5176\u4e2d\u4e00\u5757\u9ed1\u8272\u7684\u74f7\u7816\u4e0a\uff0c\u53ea\u80fd\u5411\u76f8\u90bb\u7684\u9ed1\u8272\u74f7\u7816\u79fb\u52a8\u3002\u8bf7\u5199\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u8ba1\u7b97\u4f60\u603b\u5171\u80fd\u591f\u5230\u8fbe\u591a\u5c11\u5757\u9ed1\u8272\u7684\u74f7\u7816\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u5305\u62ec\u591a\u4e2a\u6570\u636e\u96c6\u5408\u3002\u6bcf\u4e2a\u6570\u636e\u96c6\u5408\u7684\u7b2c\u4e00\u884c\u662f\u4e24\u4e2a\u6574\u6570W\u548cH\uff0c\u5206\u522b\u8868\u793ax\u65b9\u5411\u548cy\u65b9\u5411\u74f7\u7816\u7684\u6570\u91cf\u3002W\u548cH\u90fd\u4e0d\u8d85\u8fc720\u3002\u5728\u63a5\u4e0b\u6765\u7684H\u884c\u4e2d\uff0c\u6bcf\u884c\u5305\u62ecW\u4e2a\u5b57\u7b26\u3002\u6bcf\u4e2a\u5b57\u7b26\u8868\u793a\u4e00\u5757\u74f7\u7816\u7684\u989c\u8272\uff0c\u89c4\u5219\u5982\u4e0b 1\uff09\u2018.\u2019\uff1a\u9ed1\u8272\u7684\u74f7\u7816\uff1b 2\uff09\u2018#\u2019\uff1a\u767d\u8272\u7684\u74f7\u7816\uff1b 3\uff09\u2018@\u2019\uff1a\u9ed1\u8272\u7684\u74f7\u7816\uff0c\u5e76\u4e14\u4f60\u7ad9\u5728\u8fd9\u5757\u74f7\u7816\u4e0a\u3002\u8be5\u5b57\u7b26\u5728\u6bcf\u4e2a\u6570\u636e\u96c6\u5408\u4e2d\u552f\u4e00\u51fa\u73b0\u4e00\u6b21\u3002 \u5f53\u5728\u4e00\u884c\u4e2d\u8bfb\u5165\u7684\u662f\u4e24\u4e2a\u96f6\u65f6\uff0c\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6570\u636e\u96c6\u5408\uff0c\u5206\u522b\u8f93\u51fa\u4e00\u884c\uff0c\u663e\u793a\u4f60\u4ece\u521d\u59cb\u4f4d\u7f6e\u51fa\u53d1\u80fd\u5230\u8fbe\u7684\u74f7\u7816\u6570(\u8bb0\u6570\u65f6\u5305\u62ec\u521d\u59cb\u4f4d\u7f6e\u7684\u74f7\u7816)\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
6 9 
....#. 
.....# 
...... 
...... 
...... 
...... 
...... 
#@...# 
.#..#. 
0 0<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
45<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nchar mx[100][100];\nint vis[100][100];\nint w,h;\nint x,y;\nint dfs(int x,int y){\n     if(mx[x][y] == '#') return 0;\n     if(x <= 0 || y <= 0 || x > h || y > w) return 0;\n     if(vis[x][y]) return 0;\n     vis[x][y] = 1;\n     return 1 + dfs(x - 1,y) + dfs(x + 1,y) + dfs(x,y - 1) + dfs(x,y + 1);\n}\nint main(){\n    \n    while(cin >> w >> h){\n        if(!w || !h) break;\n        for(int i = 1;i <= h;i++){\n            for(int j = 1;j <= w;j++){\n                cin >> mx[i][j];\n                vis[i][j] = 0;\n                if(mx[i][j] == '@') x = i,y = j;\n            }\n        }\n        cout << dfs(x,y) << \"\\n\";\n    }\n    \n}<\/code><\/pre>\n\n\n\n
A014 \u57ce\u5821\u95ee\u9898<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
1 2 3 4 5 6 7 #############################<\/p>\n\n\n\n
1 # | # | # | | #<\/p>\n\n\n\n
#####—#####—#—#####—#<\/p>\n\n\n\n
2 # # | # # # # #<\/p>\n\n\n\n
#—#####—#####—#####—#<\/p>\n\n\n\n
3 # | | # # # # #<\/p>\n\n\n\n
#—#########—#####—#—#<\/p>\n\n\n\n
4 # # | | | | # #<\/p>\n\n\n\n
#############################<\/p>\n\n\n\n
(\u56fe 1)<\/p>\n\n\n\n
\u2018#\u2019 = Wall \u2018|\u2019 = No wall ‘-‘ = No wall<\/p>\n\n\n\n
\u56fe1\u662f\u4e00\u4e2a\u57ce\u5821\u7684\u5730\u5f62\u56fe\u3002\u8bf7\u4f60\u7f16\u5199\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u8ba1\u7b97\u57ce\u5821\u4e00\u5171\u6709\u591a\u5c11\u623f\u95f4\uff0c\u6700\u5927\u7684\u623f\u95f4\u6709\u591a\u5927\u3002\u57ce\u5821\u88ab\u5206\u5272\u6210m*n(m\u226450\uff0cn\u226450)\u4e2a\u65b9\u5757\uff0c\u6bcf\u4e2a\u65b9\u5757\u53ef\u4ee5\u67090~4\u9762\u5899\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7a0b\u5e8f\u4ece\u6807\u51c6\u8f93\u5165\u8bbe\u5907\u8bfb\u5165\u6570\u636e\u3002\u7b2c\u4e00\u884c\u662f\u4e24\u4e2a\u6574\u6570\uff0c\u5206\u522b\u662f\u5357\u5317\u5411\u3001\u4e1c\u897f\u5411\u7684\u65b9\u5757\u6570\u3002\u5728\u63a5\u4e0b\u6765\u7684\u8f93\u5165\u884c\u91cc\uff0c\u6bcf\u4e2a\u65b9\u5757\u7528\u4e00\u4e2a\u6570\u5b57(0\u2264p\u226450)\u63cf\u8ff0\u3002\u7528\u4e00\u4e2a\u6570\u5b57\u8868\u793a\u65b9\u5757\u5468\u56f4\u7684\u5899\uff0c1\u8868\u793a\u897f\u5899\uff0c2\u8868\u793a\u5317\u5899\uff0c4\u8868\u793a\u4e1c\u5899\uff0c8\u8868\u793a\u5357\u5899\u3002\u6bcf\u4e2a\u65b9\u5757\u7528\u4ee3\u8868\u5176\u5468\u56f4\u5899\u7684\u6570\u5b57\u4e4b\u548c\u8868\u793a\u3002\u57ce\u5821\u7684\u5185\u5899\u88ab\u8ba1\u7b97\u4e24\u6b21\uff0c\u65b9\u5757(1,1)\u7684\u5357\u5899\u540c\u65f6\u4e5f\u662f\u65b9\u5757(2,1)\u7684\u5317\u5899\u3002\u8f93\u5165\u7684\u6570\u636e\u4fdd\u8bc1\u57ce\u5821\u81f3\u5c11\u6709\u4e24\u4e2a\u623f\u95f4\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u57ce\u5821\u7684\u623f\u95f4\u6570\u3001\u57ce\u5821\u4e2d\u6700\u5927\u623f\u95f4\u6240\u5305\u62ec\u7684\u65b9\u5757\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
4
7
11 6 11 6 3 10 6
7 9 6 13 5 15 5
1 10 12 7 13 7 5
13 11 10 8 10 12 13<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
5
9<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nconst int dir[4][2] = { {0, -1}, {-1, 0}, {0, 1}, {1, 0} };\nconst int mask[4] = {1, 2, 4, 8};\n\nint rows, cols;\nvector<vector<int>> mx, vis;\nint ans = 0, maxx = 0, cnt = 0;\n\nvoid dfs(int x, int y, int step) {\n    if (vis[x][y]) return;\n    cnt++;\n    vis[x][y] = step;\n\n    for (int d = 0; d < 4; ++d) {\n        int nx = x + dir[d][0];\n        int ny = y + dir[d][1];\n        \n        if (nx >= 1 && nx <= rows && ny >= 1 && ny <= cols && !vis[nx][ny]) {\n            if ((mx[x][y] & mask[d]) == 0) {\n                dfs(nx, ny, step);\n            }\n        }\n    }\n}\n\nint main() {\n    cin >> rows >> cols;\n    mx.resize(rows + 1, vector<int>(cols + 1));\n    vis.resize(rows + 1, vector<int>(cols + 1, 0));\n    \n    for (int i = 1; i <= rows; i++) {\n        for (int j = 1; j <= cols; j++) {\n            cin >> mx[i][j];\n        }\n    }\n    \n    for (int i = 1; i <= rows; i++) {\n        for (int j = 1; j <= cols; j++) {\n            if (!vis[i][j]) {\n                ans++;\n                cnt = 0;\n                dfs(i, j, ans);\n                maxx = max(cnt, maxx);\n            }\n        }\n    }\n    \n    cout << ans << \"\\n\";\n    cout << maxx << \"\\n\";\n    \n    return 0;\n}<\/code><\/pre>\n\n\n\n
A015 \u5206\u89e3\u56e0\u5f0f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u51fa\u4e00\u4e2a\u6b63\u6574\u6570a\uff0c\u8981\u6c42\u5206\u89e3\u6210\u82e5\u5e72\u4e2a\u6b63\u6574\u6570\u7684\u4e58\u79ef\uff0c\u5373a = a1 * a2 * a3 * … * an\uff0c\u5e76\u4e141 < a1 <= a2 <= a3 <= … <= an\uff0c\u95ee\u8fd9\u6837\u7684\u5206\u89e3\u7684\u79cd\u6570\u6709\u591a\u5c11\u3002\u6ce8\u610f\u5230a = a\u4e5f\u662f\u4e00\u79cd\u5206\u89e3\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570n\uff0c\u540e\u9762\u8ddf\u7740n\u884c\u8f93\u5165\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53601\u884c\uff0c\u5305\u62ec\u4e00\u4e2a\u6b63\u6574\u6570a (1 < a < 32768)\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
n\u884c\uff0c\u6bcf\u884c\u8f93\u51fa\u5bf9\u5e94\u4e00\u4e2a\u8f93\u5165\u3002\u8f93\u51fa\u5e94\u662f\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u6307\u660e\u6ee1\u8db3\u8981\u6c42\u7684\u5206\u89e3\u7684\u79cd\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
2
20<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
1
4<\/pre>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint cnt = 1;\nvoid dfs(int m,int a){\n    for(int i = m;i * i <= a;i++){\n        if(a % i == 0){\n            cnt++;\n            dfs(i,a \/ i);\n        }\n    }\n}\nint main(){\n    int n;\n    cin >> n;\n    while(n--){\n        cnt = 1;\n        int a;\n        cin >> a;\n        dfs(2,a);\n        cout << cnt << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
A016 \u6570\u5b57\u62fc\u51d1<\/a><\/h1>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u73b0\u5728\u7ed9\u4f60\u8fd9\u6837\u4e00\u4e2a\u4efb\u52a1\uff0c\u8981\u6c42\u627e\u51fa\u5177\u6709\u4e0b\u5217\u6027\u8d28\u6570\u7684\u4e2a\u6570\uff08\u5305\u542b\u8f93\u5165\u7684\u6b63\u6574\u6570 n\uff09\u3002 \u5148\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570 n(n <= 500)\uff0c\u7136\u540e\u5bf9\u6b64\u6b63\u6574\u6570\u6309\u7167\u5982\u4e0b\u65b9\u6cd5\u8fdb\u884c\u5904\u7406\uff1a<\/p>\n\n\n\n
    \n
  1. \u4e0d\u4f5c\u4efb\u4f55\u5904\u7406\uff1b<\/li>\n\n\n\n
  2. \u5728\u5b83\u7684\u5de6\u8fb9\u62fc\u63a5\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u4f46\u8be5\u6b63\u6574\u6570\u4e0d\u80fd\u8d85\u8fc7\u539f\u6570\u7684\u4e00\u534a\u6216\u8005\u662f\u4e0a\u4e00\u4e2a\u88ab\u62fc\u63a5\u6570\u7684\u4e00\u534a\uff1b<\/li>\n\n\n\n
  3. \u52a0\u4e0a\u6570\u540e\uff0c\u7ee7\u7eed\u6309\u6b64\u89c4\u5219\u8fdb\u884c\u5904\u7406\uff0c\u76f4\u5230\u4e0d\u80fd\u518d\u52a0\u6b63\u6574\u6570\u4e3a\u6b62\u3002<\/li>\n<\/ol>\n\n\n\n
    \u8f93\u5165<\/h4>\n\n\n\n
    \u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n\n\n\n
    \u8f93\u51fa<\/h4>\n\n\n\n
    \u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u8868\u793a\u5177\u6709\u8be5\u6027\u8d28\u6570\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
    \u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
    6<\/pre>\n\n\n\n
    \u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
    6<\/pre>\n<\/blockquote>\n\n\n\n
    \u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
    #include<bits\/stdc++.h>\nusing namespace std;\nint cnt;\nvoid dfs(int m){\n    cnt++;\n    for (int i = 1;i <= m\/2;i++) \n      dfs(i);\n}\nint main(){\n    int n;\n    cin >> n;\n    dfs(n);\n    cout << cnt << \"\\n\";\n    return 0;\n} <\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
    \u524d\u8a00 \u8003\u8651\u5230\u8fdb\u5165\u5927\u4e8c\u4e0a\u4e86\uff0c\u6240\u4ee5\u4ee3\u7801\u4e3b\u8981\u4ee5C++\u7684\u5f62\u5f0f\u7ed9\u51fa\uff0c\u5018\u82e5\u8bfb\u8005\u64c5\u957f\u4f7f\u7528C\u8bed\u8a00\uff0c\u5f71\u54cd\u4e5f\u4e0d\u4f1a\u5f88\u5927~ A001  […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,7,17],"tags":[],"class_list":["post-306","post","type-post","status-publish","format-standard","hentry","category-nenuoj-2","category-7","category-17"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/306","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/comments?post=306"}],"version-history":[{"count":3,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/306\/revisions"}],"predecessor-version":[{"id":313,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/306\/revisions\/313"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=306"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=306"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=306"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}