{"id":310,"date":"2024-08-25T22:30:49","date_gmt":"2024-08-25T14:30:49","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=310"},"modified":"2024-08-25T22:55:17","modified_gmt":"2024-08-25T14:55:17","slug":"nenuoj-%e4%b9%8b%e7%ae%97%e6%b3%952%e6%8e%92%e5%ba%8fb","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/08\/25\/nenuoj-%e4%b9%8b%e7%ae%97%e6%b3%952%e6%8e%92%e5%ba%8fb\/","title":{"rendered":"NENUOJ \u4e4b \u7b97\u6cd52\u6392\u5e8fB"},"content":{"rendered":"\n

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

\u4e0d\u592a\u597d\u5199\u7684\u4e00\u7ae0\u8282~\u613f\u8bfb\u8005\u5145\u6ee1\u8010\u5fc3\u5730\u5b66\u4e60\u6bcf\u4e00\u9053\u9898\uff0c\u5982\u679c\u662f\u9762\u5bf9\u5c0f\u6d4b\uff0c\u53ef\u4ee5\u63d0\u524d\u51c6\u5907\u4e00\u4e0b\uff0c\u56e0\u4e3a\u8fd9\u4e00\u7ae0\u4e0d\u592a\u5bb9\u6613\u5728\u521d\u6b21\u89c1\u5230\u7684\u65f6\u5019\u9a6c\u4e0a\u505a\u51fa\u6765\u3002<\/p>\n<\/blockquote>\n\n\n\n

B001 \u5feb\u4e50\u7684\u8815\u866b<\/a><\/h2>\n\n\n\n
\n

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

\u6709\u4e00\u53ea\u5feb\u4e50\u7684\u8815\u866b\u5c45\u4f4f\u5728\u4e00\u4e2am\u00d7n\u5927\u5c0f\u7684\u7f51\u683c\u4e2d\u3002\u5728\u7f51\u683c\u7684\u67d0\u4e9b\u4f4d\u7f6e\u653e\u7f6e\u4e86k\u5757\u77f3\u5934\u3002\u7f51\u683c\u4e2d\u7684\u6bcf\u4e2a\u4f4d\u7f6e\u8981\u4e48\u662f\u7a7a\u7684\uff0c\u8981\u4e48\u653e\u7f6e\u4e86\u4e00\u5757\u77f3\u5934\u3002\u5f53\u8815\u866b\u7761\u89c9\u65f6\uff0c\u5b83\u5728\u6c34\u5e73\u65b9\u5411\u6216\u5782\u76f4\u65b9\u5411\u4e0a\u8eba\u7740\uff0c\u628a\u8eab\u4f53\u5c3d\u53ef\u80fd\u4f38\u5c55\u5f00\u6765\u3002\u8815\u866b\u7684\u8eab\u8eaf\u65e2\u4e0d\u80fd\u8fdb\u5165\u5230\u653e\u6709\u77f3\u5757\u7684\u65b9\u683c\u4e2d\uff0c\u4e5f\u4e0d\u80fd\u4f38\u51fa\u7f51\u683c\u5916\u3002\u800c\u4e14\u8815\u866b\u7684\u957f\u5ea6\u4e0d\u4f1a\u77ed\u4e8e2\u4e2a\u65b9\u683c\u7684\u5927\u5c0f\u3002 \u672c\u9898\u7684\u4efb\u52a1\u662f\u7ed9\u5b9a\u7f51\u683c\uff0c\u8981\u8ba1\u7b97\u8815\u866b\u53ef\u4ee5\u5728\u591a\u5c11\u4e2a\u4e0d\u540c\u7684\u4f4d\u7f6e\u8eba\u4e0b\u7761\u89c9\u3002<\/p>\n\n\n\n

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

\u8f93\u5165\u6587\u4ef6\u7684\u7b2c1\u884c\u662f\u4e00\u4e2a\u6574\u6570t\uff0c1<=t<=11,\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u4e2a\u6570\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u7684\u7b2c1\u884c\u4e3a3\u4e2a\u6574\u6570\uff1am,n\u548ck(0<=m,n,k<=200000),\u63a5\u4e0b\u6765\u6709k\u884c\uff0c\u6bcf\u884c\u4e3a2\u4e2a\u6574\u6570\uff0c\u63cf\u8ff0\u4e86\u4e00\u5757\u77f3\u5934\u7684\u4f4d\u7f6e\uff08\u884c\u548c\u5217\uff0c\u6700\u5de6\u4e0a\u89d2\u4f4d\u7f6e\u4e3a\uff081,1\uff09\uff09\u3002<\/p>\n\n\n\n

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

\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u5360\u4e00\u884c\uff0c\u4e3a\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u8815\u866b\u53ef\u4ee5\u8eba\u7740\u7761\u89c9\u7684\u4e0d\u540c\u4f4d\u7f6e\u7684\u6570\u76ee\u3002<\/p>\n\n\n\n

\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
1
5 5 6
1 5
2 3
2 4
4 2 
4 3
5 1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
9<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u7b14\u8005\u89c9\u5f97\u8fd9\u9898\u633a\u96be\u5199\u7684\uff0c\u57fa\u672c\u601d\u8def\u5c31\u662f\u628a\u7f51\u683c\u56db\u5468\u4e00\u5708\u4e5f\u5f53\u4f5c\u77f3\u5934\uff0c\u7136\u540e\u5728\u5185\u90e8\u901a\u8fc7x\u8f74\u6392\u5e8f\u8fd8\u6709y\u8f74\u6392\u5e8f\u7684\u65b9\u5f0f\uff0c\u5206\u522b\u53bb\u653e\u8815\u866b\uff0c\u7136\u540e\u8ba1\u6570\uff0c\u867d\u7136\u5f88\u4e0d\u559c\u6b22\u8fd9\u9053\u9898\uff0c\u4f46\u662f\u597d\u50cf\u8003\u8bd5\u8003\u7684\u6982\u7387\u7279\u522b\u5927\u3010\u60b2\u3011\u613f\u8bfb\u8005\u81ea\u6c42\u591a\u798f\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\ntypedef struct stone{\n    int x;\n    int y;\n}s;\ns st[200007];\nbool cmp1(s a,s b){\n    if(a.y == b.y) return a.x < b.x;\n    return a.y < b.y;\n}\nbool cmp2(s a,s b){\n    if(a.x == b.x) return a.y < b.y;\n    return a.x < b.x;\n}\nvoid solve(){\n    int m,n,k;\n    cin >> m >> n >> k;\n    int cnt = 0;\n    for(int i = 0;i <= n + 1;i++){\n        st[cnt].x = 0,st[cnt].y = i;\n        cnt++;\n        st[cnt].x = m + 1,st[cnt].y = i;\n        cnt++;\n    }\n    for(int i = 0;i <= m + 1;i++){\n        st[cnt].x = i,st[cnt].y = 0;\n        cnt++;\n        st[cnt].x = i,st[cnt].y = n + 1;\n        cnt++;\n    }\n    for(int i = 1;i <= k;i++){\n        int x,y;\n        cin >> x >> y;\n        st[cnt].x = x,st[cnt].y = y;\n        cnt++;\n    }\n    sort(st,st + cnt,cmp1);\n    int ans = 0;\n    for(int j = 0;j < cnt - 1;j++){\n        if(st[j + 1].y == st[j].y && abs(st[j + 1].x - st[j].x) > 2){\n            ans++;\n        }\n    }\n    sort(st,st + cnt,cmp2);\n \n    for(int j = 0;j < cnt - 1;j++){\n        if(st[j + 1].x == st[j].x && abs(st[j + 1].y - st[j].y) > 2){\n            ans++;\n        }\n    }\n    cout << ans << \"\\n\";\n}\nint main(){ \n    int t;\n    cin >> t;\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
B002 \u5355\u8bcd\u91cd\u7ec4<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5728\u7f8e\u56fd\u6570\u4ee5\u767e\u4e07\u8ba1\u7684\u62a5\u7eb8\u4e2d\uff0c\u6709\u4e00\u79cd\u5355\u8bcd\u6e38\u620f\u79f0\u4e3a\u731c\u8bcd\u3002\u6e38\u620f\u7684\u76ee\u6807\u662f\u731c\u8c1c\uff0c\u4e3a\u4e86\u627e\u51fa\u7b54\u6848\u4e2d\u7f3a\u5c11\u7684\u5b57\u6bcd\uff0c\u6709\u5fc5\u8981\u5bf94\u4e2a\u5355\u8bcd\u7684\u5b57\u6bcd\u987a\u5e8f\u91cd\u65b0\u8c03\u6574\u3002\u5728\u672c\u9898\u4e2d\uff0c\u4f60\u7684\u4efb\u52a1\u662f\u7f16\u5199\u7a0b\u5e8f\u5b9e\u73b0\u5bf9\u5355\u8bcd\u4e2d\u7684\u5b57\u6bcd\u987a\u5e8f\u91cd\u65b0\u8c03\u6574\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b4\u90e8\u5206\uff1a \uff081\uff09 \u4e00\u90e8\u5b57\u5178\uff0c\u5305\u542b\u81f3\u5c111\u4e2a\u5355\u8bcd\uff0c\u81f3\u591a100\u4e2a\u5355\u8bcd\uff0c\u6bcf\u4e2a\u5355\u8bcd\u5360\u4e00\u884c\uff1b<\/p>\n\n\n\n
\uff082\uff09 \u5b57\u5178\u540e\u662f\u4e00\u884c\u5b57\u7b26\u4e32\u201cXXXXXX\u201d\uff0c\u8868\u793a\u5b57\u5178\u7ed3\u675f\uff1b<\/p>\n\n\n\n
\uff083\uff09 \u4e00\u4e2a\u6216\u591a\u4e2a\u88ab\u6253\u4e71\u5b57\u6bcd\u987a\u5e8f\u7684\u201c\u5355\u8bcd\u201d\uff0c\u6bcf\u4e2a\u5355\u8bcd\u5360\u4e00\u884c\uff0c\u4f60\u5fc5\u987b\u6574\u7406\u8fd9\u4e9b\u5b57\u6bcd\u7684\u987a\u5e8f\uff1b<\/p>\n\n\n\n
\uff084\uff09 \u8f93\u5165\u6587\u4ef6\u7684\u6700\u540e\u4e00\u6837\u4e3a\u5b57\u7b26\u4e32\u201cXXXXXX\u201d\uff0c\u4ee3\u8868\u8f93\u5165\u6587\u4ef6\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u6240\u6709\u5355\u8bcd\uff0c\u5305\u62ec\u5b57\u5178\u4e2d\u7684\u5355\u8bcd\u548c\u88ab\u6253\u4e71\u5b57\u6bcd\u987a\u5e8f\u7684\u5355\u8bcd\uff0c\u90fd\u53ea\u5305\u542b\u5c0f\u5199\u82f1\u6587\u5b57\u6bcd\uff0c\u5e76\u4e14\u81f3\u5c11\u5305\u542b\u4e00\u4e2a\u5b57\u6bcd\uff0c\u81f3\u591a\u5305\u542b6\u4e2a\u5b57\u6bcd\u3002\u5b57\u5178\u4e2d\u7684\u5355\u8bcd\u4e0d\u4e00\u5b9a\u662f\u6309\u987a\u5e8f\u6392\u5217\u7684\uff0c\u4f46\u4fdd\u8bc1\u5b57\u5178\u4e2d\u7684\u5355\u8bcd\u662f\u552f\u4e00\u7684\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u6bcf\u4e2a\u88ab\u6253\u4e71\u5b57\u6bcd\u987a\u5e8f\u7684\u5355\u8bcdw\uff0c\u6309\u5b57\u6bcd\u987a\u5e8f\u8f93\u51fa\u5b57\u5178\u4e2d\u6240\u6709\u6ee1\u8db3\u4ee5\u4e0b\u6761\u4ef6\u7684\u5355\u8bcd\u7684\u5217\u8868\uff1a\u901a\u8fc7\u8c03\u6574\u5355\u8bcdw\u4e2d\u7684\u5b57\u6bcd\u987a\u5e8f\uff0c\u53ef\u4ee5\u53d8\u6210\u5b57\u5178\u4e2d\u7684\u5355\u8bcd\u3002\u5217\u8868\u4e2d\u7684\u6bcf\u4e2a\u5355\u8bcd\u5360\u4e00\u884c\u3002\u5982\u679c\u5217\u8868\u4e3a\u7a7a\uff08\u5373\u5355\u8bcdw\u4e0d\u80fd\u8f6c\u6362\u6210\u5b57\u5178\u4e2d\u7684\u4efb\u4f55\u4e00\u4e2a\u5355\u8bcd\uff09\uff0c\u5219\u8f93\u51fa\u4e00\u884c\u5b57\u7b26\u4e32\u201cNOT A VALID WORD\u201d\u3002\u4ee5\u4e0a\u4e24\u79cd\u60c5\u5f62\u90fd\u5728\u5217\u8868\u540e\uff0c\u8f93\u51fa\u4e00\u884c\u5305\u542b6\u4e2a\u661f\u53f7\u5b57\u7b26\u7684\u5b57\u7b26\u4e32\uff0c\u8868\u793a\u5217\u8868\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
tarp
given
score
refund
only
trap
work
earn
course
pepper
part
XXXXXX
resco
nfudre
aptr
sett
oresuc
XXXXXX<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
score
******
refund
******
part
tarp
trap
******
NOT A VALID WORD
******
course
******<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u7b14\u8005\u6682\u65f6\u53ea\u80fd\u60f3\u5230\u8fd9\u79cd\u505a\u6cd5\uff0c\u5982\u679c\u6709\u66f4\u597d\u7684\u53ef\u4ee5\u5206\u4eab~<\/p>\n\n\n\n
\u7b14\u8005\u8fd9\u91cc\u662f\u7528map\u6765\u5b9e\u73b0\u7684\uff0c\u5c31\u662f\u7ed9\u6bcf\u4e2a\u5355\u8bcd\u5bf9\u5e94\u4e86\u4e00\u4e2a\u6392\u5e8f\u540e\u7684\u6620\u5c04\uff0c\u6bd4\u5982\u8fd9\u91cc\u4f1a\u8ba4\u4e3aabcd\u548cdcba\u4f1a\u6709\u76f8\u540c\u7684\u6620\u5c04\u5373abcd\u3002\u7136\u540e\u540e\u7eed\u8f93\u51fa\u5355\u8bcd\u7684\u65f6\u5019\uff0c\u9010\u4e00\u8f93\u51famap\u91cc\u76f8\u540c\u6620\u5c04\u7684\u90a3\u4e9b\u5355\u8bcd~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nmap<string,string> mp;\nint main(){\n    string s;\n    while(cin >> s){\n        if(s == \"XXXXXX\") break;\n        string str = s;\n        sort(s.begin(),s.end());\n        mp[str] = s;\n    }\n    while(cin >> s){\n        if(s == \"XXXXXX\") break;\n        int cnt = 0;\n        for (auto it = mp.begin(); it != mp.end(); ++it) {\n            \/\/ cout << it->first << \" => \" << it->second << '\\n';\n            sort(s.begin(),s.end());\n            if(it -> second == s){\n                cnt++;\n                cout << it -> first << \"\\n\";\n            }\n        }\n        if(cnt == 0){\n            cout << \"NOT A VALID WORD\\n******\\n\";\n        }else{\n            cout << \"******\\n\";\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
B003 \u82f1\u6587\u59d3\u540d\u6392\u5e8f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5728\u6c49\u8bed\u91cc\uff0c\u5bf9\u6c49\u8bed\u59d3\u540d\u53ef\u4ee5\u6309\u62fc\u97f3\u6392\u5e8f\uff0c\u4e5f\u53ef\u4ee5\u6309\u7b14\u753b\u987a\u5e8f\u6392\u5e8f\u3002\u5728\u82f1\u8bed\u91cc\uff0c\u5bf9\u82f1\u8bed\u59d3\u540d\u4e3b\u8981\u6309\u5b57\u6bcd\u987a\u5e8f\u6392\u5e8f\u3002\u672c\u9898\u8981\u6c42\u7ed9\u5b9a\u7684\u4e00\u7ec4\u82f1\u6587\u59d3\u540d\u6309\u957f\u77ed\u987a\u5e8f\u6392\u5e8f\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u591a\u4e2a\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u7684\u7b2c1\u884c\u662f\u4e00\u4e2a\u6b63\u6574\u6570N\uff080 < N < 100\uff09\uff0c\u8868\u793a\u8be5\u6d4b\u8bd5\u6570\u636e\u4e2d\u82f1\u6587\u59d3\u540d\u7684\u6570\u76ee\uff1b\u63a5\u4e0b\u6765\u6709N\u884c\uff0c\u6bcf\u884c\u4e3a\u4e00\u4e2a\u82f1\u6587\u59d3\u540d\uff0c\u59d3\u540d\u4e2d\u5141\u8bb8\u51fa\u73b0\u7684\u5b57\u7b26\u6709\u5927\u5c0f\u5199\u82f1\u6587\u5b57\u6bcd\u3001\u7a7a\u683c\u548c\u70b9\u53f7\uff08.\uff09\uff0c\u6bcf\u4e2a\u82f1\u6587\u59d3\u540d\u957f\u5ea6\u81f3\u5c11\u4e3a2\u3001\u4f46\u4e0d\u8d85\u8fc750.N=0\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u6392\u5e8f\u540e\u7684\u59d3\u540d\u3002\u6392\u5e8f\u65b9\u6cd5\u4e3a\uff1a\u5148\u6309\u59d3\u540d\u957f\u5ea6\u4ece\u957f\u5230\u77ed\u7684\u987a\u5e8f\u6392\u5e8f\uff0c\u5bf9\u957f\u5ea6\u76f8\u540c\u7684\u59d3\u540d\uff0c\u5219\u6309\u5b57\u6bcd\u987a\u5e8f\u6392\u5e8f\u3002\u6bcf2\u4e2a\u6d4b\u8bd5\u6570\u636e\u7684\u8f93\u51fa\u4e4b\u95f4\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
4
David A. Forsyth
Jean Ponce
Tom M. Mitchell
Thomas H. Cormen
0<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
David A. Forsyth
Thomas H. Cormen
Tom M. Mitchell
Jean Ponce<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u601d\u8def\u8fd8\u662f\u5f88\u7b80\u5355\u7684\uff0c\u5c31\u662f\u6392\u5e8f\uff0c\u7136\u540e\u5904\u7406\u4e00\u4e0b\u6392\u5e8f\u903b\u8f91\uff0c\u4f46\u662f\u56e0\u4e3a\u9634\u95f4\u7684\u4e00\u4e9b\u6362\u884c\u7b26\u95ee\u9898\uff0c\u8fd9\u91cc\u4e0d\u80fd\u7528getchar()\uff0c\u6240\u4ee5\u7528\u4e86getline\u53bb\u541e\u6362\u884c\u7b26\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nstring str[1000];\nbool cmp(string a,string b){\n    if(a.size() != b.size()) return a.size() > b.size();\n    return a < b;\n}\nint main(){\n    int n;\n    while(cin >> n){\n        if(!n) break;\n        string s;\n        getline(cin,s);\n        for(int i = 1;i <= n;i++){\n            getline(cin,s);\n            str[i] = s;\n        }\n        sort(str + 1,str + n + 1,cmp);\n        for(int i = 1;i <= n;i++){\n            cout << str[i] << \"\\n\";\n        }\n        cout << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
B004 DNA\u6392\u5e8f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4e00\u4e2a\u5e8f\u5217\u7684\u9006\u5e8f\u6570\u5b9a\u4e49\u4e3a\u5e8f\u5217\u4e2d\u65e0\u5e8f\u5143\u7d20\u5bf9\u7684\u6570\u76ee\u3002\u4f8b\u5982\uff0c\u5728\u5b57\u7b26\u5e8f\u5217DAABEC\u4e2d\uff0c\u9006\u5e8f\u6570\u4e3a5\uff0c\u56e0\u4e3a\u5b57\u7b26D\u6bd4\u5b83\u53f3\u8fb9\u76844\u4e2a\u5b57\u7b26\u5927\uff0c\u800c\u5b57\u7b26E\u6bd4\u5b83\u53f3\u8fb9\u76841\u4e2a\u5b57\u7b26\u5927\u3002\u5b57\u7b26\u5e8f\u5217AACEDGG\u53ea\u67091\u4e2a\u9006\u5e8f\uff0c\u5373E\u548cD,\u5b83\u51e0\u4e4e\u662f\u5df2\u7ecf\u6392\u597d\u5e8f\u7684\uff0c\u800c\u5b57\u7b26\u5e8f\u5217\u201cZWQM\u201d\u67096\u4e2a\u9006\u5e8f\uff0c\u5b83\u662f\u6700\u5927\u7a0b\u5ea6\u7684\u65e0\u5e8f\uff0c\u5373\u6709\u5e8f\u5e8f\u5217\u7684\u9006\u5e8f\u3002 \u5728\u672c\u9898\u4e2d\uff0c\u4f60\u7684\u4efb\u52a1\u662f\u5bf9DNA\u5b57\u7b26\u4e32\uff08\u53ea\u5305\u542b\u5b57\u7b26\u201cA\u201d\u3001\u201cC\u201d\uff0c\u201cG\u201d\u548c\u201cT\u201d\uff09\u8fdb\u884c\u6392\u5e8f\u3002\u6ce8\u610f\u4e0d\u662f\u6309\u7167\u5b57\u6bcd\u987a\u5e8f\uff0c\u800c\u662f\u6309\u7167\u9006\u5e8f\u6570\u4ece\u4f4e\u5230\u9ad8\u8fdb\u884c\u6392\u5e8f\uff0c\u6240\u6709\u5b57\u7b26\u4e32\u7684\u957f\u5ea6\u90fd\u4e00\u6837\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u7684\u683c\u5f0f\u4e3a\uff1a\u7b2c1\u884c\u4e3a2\u4e2a\u6574\u6570\uff0c\u6b63\u6574\u6570n(0 < n <= 50\uff0c\u8868\u793a\u5b57\u7b26\u4e32\u7684\u957f\u5ea6)\u548c\u6b63\u6574\u6570m(1 < m <= 100,\u8868\u793a\u5b57\u7b26\u4e32\u7684\u6570\u76ee)\uff1b\u7136\u540e\u662fm\u884c\uff0c\u6bcf\u4e00\u884c\u4e3a\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u957f\u5ea6\u4e3an\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u5e94\u5230\u8f93\u5165\u6587\u4ef6\u4e2d\u7684N\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e5f\u6709N\u7ec4\uff0c\u6bcf2\u7ec4\u8f93\u51fa\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\u3002\u5bf9\u6bcf\u7ec4\u8f93\u5165\u6570\u636e\uff0c\u6309\u9006\u5e8f\u6570\u4ece\u4f4e\u5230\u9ad8\u8f93\u51fa\u5404\u5b57\u7b26\u4e32\uff0c\u5982\u679c2\u4e2a\u5b57\u7b26\u4e32\u7684\u9006\u5e8f\u6570\u4e00\u884c\uff0c\u5219\u6309\u8f93\u5165\u65f6\u7684\u5148\u540e\u987a\u5e8f\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
10 5
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
CCCGGGGGGA
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u7b14\u8005\u6700\u5f00\u59cb\u8fd8\u60f3\u7740\u5206\u4e24\u4e2a\u6570\u7ec4\u8fdb\u884c\u5904\u7406\uff0c\u4f46\u662f\u540e\u9762\u53d1\u73b0\u6392\u5e8f\u5f88\u96be\u540c\u6b65\u5904\u7406\uff0c\u5e72\u8106\u5c31\u6362\u6210\u7ed3\u6784\u4f53\u6392\u5e8f\u7684\u5199\u6cd5\u4e86\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nstruct node{\n    string s;\n    int cnt = 0;\n}node[1000];\nbool cmp(struct node a,struct node b){\n    return a.cnt < b.cnt;\n}\nint main(){\n    int n,m;\n    while(cin >> n >> m){\n        for(int i = 1;i <= m;i++){\n            string s;\n            cin >> s;\n            node[i].s = s;\n            int cnt = 0;\n            for(int j = 0;j < n;j++){\n                for(int k = j + 1;k < n;k++){\n                    if(s[j] > s[k]) cnt++;\n                }\n            }\n            node[i].cnt = cnt;\n        }\n        sort(node + 1,node + m + 1,cmp);\n        for(int i = 1;i <= m;i++){\n            cout << node[i].s << \"\\n\";\n        }\n        cout << \"\\n\";\n    }\n    \n}<\/code><\/pre>\n\n\n\n
B005 \u4f53\u91cd\u6392\u5e8f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4f5c\u4e3a\u4e00\u53f0\u5f88\u53d7\u6b22\u8fce\u7684\u8131\u53e3\u79c0\u8282\u76ee\u7684\u4e3b\u6301\u4eba\uff0c\u4f60\u6b63\u5728\u505a\u4e00\u671f\u5173\u4e8e\u8282\u98df\u7684\u8282\u76ee\u3002\u4f60\u7684\u5609\u5bbe\u662fKevorkian\u535a\u58eb\u3002\u4ed6\u6700\u8fd1\u63a8\u51fa\u4e86\u4e00\u9879\u51cf\u80a5\u8ba1\u5212\u201cDo You Want To Diet?\u201d\uff0c\u8fd9\u9879\u8ba1\u5212\u5411\u5b83\u7684\u7528\u6237\u4fdd\u8bc1\u6bcf\u5929\u51cf\u80a51\u78c5\u3002 \u8282\u76ee\u5f55\u5236\u90a3\u5929\uff0c\u4f60\u51c6\u5907\u8ba9\u4e00\u4e9b\u4f7f\u7528Kevorkian\u535a\u58eb\u51cf\u80a5\u8ba1\u5212\u7684\u8282\u98df\u8005\u4e0a\u53f0\u79c0\u4e00\u4e0b\u3002\u4f60\u51c6\u5907\u6309\u4ed6\u4eec\u7684\u4f53\u91cd\u7684\u9012\u51cf\u987a\u5e8f\u6765\u5b89\u6392\u4ed6\u4eec\u51fa\u573a\u7684\u5148\u540e\u987a\u5e8f\u3002\u95ee\u9898\u662f\u4ed6\u4eec\u62a5\u540d\u65f6\u53ea\u63d0\u4f9b\u4e86\u4ee5\u4e0b\u4fe1\u606f\uff1a\u59d3\u540d\uff0c\u8282\u98df\u7684\u5929\u6570\uff0c\u8282\u98df\u524d\u7684\u4f53\u91cd\u3002\u4f60\u8981\u6839\u636e\u4ed6\u4eec\u8282\u98df\u7684\u5929\u6570\u6765\u8ba1\u7b97\u4ed6\u4eec\u73b0\u5728\u7684\u4f53\u91cd\u3002\u6240\u6709\u7684\u8282\u98df\u8005\u6bcf\u5929\u51cf\u80a51\u78c5\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b\u81f3\u591a100\u4e2a\u6d4b\u8bd5\u6570\u636e\u3002\u6d4b\u8bd5\u6570\u636e\u4e4b\u95f4\u6ca1\u6709\u7a7a\u884c\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5305\u542b3\u90e8\u5206\uff1a \u7b2c1\u884c\u4e3aSTART\uff1b \u63a5\u4e0b\u6765\u4e3a\u8282\u98df\u8005\u5217\u8868\uff1a\u5305\u542b110\u884c\uff0c\u6bcf\u884c\u63cf\u8ff0\u4e00\u540d\u8282\u98df\u8005\uff0c\u5305\u62ec\u59d3\u540d\u3001\u8282\u98df\u7684\u5929\u6570\u548c\u8282\u98df\u524d\u7684\u4f53\u91cd\u3002\u5176\u4e2d\u59d3\u540d\u4e3a1<\/sub>20\u4e2a\u6570\u5b57\u3001\u5b57\u6bcd\u5b57\u7b26\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\uff1b\u8282\u98df\u7684\u5929\u6570\u4e0d\u8d85\u8fc71000\u5929\uff1b\u8282\u98df\u524d\u7684\u4f53\u91cd\u4e0d\u8d85\u8fc710,000\u3002 \u6700\u540e\u4e00\u884c\u4e3aEND\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u6839\u636e\u5404\u8282\u98df\u8005\u73b0\u5728\u4f53\u91cd\u7684\u9012\u51cf\u987a\u5e8f\u5217\u51fa\u8282\u98df\u8005\u7684\u540d\u5b57\uff0c\u6bcf\u4e2a\u8282\u98df\u8005\u7684\u540d\u5b57\u5360\u4e00\u884c\u3002\u6bcf2\u4e2a\u6d4b\u8bd5\u6570\u636e\u7684\u8f93\u51fa\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
START
Joe 10 110
END
START
James 100 150
Laura 100 140
Hershey 100 130
END<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
Joe
\u200b
James
Laura
Hershey<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9898\u4e3b\u8981\u662f\u5904\u7406START\u548cEND\u6709\u70b9\u9ebb\u70e6\uff0c\u53ef\u4ee5\u53c2\u8003\u7b14\u8005\u8fd9\u91cc\u7684\u505a\u6cd5~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nstruct node{\n    string name;\n    int day = 0;\n    int w = 0;\n}node[10000];\nbool cmp(struct node a,struct node b){\n    return a.w - a.day > b.w - b.day;\n}\nint main(){\n    string start;\n    string end;\n    while(cin >> start){\n        int cnt = 0;\n        string name;\n        int day = 0;\n        int w = 0;\n        while(cin >> name){\n            if(name == \"END\") break;\n            cin >> day >> w;\n            cnt++;\n            node[cnt].name = name;\n            node[cnt].day = day;\n            node[cnt].w = w;\n        }\n        sort(node + 1,node + cnt + 1,cmp);\n        for(int i = 1;i <= cnt;i++){\n            cout << node[i].name << \"\\n\";\n        }\n        cout << \"\\n\";\n    }\n}<\/code><\/pre>\n\n\n\n
B006 \u4fc4\u7f57\u65af\u5957\u5a03<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4fc4\u7f57\u65af\u5957\u5a03\u5927\u5bb6\u5e94\u8be5\u90fd\u73a9\u8fc7\u3002\u662f\u4e00\u4e2a\u6309\u7167\u5927\u5c0f\u987a\u5e8f\u53ef\u4ee5\u5d4c\u5957\u5728\u4e00\u8d77\u7684\u73a9\u5177\u3002\u73b0\u5728\u6709\u4e00\u4e2a\u88ab\u62c6\u5f00\u7684\u4fc4\u7f57\u65af\u5957\u5a03\u6446\u5230\u4e86\u4f60\u7684\u597d\u53cb\u9762\u524d\uff0c\u4f46\u662f\uff0c\u8981\u60f3\u628a\u5b83\u91cd\u65b0\u53d8\u6210\u4e00\u4e2a\u5a03\u5a03\uff0c\u5fc5\u987b\u8981\u6ee1\u8db3\u8fd9\u6837\u7684\u89c4\u5219\uff1a 1.\u5a03\u5a03\u7684\u5927\u5c0f\u5fc5\u987b\u662f\u4ece\u5c0f\u5230\u5927\u6392\u5217\u597d\u7684\u3002 2.\u4f60\u6bcf\u6b21\u53ea\u53ef\u4ee5\u4ea4\u6362\u76f8\u90bb\u7684\u4e24\u4e2a\u5a03\u5a03\u3002 \u8fd9\u6837\u7684\u89c4\u5219\u4f7f\u4f60\u7684\u597d\u53cb\u53d8\u5f97\u5f88\u70e6\u8e81\uff0c\u5047\u8bbe\u5a03\u5a03\u7684\u4e2a\u6570\u4e3an\uff0c\u5982\u679c\u4ea4\u6362\u5a03\u5a03\u7684\u6b21\u6570\u8d85\u8fc7n*(n – 1) \/ 2 – 1\u6b21\uff0c\u90a3\u4e48\u4f60\u7684\u597d\u53cb\u5c31\u4f1a\u70e7\u6389\u8fd9\u4e9b\u5a03\u5a03\u3002\u4f46\u662f\u5979\u5f88\u73cd\u60dc\u8fd9\u4e9b\u5a03\u5a03\u3002\u73b0\u5728\u5979\u5411\u4f60\u8be2\u95ee\uff0c\u5979\u662f\u5426\u4e0d\u4f1a\u70e7\u6389\u8fd9\u4e2a\u4fc4\u7f57\u65af\u5957\u5a03\uff1f<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u4e00\u4e2a\u6574\u6570n(n <= 1000) \u63a5\u4e0b\u6765n\u4e2a\u6570Si\uff0cSi\u8868\u793a\u5f53\u524d\u4f4d\u7f6e\u5a03\u5a03\u5927\u5c0f\u3002\uff08Si\u4e0d\u4e00\u5b9a\u5c0f\u4e8en\uff09\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5982\u679c\u597d\u53cb\u4e0d\u4f1a\u70e7\u6389\u5a03\u5a03\u8f93\u51fa”YES”\uff08\u6ca1\u6709\u5f15\u53f7\uff09\uff0c\u53cd\u4e4b\u8f93\u51fa”NO”\uff08\u6ca1\u6709\u5f15\u53f7\uff09\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
6
6 5 4 3 2 1<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
NO<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u7b14\u8005\u6700\u5f00\u59cb\u60f3\u5f97\u4e71\u4e03\u516b\u7cdf\u7684\uff0c\u7ed3\u679c\u66b4\u529b\u6392\u5e8f\u5c31\u53ef\u4ee5\u4e86hhh<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint s[1000];\nint main(){\n    int n;\n    cin >> n;\n    for(int i = 0;i < n;i++){\n        cin >> s[i];\n    }\n    int cnt = 0;\n    for(int i = 0;i < n - 1;i++){\n        for(int j = 0;j < n - 1- i;j++){\n            if(s[j] > s[j + 1]){\n                int temp = s[j];\n                s[j] = s[j + 1];\n                s[j + 1] = temp;\n                cnt++;\n            }\n        }\n    }\n    cout << ((cnt > n * (n - 1) \/ 2 - 1) ? \"NO\\n\" : \"YES\\n\");\n}<\/code><\/pre>\n\n\n\n
B007 \u7ec4\u5408\u6570\u5b57<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u73b0\u5728\u7ed9\u4f60n\u4e2a\u6b63\u6574\u6570\uff0ca1\uff0ca2\uff0ca3……..an\uff0c\u8bf7\u4f60\u628a\u5b83\u4eec\u9996\u5c3e\u8fde\u63a5\u5230\u4e00\u8d77\uff0c\u7ec4\u6210\u4e00\u4e2a\u6700\u5c0f\u7684\u6b63\u6574\u6570\uff08\u53ef\u80fd\u4f1a\u8d85\u51falong long\uff09\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c\u4e00\u884c\u6709\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u6570\u5b57\u4e2a\u6570 n\u3002 \u7b2c\u4e8c\u884c\u6709 n \u4e2a\u6574\u6570\uff0c\u8868\u793a\u7ed9\u51fa\u7684 n \u4e2a\u6574\u6570 ai\uff081 <= n <= 20\uff0c1 <= ai <= 1e9\uff09\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u8868\u793a\u6700\u5c0f\u7684\u6574\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
3
13 312 343<\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
13312343<\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5f88\u7ecf\u5178\u7684\u5b57\u7b26\u4e32\u62fc\u63a5\u6bd4\u8f83\u7684\u65b9\u6cd5\u5c31\u662f<\/p>\n\n\n\n
bool cmp(string a,string b){\n    return a + b < b + a;\n}<\/code><\/pre>\n\n\n\n
\u4e00\u5b9a\u8981\u7406\u89e3\u54e6~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nstring a[1000];\nbool cmp(string a,string b){\n    return a + b < b + a;\n}\nint main(){\n    int n;\n    cin >> n;\n    for(int i = 1;i <= n;i++){\n        cin >> a[i];\n    }\n    sort(a + 1,a + n + 1,cmp);\n    for(int i = 1;i <= n;i++){\n        cout << a[i];\n    }\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u524d\u8a00 \u4e0d\u592a\u597d\u5199\u7684\u4e00\u7ae0\u8282~\u613f\u8bfb\u8005\u5145\u6ee1\u8010\u5fc3\u5730\u5b66\u4e60\u6bcf\u4e00\u9053\u9898\uff0c\u5982\u679c\u662f\u9762\u5bf9\u5c0f\u6d4b\uff0c\u53ef\u4ee5\u63d0\u524d\u51c6\u5907\u4e00\u4e0b\uff0c\u56e0\u4e3a\u8fd9\u4e00\u7ae0\u4e0d\u592a\u5bb9\u6613\u5728\u521d […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,18],"tags":[],"class_list":["post-310","post","type-post","status-publish","format-standard","hentry","category-nenuoj-2","category-18"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/310","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=310"}],"version-history":[{"count":2,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/310\/revisions"}],"predecessor-version":[{"id":312,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/310\/revisions\/312"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=310"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=310"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=310"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}