{"id":173,"date":"2024-02-14T15:52:10","date_gmt":"2024-02-14T07:52:10","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=173"},"modified":"2024-04-02T20:43:22","modified_gmt":"2024-04-02T12:43:22","slug":"nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%951%e7%ac%ac4%e7%ab%a0","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/02\/14\/nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%951%e7%ac%ac4%e7%ab%a0\/","title":{"rendered":"NENUOJ \u4e4b \u7b97\u6cd51\u7b2c4\u7ae0"},"content":{"rendered":"\n

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

\u4e0d\u662f\u6bcf\u4e00\u9053\u9898\u90fd\u6709\u601d\u8def\u89e3\u91ca\uff0c\u6ca1\u6709\u601d\u8def\u89e3\u91ca\u7684\u9898\u76ee\u8bf4\u660e\u53ea\u662f\u7b80\u5355\u7684\u6a21\u62df\uff0c\u4e0d\u9700\u8981\u591a\u4f59\u7684\u8bb2\u89e3\u3002<\/p>\n<\/blockquote>\n\n\n\n

4001 HTML\u89e3\u6790<\/a><\/h2>\n\n\n\n
\n

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

\u5982\u679c\u4f60\u5728\u4e00\u53f0\u6ca1\u6709\u5b89\u88c5Netscape\u6d4f\u89c8\u5668\u7684Macintosh\u673a\u5668\u4e0a\uff0c\u8bd5\u7740\u9605\u8bfb\u4e00\u4e2ahtml\u6587\u6863\uff0c\u90a3\u662f\u4ef6\u975e\u5e38\u56f0\u96be\u7684\u4e8b\u60c5\u3002 \u4f60\u7684\u4efb\u52a1\u662f\u8981\u7f16\u7a0b\u5b9e\u73b0\u4e00\u4e2a\u5c0f\u7684html\u6d4f\u89c8\u5668\u3002\u8981\u6c42\u663e\u793a\u8f93\u5165\u6587\u4ef6\u7684\u5185\u5bb9\uff0c\u4f60\u9700\u8981\u77e5\u9053html\u7684\u6807\u7b7e\uff1a \u8868\u793a\u6362\u884c\uff0c<hr>\u8868\u793a\u6c34\u5e73\u7ebf\uff0c\u53e6\u5916\u8fd8\u6709\u5236\u8868\u7b26\uff0c\u7a7a\u683c\u548c\u6362\u884c\u7b26\u3002\u6bcf\u884c\u4e0d\u8d85\u8fc780\u4e2a\u5b57\u7b26\u3002<\/p>\n\n\n\n

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

\u8f93\u5165\u5305\u62ec\u4e00\u4e2a\u4f60\u8981\u663e\u793a\u7684\u5185\u5bb9\u6587\u672c\u3002\u8fd9\u4e2a\u6587\u672c\u5305\u62ec\u4e00\u4e9b\u5355\u8bcd\u548cHTML\u6807\u7b7e\uff0c\u5b83\u4eec\u7531\u4e00\u4e2a\u6216\u591a\u4e2a\u7a7a\u683c\u3001\u5236\u8868\u7b26\u6216\u6362\u884c\u7b26\u5206\u5272\u5f00\u7684\u3002 \u4e00\u4e2a\u5355\u8bcd\u662f\u6307\u75310\u4e2a\u6216\u591a\u4e2a\u5b57\u6bcd\u3001\u6570\u5b57\u548c\u6807\u70b9\u7b26\u53f7\u7ec4\u6210\u7684\u4e00\u4e2a\u5e8f\u5217\u3002\u4f8b\u5982\uff0cabc,123 \u662f\u4e00\u4e2a\u8bcd\uff0c\u4f46\u662fabc, 123\u662f\u4e24\u4e2a\u8bcd\uff0c\u5373abc, and 123\uff08\u5373\u4ee5\u7a7a\u683c\u4f5c\u4e3a\u5355\u8bcd\u7684\u5206\u9694\u7b26\uff09\u3002\u4e00\u4e2a\u8bcd\u4e0d\u4f1a\u8d85\u8fc781\u4e2a\u5b57\u7b26\uff0c\u800c\u4e14\u4e0d\u4f1a\u5305\u542b\u4efb\u4f55<\u6216>\u7b26\u53f7\u3002\u6240\u6709\u7684HTML\u6807\u7b7e\u4e0d\u662fbr\u5c31\u662fhr\u3002<\/p>\n\n\n\n

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

\u4f60\u5e94\u8be5\u6309\u7167\u5982\u4e0b\u89c4\u5219\u6765\u663e\u793a\u8f93\u5165\u7684\u6587\u672c\uff1a \uff081\uff09 \u5982\u679c\u4f60\u8bfb\u5165\u7684\u8bcd\uff0c\u7ed3\u679c\u884c\u6ca1\u6709\u8d85\u8fc780\u4e2a\u5b57\u7b26\uff0c\u90a3\u4e48\u5c31\u663e\u793a\u5b83\uff0c\u5426\u5219\u6362\u884c\u663e\u793a\u3002 \uff082\uff09 \u5982\u679c\u4f60\u8bfb\u5165 \u6807\u7b7e\uff0c\u5219\u5f00\u59cb\u4e00\u4e2a\u65b0\u884c\u3002 \uff083\uff09 \u5982\u679c\u4f60\u8bfb\u5165<hr>\u6807\u7b7e\uff0c\u5219\u8981\u5728\u65b0\u4e00\u884c\u4e2d\u663e\u793a80\u4e2a\u2018-\u2019\u5b57\u7b26\u3002 \uff084\uff09 \u6700\u540e\u4ee5\u4e00\u4e2a\u6362\u884c\u4f5c\u4e3a\u7ed3\u675f\u3002<\/p>\n\n\n\n

\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n

 Hallo, dies ist eine
 ziemlich lange Zeile, die in Html
 aber nicht umgebrochen wird.
 <br>
 Zwei <br> <br> produzieren zwei Newlines.
 Es gibt auch noch das tag <hr> was einen Trenner darstellt.
 Zwei <hr> <hr> produzieren zwei Horizontal Rulers.
 Achtung       mehrere Leerzeichen irritieren
 \u200b
 Html genauso wenig wie
 \u200b
 \u200b
 mehrere Leerzeilen.<\/p>\n\n\n\n

\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n

 Hallo, dies ist eine ziemlich lange Zeile, die in Html aber nicht umgebrochen
 wird.
 Zwei
 \u200b
 produzieren zwei Newlines. Es gibt auch noch das tag
 ——————————————————————————–
 was einen Trenner darstellt. Zwei
 ——————————————————————————–
 ——————————————————————————–
 produzieren zwei Horizontal Rulers. Achtung mehrere Leerzeichen irritieren Html
 genauso wenig wie mehrere Leerzeilen.<\/p>\n<\/blockquote>\n\n\n\n

\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n\n\tchar s[10000];\n\tint count = 0;\n\tint flag = 0;\n\/\/\tfreopen(\"4001.txt\",\"r\",stdin);\n\twhile(~scanf(\"%s\",s)){\n\n\t\tint temp = strlen(s);\n\t\tcount += temp + 1;\n\t\tif(count > 80){\n\t\t\tprintf(\"\\n\");\n\t\t\tcount = 0;\n\t\t\tflag = 1;\n\t\t}\n\t\t\n\t\tif(strcmp(s,\"<br>\")==0&&flag==0){\n\t\t\tprintf(\"\\n\");\n\t\t\tcount = 0; \n\t\t\tflag = 1;\n\t\t}else if(strcmp(s,\"<br>\")==0&&flag==1){\n\t\t\tprintf(\"\\n\");\n\t\t\tcount = 0; \n\t\t\tflag = 1;\n\t\t}\n\t\telse if(strcmp(s,\"<hr>\")==0&&flag==0){\n\t\t    printf(\"\\n--------------------------------------------------------------------------------\\n\");\n\t\t\tcount = 0;\t\t\n\t\t\tflag = 1;\n\t\t}else if(strcmp(s,\"<hr>\")==0&&flag==1){\n\t\t    printf(\"--------------------------------------------------------------------------------\\n\");\n\t\t\tcount = 0;\t\t\n\t\t\tflag = 1;\n\t\t}else{\n\t\t\tprintf(\"%s \",s);\n\t\t\tflag = 0;\n\t\t}\n\t\t\n\n\n\t}\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
4002 \u6309\u9519\u952e<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4e00\u79cd\u5e38\u89c1\u7684\u6253\u5b57\u9519\u8bef\u662f\u5c06\u624b\u653e\u5728\u952e\u76d8\u4e0a\u6b63\u786e\u4f4d\u7f6e\u7684\u53f3\u4fa7\u76f8\u90bb\u7684\u4e00\u4f4d\uff0c\u5982\u4e0b\u56fe\u6240\u793a\uff1a<\/p>\n\n\n\n
\"4002.png\"<\/div><\/figure>\n\n\n\n
\u952e\u76d8\u793a\u610f\u56fe<\/p>\n\n\n\n
\u4f8b\u5982\uff0c\u952e\u5165\u201cQ\u201d\u5374\u6309\u6210\u4e86\u201cW\u201d\uff0c\u201cJ\u201d\u88ab\u6309\u6210\u201cK\u201d\uff0c\u8981\u6c42\u4f60\u7f16\u7a0b\u5bf9\u7ea0\u6b63\u4e0a\u8ff0\u7684\u9519\u8bef<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b\u591a\u884c\uff0c\u6bcf\u884c\u53ef\u80fd\u4f1a\u5305\u542b\u6570\u5b57\u3001\u7a7a\u683c\u3001\u5927\u5199\u5b57\u6bcd\uff08\u4e0d\u5305\u62ec\u201cA\u201d\u3001\u201cZ\u201d\u3001\u201cQ\u201d\uff09\u548c\u6807\u70b9\u7b26\u53f7\uff08\u4e0d\u5305\u62ec\u5355\u5f15\u53f7\u201c\u2019\u201d\uff09\u3002\u6240\u6709\u6807\u8bb0\u4e86\u5355\u8bcd\u7684\u6309\u952e\u4e0d\u4e0d\u5305\u62ec\u5728\u5185\uff0c\u5982Tab\u3001BackSpace\u3001Control\u7b49\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5c06\u6bcf\u4e2a\u5b57\u6bcd\u6216\u6807\u70b9\u7b26\u53f7\u7528\u5b83\u5de6\u8fb9\u7684\u7b26\u53f7\u66ff\u6362\uff0c\u8f93\u5165\u4e2d\u7684\u7a7a\u683c\u6309\u539f\u6837\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 O S,GOMR YPFSU\/
 234567890-=WERTYYUIOP[]<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 I AMFINE TODAY.
 1234567890-QWERTTYUIOP[<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u4e4d\u4e00\u770b\u662f\u4e0d\u662f\u6ca1\u4ec0\u4e48\u60f3\u6cd5\uff0c\u5176\u5b9e\u5c31\u662f\u5148\u628a\u952e\u76d8\u4e0a\u6309\u952e\u5b58\u50a8\u4e0b\u6765\uff0c\u4e4b\u540e\u67e5\u8868\u5c31\u53ef\u4ee5\u4e86\u3002\u6ce8\u610f\u683c\u5f0f\uff0c\u5904\u7406\u65b9\u5f0f\u7528fgets\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n int main(){\n     char str[] = {\"`1234567890-=QWERTYUIOP[]ASDFGHJKL;'ZXCVBNM,.\/\"};\n     char s[2000];\n     int length = strlen(str);\n     while(fgets(s,sizeof(s),stdin)){\n         int len = strlen(s);\n         for(int i = 0;i < len;i++){\n             if(s[i] == ' '){\n                 printf(\" \");\n                 continue;\n            }\n             for(int j = 0;j < length;j++){\n                 if(s[i] == str[j]){\n                     printf(\"%c\",str[j - 1]);\n                     break;\n                }\n            }\n        }\n         printf(\"\\n\");\n    }\n }<\/code><\/pre>\n\n\n\n
4003 \u5b57\u7b26\u4e32\u7edf\u8ba1<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5bf9\u4e8e\u7ed9\u5b9a\u7684\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u7edf\u8ba1\u5176\u4e2d\u6570\u5b57\u5b57\u7b26\u51fa\u73b0\u7684\u6b21\u6570\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6570\u636e\u6709\u591a\u884c\uff0c\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6b63\u6574\u6570n\uff0c\u8868\u793a\u6d4b\u8bd5\u5b9e\u4f8b\u7684\u4e2a\u6570\uff0c\u540e\u9762\u8ddf\u7740n\u884c\uff0c\u6bcf\u884c\u5305\u62ec\u4e00\u4e2a\u7531\u5b57\u6bcd\u548c\u6570\u5b57\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u6d4b\u8bd5\u5b9e\u4f8b\uff0c\u8f93\u51fa\u8be5\u4e32\u4e2d\u6570\u503c\u7684\u4e2a\u6570\uff0c\u6bcf\u4e2a\u8f93\u51fa\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2
 asdfasdf123123asdfasdf
 asdf111111111asdfasdfasdf<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 6
 9<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n int main(){\n     int n;\n     char str[10000];\n     scanf(\"%d\",&n);\n     for(int t = 1;t <= n;t++){\n         scanf(\"%s\",str);\n         int cnt = 0;\n         int len = strlen(str);\n         for(int i = 0;i < len;i++){\n             if(str[i] >= '0' && str[i] <= '9'){\n                 cnt++;\n            }\n        }\n         printf(\"%d\\n\",cnt);\n    }\n\n }<\/code><\/pre>\n\n\n\n
4004 \u5f00\u95e8\u4eba\u548c\u5173\u95e8\u4eba<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6bcf\u5929\u7b2c\u4e00\u4e2a\u5230\u673a\u623f\u7684\u4eba\u8981\u628a\u95e8\u6253\u5f00\uff0c\u6700\u540e\u4e00\u4e2a\u79bb\u5f00\u7684\u4eba\u8981\u628a\u95e8\u5173\u597d\u3002\u73b0\u6709\u4e00\u5806\u6742\u4e71\u7684\u673a\u623f\u7b7e\u5230\u3001\u7b7e\u79bb\u8bb0\u5f55\uff0c\u8bf7\u6839\u636e\u8bb0\u5f55\u627e\u51fa\u5f53\u5929\u5f00\u95e8\u548c\u5173\u95e8\u7684\u4eba\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u6d4b\u8bd5\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u7ed9\u51fa\u8bb0\u5f55\u7684\u603b\u5929\u6570N (N > 0 )\u3002\u4e0b\u9762\u5217\u51fa\u4e86N\u5929\u7684\u8bb0\u5f55\u3002\u6bcf\u5929\u7684\u8bb0\u5f55\u5728\u7b2c\u4e00\u884c\u7ed9\u51fa\u8bb0\u5f55\u7684\u6761\u76ee\u6570M ( M > 0 )\uff0c\u4e0b\u9762\u662fM\u884c\uff0c\u6bcf\u884c\u7684\u683c\u5f0f\u4e3a\uff1a \u8bc1\u4ef6\u53f7\u7801 \u7b7e\u5230\u65f6\u95f4 \u7b7e\u79bb\u65f6\u95f4 \u5176\u4e2d\u65f6\u95f4\u6309\u201c\u5c0f\u65f6:\u5206\u949f:\u79d2\u949f\u201d\uff08\u5404\u53602\u4f4d\uff09\u7ed9\u51fa\uff0c\u8bc1\u4ef6\u53f7\u7801\u662f\u957f\u5ea6\u4e0d\u8d85\u8fc715\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e00\u5929\u7684\u8bb0\u5f55\u8f93\u51fa1\u884c\uff0c\u5373\u5f53\u5929\u5f00\u95e8\u548c\u5173\u95e8\u4eba\u7684\u8bc1\u4ef6\u53f7\u7801\uff0c\u4e2d\u95f4\u75281\u7a7a\u683c\u5206\u9694\u3002 \u6ce8\u610f\uff1a\u5728\u88c1\u5224\u7684\u6807\u51c6\u6d4b\u8bd5\u8f93\u5165\u4e2d\uff0c\u6240\u6709\u8bb0\u5f55\u4fdd\u8bc1\u5b8c\u6574\uff0c\u6bcf\u4e2a\u4eba\u7684\u7b7e\u5230\u65f6\u95f4\u5728\u7b7e\u79bb\u65f6\u95f4\u4e4b\u524d\uff0c\u4e14\u6ca1\u6709\u591a\u4eba\u540c\u65f6\u7b7e\u5230\u6216\u8005\u7b7e\u79bb\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
3
1
ME3021112225321 00:00:00 23:59:59
2
EE301218 08:05:35 20:56:35
MA301134 12:35:45 21:40:42
3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
ME3021112225321 ME3021112225321
EE301218 MA301134
SC3021234 CS301133<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n int main(){\n\n     int n;\n     char name[101];\n     char st[10000];\n     char en[10000];\n     scanf(\"%d\",&n);\n     while(n--){\n         int m;\n         int i = 0;\n         int j = 0;\n         int h;\n         int s;\n         int start;\n         int mini,minn = 1e9;\n         int end,maxx = -1;\n         scanf(\"%d\",&m);\n         for(i = 0;i < m;i++){\n\n             scanf(\"%s %d:%d:%d\",name,&h,&mini,&s);\n             start = h * 3600 + mini * 60 + s;\n             if(start < minn){\n                 minn = start;\n                 strcpy(st,name);\n            }\n             scanf(\"%d:%d:%d\",&h,&mini,&s);\n             end = h * 3600 + mini * 60 + s;\n             if(end > maxx){\n                 maxx = end;\n                 strcpy(en,name);\n            }\n        }\n\n     printf(\"%s %s\\n\",st,en);\n }\n     return 0;\n }<\/code><\/pre>\n\n\n\n
4005 \u770b\u548c\u8bf4<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u770b\u548c\u8bf4\u7684\u987a\u5e8f\u5b9a\u4e49\u5982\u4e0b\uff1a\u4efb\u4f55\u4e00\u4e2a\u5b57\u7b26\u4e32\u90fd\u662f\u4ee5\u6570\u5b57\u5f00\u5934\uff0c\u6bcf\u4e2a\u968f\u540e\u7684\u5143\u7d20\u90fd\u662f\u88ab\u524d\u4e00\u4e2a\u5143\u7d20\u91cd\u65b0\u5b9a\u4e49\u3002\u4f8b\u5982\uff0c\u5b57\u7b26\u4e32\u201c122344111\u201d\u53ef\u4ee5\u88ab\u63cf\u8ff0\u4e3a\u201c1\u4e2a1\uff0c\u4e24\u4e2a2\uff0c1\u4e2a3\uff0c2\u4e2a4\u548c3\u4e2a1\u201d\u3002\u56e0\u6b64\uff0c122344111\u4ee5\u5e8f\u5217\u7684\u5f62\u5f0f\u8868\u793a\u51fa\u6765\u5c31\u662f1122132431\u3002\u540c\u7406\uff0c101\u5c31\u8868\u793a1111111111\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u62ec\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570\uff0c\u7136\u540e\u4f9d\u6b21\u4e3a\u76f8\u5e94\u7684\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u4e2a\u6570\u636e\u5360\u4e00\u884c\uff0c\u4e0d\u4f1a\u8d85\u8fc71000\u4f4d\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u5bf9\u5e94\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 3
 122344111
 1111111111
 12345<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 1122132431
 101
 1112131415<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>
#include <string.h><\/p>\n\n\n\n
#include <stdio.h>\n#include <string.h> \n\nint main(){\n\t\n\tchar str[1005];\n\tint n;\n\tscanf(\"%d\",&n);\n\twhile(n--){\n\t\tint count = 1;\n\t\tint i,j;\n\t\tscanf(\"%s\",str);\n\t\tint len = strlen(str);\n\t\tfor(i = 0;i < len;i++){\n\t\t\tif(str[i]!=str[i+1]){\n\t\t\t\tprintf(\"%d%d\",count,str[i]-'0');\n\t\t\t\tcount = 1;\n\t\t\t}else{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tprintf(\"\\n\");\n\n\t}\n\t\n\n\treturn 0;\n} <\/code><\/pre>\n\n\n\n
}<\/p>\n\n\n\n
return 0;
}<\/p>\n\n\n\n
4006 A+B\u95ee\u9898<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e24\u4e2a\u6574\u6570A\u548cB\uff0c\u5176\u8868\u793a\u5f62\u5f0f\u662f\uff1a\u4ece\u4e2a\u4f4d\u5f00\u59cb\uff0c\u6bcf\u4e09\u4f4d\u6570\u7528\u9017\u53f7,\u9694\u5f00\u3002 \u73b0\u5728\u8bf7\u8ba1\u7b97A+B\u7684\u7ed3\u679c\uff0c\u5e76\u4ee5\u6b63\u5e38\u5f62\u5f0f\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u591a\u7ec4\u6570\u636e\uff0c\u6bcf\u7ec4\u6570\u636e\u5360\u4e00\u884c\uff0c\u7531\u4e24\u4e2a\u6574\u6570A\u548cB\u7ec4\u6210\uff08-109 < A,B < 109\uff09\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8bf7\u8ba1\u7b97A+B\u7684\u7ed3\u679c\uff0c\u5e76\u4ee5\u6b63\u5e38\u5f62\u5f0f\u8f93\u51fa\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
-234,567,890 123,456,789
1,234 2,345,678<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
-111111101
2346912<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u4e00\u4f4d\u4e00\u4f4d\u5904\u7406\uff0c\u6bcf\u6b21\u5230\u4e0b\u4e00\u4f4d\u5c31\u4e58\u4ee510\uff0c\u8d1f\u53f7\u7684\u5904\u7406\u7528\u4e00\u4e2a\u53d8\u91cf\u8bb0\u5f55\u5373\u53ef\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n    char a[1000],b[1000];\n    while(~scanf(\"%s %s\",a,b)){\n        int len1 = strlen(a);\n        int len2 = strlen(b);\n        long long sum1 = 0,sum2 = 0;\n        int flag = 0;\n        for(int i = 0;i < len1;i++){\n            if(a[i] == '-'){\n                flag = 1;\n                continue;\n            }\n            if(a[i] != ',') {\n                sum1 += a[i] - '0';\n                sum1 *= 10;\n            }\n        }\n        sum1 \/= 10;\n        if(flag) sum1 = -sum1;\n        flag = 0;\n        for(int i = 0;i < len2;i++){\n            if(b[i] == '-'){\n                flag = 1;\n                continue;\n            }\n            if(b[i] != ',') {\n                sum2 += b[i] - '0';\n                sum2 *= 10;\n            }\n        }\n        sum2 \/= 10;\n        if(flag) sum2 = -sum2;\n        flag = 0;\n        long long sum = sum1 + sum2;\n        printf(\"%lld\\n\",sum);\n    }\n}<\/code><\/pre>\n\n\n\n
4007 \u5706\u62ec\u53f7\u7f16\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4ee4S=s1 s2 \u2026sn\u662f\u4e00\u4e2a\u89c4\u5219\u7684\u5706\u62ec\u53f7\u5b57\u7b26\u4e32\u3002S\u4ee52\u79cd\u4e0d\u540c\u5f62\u5f0f\u7f16\u7801\uff1a \uff081\uff09\u7528\u4e00\u4e2a\u6574\u6570\u5e8f\u5217P=p1 p2 \u2026 pn\u7f16\u7801\uff0cpi\u4ee3\u8868\u5728S\u4e2d\u7b2ci\u4e2a\u53f3\u5706\u62ec\u53f7\u7684\u5de6\u5706\u62ec\u53f7\u6570\u91cf\u3002\uff08\u8bb0\u4e3aP-\u5e8f\u5217\uff09 \uff082\uff09\u7528\u4e00\u4e2a\u6574\u6570\u5e8f\u5217W=w1 w2 \u2026 wn\u7f16\u7801\uff0c\u5bf9\u6bcf\u4e00\u4e2a\u53f3\u5706\u62ec\u53f7a\uff0c\u4ece\u4e0e\u4e4b\u5339\u914d\u7684\u5de6\u5706\u62ec\u53f7\u5f00\u59cb\u5230a\u4e4b\u95f4\u7684\u53f3\u5706\u62ec\u53f7\u7684\u6570\u76ee\u7528wi\u8868\u793a\u3002\uff08\u8bb0\u4e3aW-\u5e8f\u5217\uff09 \u4f8b\u5982\uff1a S\u4e3a\uff1a(((()()()))) P-\u5e8f\u5217 4 5 6 6 6 6 W-\u5e8f\u5217 1 1 1 4 5 6 \u7f16\u7a0b\u628a\u4e00\u4e2a\u5706\u62ec\u53f7\u4e32S\u7684P-\u5e8f\u5217\u8f6c\u5316\u4e3aW-\u5e8f\u5217\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570t\uff081 <= t <= 10\uff09\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570\u3002\u63a5\u4e0b\u6765\u662f\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u7684\u7b2c1\u884c\u662f\u4e00\u4e2a\u6574\u6570n\uff081 <= n <= 20\uff09\uff0c\u7b2c2\u884c\u662f\u4e00\u4e2a\u5706\u62ec\u53f7\u4e32\u7684P-\u5e8f\u5217\uff0c\u5305\u542bn\u4e2a\u6b63\u6574\u6570\uff0c\u4ee5\u7a7a\u683c\u9694\u5f00\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fat\u884c\uff0c\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u6240\u8868\u793a\u7684P-\u5e8f\u5217\uff0c\u8f93\u51fa\u5bf9\u5e94\u7684W-\u5e8f\u5217\uff0c\u5360\u4e00\u884c\uff0c\u5305\u542bn\u4e2a\u6574\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
3
5
4 5 5 5 5
6
4 5 6 6 6 6
9
4 6 6 6 6 8 9 9 9<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
1 1 3 4 5
1 1 1 4 5 6
1 1 2 4 5 1 1 3 9<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5b9e\u73b0\u8d77\u6765\u633a\u9ebb\u70e6\u7684\u3002\u601d\u8def\u5c31\u662f\u5148\u628aP-\u5e8f\u5217\u8f6c\u6362\u6210S\u5706\u62ec\u53f7\u5b57\u7b26\u4e32\uff0c\u518d\u628aS\u5b57\u7b26\u4e32\u8f6c\u6362\u6210W-\u5e8f\u5217\u3002<\/p>\n\n\n\n
\u7b2c\u4e00\u90e8\u5206\u3010\u628aP-\u5e8f\u5217\u8f6c\u6362\u6210S\u5706\u62ec\u53f7\u5b57\u7b26\u4e32\u3011\uff0c\u5c31\u662f\u5148\u8bfb\u5165P-\u5e8f\u5217\uff0c\u7136\u540e\u6211\u4eec\u77e5\u9053\u4e86\u7b2c i \u4e2a\u53f3\u62ec\u53f7\u5de6\u8fb9\u6709\u591a\u5c11\u4e2a\u5de6\u62ec\u53f7\uff0c\u6240\u4ee5\u5c31\u7528\u4e2a\u5b57\u7b26\u6570\u7ec4\uff0c\u628a\u5de6\u62ec\u53f7\u653e\u4e0a\uff0c\u5047\u8bbe\u7b2c5\u4e2a\u53f3\u62ec\u53f7\u5de6\u8fb9\u67096\u4e2a\u5de6\u62ec\u53f7\uff0c\u7b2c6\u4e2a\u53f3\u62ec\u53f7\u5de6\u8fb9\u67097\u4e2a\u5de6\u62ec\u53f7\uff0c\u4e0d\u5c31\u8bf4\u660e\u7b2c5\u4e2a\u548c\u7b2c6\u4e2a\u53f3\u62ec\u53f7\u4e4b\u95f4\u67091\u4e2a\u5de6\u62ec\u53f7\u561b\u3002\u6240\u4ee5\u5c31\u662f\u6309\u7167\u8fd9\u4e2a\u601d\u8def\u53bb\u6a21\u62df\uff0c\u6bcf\u6b21\u653e\u4e0a s[ i ] – s[ i – 1 ] \u4e2a\u5de6\u62ec\u53f7\uff0c\u518d\u653e\u4e0a\u53f3\u62ec\u53f7\u5c31\u5b8c\u6210\u4e86\u6a21\u62df\u3002<\/p>\n\n\n\n
\u7b2c\u4e8c\u90e8\u5206\u3010\u628aS\u5b57\u7b26\u4e32\u8f6c\u6362\u6210W-\u5e8f\u5217\u3011\uff0c\u8fd9\u4e2a\u4e5f\u6bd4\u8f83\u9ebb\u70e6\u3002\u601d\u8def\u5c31\u662f\u6bcf\u6b21\u9047\u5230\u4e00\u4e2a\u53f3\u62ec\u53f7\uff0c\u5c31\u5f80\u5b83\u7684\u5de6\u8fb9\u53bb\u627e\u548c\u5b83\u5bf9\u5e94\u7684\u90a3\u4e2a\u5de6\u62ec\u53f7\uff0c\u627e\u5230\u5c31\u7686\u5927\u6b22\u559c\u3002\u90a3\u627e\u7684\u9014\u4e2d\u8bb0\u5f55\u53f3\u62ec\u53f7\u6570\u76ee\u548c\u5de6\u62ec\u53f7\u6570\u76ee\uff0c\u5982\u679c\u6570\u76ee\u76f8\u540c\u8bf4\u660e\u4e2d\u95f4\u8fd9\u4e00\u6bb5\u5339\u914d\u4e0a\u4e86\uff0c\u90a3\u5c31\u8f93\u51fa\u5339\u914d\u6570\u5373\u53ef\u3002<\/p>\n\n\n\n
\u662f\u4e00\u4e2a\u6bd4\u8f83\u7ed5\u7684\u6a21\u62df\uff0c\u8be6\u60c5\u770b\u4e0b\u65b9\u4ee3\u7801\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>
#include <string.h><\/p>\n\n\n\n
int main() {
int t;
scanf(“%d”, &t);
int p[10000];<\/p>\n\n\n\n
#include <stdio.h>\n#include <string.h>\n\nint main() {\n    int t;\n    scanf(\"%d\", &t);\n    int p[10000];\n\n    while (t--) {\n        int n;\n        char s[10000] = {0};\n        scanf(\"%d\", &n);\n        for (int i = 1; i <= n; i++) {\n            scanf(\"%d\", &p[i]);\n        }\n        \/\/\u5148\u8f6c\u6362\u6210S\u5b57\u7b26\u4e32\n        int idx = 0;\n        for (int i = 1; i <= n; i++) {\n            for (int j = 1; j <= p[i] - p[i - 1]; j++) {\n                s[idx++] = '(';\n            }\n            s[idx++] = ')';\n        }\n        s[idx] = '\\0';\n        \/\/\u518d\u8f6c\u6362\u6210W\u5e8f\u5217\n        int cnt = 1;\n        int cnt1 = 0,cnt2 = 0;\n        for(int i = 0;i < idx;i++){\n            \/\/\u9047\u5230\u53f3\u62ec\u53f7\uff0c\u5c31\u53bb\u627e\u5b83\u5bf9\u5e94\u7684\u5de6\u62ec\u53f7\uff0c\u5e76\u4e14\u8ba1\u6570\u4e00\u4e0b\u4e2d\u95f4\u6709\u591a\u5c11\u4e2a\u53f3\u62ec\u53f7\n            if(s[i] == ')'){\n                cnt2 = 1;\n                cnt1 = 0;\n                for(int j = i - 1;j >= 0;j--){\n                    if(s[j] == '(') {\n                        cnt1++;\n                    }else {\n                        cnt2++;\n                    }\n                    if(cnt1 == cnt2){\n                        printf(\"%d \",cnt2);\n                        break;\n                    }\n                }\n            }\n        }\n        printf(\"\\n\");\n    }\n}\n<\/code><\/pre>\n\n\n\n
4008 \u5728\u7ebf\u8bc4\u5224\u7cfb\u7edf<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u674e\u56db\u6b63\u5728\u5efa\u8bbe\u4e00\u4e2a\u5728\u7ebf\u8bc4\u5224\u7cfb\u7edf\uff0c\u76ee\u524d\u4ed6\u4e07\u4e8b\u4ff1\u5907\uff0c\u53ea\u6b20\u8bc4\u5224\u7cfb\u7edf\u3002\u8bc4\u5224\u7cfb\u7edf\u5fc5\u987b\u53bb\u8bfb\u6b63\u786e\u6570\u636e\u6587\u4ef6\u548c\u7528\u6237\u6570\u636e\u6587\u4ef6\uff0c\u7136\u540e\u6bd4\u5bf9\u8fd9\u4e24\u4e2a\u6587\u4ef6\u3002\u5982\u679c\u8fd9\u4e24\u4e2a\u6587\u4ef6\u5b8c\u5168\u4e00\u6837\uff0c\u7cfb\u7edf\u8fd4\u56de\u201cAccepted\u201d,\u5426\u5219\u5982\u679c\u4e24\u4e2a\u6587\u4ef6\u53ea\u662f\u7a7a\u683c\uff0ctab\u952e\u6216\u6362\u884c\u6709\u6240\u533a\u522b\u7684\u8bdd\uff0c\u5219\u8fd4\u56de\u201cPresentation Error\u201d\uff0c\u5426\u5219\u7cfb\u7edf\u5c06\u8fd4\u56de\u201cWrong Answer\u201d\u3002 \u7ed9\u5b9a\u6b63\u786e\u6570\u636e\u6587\u4ef6\u548c\u7528\u6237\u7ed3\u679c\u6587\u4ef6\uff0c\u4f60\u7684\u4efb\u52a1\u5c31\u662f\u51b3\u5b9a\u7cfb\u7edf\u5e94\u8be5\u8fd4\u56de\u4ec0\u4e48\u5224\u65ad\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u62ec\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u7b2c\u4e00\u884c\u662f\u6574\u6570T\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570\u3002\u63a5\u4e0b\u6765\u662fT\u4e2a\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5305\u62ec\u4e24\u4e2a\u90e8\u5206\uff0c\u6b63\u786e\u7684\u8f93\u51fa\u6587\u4ef6\u548c\u7528\u6237\u7ed3\u679c\u6587\u4ef6\u3002\u5b83\u4eec\u90fd\u662f\u4ee5\u4e00\u4e2a\u5355\u72ec\u7684\u5b57\u7b26\u4e32\u201cSTART\u201d\u5360\u4e00\u884c\u8868\u793a\u5f00\u59cb\u3002\u6700\u540e\u4ee5\u5b57\u7b26\u4e32\u201cEND\u201d\u8868\u793a\u7ed3\u675f\u3002\u6240\u6709\u7684\u6570\u636e\u90fd\u662f\u5728\u8fd9\u4e24\u4e2a\u5b57\u7b26\u4e32\u4e4b\u95f4\u3002\u6240\u6709\u7684\u6570\u636e\u4e0d\u8d85\u8fc75000\u4e2a\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u8bc4\u5224\u7cfb\u7edf\u5e94\u8be5\u8fd4\u56de\u7684\u503c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 4
 START
 1 + 2 = 3
 END
 START
 1+2=3
 END
 START
 1 + 2 = 3
 END
 START
 1 + 2 = 3
 \u200b
 END
 START
 1 + 2 = 3
 END
 START
 1 + 2 = 4
 END
 START
 1 + 2 = 3
 END
 START
 1   + 2 = 3
 END<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 Presentation Error
 Presentation Error
 Wrong Answer
 Presentation Error<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5f88\u9ebb\u70e6\u7684\u4e00\u9053\u5b57\u7b26\u4e32\u6a21\u62df\u9898\uff0c\u57fa\u672c\u601d\u8def\u5c31\u662f\u7528scanf\u53bb\u8bfbbegin\u80af\u5b9a\u662f\u80fd\u8bfb\u5230\u7684\uff0c\u7136\u540e\u5c31\u4e00\u76f4\u53bb\u7528fgets\u8bfbend\uff0c\u6ca1\u8bfb\u5230end\u4e4b\u524d\uff0c\u5c31\u62fc\u63a5\u5b57\u7b26\u4e32\uff0c\u5c31\u662f\u6211\u4eec\u5f97\u5230\u7684\u4e24\u4e2a\u7528\u6765\u6bd4\u8f83\u7684\u5b57\u7b26\u4e32\u3002\u7136\u540e\u53bb\u628a\u4e24\u4e2a\u5b57\u7b26\u4e32\u505a\u6bd4\u8f83\uff0c\u76f8\u540c\u5c31AC\uff0c\u4e0d\u540c\u7684\u8bdd\u5c31\u53bb\u6389\u7a7a\u683c\u548c\u6362\u884c\u8fdb\u884c\u7b2c\u4e8c\u8f6e\u6bd4\u8f83\uff0c\u5982\u679c\u4e00\u6837\u5c31\u662fPE\uff0c\u5426\u5219\u5c31\u662fWA\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n \/\/\u56e0\u4e3a\u4f1a\u628a\u7a7a\u683c\u548c\u6362\u884c\u4ec0\u4e48\u8bfb\u5165\uff0c\u4f1a\u5f71\u54cd\u5230END\u7684\u5224\u65ad\uff0c\u6240\u4ee5\u8fd9\u8fb9\u5355\u72ec\u5199\u4e86\u4e2a\u5224\u65ad\u51fd\u6570\n int judge(char a[]){\n     if(a[0] == 'E' && a[1] == 'N' && a[2] == 'D'){\n         return 1;\n    }\n     return 0;\n }\n int main(){\n     int t;\n     scanf(\"%d\",&t);\n     while(t--){\n         char begin[1000];\n         char str1[1000] = {0};\n         char str2[1000] = {0};\n         char end[1000] = {0};\n         int len1 = 0;\n         int len2 = 0;\n         int cnt = 0;\n         \/\/\u8bfb\u5165BEGIN\n         scanf(\"%s\",begin);\n         getchar();\n         \/\/\u8bfb\u5165\u5b57\u7b26\u4e32+END\n         while(fgets(end,sizeof(end),stdin)){\n             if(judge(end)) break;\n             if(strlen(end) != 0){\n                 strcat(str1,end);\n                 len1 = strlen(str1);\n            }\n        }\n         \/\/\u8bfb\u5165BEGIN\n         scanf(\"%s\",begin);\n         getchar();\n         \/\/\u8bfb\u5165\u5b57\u7b26\u4e32+END\n         while(fgets(end,sizeof(end),stdin)){\n             if(judge(end)) break;\n             if(strlen(end) != 0){\n                 strcat(str2,end);\n                 len2 = strlen(str2);\n            }\n        }\n  \/\/\u505a\u7b2c\u4e00\u8f6e\u6bd4\u8f83\n         if(strcmp(str1,str2) == 0){\n             printf(\"Accepted\\n\");\n        }else{\n             \/\/\u5f00\u59cb\u7b2c\u4e8c\u8f6e\u6bd4\u8f83\n             char temp1[100] = {'\\0'};\n             char temp2[100] = {'\\0'};\n             int j = 0;\n             \/\/\u53bb\u9664 \u7a7a\u683c \u6362\u884c \u548c tab\n             for(int i = 0;i < len1;i++){\n                 if(str1[i] != ' ' && str1[i] != '\\n' && str1[i] != '\\t'){\n                     temp1[j++] = str1[i];\n                }\n            }\n             temp1[j] = '\\0';\n             j = 0;\n             \/\/\u53bb\u9664 \u7a7a\u683c \u6362\u884c \u548c tab\n             for(int i = 0;i < len2;i++){\n                 if(str2[i] != ' ' && str2[i] != '\\n' && str2[i] != '\\t'){\n                     temp2[j++] = str2[i];\n                }\n            }\n             temp2[j] = '\\0';\n  \/\/\u7b2c\u4e8c\u8f6e\u6bd4\u8f83\n             if(strcmp(temp1,temp2) == 0){\n                 printf(\"Presentation Error\\n\");\n            }else{\n                 printf(\"Wrong Answer\\n\");\n            }\n        }\n    }\n }<\/code><\/pre>\n\n\n\n
4009 \u4ee4\u4eba\u60ca\u8bb6\u7684\u5b57\u7b26\u4e32<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5b57\u7b26\u4e32S\u7531\u5b57\u6bcd\u5b57\u7b26\u7ec4\u6210\uff0c\u5b83\u7684\u201cD-\u5bf9\u5b57\u7b26\u4e32\u201d\u4e3aS\u4e2d\u76f8\u9694D\u4e2a\u4f4d\u7f6e\u7684\u4e24\u4e2a\u5b57\u7b26\u7ec4\u6210\u7684\u6709\u5e8f\u5bf9\u3002\u5982\u679cS\u6240\u6709\u7684\u201cD-\u5bf9\u5b57\u7b26\u4e32\u201d\u90fd\u4e0d\u76f8\u540c\uff0c\u5219\u79f0S\u662f\u201cD-\u552f\u4e00\u7684\u201d\u3002\u5982\u679cS\u5bf9\u6240\u6709\u53ef\u80fd\u7684D\u503c\u90fd\u662f\u201cD-\u552f\u4e00\u7684\u201d\uff0c\u5219\u79f0S\u662f\u4e00\u4e2a\u201c\u4ee4\u4eba\u60ca\u8bb6\u7684\u5b57\u7b26\u4e32\u201d\u3002 \u4f8b\u5982\uff0c\u5b57\u7b26\u4e32ZGBG\uff0c\u5b83\u7684\u201c0-\u5bf9\u5b57\u7b26\u4e32\u201d\u4e3aZG\u3001GB\u548cBG\uff0c\u7531\u4e8e\u8fd9\u4e09\u4e2a\u5b57\u7b26\u4e32\u90fd\u4e0d\u76f8\u540c\uff0c\u56e0\u6b64ZGBG\u662f\u201c0-\u552f\u4e00\u7684\u201d\u3002\u540c\u6837\uff0c\u5b83\u7684\u201c1-\u5bf9\u5b57\u7b26\u4e32\u201d\u4e3aZB\u548cGG\uff0c\u4e0d\u76f8\u540c\uff0c\u4e5f\u662f\u201c1-\u552f\u4e00\u7684\u201d\u3002\u6700\u540e\uff0c\u5b83\u7684\u201c2-\u5bf9\u5b57\u7b26\u4e32\u201d\u53ea\u6709\u4e00\u4e2a\uff0c\u5c31\u662fZG\uff0c\u56e0\u6b64ZGBG\u4e5f\u662f\u201c2-\u552f\u4e00\u7684\u201d\u3002 \u56e0\u6b64\uff0cZGBG\u662f\u4e00\u4e2a\u201c\u4ee4\u4eba\u60ca\u8bb6\u7684\u5b57\u7b26\u4e32\u201d\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u4e86\u82e5\u5e72\u4e2a\u975e\u7a7a\u5b57\u7b26\u4e32\uff0c\u7531\u5927\u5199\u5b57\u6bcd\u5b57\u7b26\u7ec4\u6210\uff0c\u957f\u5ea6\u6700\u957f\u4e3a79\u4e2a\u5b57\u7b26\u3002\u6bcf\u4e2a\u5b57\u7b26\u4e32\u5360\u4e00\u884c\u3002\u8f93\u5165\u6587\u4ef6\u7684\u6700\u540e\u4e00\u884c\u4e3a\u201c*\u201d\u5b57\u7b26\uff0c\u4ee3\u8868\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u4e86\u82e5\u5e72\u4e2a\u975e\u7a7a\u5b57\u7b26\u4e32\uff0c\u7531\u5927\u5199\u5b57\u6bcd\u5b57\u7b26\u7ec4\u6210\uff0c\u957f\u5ea6\u6700\u957f\u4e3a79\u4e2a\u5b57\u7b26\u3002\u6bcf\u4e2a\u5b57\u7b26\u4e32\u5360\u4e00\u884c\u3002\u8f93\u5165\u6587\u4ef6\u7684\u6700\u540e\u4e00\u884c\u4e3a\u201c*\u201d\u5b57\u7b26\uff0c\u4ee3\u8868\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
ZGBG
X
EE
AAB
AABA
AABB
BCBABCC
*<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
ZGBG is surprising.
X is surprising.
EE is surprising.
AAB is surprising.
AABA is surprising.
AABB is NOT surprising.
BCBABCC is NOT surprising.<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u679a\u4e3e\u6240\u6709\u53ef\u80fd\u7684k\u3002\u5b57\u7b26\u4e32\u7528\u53cc\u5c42\u904d\u5386\u53bb\u505a\u6bd4\u8f83\u8fd9\u4ef6\u4e8b\u5927\u5bb6\u5e94\u8be5\u90fd\u4f1a\u5427\uff1f\u6211\u4eec\u518d\u5f80\u91cc\u9762\u52a0\u4e00\u5c42\u5faa\u73af\uff0c\u7528\u6765\u679a\u4e3ek\u7684\u503c\uff0c\u7136\u540e\u628a i \u548c j \u8fd8\u6709 i + k \u548c j + k \u505a\u6bd4\u8f83\uff0c\u5982\u679c\u4e24\u5bf9\u90fd\u76f8\u540c\uff0c\u8bf4\u660e\u4e0d\u662f\u4ee4\u4eba\u60ca\u8bb6\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n \n    char str[1000];\n    int i,j,k;\n \n    while(scanf(\"%s\",str)){\n        int flag = 0;\n        if(str[0]=='*') break;\n        int len = strlen(str);\n        for(i = 0;i < len;i++){\n            for(j = i+1 ;j < len;j++){\n                if(str[i] == str[j]){\n                    for(k = 1;k < len;k++){\n                        if(str[i + k] == str[j + k] && i+k<len&&j+k<len){\n                            flag = 1;\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        if(flag == 0){\n            printf(\"%s is surprising.\\n\",str);\n        }else{\n            printf(\"%s is NOT surprising.\\n\",str);\n        }\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
4010 \u53e4\u4ee3\u5bc6\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u53e4\u7f57\u9a6c\u5e1d\u738b\u6709\u4e00\u4e2a\u5305\u62ec\u5404\u79cd\u90e8\u95e8\u7684\u5f3a\u5927\u653f\u5e9c\u7ec4\u7ec7\u3002\u5176\u4e2d\u6709\u4e00\u4e2a\u90e8\u95e8\u5c31\u662f\u4fdd\u5bc6\u670d\u52a1\u90e8\u95e8\u3002\u4e3a\u4e86\u4fdd\u9669\u8d77\u89c1\uff0c\u5728\u7701\u4e0e\u7701\u4e4b\u95f4\u4f20\u9012\u7684\u91cd\u8981\u6587\u4ef6\u4e2d\u7684\u5927\u5199\u5b57\u6bcd\u662f\u52a0\u5bc6\u7684\u3002\u5f53\u65f6\u6700\u6d41\u884c\u7684\u52a0\u5bc6\u65b9\u6cd5\u662f\u66ff\u6362\u548c\u91cd\u65b0\u6392\u5217\u3002 \u66ff\u6362\u65b9\u6cd5\u662f\u5c06\u6240\u6709\u51fa\u73b0\u7684\u5b57\u7b26\u66ff\u6362\u6210\u5176\u5b83\u7684\u5b57\u7b26\u3002\u6709\u4e9b\u5b57\u7b26\u4f1a\u78b0\u5de7\u66ff\u6362\u6210\u5b83\u81ea\u5df1\u3002\u4f8b\u5982\uff1a\u66ff\u6362\u89c4\u5219\u53ef\u4ee5\u662f\u5c06A \u5230 Y\u66ff\u6362\u6210\u5b83\u7684\u4e0b\u4e00\u4e2a\u5b57\u7b26\uff0c\u5c06Z\u66ff\u6362\u6210 A\uff0c\u5982\u679c\u539f\u8bcd\u662f VICTORIOUS \u5219\u5b83\u53d8\u6210 WJDUPSJPVT\u3002 \u6392\u5217\u65b9\u6cd5\u6539\u53d8\u539f\u6765\u5355\u8bcd\u4e2d\u5b57\u6bcd\u7684\u987a\u5e8f\u3002\u4f8b\u5982\uff1a\u5c06\u987a\u5e8f <2, 1, 5, 4, 3, 7, 6, 10, 9, 8> \u5e94\u7528\u5230 VICTORIOUS \u4e0a\uff0c\u5219\u5f97\u5230IVOTCIRSUO\u3002 \u4eba\u4eec\u5f88\u5feb\u610f\u8bc6\u5230\u5355\u72ec\u5e94\u7528\u66ff\u6362\u65b9\u6cd5\u6216\u6392\u5217\u65b9\u6cd5\uff0c\u52a0\u5bc6\u662f\u5f88\u4e0d\u4fdd\u9669\u7684\u3002\u4f46\u662f\u5982\u679c\u7ed3\u5408\u8fd9\u4e24\u79cd\u65b9\u6cd5\uff0c\u5728\u5f53\u65f6\u5c31\u53ef\u4ee5\u5f97\u5230\u975e\u5e38\u53ef\u9760\u7684\u52a0\u5bc6\u65b9\u6cd5\u3002\u6240\u4ee5\uff0c\u5f88\u591a\u91cd\u8981\u4fe1\u606f\u5148\u4f7f\u7528\u66ff\u6362\u65b9\u6cd5\u52a0\u5bc6\uff0c\u518d\u5c06\u52a0\u5bc6\u7684\u7ed3\u679c\u7528\u6392\u5217\u7684\u65b9\u6cd5\u52a0\u5bc6\u3002\u7528\u4e24\u79cd\u65b9\u6cd5\u7ed3\u5408\u5c31\u53ef\u4ee5\u5c06VICTORIOUS \u52a0\u5bc6\u6210JWPUDJSTVP\u3002 \u8003\u53e4\u5b66\u5bb6\u6700\u8fd1\u5728\u4e00\u4e2a\u77f3\u53f0\u4e0a\u53d1\u73b0\u4e86\u4e00\u4e9b\u4fe1\u606f\u3002\u521d\u770b\u8d77\u6765\u5b83\u4eec\u6beb\u65e0\u610f\u4e49\uff0c\u6240\u4ee5\u6709\u4eba\u8bbe\u60f3\u5b83\u4eec\u53ef\u80fd\u662f\u7528\u66ff\u6362\u548c\u6392\u5217\u7684\u65b9\u6cd5\u88ab\u52a0\u5bc6\u4e86\u3002\u4eba\u4eec\u8bd5\u7740\u89e3\u8bfb\u4e86\u77f3\u53f0\u4e0a\u7684\u5bc6\u7801\uff0c\u73b0\u5728\u4ed6\u4eec\u60f3\u68c0\u67e5\u89e3\u8bfb\u7684\u662f\u5426\u6b63\u786e\u3002\u4ed6\u4eec\u9700\u8981\u4e00\u4e2a\u8ba1\u7b97\u673a\u7a0b\u5e8f\u6765\u9a8c\u8bc1\u5979\uff0c\u4f60\u7684\u4efb\u52a1\u5c31\u662f\u5199\u8fd9\u4e2a\u9a8c\u8bc1\u7a0b\u5e8f\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u4e24\u884c\u3002\u7b2c\u4e00\u884c\u662f\u77f3\u53f0\u4e0a\u7684\u6587\u5b57\u3002\u6587\u5b57\u4e2d\u6ca1\u6709\u7a7a\u683c\uff0c\u5e76\u4e14\u53ea\u6709\u5927\u5199\u82f1\u6587\u5b57\u6bcd\u3002\u7b2c\u4e8c\u884c\u662f\u88ab\u89e3\u8bfb\u51fa\u6765\u7684\u52a0\u5bc6\u524d\u7684\u6587\u5b57\u3002\u7b2c\u4e8c\u884c\u4e5f\u662f\u7531\u5927\u5199\u82f1\u6587\u5b57\u6bcd\u6784\u6210\u7684\u3002\u8fd9\u4e24\u884c\u5b57\u7b26\u6570\u76ee\u7684\u957f\u5ea6\u90fd\u4e0d\u8d85\u8fc7\u8ba1\u5212100\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5982\u679c\u7b2c\u4e8c\u884c\u7ecf\u8fc7\u67d0\u79cd\u52a0\u5bc6\u65b9\u6cd5\u540e\u53ef\u4ee5\u4ea7\u751f\u7b2c\u4e00\u884c\u7684\u4fe1\u606f\uff0c\u8f93\u51fa YES\uff0c\u5426\u5219\u8f93\u51faNO\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
JWPUDJSTVP
VICTORIOUS<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
YES<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6a21\u62df\u52a0\u5bc6\u8fc7\u7a0b\uff0c\u5148\u79fb\u4f4d\u7136\u540e\u518d\u8c03\u6362\u987a\u5e8f\u5373\u53ef\u3002\u79fb\u4f4d\u5f88\u597d\u5b9e\u73b0\uff0c\u600e\u4e48\u505a\u5230\u6392\u5217\u5462\uff1f\u6211\u4eec\u7edf\u8ba1\u5b57\u7b26\u4e2a\u6570\uff0c\u5047\u8bbe\u7b2c\u4e00\u4e2a\u5b57\u7b26\u4e32\u7528\u5230\u7684\u5b57\u7b26\u548c\u7b2c\u4e8c\u4e2a\u5b57\u7b26\u4e32\u7528\u5230\u7684\u5b57\u7b26\u662f\u4e00\u81f4\u7684\uff0c\u8bf4\u660e\u7b2c\u4e8c\u4e2a\u5b57\u7b26\u4e32\u6392\u5217\u540e\u80af\u5b9a\u80fd\u5f97\u5230\u7b2c\u4e00\u4e2a\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u539f\u672c\u7b14\u8005\u4ee5\u4e3a\u8fd9\u9053\u9898\u9700\u8981\u628a\u4e09\u79cd\u52a0\u5bc6\u65b9\u5f0f\u90fd\u8003\u8651\u4e00\u6b21\u3010\u66ff\u6362\u3001\u6392\u5217\u3001\u66ff\u6362+\u6392\u5217\u3011\uff0c\u540e\u9762\u7ecf\u8fc7\u7b14\u8005\u6d4b\u8bd5\uff0c\u53ea\u9700\u8981\u8003\u8651 \u66ff\u6362+\u6392\u5217 \u8fd9\u4e00\u79cd\u52a0\u5bc6\u65b9\u5f0f\u5373\u53ef\uff0c\u8bf7\u653e\u5fc3\u98df\u7528\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint vis1[100];\nint vis2[100];\nint main(){\n    char a[100],b[100];\n    char c[100];\n    scanf(\"%s\",a);\n    scanf(\"%s\",b);\n    int len1 = strlen(a);\n    int len2 = strlen(b);\n    if(len2 != len1) {\n        printf(\"NO\\n\");\n        return 0;\n    }\n    for(int i = 0;i < len2;i++){\n        b[i] = b[i] + 1;\n        if(b[i] > 'Z') b[i] = 'A';\n        vis2[b[i] - 'A']++;\n    }\n    for(int i = 0;i < len1;i++){\n        vis1[a[i] - 'A']++;\n    }\n    for(int i = 0;i < 26;i++){\n        if(vis1[i] != vis2[i]){\n            printf(\"NO\\n\");\n            return 0;\n        }\n    }\n    printf(\"YES\\n\");\n}<\/code><\/pre>\n\n\n\n
4011 \u68c0\u9a8c\u548c<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u68c0\u9a8c\u548c\u662f\u4e00\u79cd\u7b97\u6cd5\uff0c\u8fd9\u79cd\u7b97\u6cd5\u626b\u63cf\u6570\u636e\u5305\u5e76\u8fd4\u56de\u4e00\u4e2a\u503c\u3002\u8fd9\u79cd\u7b97\u6cd5\u7684\u601d\u60f3\u662f\u5f53\u6570\u636e\u5305\u88ab\u6539\u53d8\u65f6\uff0c\u6821\u9a8c\u548c\u540c\u6837\u8981\u6539\u53d8\uff0c\u56e0\u6b64\u6821\u9a8c\u548c\u901a\u5e38\u7528\u6765\u68c0\u67e5\u4f20\u8f93\u9519\u8bef\uff0c\u7528\u6765\u786e\u8ba4\u4f20\u8f93\u5185\u5bb9\u7684\u6b63\u786e\u6027\u3002 \u5728\u672c\u9898\u4e2d\uff0c\u4f60\u9700\u8981\u5b9e\u73b0\u4e00\u79cd\u6821\u9a8c\u548c\u7b97\u6cd5\uff0c\u79f0\u4e3aQuicksum\uff0c\u4e00\u4e2aQuicksum\u6570\u636e\u5305\u53ea\u5141\u8bb8\u5305\u542b\u5927\u5199\u5b57\u6bcd\u548c\u7a7a\u683c\uff0c\u5e76\u4e14\u8d77\u59cb\u5b57\u7b26\u548c\u7ec8\u6b62\u5b57\u7b26\u90fd\u662f\u5927\u5199\u5b57\u6bcd\u3002\u9664\u6b64\u4e4b\u5916\uff0c\u7a7a\u683c\u548c\u5927\u5199\u5b57\u6bcd\u5141\u8bb8\u4ee5\u4efb\u4f55\u7684\u7ec4\u5408\u65b9\u5f0f\u51fa\u73b0\uff0c\u5305\u62ec\u8fde\u7eed\u7684\u7a7a\u683c\u3002 \u6821\u9a8c\u548cQuicksum\u662f\u6570\u636e\u5305\u4e2d\u6240\u6709\u5b57\u7b26\u5728\u6570\u636e\u5305\u4e2d\u7684\u4f4d\u7f6e\u548c\u5b83\u7684\u503c\u7684\u4e58\u79ef\u7684\u7d2f\u52a0\u548c\u3002\u7a7a\u683c\u7684\u503c\u4e3a0\uff0c\u5176\u4ed6\u5927\u5199\u5b57\u6bcd\u7684\u503c\u4e3a\u5b83\u5728\u5b57\u6bcd\u8868\u4e2d\u7684\u4f4d\u7f6e\uff0c\u5373A=1\uff0cB=2\uff0c\u2026\u2026\uff0cZ=26\u3002 \u4e0b\u9762\u662fQuicksum\u6570\u636e\u5305\u201cACM\u201d\u548c\u201cMID CENTRAL\u201d\u7684\u6821\u9a8c\u548c\u8ba1\u7b97\u65b9\u6cd5\uff1a ACM\uff1a1 * 1 + 2 * 3 + 3 * 13 = 46 MID CENTRAL\uff1a1 * 13 + 2 * 9 + 3 * 4 + 4 * 0 + 5 * 3 + 6 * 5 + 7 * 14 + 8 * 20 + 9 * 18 + 10 * 1 + 11 * 12 = 650<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u62ec\u4e00\u4e2a\u6216\u591a\u4e2a\u6570\u636e\u5305\uff0c\u8f93\u5165\u6587\u4ef6\u7684\u6700\u540e\u4e00\u884c\u4e3a\u7b26\u53f7#\uff0c\u8868\u793a\u8f93\u5165\u6587\u4ef6\u7ed3\u675f\u3002\u6bcf\u4e2a\u6570\u636e\u5305\u5360\u4e00\u884c\uff0c\u6bcf\u4e2a\u6570\u636e\u5305\u4e0d\u4f1a\u4ee5\u7a7a\u683c\u5f00\u5934\u6216\u7ed3\u5c3e\uff0c\u6bcf\u4e2a\u6570\u636e\u5305\u5305\u542b1~255\u4e2a\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6570\u636e\u5305\uff0c\u8f93\u51fa\u4e00\u884c\uff0c\u4e3a\u5b83\u7684\u6821\u9a8c\u548c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
46
650
4690
49
75
14
15<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n    char str[1000];\n    while(fgets(str,sizeof(str),stdin)){\n        if(str[0] == '#') break;\n        int len = strlen(str);\n        int sum = 0;\n        for(int i = 0;i < len;i++){\n            if(str[i] >= 'A' && str[i] <= 'Z')\n                sum += (i + 1) * (str[i] - 'A' + 1);\n        }\n        printf(\"%d\\n\",sum);\n    }\n}<\/code><\/pre>\n\n\n\n
4012 \u6469\u5c14\u65af\u7f16\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6469\u5c14\u65af\u7f16\u7801\u91c7\u7528\u53d8\u957f\u7684\u70b9\u53f7\u201c.\u201d\u548c\u77ed\u5212\u7ebf\u201c-\u201d\u5e8f\u5217\u6765\u4ee3\u8868\u5b57\u7b26\u3002\u5b9e\u9645\u7f16\u7801\u65f6\uff0c\u7535\u6587\u4e2d\u7684\u5b57\u7b26\u7528\u7a7a\u683c\u9694\u5f00\u3002\u88684.1\u662f\u6469\u5c14\u65af\u7f16\u7801\u4e2d\u5404\u5b57\u7b26\u5bf9\u5e94\u7684\u7f16\u7801\u3002<\/p>\n\n\n\n
\"4012.png\"<\/div><\/figure>\n\n\n\n
\u6ce8\u610f\uff0c\u5728\u4e0a\u8868\u4e2d\u70b9\u53f7\u548c\u77ed\u5212\u7ebf\u67094\u4e2a\u7ec4\u5408\u6ca1\u6709\u91c7\u7528\u3002\u5728\u672c\u9898\u4e2d\uff0c\u5c06\u8fd9\u56db\u79cd\u7ec4\u5408\u5206\u914d\u7ed9\u4ee5\u4e0b\u7684\u5b57\u7b26\uff1a \u4e0b\u5212\u7ebf\uff1a..– \u70b9\u53f7\uff1a—. \u9017\u53f7\uff1a.-.- \u95ee\u53f7\uff1a—- \u56e0\u6b64\uff0c\u7535\u6587\u201cACM_GREATER_NY_REGION\u201d\u88ab\u7f16\u7801\u4e3a\uff1a.- -.-. — ..– –. .-. . .- – . .-. ..– -. -.– ..– .-. . –. .. — -. Ohaver\u57fa\u4e8e\u6469\u5c14\u65af\u7f16\u7801\u63d0\u51fa\u4e86\u4e00\u79cd\u52a0\u5bc6\u65b9\u6cd5\u3002\u8fd9\u79cd\u65b9\u6cd5\u7684\u601d\u8def\u662f\u53bb\u6389\u5b57\u7b26\u95f4\u7684\u7a7a\u683c\uff0c\u5e76\u4e14\u5728\u7f16\u7801\u540e\u7ed9\u51fa\u6bcf\u4e2a\u5b57\u7b26\u7f16\u7801\u7684\u957f\u5ea6\u3002\u4f8b\u5982\u7535\u6587\u201cACM\u201d\u7f16\u7801\u4e3a\u201c.–.-.–242\u201d\u3002 Ohaver\u7684\u52a0\u5bc6\uff08\u89e3\u5bc6\u4e5f\u662f\u4e00\u6837\u7684\uff09\u65b9\u6cd5\u5206\u4e3a3\u4e2a\u6b65\u9aa4\uff1a \uff081\uff09\u5c06\u539f\u6587\u8f6c\u6362\u6210\u6469\u5c14\u65af\u7f16\u7801\uff0c\u53bb\u6389\u5b57\u7b26\u95f4\u7684\u7a7a\u683c\uff0c\u7136\u540e\u628a\u6bcf\u4e2a\u5b57\u7b26\u957f\u5ea6\u7684\u4fe1\u606f\u6dfb\u52a0\u5728\u540e\u9762\uff1b \uff082\uff09\u5c06\u8868\u793a\u5404\u5b57\u7b26\u957f\u5ea6\u7684\u5b57\u7b26\u4e32\u53cd\u8f6c\uff1b \uff083\uff09\u6309\u7167\u53cd\u8f6c\u540e\u7684\u5404\u5b57\u7b26\u957f\u5ea6\uff0c\u89e3\u91ca\u70b9\u53f7\u548c\u77ed\u5212\u7ebf\u5e8f\u5217\uff0c\u5f97\u5230\u5bc6\u6587\u3002 \u4f8b\u5982\uff0c\u5047\u8bbe\u5bc6\u6587\u4e3a\u201cAKADTOF_IBOETATUK_IJN\u201d\uff0c\u89e3\u5bc6\u6b65\u9aa4\u5982\u4e0b\uff1a \uff081\uff09\u5c06\u5bc6\u6587\u8f6c\u6362\u4e3a\u6469\u5c14\u65af\u7f16\u7801\uff0c\u53bb\u6389\u5b57\u7b26\u95f4\u7684\u7a7a\u683c\uff0c\u6dfb\u52a0\u5404\u5b57\u7b26\u957f\u5ea6\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\uff0c\u5f97\u5230\u201c.–.-.–..—-..-…–..-…—.-.–..–.-..–…—-.232313442431121334242\u201d\uff1b \uff082\uff09\u5c06\u5b57\u7b26\u957f\u5ea6\u5b57\u7b26\u4e32\u53cd\u8f6c\uff0c\u5f97\u5230\u201c242433121134244313232\u201d\uff1b \uff083\uff09\u5bf9\u5b57\u7b26\u957f\u5ea6\u5b57\u7b26\u4e32\u53cd\u8f6c\u540e\u7684\u7f16\u7801\u5b57\u7b26\u4e32\uff0c\u7528\u6469\u5c14\u65af\u7f16\u7801\u89e3\u91ca\u8be5\u5b57\u7b26\u4e32\uff0c\u5f97\u5230\u539f\u6587\u201cACM_GREATER_NY_REGION\u201d\u3002 \u672c\u9898\u76ee\u7684\u76ee\u7684\u662f\u5b9e\u73b0Ohaver\u7684\u89e3\u5bc6\u7b97\u6cd5\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\u8f93\u5165\u6587\u4ef6\u7684\u7b2c1\u884c\u662f\u4e00\u4e2a\u6574\u6570n\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u4e2a\u6570\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u4e3a\u4e00\u4e2a\u7528Ohaver\u52a0\u5bc6\u7b97\u6cd5\u52a0\u5bc6\u540e\u7684\u5bc6\u6587\u3002\u6bcf\u4e2a\u5bc6\u6587\u4e2d\u5141\u8bb8\u51fa\u73b0\u7684\u7b26\u53f7\u4e3a\uff1a\u5927\u5199\u5b57\u6bcd\uff0c\u4e0b\u5212\u7ebf\u3001\u9017\u53f7\uff0c\u70b9\u53f7\u548c\u95ee\u53f7\u3002\u5bc6\u6587\u957f\u5ea6\u4e0d\u8d85\u8fc7100\u4e2a\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u5bc6\u6587\uff0c\u9996\u5148\u8f93\u51fa\u5bc6\u6587\u7684\u5e8f\u53f7\uff0c\u7136\u540e\u662f\u5192\u53f7\u548c\u7a7a\u683c\uff0c\u6700\u540e\u662f\u89e3\u7801\u540e\u7684\u539f\u6587\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
5
AKADTOF_IBOETATUK_IJN
PUEL
QEWOISE.EIVCAEFNRXTBELYTGD.
?EJHUT.TSMYGW?EJHOT
DSU.XFNCJEVE.OE_UJDXNO_YHU?VIDWDHPDJIKXZT?E<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
1: ACM_GREATER_NY_REGION
2: PERL
3: QUOTH_THE_RAVEN,_NEVERMORE.
4: TO_BE_OR_NOT_TO_BE?
5: THE_QUICK_BROWN_FOX_JUMPS_OVER_THE_LAZY_DOG<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u601d\u8def\u4e0d\u96be\u60f3\uff0c\u5c31\u662f\u771f\u7684\u5f88\u6076\u5fc3\u3002\u4e00\u6b65\u4e00\u6b65\u8ddf\u7740\u9898\u76ee\u6a21\u62df\u5c31\u597d\uff0c\u4f46\u662f\u771f\u7684\u8981\u8d39\u70b9\u529f\u592b\u3002\u4e0b\u65b9\u4ee3\u7801\u5199\u5f97\u5f88\u6e05\u695a\u4e86\uff0c\u81ea\u884c\u53c2\u8003~<\/p>\n\n\n\n
strncpy\u51fd\u6570\u6216\u8005memcpy\u51fd\u6570\u53ef\u4ee5\u53bb\u4e86\u89e3\u4e00\u4e0b\uff01<\/p>\n\n\n\n
c++\u7684string\u7528substr\u51fd\u6570~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n int cnt;\n int num[1000];\n char stable[35][35] = {\".-\",\"-...\",\"-.-.\",\"-..\",\".\",\"..-.\",\"--.\",\"....\",\"..\",\".---\",\"-.-\",\".-..\",\"--\",\"-.\",\"---\",\".--.\",\"--.-\",\".-.\",\"...\",\"-\",\"..-\",\"...-\",\".--\",\"-..-\",\"-.--\",\"--..\"};\n int number[30] = {2,4,4,3,1,4,3,4,2,4,3,4,2,2,3,4,4,3,3,1,3,4,3,4,4,4};\n void reverse(){\n     for(int i = 0;i < cnt\/2;i++){\n         int t = num[i];\n         num[i] = num[cnt - i - 1];\n         num[cnt - i - 1] = t;\n    }\n }\n void find(char str[]){\n     for(int i = 0;i < 26;i++){\n         if(strcmp(str,stable[i]) == 0){\n             printf(\"%c\",'A' + i);\n             return ;\n        }\n    }\n     if(strcmp(str,\"..--\") == 0){\n         printf(\"_\");\n    }else if(strcmp(str,\"---.\") == 0){\n         printf(\".\");\n    }else if(strcmp(str,\".-.-\") == 0){\n         printf(\",\");\n    }else if(strcmp(str,\"----\") == 0){\n         printf(\"?\");\n    }\n }\n int main(){\n\n     char str[1000];\n     int n;\n     scanf(\"%d\",&n);\n     int t = 0;\n     while(n--){\n         t++;\n         char s[1000] = {'\\0'};\n         cnt = 0;\n         scanf(\"%s\",str);\n         int len = strlen(str);\n         \/\/\u83b7\u53d6\u6469\u65af\u7535\u7801\u5b57\u7b26\u4e32\n         for(int i = 0;i < len;i++){\n             if(str[i] >= 'A' && str[i] <= 'Z'){\n                 strcat(s,stable[str[i] - 'A']);\n            }else{\n                 if(str[i] == '?'){\n                     strcat(s,\"----\");\n                }else if(str[i] == ','){\n                     strcat(s,\".-.-\");\n                }else if(str[i] == '.'){\n                     strcat(s,\"---.\");\n                }else if(str[i] == '_'){\n                     strcat(s,\"..--\");\n                }\n            }\n        }\n         \/\/\u83b7\u53d6\u539f\u59cb\u6570\u5b57\u4e32\n         for(int i = 0;i < len;i++){\n             cnt++;\n             if(str[i] >= 'A' && str[i] <= 'Z')\n                 num[i] = number[str[i] - 'A'];\n             else{\n                 num[i] = 4;\n            }\n        }\n         \/\/\u83b7\u53d6\u7ffb\u8f6c\u6570\u5b57\u4e32\n         reverse();\n         \/\/\u7528\u6570\u5b57\u4e32\u548c\u5b57\u7b26\u4e32\u5f00\u59cb\u89e3\u5bc6\n         int sum = 0;\n         printf(\"%d: \",t);\n         for(int i = 0;i < cnt;i++){\n             char temp[100] = {'\\0'};\n             \/\/\u8981\u622a\u53d6sum\u548csum + num[i]\u4e4b\u95f4\u7684\u5b57\u7b26\u4e32\n             strncpy(temp,s + sum,num[i]);\/\/\u4e00\u4e2a\u53ef\u4ee5\u622a\u53d6\u90e8\u5206\u5b57\u7b26\u4e32\u7684\u51fd\u6570\n             sum += num[i];\n             \/\/\u628a\u622a\u53d6\u7684\u5b57\u7b26\u4e32\u5728stable\u6570\u7ec4\u91cc\u5bfb\u627e\uff0c\u627e\u5230\u5c31\u8f93\u51fa\n             find(temp);\n        }\n         printf(\"\\n\");\n    }\n }<\/code><\/pre>\n\n\n\n
4013 anagrammatic\u8ddd\u79bb<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4e24\u4e2a\u5355\u8bcd\u4e92\u4e3aanagrams\uff0c\u610f\u601d\u662f\u4e00\u4e2a\u5355\u8bcd\u7684\u5b57\u6bcd\u7ecf\u8fc7\u91cd\u65b0\u6392\u5e8f\u540e\u53ef\u4ee5\u5f62\u6210\u53e6\u4e00\u4e2a\u5355\u8bcd\uff0c\u4f8b\u5982\uff0c\u5355\u8bcd\u201coccurs\u201d\u548c\u201csuccor\u201d\u4e92\u4e3aanagrams\u3002\u7136\u800c\u201cdear\u201d\u548c\u201cdared\u201d\u4e0d\u662f\u4e92\u4e3aanagrams\uff0c\u56e0\u4e3a\u5b57\u6bcdd\u5728\u201cdared\u201d\u4e2d\u51fa\u73b0\u4e862\u6b21\uff0c\u800c\u5728\u201cdear\u201d\u53ea\u51fa\u73b0\u4e861\u6b21\u3002\u82f1\u8bed\u4e2d\u6700\u8457\u540d\u7684anagrams\u662f\u201cdog\u201d\u548c\u201cgod\u201d\u3002 \u4e24\u4e2a\u5355\u8bcd\u7684anagrammatic\u8ddd\u79bb\u4e3aN\uff0c\u610f\u601d\u662f\u81f3\u5c11\u8981\u5728\u4e24\u4e2a\u5355\u8bcd\u4e2d\u4e00\u5171\u53bb\u6389N\u4e2a\u5b57\u6bcd\uff0c\u624d\u80fd\u4f7f\u4e24\u4e2a\u5355\u8bcd\u4e2d\u5269\u4e0b\u7684\u90e8\u5206\u4e92\u4e3aanagrams\u3002\u4f8b\u5982\uff0c\u7ed9\u5b9a\u4e24\u4e2a\u5355\u8bcd\uff1a\u201csleep\u201d\u548c\u201cleap\u201d\uff0c\u6211\u4eec\u9700\u8981\u81f3\u5c11\u53bb\u63893\u4e2a\u5b57\u6bcd\uff08\u4ece\u5355\u8bcd\u201csleep\u201d\u4e2d\u53bb\u63892\u4e2a\u5b57\u6bcd\u3001\u4ece\u5355\u8bcd\u201cleap\u201d\u4e2d\u53bb\u63891\u4e2a\u5b57\u6bcd\uff09\uff0c\u624d\u80fd\u4f7f\u8fd9\u4e24\u4e2a\u5355\u8bcd\u4e2d\u5269\u4e0b\u7684\u90e8\u5206\u4e92\u4e3aanagrams\uff08\u6bcf\u4e2a\u5355\u8bcd\u53ea\u5269\u4e0blep\uff09\u3002\u5bf9\u4e8e\u5355\u8bcd\u201cdog\u201d\u548c\u201ccat\u201d\uff0c\u7531\u4e8e\u4e24\u4e2a\u5355\u8bcd\u6ca1\u6709\u76f8\u540c\u7684\u5b57\u6bcd\uff0c\u6240\u4ee5\u5b83\u4eec\u7684anagrammatic\u8ddd\u79bb\u662f\u4e24\u4e2a\u5355\u8bcd\u5b57\u6bcd\u4e2a\u6570\u7684\u603b\u548c\uff0c\u56e0\u4e3a\u8981\u53bb\u6389\u6240\u6709\u5b57\u6bcd\u624d\u80fd\u4f7f\u5b83\u4eec\u4e92\u4e3aanagrams\u3002\uff08\u6ce8\u610f\uff1a\u4e00\u4e2a\u5355\u8bcd\u603b\u662f\u548c\u5b83\u672c\u8eab\u4e92\u4e3aanagrams\u7684\uff09 \u4f60\u7684\u4efb\u52a1\u662f\u7f16\u5199\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u8ba1\u7b97\u4e24\u4e2a\u5355\u8bcd\u7684anagrammatic\u8ddd\u79bb\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u7684\u7b2c\u4e00\u884c\u4e3a\u4e00\u4e2a\u6b63\u6574\u6570N\uff08N < 60000\uff09\uff0c\u6807\u660e\u8f93\u5165\u6587\u4ef6\u4e2d\u6d4b\u8bd5\u6570\u636e\u7684\u4e2a\u6570\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5305\u542b\u4e24\u4e2a\u5355\u8bcd\uff0c\u6709\u53ef\u80fd\u4e3a\u7a7a\uff0c\u6bcf\u4e2a\u5355\u8bcd\u5360\u4e00\u884c\uff08\u6240\u4ee5\u6709\u53ef\u80fd\u4e3a\u7a7a\u884c\uff09\u3002\u56e0\u6b64\u8f93\u5165\u6587\u4ef6\u4e2d\u7b2c\u4e00\u884c\u4e4b\u540e\u8fd8\u67092N\u884c\u3002 \u5c3d\u7ba1\u5355\u8bcd\u53ef\u80fd\u4e3a\u7a7a\uff0c\u4f46\u5b83\u4eec\u80af\u5b9a\u662f\u5f88\u7b80\u5355\u7684\u5355\u8bcd\uff08\u5355\u8bcd\u4e2d\u7684\u5b57\u6bcd\u90fd\u662f\u5c0f\u5199\u7684\uff09\uff0c\u800c\u4e14\u90fd\u662f\u82f1\u6587\u5b57\u6bcd\u8868\u4e2d26\u4e2a\u5b57\u6bcd\u4e2d\u7684\u4e00\u4e2a\uff0c\u6700\u957f\u7684\u5355\u8bcd\u662fpneumonoultramicroscopicsilicovolcanoconiosis\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e24\u4e2a\u5355\u8bcd\u7684anagrammatic\u8ddd\u79bb\uff0c\u6309\u7167\u8f93\u51fa\u6837\u4f8b\u4e2d\u7684\u683c\u5f0f\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
4
crocus
succor
dares
seared
empty<\/p>\n\n\n\n
smell
lemon<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
Case #1: 0
Case #2: 1
Case #3: 5
Case #4: 4<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6ce8\u610f\u8f93\u51fa\u683c\u5f0f\uff0c\u8fd8\u6709fgets\u4f1a\u628a\u6362\u884c\u7b26\u4e5f\u8bfb\u5165\u8fdb\u6765\uff0c\u53ef\u4ee5\u7a0d\u7a0d\u5904\u7406\u4e00\u4e0b\u3002\u57fa\u672c\u601d\u8def\u5c31\u662f\u8ba1\u6570\uff0c\u770b\u770b26\u4e2a\u5b57\u6bcd\u7684\u4e2a\u6570\uff0c\u770b\u770b\u4e24\u8fb9\u5dee\u591a\u5c11\uff0c\u7136\u540e\u628a\u5dee\u503c\u6c42\u548c\u5c31\u662f\u7b54\u6848\u4e86\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    getchar();\n    int t = 0;\n    while(n--){\n        t++;\n        printf(\"Case #%d:  \",t);\n        char a[1000];\n        char b[1000];\n        int vis1[100] = {0};\n        int vis2[100] = {0};\n        fgets(a,sizeof(a),stdin);\n        fgets(b,sizeof(b),stdin);\n        int len1 = strlen(a);\n        int len2 = strlen(b);\n        if(a[len1 - 1] == '\\n') a[len1 - 1] = '\\0';\n        if(b[len2 - 1] == '\\n') b[len2 - 1] = '\\0';\n        len1 = strlen(a);\n        len2 = strlen(b);\n        for(int i = 0;i < len1;i++){\n            vis1[a[i] - 'a']++;\n        }\n        for(int i = 0;i < len2;i++){\n            vis2[b[i] - 'a']++;\n        }\n        int sum = 0;\n        for(int i = 0;i < 26;i++){\n            sum += abs(vis1[i] - vis2[i]);\n        }\n        printf(\"%d\\n\",sum);\n    }\n}<\/code><\/pre>\n\n\n\n
4101 \u7edf\u8ba1\u5b57\u7b26\u6570<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5224\u65ad\u4e00\u4e2a\u7531a~z\u8fd926\u4e2a\u5b57\u7b26\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\u4e2d\u54ea\u4e2a\u5b57\u7b26\u51fa\u73b0\u7684\u6b21\u6570\u6700\u591a\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570n\uff0c\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53601\u884c\uff0c\u662f\u4e00\u4e2a\u7531a-z\u8fd926\u4e2a\u5b57\u7b26\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\uff0c\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\uff0c\u6bcf\u884c\u6570\u636e\u4e0d\u8d85\u8fc71000\u4e2a\u5b57\u7b26\u4e14\u975e\u7a7a\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\u4e00\u884c\u8f93\u51fa\u5305\u62ec\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b57\u7b26\u548c\u8be5\u5b57\u7b26\u51fa\u73b0\u7684\u6b21\u6570\uff0c\u4e2d\u95f4\u662f\u4e00\u4e2a\u7a7a\u683c\u3002 \u5982\u679c\u6709\u591a\u4e2a\u5b57\u7b26\u51fa\u73b0\u7684\u6b21\u6570\u76f8\u540c\u4e14\u6700\u591a\uff0c\u90a3\u4e48\u8f93\u51faASCII\u7801\u6700\u5c0f\u7684\u90a3\u4e00\u4e2a\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
abbccc<\/p>\n\n\n\n
adfadffasdf<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
c 3
f 4<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint vis[100];\nint main()\n{\n    int n;\n    scanf(\"%d\",&n);\n    while(n--){\n        memset(vis,0,sizeof(vis));\n        char str[100];\n        scanf(\"%s\",str);\n        int len = strlen(str);\n        for(int i = 0;i < len;i++){\n            vis[str[i] - 'a']++;\n        }\n        int maxx = 0;\n        int index = 0;\n        for(int i = 0;i < 26;i++){\n            if(vis[i] > maxx){\n                maxx = vis[i];\n                index = i;\n            }\n        }\n        printf(\"%c %d\\n\",index + 'a',maxx);\n    }\n        \n}<\/code><\/pre>\n\n\n\n
4102 \u6c14\u7403\u5347\u8d77\u6765<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u53c8\u5230\u4e00\u5e74\u7ade\u8d5b\u65f6\uff0c\u6bcf\u5f53\u770b\u5230\u6c14\u7403\u5347\u8d77\u6765\uff0c\u662f\u591a\u4e48\u4ee4\u4eba\u5174\u594b\u5440\u3002\u544a\u8bc9\u4f60\u4e00\u4e2a\u79d8\u5bc6\uff0c\u88c1\u5224\u603b\u662f\u70ed\u8877\u4e8e\u731c\u54ea\u9898\u662f\u6700\u6d41\u884c\u7684\u9898\u3002\u6bd4\u8d5b\u7ed3\u675f\u540e\uff0c\u53ea\u8981\u7edf\u8ba1\u4e00\u4e0b\u6240\u6709\u7684\u6c14\u7403\u989c\u8272\u5c31\u80fd\u5f97\u5230\u7b54\u6848\u3002 \u4eca\u5e74\uff0c\u4ed6\u4eec\u51b3\u5b9a\u628a\u8fd9\u4e2a\u5de5\u4f5c\u7559\u7ed9\u4f60\u6765\u5b8c\u6210\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u62ec\u591a\u7ec4\u6d4b\u8bd5\u6837\u4f8b\uff0c\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u90fd\u662f\u4ee5\u6570\u5b57N\u5f00\u59cb (0 < N <= 1000) \uff0c\u5b83\u6807\u8bc6\u5206\u53d1\u7684\u6c14\u7403\u603b\u6570\u3002\u63a5\u4e0b\u6765\u7684N\u884c\u5c31\u662f\u4e0d\u540c\u989c\u8272\u7684\u6c14\u7403\uff0c\u6c14\u7403\u989c\u8272\u662f\u4e00\u4e2a\u4e0d\u8d85\u8fc715\u4e2a\u5b57\u7b26\u7684\u5b57\u7b26\u4e32\u3002 \u5f53N=0\u65f6\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u7ec4\u6570\u636e\uff0c\u8f93\u51fa\u6700\u6d41\u884c\u7684\u95ee\u9898\u5bf9\u5e94\u7684\u989c\u8272\u3002\u8fd9\u91cc\u4fdd\u8bc1\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u53ea\u4f1a\u6709\u4e00\u4e2a\u7b54\u6848\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
5
green
red
blue
red
red
3
pink
orange
pink
0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
red
pink<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u904d\u5386\u53bb\u627e\u54ea\u4e2a\u5b57\u7b26\u4e32\u51fa\u73b0\u6b21\u6570\u6700\u591a\uff0c\u4e0b\u65b9\u4ee3\u7801\u662f\u4e00\u79cd\u89e3\u51b3\u529e\u6cd5\uff0c\u8bfb\u8005\u4e5f\u53ef\u4ee5\u91c7\u53d6\u522b\u7684\u601d\u8def~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n int vis[1000];\n int main(){\n     int n;\n\n     while(~scanf(\"%d\",&n)){\n         if(!n) break;\n         char str[100][100] = {'\\0'};\n         memset(vis,0,sizeof(vis));\n         char temp[100];\n         for(int i = 1;i <= n;i++)\n             scanf(\"%s\",str[i]);\n\n         for(int i = 1;i <= n;i++){\n             for(int j = 1;j <= n;j++){\n                 if(strcmp(str[i],str[j]) == 0){\n                     vis[i]++;\n                }\n            }\n        }\n         int maxx = 0;\n         int index = 0;\n         for(int i = 1;i <= n;i++){\n             if(vis[i] > maxx){\n                 maxx = vis[i];\n                 index = i;\n            }\n        }\n         printf(\"%s\\n\",str[index]);\n    }\n }<\/code><\/pre>\n\n\n\n
4103 All in All<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32s\u548ct\uff0c\u5224\u65ads\u662f\u5426\u662ft\u7684\u5b50\u5e8f\u5217\u3002\u5373\u4ecet\u4e2d\u5220\u9664\u4e00\u4e9b\u5b57\u7b26\uff0c\u5c06\u5269\u4f59\u7684\u5b57\u7b26\u8fde\u63a5\u8d77\u6765\uff0c\u5373\u53ef\u83b7\u5f97s\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u62ec\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u5305\u62ec\u4e24\u4e2a\u7531ASCII\u7801\u7ec4\u6210\u7684\u5b57\u7b26\u4e32s\u548ct\uff0c\u5b83\u4eec\u7684\u957f\u5ea6\u90fd\u4e0d\u8d85\u8fc7100000\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u8f93\u51fa\u4e00\u884c\uff0c\u5982\u679cs\u662ft\u7684\u5b50\u5e8f\u5217\uff0c\u5219\u8f93\u51fa\u201cYes\u201d\uff0c\u5426\u5219\u8f93\u51fa\u201cNo\u201d\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 sequence subsequence
 person compression
 VERDI vivaVittorioEmanueleReDiItalia
 caseDoesMatter CaseDoesMatter<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
Yes
No
Yes
No<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nchar a[100005];\nchar b[100005];\nint main(){\n    \n    while(~scanf(\"%s %s\",a,b)){\n        int flag = 0;\n        int len1 = strlen(a);\n        int len2 = strlen(b);\n        if(len1 > len2) {\n            printf(\"No\\n\");\n            continue;\n        }\n        int i,j;\n        for(i = 0,j = 0;i < len1 && j < len2;j++){\n            if(a[i] == b[j]){\n                i++;\n            }\n        }\n        if(i == len1){\n            printf(\"Yes\\n\");\n        }else{\n            printf(\"No\\n\");\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
4104 Soundex\u7f16\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
Soundex\u7f16\u7801\u662f\u6839\u636e\u5355\u8bcd\u7684\u62fc\u5199\u548c\u53d1\u97f3\u76f8\u4f3c\u6027\u6765\u5bf9\u5355\u8bcd\u8fdb\u884c\u5206\u7ec4\uff0c\u4f8b\u5982\uff0c\u201ccan\u201d\u4e0e\u201ckhawn\u201d, \u201ccon\u201d\u4e0e\u201cgone\u201d\u5728Soundex\u7f16\u7801\u4e0b\u662f\u76f8\u540c\u7684\u3002 Soundex\u7f16\u7801\u65b9\u6cd5\u5c06\u6bcf\u4e2a\u5355\u8bcd\u8f6c\u6362\u6210\u4e00\u4e32\u6570\u5b57\uff0c\u6bcf\u4e2a\u6570\u5b57\u4ee3\u8868\u4e00\u4e2a\u5b57\u6bcd\u3002\u5177\u4f53\u5982\u4e0b\uff1a 1 \u8868\u793aB\u3001F\u3001P\u6216V\uff1b 2 \u8868\u793aC\u3001G\u3001J\u3001K\u3001Q\u3001S\u3001X\u6216Z\uff1b 3 \u8868\u793aD\u6216T\uff1b 4 \u8868\u793aL\uff1b 5 \u8868\u793aM\u6216N\uff1b 6 \u8868\u793aR\u3002 \u5b57\u6bcdA\uff0cE\uff0cI\uff0c0\uff0cU\uff0cH\uff0cW\u548cY\u5728Soundex\u4e2d\u4e0d\u7528\u7f16\u7801\u7684\uff0c\u53ef\u4ee5\u76f4\u63a5\u5ffd\u7565\u3002\u76f8\u90bb\u7684\u5e76\u4e14\u5177\u6709\u76f8\u540c\u7f16\u7801\u503c\u7684\u5b57\u6bcd\u53ea\u7528\u4e00\u4e2a\u5bf9\u5e94\u7684\u6570\u5b57\u8868\u793a\u3002\u5177\u6709\u76f8\u540cSoundex\u7f16\u7801\u503c\u7684\u5355\u8bcd\u88ab\u8ba4\u4e3a\u662f\u76f8\u540c\u7684\u5355\u8bcd\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u884c\u4e3a\u4e00\u4e2a\u5355\u8bcd\uff0c\u5168\u90e8\u5927\u5199\uff0c\u4e0d\u8d85\u8fc720\u4e2a\u5b57\u6bcd\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u5355\u8bcd\uff0c\u8f93\u51fa\u8be5\u5355\u8bcd\u7684Soundex\u7f16\u7801\uff0c\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
KHAWN
PFISTER
BOBBY<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
25
1236
11<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h> \n \nint main(){\n     \n    char str[1000];\n    while(~scanf(\"%s\",str)){\n        int i;\n        int n = strlen(str);\n        int flag[8]={0};\n        for(i = 0;i < n;i++){\n            switch(str[i]){\n            case 'B':\n            case 'F':\n            case 'P':\n            case 'V':if(flag[1]==0)printf(\"1\");flag[1]=1;flag[2]=0;flag[3]=0;flag[4]=0;flag[5]=0;flag[6]=0;break;\n            case 'C':\n            case 'G':\n            case 'J':\n            case 'K':\n            case 'Q':\n            case 'S':\n            case 'X':\n            case 'Z':if(flag[2]==0)printf(\"2\");flag[1]=0;flag[2]=1;flag[3]=0;flag[4]=0;flag[5]=0;flag[6]=0;break;\n            case 'D':\n            case 'T':if(flag[3]==0)printf(\"3\");flag[1]=0;flag[2]=0;flag[3]=1;flag[4]=0;flag[5]=0;flag[6]=0;break;\n            case 'L':if(flag[4]==0)printf(\"4\");flag[1]=0;flag[2]=0;flag[3]=0;flag[4]=1;flag[5]=0;flag[6]=0;break;\n            case 'M':\n            case 'N':if(flag[5]==0)printf(\"5\");flag[1]=0;flag[2]=0;flag[3]=0;flag[4]=0;flag[5]=1;flag[6]=0;break;\n            case 'R':if(flag[6]==0)printf(\"6\");flag[1]=0;flag[2]=0;flag[3]=0;flag[4]=0;flag[5]=0;flag[6]=1;break;\n            default:flag[1]=0;flag[2]=0;flag[3]=0;flag[4]=0;flag[5]=0;flag[6]=0;break;\n \n \n            }\n        }\n        printf(\"\\n\");\n \n    }\n     \n \n    return 0;\n} <\/code><\/pre>\n\n\n\n
4111 \u6d6e\u70b9\u6570\u683c\u5f0f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u8f93\u5165n\u4e2a\u6d6e\u70b9\u6570\uff0c\u8981\u6c42\u628a\u8fd9n\u4e2a\u6d6e\u70b9\u6570\u91cd\u65b0\u6392\u5217\u540e\u518d\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u4e00\u4e2a\u6b63\u6574\u6570n(n <= 10000)\uff0c\u540e\u9762n\u884c\u6bcf\u884c\u4e00\u4e2a\u6d6e\u70b9\u6570\uff0c\u4fdd\u8bc1\u5c0f\u6570\u70b9\u4f1a\u51fa\u73b0, \u6d6e\u70b9\u6570\u7684\u957f\u5ea6\u4e0d\u8d85\u8fc750\u4f4d\uff0c\u6ce8\u610f\u8fd9\u91cc\u7684\u6d6e\u70b9\u6570\u4f1a\u8d85\u8fc7\u7cfb\u7edf\u6807\u51c6\u6d6e\u70b9\u6570\u7684\u8868\u793a\u8303\u56f4\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
n\u884c\uff0c\u6bcf\u884c\u5bf9\u5e94\u4e00\u4e2a\u8f93\u5165\u3002\u8981\u6c42\u6bcf\u4e2a\u6d6e\u70b9\u6570\u7684\u5c0f\u6570\u70b9\u5728\u540c\u4e00\u5217\u4e0a\uff0c\u540c\u65f6\u8981\u6c42\u9996\u5217\u4e0a\u4e0d\u4f1a\u5168\u90e8\u662f\u7a7a\u683c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2
-0.34345
4545.232<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 -0.34345
 4545.232<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
 #include<stdio.h>\n #include<string.h>\n char a[10005][100];\n int index[10005];\n int max(int a,int b){\n     return a > b ? a : b;\n }\n int main(){\n     int n;\n     scanf(\"%d\",&n);\n     int len = 0;\n     int maxx = 0;\n     for(int i = 1;i <= n;i++){\n         scanf(\"%s\",a[i]);\n         len = strlen(a[i]);\n         for(int j = 0;j < len;j++){\n             if(a[i][j] == '.') index[i] = j;\n        }\n         maxx = max(maxx,index[i]);\n    }\n     for(int i = 1;i <= n;i++){\n         for(int j = 1;j <= maxx - index[i];j++){\n             printf(\" \");\n        }\n         puts(a[i]);\n    }\n }<\/code><\/pre>\n\n\n\n
4112 487-3279<\/a><\/h2>\n\n\n\n
\n
\u4f01\u4e1a\u559c\u6b22\u7528\u5bb9\u6613\u88ab\u8bb0\u4f4f\u7684\u7535\u8bdd\u53f7\u7801\u3002\u8ba9\u7535\u8bdd\u53f7\u7801\u5bb9\u6613\u88ab\u8bb0\u4f4f\u7684\u4e00\u4e2a\u529e\u6cd5\u662f\u5c06\u5b83\u5199\u6210\u4e00\u4e2a\u5bb9\u6613\u8bb0\u4f4f\u7684\u5355\u8bcd\u6216\u8005\u77ed\u8bed\u3002\u4f8b\u5982\uff0c\u4f60\u9700\u8981\u7ed9\u6ed1\u94c1\u5362\u5927\u5b66\u6253\u7535\u8bdd\u65f6\uff0c\u53ef\u4ee5\u62e8\u6253TUT-GLOP\u3002\u6709\u65f6\uff0c\u53ea\u5c06\u7535\u8bdd\u53f7\u7801\u4e2d\u90e8\u5206\u6570\u5b57\u62fc\u5199\u6210\u5355\u8bcd\u3002\u5f53\u4f60\u665a\u4e0a\u56de\u5230\u9152\u5e97\uff0c\u53ef\u4ee5\u901a\u8fc7\u62e8\u6253310-GINO\u6765\u5411Ginos\u8ba2\u4e00\u4efdpizza\u3002\u8ba9\u7535\u8bdd\u53f7\u7801\u5bb9\u6613\u88ab\u8bb0\u4f4f\u7684\u53e6\u4e00\u4e2a\u529e\u6cd5\u662f\u4ee5\u4e00\u79cd\u597d\u8bb0\u7684\u65b9\u5f0f\u5bf9\u53f7\u7801\u7684\u6570\u5b57\u8fdb\u884c\u5206\u7ec4\u3002\u901a\u8fc7\u62e8\u6253\u5fc5\u80dc\u5ba2\u7684\u201c\u4e09\u4e2a\u5341\u201d\u53f7\u78013-10-10-10\uff0c\u4f60\u53ef\u4ee5\u4ece\u4ed6\u4eec\u90a3\u91cc\u8ba2pizza\u3002 \u7535\u8bdd\u53f7\u7801\u7684\u6807\u51c6\u683c\u5f0f\u662f\u4e03\u4f4d\u5341\u8fdb\u5236\u6570\uff0c\u5e76\u5728\u7b2c\u4e09\u3001\u7b2c\u56db\u4f4d\u6570\u5b57\u4e4b\u95f4\u6709\u4e00\u4e2a\u8fde\u63a5\u7b26\u3002\u7535\u8bdd\u62e8\u53f7\u76d8\u63d0\u4f9b\u4e86\u4ece\u5b57\u6bcd\u5230\u6570\u5b57\u7684\u6620\u5c04\uff0c\u6620\u5c04\u5173\u7cfb\u5982\u4e0b\uff1a A\u3001B\u548cC\u6620\u5c04\u52302 D\u3001E\u548cF\u6620\u5c04\u52303 G\u3001H\u548cI\u6620\u5c04\u52304 J\u3001K\u548cL\u6620\u5c04\u52305 M\u3001N\u548cO\u6620\u5c04\u52306 P\u3001R\u548cS\u6620\u5c04\u52307 T\u3001U\u548cV\u6620\u5c04\u52308 W\u3001X\u548cY\u6620\u5c04\u52309 Q\u548cZ\u6ca1\u6709\u6620\u5c04\u5230\u4efb\u4f55\u6570\u5b57\uff0c\u8fde\u5b57\u7b26\u4e0d\u9700\u8981\u62e8\u53f7\uff0c\u53ef\u4ee5\u4efb\u610f\u6dfb\u52a0\u548c\u5220\u9664\u3002 TUT-GLOP\u7684\u6807\u51c6\u683c\u5f0f\u662f888-4567\uff0c310-GINO\u7684\u6807\u51c6\u683c\u5f0f\u662f310-4466\uff0c3-10-10-10\u7684\u6807\u51c6\u683c\u5f0f\u662f310-1010\u3002 \u5982\u679c\u4e24\u4e2a\u53f7\u7801\u6709\u76f8\u540c\u7684\u6807\u51c6\u683c\u5f0f\uff0c\u90a3\u4e48\u4ed6\u4eec\u5c31\u662f\u7b49\u540c\u7684\uff08\u76f8\u540c\u7684\u62e8\u53f7\uff09\u3002 \u4f60\u7684\u516c\u53f8\u6b63\u5728\u4e3a\u672c\u5730\u7684\u516c\u53f8\u7f16\u5199\u4e00\u4e2a\u7535\u8bdd\u53f7\u7801\u8584\u3002\u4f5c\u4e3a\u8d28\u91cf\u63a7\u5236\u7684\u4e00\u90e8\u5206\uff0c\u4f60\u60f3\u8981\u68c0\u67e5\u662f\u5426\u6709\u4e24\u4e2a\u548c\u591a\u4e2a\u516c\u53f8\u62e5\u6709\u76f8\u540c\u7684\u7535\u8bdd\u53f7\u7801\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u7684\u683c\u5f0f\u662f\uff0c\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u6307\u5b9a\u7535\u8bdd\u53f7\u7801\u8584\u4e2d\u53f7\u7801\u7684\u6570\u91cf\uff08\u6700\u591a100000\uff09\u3002\u4f59\u4e0b\u7684\u6bcf\u884c\u662f\u4e00\u4e2a\u7535\u8bdd\u53f7\u7801\u3002\u6bcf\u4e2a\u7535\u8bdd\u53f7\u7801\u7531\u6570\u5b57\uff0c\u5927\u5199\u5b57\u6bcd\uff08\u9664\u4e86Q\u548cZ\uff09\u4ee5\u53ca\u8fde\u63a5\u7b26\u7ec4\u6210\u3002\u6bcf\u4e2a\u7535\u8bdd\u53f7\u7801\u4e2d\u53ea\u4f1a\u521a\u597d\u67097\u4e2a\u6570\u5b57\u6216\u8005\u5b57\u6bcd\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u51fa\u73b0\u91cd\u590d\u7684\u53f7\u7801\u4ea7\u751f\u4e00\u884c\u8f93\u51fa\uff0c\u8f93\u51fa\u662f\u53f7\u7801\u7684\u6807\u51c6\u683c\u5f0f\u7d27\u8ddf\u4e00\u4e2a\u7a7a\u683c\u7136\u540e\u662f\u5b83\u7684\u91cd\u590d\u6b21\u6570\u3002\u5982\u679c\u5b58\u5728\u591a\u4e2a\u91cd\u590d\u7684\u53f7\u7801\uff0c\u5219\u6309\u7167\u53f7\u7801\u7684\u5b57\u5178\u5347\u5e8f\u8f93\u51fa\u3002\u5982\u679c\u8f93\u5165\u6570\u636e\u4e2d\u6ca1\u6709\u91cd\u590d\u7684\u53f7\u7801\uff0c\u8f93\u51fa\u4e00\u884c\uff1a No duplicates.<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 12
 4873279
 ITS-EASY
 888-4567
 3-10-10-10
 888-GLOP
 TUT-GLOP
 967-11-11
 310-GINO
 F101010
 888-1200
 -4-8-7-3-2-7-9-
 487-3279<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h> \nchar str[100005][100];\nchar str2[100005][100];\nint count[10000005]={0};\nint tonum(char p[]){\n\tint sum = 0;\n\tsum += (p[0]-'0')*1000000+(p[1]-'0')*100000+(p[2]-'0')*10000+(p[3]-'0')*1000+(p[4]-'0')*100+(p[5]-'0')*10+(p[6]-'0');\n\treturn sum;\n}\nint main(){\n\n\tint n;\n\tint i,j,k,p,q,len,t;\n\tscanf(\"%d\",&n);\n\tfor(i = 0;i < n;i++){\n\t\tt = 0;\n\t\tscanf(\"%s\",str[i]);\n\t\tlen = strlen(str[i]);\n\t\tfor(j = 0;j < len;j++){\n\t\t\tswitch(str[i][j]){\n\t\t\tcase 'A':\n\t\t\tcase 'B':\n\t\t\tcase 'C':str[i][j] = '2';break;\n\t\t\tcase 'D':\n\t\t\tcase 'E':\n\t\t\tcase 'F':str[i][j] = '3';break;\n\t\t\tcase 'G':\n\t\t\tcase 'H':\n\t\t\tcase 'I':str[i][j] = '4';break;\n\t\t\tcase 'J':\n\t\t\tcase 'K':\n\t\t\tcase 'L':str[i][j] = '5';break;\n\t\t\tcase 'M':\n\t\t\tcase 'N':\n\t\t\tcase 'O':str[i][j] = '6';break;\n\t\t\tcase 'P':\n\t\t\tcase 'R':\n\t\t\tcase 'S':str[i][j] = '7';break;\n\t\t\tcase 'T':\n\t\t\tcase 'U':\n\t\t\tcase 'V':str[i][j] = '8';break;\n\t\t\tcase 'W':\n\t\t\tcase 'X':\n\t\t\tcase 'Y':str[i][j] = '9';break;\n\n\n\t\t\t}\n\t\t}\n\t\tfor(k = 0;k < len;k++){\n\t\t\tif(str[i][k]>='0'&&str[i][k]<='9'){\n\t\t\t\tstr2[i][t++] = str[i][k];\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\n\tfor(i = 0;i < n;i++){\n\t\tint a = tonum(str2[i]);\n\t\tcount[a]++;\n\t}\n\tfor(i = 1000000;i < 10000000;i++){\n\t\tif(count[i]>1){\n\t\t\t\/\/printf(\"%c%c%c-%c%c%c%c %d\\n\",str2[i][0],str2[i][1],str2[i][2],str2[i][3],str2[i][4],str2[i][5],str2[i][6],count[j]);\n\t\t\tprintf(\"%d%d%d-%d%d%d%d %d\\n\",i\/1000000,(i)\/100000%10,i\/10000%10,i\/1000%10,i\/100%10,i\/10%10,i%10,count[i]);\n\t\t}\n\t}\n\t\/\/ for(p = 0;p < n;p++){\n\t\/\/ \tputs(str2[p]);\n\t\/\/ \tfor(q = p+1;q < n;q++){\n\t\/\/ \t\tif(strcmp(str2[p],str2[q])==0){\n\t\/\/ \t\t\tcount[p]++;\n\t\/\/ \t\t}\n\t\/\/ \t}\n\t\/\/ }\n\t\/\/ for(i = 0;i < n;i++){\n\t\/\/ \tif(count[i]>1){\n\t\/\/ \t\tprintf(\"%s %d\\n\",str2[i],count[i]);\n\t\/\/ \t}\n\t\/\/ }\n\n\treturn 0;\n} <\/code><\/pre>\n\n\n\n
4113 \u7c97\u5fc3\u7684\u6253\u5b57\u5458<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
Tony\u662f\u4e00\u4e2a\u7c97\u5fc3\u7684\u6253\u5b57\u5458\uff0c\u4ed6\u603b\u662f\u72af\u540c\u6837\u7684\u9519\u8bef\u3002\u66f4\u7cdf\u7cd5\u7684\u662f\uff0c\u5149\u6807\u952e\u574f\u4e86\uff0c\u56e0\u6b64\u4ed6\u53ea\u80fd\u7528\u9000\u683c\u952e\u56de\u5230\u51fa\u9519\u7684\u5730\u65b9\uff0c\u7ea0\u6b63\u4ee5\u540e\uff0c\u539f\u6765\u6b63\u786e\u5b57\u7b26\u8fd8\u5f97\u91cd\u65b0\u8f93\u5165\u3002 \u73b0\u5728\u8ba9\u6211\u4eec\u5e2e\u52a9Tony\u627e\u51fa\u81f3\u5c11\u9700\u8981\u591a\u957f\u65f6\u95f4\u624d\u80fd\u7ea0\u6b63\u4ed6\u7684\u9519\u8bef\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u7684\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570N\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570\u3002\u63a5\u4e0b\u6765\u6709N\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002 \u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53603\u884c\uff1a \u7b2c1\u884c\u662f\u4e00\u4e2a\u6b63\u6574\u6570t\uff08t <= 100\uff09,\u8868\u793aTony\u5220\u9664\u6216\u8005\u8f93\u5165\u4e00\u4e2a\u5b57\u7b26\u6240\u82b1\u7684\u65f6\u95f4\u3002 \u7b2c2\u884c\u662f\u6b63\u786e\u7684\u6587\u672c\u5185\u5bb9\u3002 \u7b2c3\u884c\u662fTony\u8f93\u5165\u7684\u6587\u672c\u5185\u5bb9\u3002 \u6ce8\u610f\uff1a\u6587\u672c\u5305\u542b\u90fd\u662f\u53ef\u8bfb\u5b57\u7b26\u3002\u6bcf\u884c\u6587\u672c\u957f\u5ea6\u4e0d\u8d85\u8fc780\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e3aTony\u7ea0\u6b63\u9519\u8bef\u6240\u82b1\u7684\u6700\u5c11\u65f6\u95f4\uff0c\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2
 1
 WishingBone
 WashingBone
 1
 Oops
 Oooops<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 20
 6<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5927\u5bb6\u53ef\u4ee5\u53d1\u73b0\u4e00\u4e2a\u4e8b\u60c5\uff0c\u5c31\u662f\u5982\u679c\u6211\u8981\u66f4\u6539\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u5c31\u8981\u628a\u6211\u6253\u9519\u7684\u90a3\u4e9b\u5168\u90fd\u5220\u4e86\u3002\u4ece\u54ea\u5f00\u59cb\u5220\uff1f\u4ece\u54ea\u91cc\u6253\u9519\u5c31\u4ece\u54ea\u91cc\u5f00\u59cb\u5220\u3002\u6240\u4ee5\u6211\u4eec\u4f1a\u53d1\u73b0\uff0c\u524d\u7f00\u76f8\u540c\u7684\u90e8\u5206\u4e0d\u7528\u52a8\uff0c\u6211\u4eec\u8981\u6539\u7684\u5c31\u662f\u540e\u9762\u4e0d\u540c\u7684\u90e8\u5206\u3002\u6240\u4ee5\u6211\u4eec\u7b97\u4e00\u4e0b\u4e0d\u7528\u52a8\u7684\u524d\u7f00\u957f\u5ea6\uff0c\u7136\u540e\u7b80\u5355\u6a21\u62df\u4e00\u4e0b\u5c31\u597d\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h> \nint min(int x,int y){\n\treturn x<y?x:y;\n}\nchar str1[10005];\nchar str2[10005];\nint main(){\n\t\n\tint n;\n\t\n\tint i,j;\n\tscanf(\"%d\",&n);\n\twhile(n--){\n\n\t\tint t;\n\t\tscanf(\"%d\",&t);\n\t\tscanf(\"%s\",str1);\n\t\tscanf(\"%s\",str2);\n\t\tint l1 = strlen(str1);\n\t\tint l2 = strlen(str2);\n\t\tint same = 0;\n\t\tint l = min(l1,l2);\n\t\tfor(i = 0;i < l;i++){\n\t\t\tif(str1[i]==str2[i]){\n\t\t\t\tsame++;\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t printf(\"%d\\n\",(l2-same+l1-same)*t);\n\n\t}\n\t\n\n\treturn 0;\n} <\/code><\/pre>\n\n\n\n
4114 \u5355\u8bcd\u9006\u5e8f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u5355\u8bcd\uff0c\u5728\u4e0d\u6539\u53d8\u8fd9\u4e9b\u5355\u8bcd\u4e4b\u95f4\u7684\u987a\u5e8f\u4e0b\uff0c\u9006\u5e8f\u8f93\u51fa\u6bcf\u4e2a\u5355\u8bcd\u3002 \u8fd9\u4e2a\u95ee\u9898\u5305\u62ec\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u7b2c1\u884c\u662f\u4e00\u4e2a\u6574\u6570M\uff0c\u7d27\u63a5\u7740\u662f\u4e00\u4e2a\u7a7a\u884c\uff0c\u7136\u540e\u662fM\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u7ec4\u6570\u636e\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\u3002\u8981\u6c42\u8f93\u51faM\u4e2a\u8f93\u51fa\u5757\u3002\u6bcf\u4e2a\u8f93\u51fa\u5757\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u4e3a\u4e00\u4e2a\u6574\u6570M\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570\u3002\u7136\u540e\u662f\u4e00\u4e2a\u7a7a\u884c\uff0c\u7d27\u63a5\u7740\u662fM\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u5f00\u59cb\u662f\u4e00\u4e2a\u6b63\u6574\u6570N\uff0c\u518d\u662fN\u884c\u6d4b\u8bd5\u6570\u636e\uff0c\u5305\u542b\u82e5\u5e72\u4e2a\u5355\u8bcd\uff0c\u5355\u8bcd\u4e4b\u95f4\u7528\u4e00\u4e2a\u7a7a\u683c\u9694\u5f00\uff0c\u6bcf\u4e2a\u5355\u8bcd\u4ec5\u7531\u5927\u5c0f\u5199\u5b57\u6bcd\u5b57\u7b26\u7ec4\u6210\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u7ec4\u6570\u636e\u4e2d\u7684\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 1
 \u200b
 3
 I am happy today
 To be or not to be
 I want to win the practice contest<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 I ma yppah yadot
 oT eb ro ton ot eb
 I tnaw ot niw eht ecitcarp tsetnoc<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h> \nvoid reverse(int x,int y,char str[]){\n\tint i;\n\tfor(i = y;i >= x;i--){\n\t\tprintf(\"%c\",str[i]);\n\t}\n}\nint main(){\n\tchar str[10000];\n\tint m;\n\tint n;\n\tint i;\n\tscanf(\"%d\",&m);\n\tgetchar();\n\twhile(m--){\n\t\tscanf(\"%d\",&n);\n\t\tgetchar();\n\t\twhile(n--){\n\t\t\tfgets(str,sizeof(str),stdin);\n\t\t\tint index1 = 0,index2;\n\t\t\tint len = strlen(str);\n\t\t\tstr[len - 1] = '\\0';\n\t\t\tfor(i = 0;i <= len;i++){\n\t\t\t\tif(str[i]==' '||str[i]=='\\0'){\n\t\t\t\t\tindex2 = i - 1;\n\t\t\t\t\treverse(index1,index2,str);\n\t\t\t\t\tindex1 = i + 1;\n\t\t\t\t\tprintf(\" \");\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\n\treturn 0;\n} <\/code><\/pre>\n\n\n\n
4201 \u51ef\u6492\u5bc6\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
Julius Caesar \u751f\u6d3b\u5728\u5145\u6ee1\u5371\u9669\u548c\u9634\u8c0b\u7684\u5e74\u4ee3\u3002\u4e3a\u4e86\u751f\u5b58\uff0c\u4ed6\u9996\u6b21\u53d1\u660e\u4e86\u5bc6\u7801\uff0c\u7528\u4e8e\u519b\u961f\u7684\u6d88\u606f\u4f20\u9012\u3002\u5047\u8bbe\u4f60\u662fCaesar \u519b\u56e2\u4e2d\u7684\u4e00\u540d\u519b\u5b98\uff0c\u9700\u8981\u628aCaesar \u53d1\u9001\u7684\u6d88\u606f\u7834\u8bd1\u51fa\u6765\u3001\u5e76\u63d0\u4f9b\u7ed9\u4f60\u7684\u5c06\u519b\u3002\u6d88\u606f\u52a0\u5bc6\u7684\u529e\u6cd5\u662f\uff1a\u5bf9\u6d88\u606f\u539f\u6587\u4e2d\u7684\u6bcf\u4e2a\u5b57\u6bcd\uff0c\u5206\u522b\u7528\u8be5\u5b57\u6bcd\u4e4b\u540e\u7684\u7b2c5\u4e2a\u5b57\u6bcd\u66ff\u6362\uff08\u4f8b\u5982\uff1a\u6d88\u606f\u539f\u6587\u4e2d\u7684\u6bcf\u4e2a\u5b57\u6bcdA\u90fd\u5206\u522b\u66ff\u6362\u6210\u5b57\u6bcdF\uff09\uff0c\u5176\u4ed6\u5b57\u7b26\u4e0d \u53d8\uff0c\u5e76\u4e14\u6d88\u606f\u539f\u6587\u7684\u6240\u6709\u5b57\u6bcd\u90fd\u662f\u5927\u5199\u7684\u3002 \u5bc6\u7801\u5b57\u6bcd\uff1aA B C D E F G H I J K L M N O P Q R S T U V W X Y Z \u539f\u6587\u5b57\u6bcd\uff1aV W X Y Z A B C D E F G H I J K L M N O P Q R S T U<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u6700\u591a\u4e0d\u8d85\u8fc7100\u4e2a\u6570\u636e\u96c6\u7ec4\u6210\u3002\u6bcf\u4e2a\u6570\u636e\u96c6\u75313\u90e8\u5206\u7ec4\u6210\uff1a \u8d77\u59cb\u884c\uff1aSTART \u5bc6\u7801\u6d88\u606f\uff1a\u75311\u5230200\u4e2a\u5b57\u7b26\u7ec4\u6210\u4e00\u884c\uff0c\u8868\u793aCaesar\u53d1\u51fa\u7684\u4e00\u6761\u6d88\u606f \u7ed3\u675f\u884c\uff1aEND<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u6bcf\u4e2a\u6570\u636e\u96c6\u5bf9\u5e94\u4e00\u884c\uff0c\u662fCaesar \u7684\u539f\u59cb\u6d88\u606f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 START
 NS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJX
 END
 START
 N BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJ
 END
 START
 IFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJ
 END
 ENDOFINPUT<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSES
 I WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROME
 DANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\n\nint main()\n{\n\tchar str[1000];\n\tint i;\n\n\twhile(gets(str))\n\t{\n\t    if(strcmp(str,\"START\")==0){\n\t       continue;\n\t    }\n\t    else if(strcmp(str,\"END\")==0){\n\t       continue;\n\t    }\n\t    else if(strcmp(str,\"ENDOFINPUT\")==0){\n\t        break;\n\t    }\n\t    else\n\t    {\n\t    \t\n\t\t    for(i=0;i<strlen(str);i++)\n\t    \t{\n\t\t\t  if(str[i] > 'E' && str[i]<='Z')\n\t\t\t    str[i] = str[i]-5;\n\t\t\t  else if(str[i]>='A'&&str[i]<='E')\n\t\t\t\tstr[i] = str[i]+21;\n\t\t    }\n\t\t    puts(str);\n\t\t}\n\t}\n\treturn 0;\n}\n<\/code><\/pre>\n\n\n\n
4202 \u5b50\u4e32<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u73b0\u5728\u6709\u4e00\u4e9b\u7531\u82f1\u6587\u5b57\u7b26\u7ec4\u6210\u7684\u5927\u5c0f\u5199\u654f\u611f\u7684\u5b57\u7b26\u4e32\uff0c\u4f60\u7684\u4efb\u52a1\u662f\u627e\u5230\u4e00\u4e2a\u6700\u957f\u7684\u5b57\u7b26\u4e32x\uff0c\u4f7f\u5f97\u5bf9\u4e8e\u5df2\u7ecf\u7ed9\u51fa\u7684\u5b57\u7b26\u4e32\u4e2d\u7684\u4efb\u610f\u4e00\u4e2ay\uff0cx\u6216\u8005\u662fy\u7684\u5b50\u4e32\uff0c\u6216\u8005x\u4e2d\u7684\u5b57\u7b26\u53cd\u5e8f\u4e4b\u540e\u5f97\u5230\u7684\u65b0\u5b57\u7b26\u4e32\u662fy\u7684\u5b50\u4e32\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570t (1 <= t <= 10)\uff0ct\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u6570\u76ee\u3002\u5bf9\u4e8e\u6bcf\u4e00\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570n (1 <= n <= 100)\uff0c\u8868\u793a\u5df2\u7ecf\u7ed9\u51fan\u4e2a\u5b57\u7b26\u4e32\u3002\u63a5\u4e0b\u6765n\u884c\uff0c\u6bcf\u884c\u7ed9\u51fa\u4e00\u4e2a\u957f\u5ea6\u57281\u548c100\u4e4b\u95f4\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e00\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e00\u884c\uff0c\u7ed9\u51fa\u9898\u76ee\u4e2d\u8981\u6c42\u7684\u5b57\u7b26\u4e32x\u7684\u957f\u5ea6\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2
 3
 ABCD
 BCDFF
 BRCD
 2
 rose
 orchid<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 2
 2<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5f88\u6076\u5fc3\u7684\u66b4\u529b\u679a\u4e3e\u3002\u8fd9\u9053\u9898\u5c31\u662f\u679a\u4e3e\u6240\u6709\u7684\u5b50\u4e32\u548c\u7ffb\u8f6c\u4e32\uff0c\u518d\u628a\u6240\u6709\u7684\u679a\u4e3e\u60c5\u51b5\u4e00\u4e00\u5224\u65ad\u4e00\u904d\u662f\u5426\u6210\u7acb\u3002<\/p>\n\n\n\n
\u5b57\u7b26\u6570\u7ec4\u8981\u968f\u65f6\u6e05\u7a7a\uff0cstrstr\u51fd\u6570\u8981\u53bb\u4e86\u89e3\u4e00\u4e0b\uff0c\u7528\u4e8e\u5728\u4e00\u4e2a\u5b57\u7b26\u4e32\uff08\u4e3b\u4e32\uff09\u4e2d\u67e5\u627e\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32\uff08\u5b50\u4e32\uff09\u7684\u4f4d\u7f6e\uff0c\u627e\u4e0d\u5230\u4f1a\u8fd4\u56deNULL\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nchar str[105][105];\nint min(int a,int b){\n    return a < b ? a : b;\n}\nint max(int a,int b){\n    return a > b ? a : b;\n}\nvoid solve(){\n    int n;\n    scanf(\"%d\",&n);\n    int minn = 100000;\n    int len = 0;\n    for(int i = 1;i <= n;i++){\n        scanf(\"%s\",str[i]);\n        len = strlen(str[i]);\n        minn = min(minn,len);\n    }\n    char temp[100];\n    int len1 = strlen(str[1]);\n    int ans = 0;\n    int length = 0;\n    for(int j = 0;j < len;j++){\n        memset(temp,'\\0',sizeof(temp));\n        for(int k = 1;k <= len;k++){\n            if(j + k > len1) continue;\n            strncpy(temp,str[1] + j,k);\n            length = strlen(temp);\n            int flag = 0;\n            char rev[105] = {'\\0'};\n            for(int l = 0;l < length;l++){\n                rev[l] = temp[length - l - 1];\n            }\n            for(int i = 2;i <= n;i++){\n                if(strstr(str[i],temp)|| strstr(str[i],rev)){\n                    \n                }else{\n                    flag = 1;\n                    break;\n                }\n            }\n            if(!flag){\n                ans = max(length,ans);\n            }\n        }\n    }\n    printf(\"%d\\n\",ans);\n}\nint main(){\n    int t;\n    scanf(\"%d\",&t);\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
4203 IBM\u51cf\u4e00<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4f60\u53ef\u80fd\u542c\u8bf4\u8fc7Arthur C. Clarke\u7684\u4e66\u201c2001-\u592a\u7a7a\u5965\u5fb7\u8d5b\u201d\uff0c\u6216\u8005\u7531Stanley Kubrick\u5199\u7684\u540c\u540d\u7535\u5f71\u3002\u4e66\u4e2d\u63cf\u8ff0\u7684\u662f\u4e00\u8258\u4ece\u5730\u7403\u98de\u5f80\u571f\u661f\u7684\u592a\u7a7a\u8239\u4e0a\u53d1\u751f\u7684\u4e8b\u60c5\u3002\u957f\u9014\u98de\u884c\uff0c\u8239\u5458\u90fd\u5f88\u75b2\u52b3\uff0c\u53ea\u6709\u4e24\u4e2a\u4eba\u662f\u6e05\u9192\u7684\u3002\u98de\u8239\u7531\u667a\u80fd\u7535\u8111HAL\u63a7\u5236\u7684\u3002\u4f46\u5728\u98de\u884c\u4e2d\uff0cHAL\u64cd\u4f5c\u53d8\u5f97\u8d8a\u6765\u8d8a\u5947\u602a\uff0c\u751a\u81f3\u5f00\u59cb\u8981\u6740\u6b7b\u8239\u4e0a\u7684\u8239\u5458\u3002\u6211\u4eec\u4e0d\u544a\u8bc9\u4f60\u6545\u4e8b\u7684\u7ed3\u5c40\uff0c\u4f60\u53ef\u4ee5\u8bd5\u7740\u4eb2\u81ea\u53bb\u9605\u8bfb\u3002 \u7535\u5f71\u4e0a\u6620\u540e\uff0c\u5927\u53d7\u6b22\u8fce\u3002\u4eba\u4eec\u5f00\u59cb\u8ba8\u8bba\u201cHAL\u201d\u7684\u540d\u5b57\u771f\u6b63\u7684\u542b\u4e49\u662f\u4ec0\u4e48\u3002\u6709\u4eba\u8ba4\u4e3a\u5b83\u53ef\u80fd\u662f\u201c\u542f\u53d1\u5f0f\u7b97\u6cd5\u201d\u7684\u7f29\u5199\u3002\u6709\u4eba\u53d1\u73b0\uff0c\u5982\u679c\u628aHAL\u4e2d\u7684\u6bcf\u4e2a\u5b57\u6bcd\u90fd\u66ff\u6362\u6210\u5b57\u6bcd\u8868\u4e2d\u5176\u540e\u7684\u5b57\u6bcd\uff0c\u5c31\u4f1a\u5f97\u5230\u201cIBM\u201d\u3002 \u7528\u8fd9\u4e2a\u65b9\u6cd5\u4e5f\u8bb8\u80fd\u591f\u627e\u51fa\u66f4\u591a\u7684\u7f29\u5199\u8bcd\u3002\u8bf7\u4f60\u7f16\u7a0b\u5e2e\u5fd9\u627e\u51fa\u8fd9\u4e9b\u5355\u8bcd\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u4e3a\u4e00\u4e2a\u6574\u6570n\uff0c\u8868\u793an\u4e2a\u5b57\u7b26\u4e32\u3002\u63a5\u4e0b\u6765\u7684n\u884c\u4e2d\uff0c\u6bcf\u884c\u4e3a\u4e00\u4e2a\u4e0d\u8d85\u8fc750\u5927\u5199\u5b57\u6bcd\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u5b57\u7b26\u4e32\uff0c\u5148\u8f93\u51fa\u5b57\u7b26\u4e32\u7684\u5e8f\u53f7\uff0c\u5982\u8f93\u51fa\u6837\u4f8b\u6240\u793a\u3002\u6700\u540e\u8f93\u51fa\u53d8\u6362\u540e\u5bf9\u5e94\u7684\u5b57\u7b26\u4e32\uff0c\u5373\u7528\u5b57\u6bcd\u8868\u4e2d\u540e\u9762\u7684\u5b57\u6bcd\u66ff\u6362\uff0c\u5176\u4e2d\u2018Z\u2019\u7528\u2018A\u2019\u66ff\u6362\u3002 \u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u4e4b\u540e\uff0c\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2
 HAL
 SWERC<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 String #1
 IBM
 \u200b
 String #2
 TXFSD<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    for(int i = 1;i <= n;i++){\n        char str[1000];\n        scanf(\"%s\",str);\n        int len = strlen(str);\n        for(int j = 0;j < len;j++){\n            str[j]++;\n            if(str[j] > 'Z') str[j] = 'A';\n        }\n        printf(\"String #%d\\n\",i);\n        printf(\"%s\\n\",str);\n        printf(\"\\n\");\n    }\n}<\/code><\/pre>\n\n\n\n
4204 W\u5bc6\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u52a0\u5bc6\u4e00\u6761\u4fe1\u606f\u9700\u8981\u4e09\u4e2a\u6574\u6570\u7801, k1, k2 \u548c k3\u3002\u5b57\u7b26[a-i] \u7ec4\u6210\u4e00\u7ec4, [j-r] \u662f\u7b2c\u4e8c\u7ec4, \u5176\u5b83\u6240\u6709\u5b57\u7b26 ([s-z] \u548c\u4e0b\u5212\u7ebf)\u7ec4\u6210\u7b2c\u4e09\u7ec4\u3002 \u5728\u4fe1\u606f\u4e2d\u5c5e\u4e8e\u6bcf\u7ec4\u7684\u5b57\u7b26\u5c06\u88ab\u5faa\u73af\u5730\u5411\u5de6\u79fb\u52a8ki\u4e2a\u4f4d\u7f6e\u3002 \u6bcf\u7ec4\u4e2d\u7684\u5b57\u7b26\u53ea\u5728\u81ea\u5df1\u7ec4\u4e2d\u7684\u5b57\u7b26\u6784\u6210\u7684\u4e32\u4e2d\u79fb\u52a8\u3002\u89e3\u5bc6\u7684\u8fc7\u7a0b\u5c31\u662f\u6bcf\u7ec4\u4e2d\u7684\u5b57\u7b26\u5728\u81ea\u5df1\u6240\u5728\u7684\u7ec4\u4e2d\u5faa\u73af\u5730\u5411\u53f3\u79fb\u52a8ki\u4e2a\u4f4d\u7f6e\u3002 \u4f8b\u5982\u5bf9\u4e8e\u4fe1\u606f the_quick_brown_fox \u4ee5ki \u5206\u522b\u4e3a 2, 3 \u548c 1\u8fdb\u884c\u52a0\u5bc6\u3002\u52a0\u5bc6\u540e\u53d8\u6210 _icuo_bfnwhoq_kxert\u3002\u4e0b\u56fe\u663e\u793a\u4e86\u53f3\u65cb\u89e3\u5bc6\u7684\u8fc7\u7a0b\u3002<\/p>\n\n\n\n
\"4204.png\"<\/div><\/figure>\n\n\n\n
\u53f3\u65cb\u89e3\u5bc6\u793a\u610f\u56fe<\/p>\n\n\n\n
\u89c2\u5bdf\u5728\u7ec4[a-i]\u4e2d\u7684\u5b57\u7b26\uff0c\u6211\u4eec\u53d1\u73b0{i,c,b,f,h,e}\u51fa\u73b0\u5728\u4fe1\u606f\u4e2d\u7684\u4f4d\u7f6e\u4e3a{2,3,7,8,11,17}\u3002\u5f53k1=2\u53f3\u65cb\u4e00\u6b21\u540e, \u4e0a\u8ff0\u4f4d\u7f6e\u4e2d\u7684\u5b57\u7b26\u53d8\u6210{h,e,i,c,b,f}\u3002\u4e0b\u8868\u663e\u793a\u4e86\u7ecf\u8fc7\u6240\u6709\u7b2c\u4e00\u7ec4\u5b57\u7b26\u65cb\u8f6c\u5f97\u5230\u7684\u4e2d\u95f4\u5b57\u7b26\u4e32\uff0c\u7136\u540e\u662f\u6240\u6709\u7b2c\u4e8c\u7ec4\uff0c\u7b2c\u4e09\u7ec4\u65cb\u8f6c\u7684\u4e2d\u95f4\u5b57\u7b26\u4e32\u3002\u5728\u4e00\u7ec4\u4e2d\u53d8\u6362\u5b57\u7b26\u5c06\u4e0d\u5f71\u54cd\u5176\u5b83\u7ec4\u4e2d\u5b57\u7b26\u7684\u4f4d\u7f6e\u3002<\/p>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u6240\u6709\u8f93\u5165\u5b57\u7b26\u4e32\u4e2d\u53ea\u5305\u542b\u5c0f\u5199\u5b57\u6bcd\u548c\u4e0b\u5212\u7ebf( _ )\u3002\u6bcf\u4e2a\u5b57\u7b26\u4e32\u7684\u957f\u5ea6\u4e0d\u8d85\u8fc780\u4e2a\u5b57\u7b26\u3002ki \u662f1-100\u4e4b\u95f4\u7684\u6574\u6570\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u62ec\u4e00\u5230\u591a\u7ec4\u6570\u636e\u3002\u6bcf\u4e2a\u7ec4\u524d\u9762\u4e00\u884c\u5305\u62ec\u4e09\u4e2a\u6574\u6570 k1, k2 \u548c k3\uff0c\u540e\u9762\u662f\u4e00\u884c\u52a0\u5bc6\u4fe1\u606f\u3002\u8f93\u5165\u7684\u6700\u540e\u4e00\u884c\u662f\u7531\u4e09\u4e2a0\u7ec4\u6210\u7684\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u7ec4\u52a0\u5bc6\u6570\u636e\uff0c\u8f93\u51fa\u5b83\u52a0\u5bc6\u524d\u7684\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2 3 1
 _icuo_bfnwhoq_kxert
 1 1 1
 bcalmkyzx
 3 7 4
 wcb_mxfep_dorul_eov_qtkrhe_ozany_dgtoh_u_eji
 2 4 3
 cjvdksaltbmu
 0 0 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 the_quick_brown_fox
 abcklmxyz
 the_quick_brown_fox_jumped_over_the_lazy_dog
 ajsbktcludmv<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5c31\u8ddf\u7740\u53bb\u6a21\u62df\uff0c\u5148\u5206\u7ec4\u5b58\u50a8\uff0c\u8bb0\u5f97\u5b58\u50a8\u7d22\u5f15\uff0c\u4e0d\u7136\u4e4b\u540e\u4e0d\u77e5\u9053\u8f93\u51fa\u54ea\u4e2a\u7ec4\u7684\u503c\u3002<\/p>\n\n\n\n
\u5206\u7ec4\u5b58\u50a8\u540e\uff0c\u6a21\u62df\u79fb\u52a8\uff0c\u6bcf\u4e00\u7ec4\u5411\u53f3\u79fb\u52a8k\u4f4d\u3002\u7b2c\u4e09\u7ec4\u7684\u4e0b\u5212\u7ebf\u8bb0\u5f97\u8981\u7279\u5224\u4e00\u4e0b\u3002<\/p>\n\n\n\n
\u867d\u7136\u6a21\u62df\u5f88\u590d\u6742\uff0c\u4f46\u662f\u5206\u89e3\u8d77\u6765\u4e5f\u4e0d\u96be\uff0c\u6bcf\u4e00\u7ec4\u505a\u7684\u4e8b\u60c5\u90fd\u662f\u4e00\u6837\u7684\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nint main(){\n    int k1,k2,k3;\n    while(~scanf(\"%d %d %d\",&k1,&k2,&k3)){\n        if(!k1 && !k2 && !k3) break;\n        char group1[2000] = {'\\0'};\n        char group2[2000] = {'\\0'};\n        char group3[2000] = {'\\0'};\n        char str[2000] = {'\\0'};\n        scanf(\"%s\",str);\n        int len = strlen(str);\n        int a = 0;\n        int b = 0;\n        int c = 0;\n        int index[2000] = {0};\n        \/\/\u5206\u7ec4\u8bfb\u5165\n        \/\/index\u6570\u7ec4\u7528\u6765\u7d22\u5f15\n        for(int i = 0 ;i < len;i++){\n            if(str[i] >= 'a' && str[i] <= 'i'){\n                group1[a++] = str[i];\n                index[i] = 1;\n            }\n            if(str[i] >= 'j' && str[i] <= 'r'){\n                group2[b++] = str[i];\n                index[i] = 2;\n            }\n            if(str[i] >= 's' && str[i] <= 'z' || str[i] == '_'){\n                group3[c++] = str[i];\n                index[i] = 3;\n            }\n        }\n\n        \/\/\u79fb\u52a8group1\n        for(int i = a - 1;i >= 0;i--){\n            group1[i + k1] = group1[i];\n        }\n        for(int i = a;i <= 200;i++){\n            if(group1[i] >= 'a' && group1[i] <= 'z'){\n                group1[i - a] = group1[i];\n            }else{\n                break;\n            }\n        }\n        group1[a] = '\\0';\n        \/\/\u79fb\u52a8group2\n        for(int i = b - 1;i >= 0;i--){\n            group2[i + k2] = group2[i];\n        }\n        for(int i = b;i <= 200;i++){\n            if(group2[i] >= 'a' && group2[i] <= 'z'){\n                group2[i - b] = group2[i];\n            }else{\n                break;\n            }\n        }\n        group2[b] = '\\0';\n        \/\/\u79fb\u52a8group3\n        for(int i = c - 1;i >= 0;i--){\n            group3[i + k3] = group3[i];\n        }\n        for(int i = c;i <= 200;i++){\n            if(group3[i] >= 'a' && group3[i] <= 'z' || group3[i] == '_'){\n                group3[i - c] = group3[i];\n            }else{\n                break;\n            }\n        }\n        group3[c] = '\\0';\n        \/\/\u5f00\u59cb\u6309\u7167index\u6570\u7ec4\u7684\u7d22\u5f15\u8f93\u51fa\n        int index1 = 0;\n        int index2 = 0;\n        int index3 = 0;\n        for(int i = 0;i < len;i++){\n            \/\/\u8f93\u51fa\u5206\u7ec41\n            if(index[i] == 1){\n                printf(\"%c\",group1[index1++]);\n            }\n            \/\/\u8f93\u51fa\u5206\u7ec42\n            if(index[i] == 2){\n                printf(\"%c\",group2[index2++]);\n            }\n            \/\/\u8f93\u51fa\u5206\u7ec43\n            if(index[i] == 3){\n                printf(\"%c\",group3[index3++]);\n            }\n        }\n        printf(\"\\n\");\n    }\n}<\/code><\/pre>\n\n\n\n
4205 \u5b57\u7b26\u957f\u5ea6\u7f16\u7801<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4f60\u7684\u4efb\u52a1\u662f\u7f16\u7a0b\u5b9e\u73b0\u4e00\u4e2a\u7b80\u5355\u7684\u5b57\u7b26\u957f\u5ea6\u7f16\u7801\u65b9\u6cd5\u3002\u5177\u4f53\u89c4\u5219\u5982\u4e0b\uff1a \u5c06\u4efb\u4f55\u75312~9\u4e2a\u76f8\u540c\u5b57\u7b26\u6784\u6210\u7684\u5e8f\u5217\u75282\u4e2a\u5b57\u7b26\u7f16\u7801\uff1a\u7b2c1\u4e2a\u5b57\u7b26\u4e3a\u6570\u5b572\uff5e9\uff0c\u8868\u793a\u5e8f\u5217\u957f\u5ea6\uff0c\u7b2c2\u4e2a\u5b57\u7b26\u4e3a\u91cd\u590d\u5b57\u7b26\u672c\u8eab\u3002\u8d85\u8fc79\u4e2a\u5b57\u7b26\u7684\uff0c\u5148\u5bf9\u524d9\u4e2a\u5b57\u7b26\u8fdb\u884c\u7f16\u7801\uff0c\u7136\u540e\u518d\u7f16\u7801\u5269\u4f59\u7684\u3002 \u5982\u679c\u5b50\u5e8f\u5217\u4e2d\u6ca1\u6709\u4efb\u4f55\u91cd\u590d\u7684\u5b57\u7b26\uff0c\u5219\u7528\u5b57\u7b26\u201c1\u201d\u5f00\u5934\uff0c\u7136\u540e\u662f\u5b50\u5e8f\u5217\u672c\u8eab\uff0c\u6700\u540e\u518d\u4ee5\u5b57\u7b26\u201c1\u201d\u7ed3\u675f\u3002\u82e5\u5b57\u7b26\u4e32\u4e2d\u542b\u6709\u5b57\u7b26\u201c1\u201d\uff0c\u5219\u7528\u4e24\u4e2a\u201c1\u201d\u66ff\u6362\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b\u82e5\u5e72\u884c\uff0c\u6bcf\u884c\u7684\u5b57\u7b26\u90fd\u662f\u5927\u5c0f\u5199\u5b57\u6bcd\u5b57\u7b26\uff0c\u6570\u5b57\u5b57\u7b26\uff0c\u7a7a\u683c\u6216\u6807\u70b9\u7b26\u53f7\uff0c\u6ca1\u6709\u5176\u4ed6\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u884c\u8fdb\u884c\u957f\u5ea6\u7f16\u7801\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 AAAAAABCCCC
 12344<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 6A1B14C
 11123124<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6309\u7167\u9898\u76ee\u7684\u601d\u8def\u53bb\u6a21\u62df\uff0c\u7b14\u8005\u7684\u4ee3\u7801\u4e5f\u4e0d\u592a\u597d\u53c2\u8003\u3002<\/p>\n\n\n\n
\u8fd9\u8fb9\u53ef\u4ee5\u7ed9\u8bfb\u8005\u4e00\u4e9b\u5c0f\u601d\u8def\uff1a\u6211\u4eec\u8981\u5148\u80fd\u5224\u65ad\u8fde\u7eed\u548c\u975e\u8fde\u7eed\uff0c\u6bd4\u5982\u7528\u8ba1\u6570\u7684\u65b9\u5f0f\u3002\u5982\u679c\u662f\u8fde\u7eed\u7247\u6bb5\uff0c\u5c31\u6b63\u5e38\u5904\u7406\uff0c\u90a3\u5982\u679c\u9047\u5230\u975e\u8fde\u7eed\u7247\u6bb5\u5462\uff1f\u5c31\u5230\u4e0b\u4e00\u6b21\u9047\u5230\u8fde\u7eed\u7247\u6bb5\u7684\u65f6\u5019\u5904\u7406\uff08\u5982\u679c\u662f\u7ed3\u5c3e\u7684\u975e\u8fde\u7eed\u7247\u6bb5\u5c31\u7279\u5224\uff09\u3002<\/p>\n\n\n\n
\u7b14\u8005\u4ee3\u7801\u6bd4\u8f83\u96be\u4ee5\u7406\u89e3\uff0c\u8fd9\u9053\u9898\u63a8\u8350\u8bfb\u8005\u81ea\u884c\u5b9e\u73b0\uff0c\u6838\u5fc3\u601d\u8def\u5c31\u662f\u53bb\u6a21\u62df\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\n\nint main(){\n    char str[1000];\n    \n    while(~scanf(\"%s\",str)){\n        char temp[100] = {'\\0'}; \/\/\u4e34\u65f6\u6570\u7ec4\u7528\u4e8e\u5b58\u50a8\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\n        int len = strlen(str);\n        int cnt1 = 1; \/\/\u7528\u4e8e\u8ba1\u6570\u8fde\u7eed\u5b57\u7b26\u7684\u6570\u91cf\n        int cnt2 = 0; \/\/\u7528\u4e8e\u8ba1\u6570\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\u7684\u957f\u5ea6\n        int i = 0, j = 0;\n        \n        for(i = 0; i < len; i += cnt1){\n            memset(temp, '\\0', sizeof(temp)); \/\/\u6e05\u7a7a\u4e34\u65f6\u6570\u7ec4\n            cnt1 = 1;\n            for(j = i + 1; j < len; j++){\n                if(str[j] == str[j - 1]){\n                    cnt1++;\n                }else{\n                    break;\n                }\n            }\n            \/\/ \u5982\u679c\u53ea\u6709\u4e00\u4e2a\u5b57\u7b26\uff0c\u8bf4\u660e\u4e0d\u91cd\u590d\uff0c\u589e\u52a0\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\u957f\u5ea6\n            if(cnt1 == 1){\n                cnt2++;\n            }else{\n                \/\/\u5982\u679c\u4e4b\u524d\u6709\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\uff0c\u5219\u8f93\u51fa\u5b83\u4eec\u7684\u7f16\u7801\n                if(cnt2 != 0){\n                    strncpy(temp, str + i - cnt2, cnt2); \/\/ \u628a\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\u590d\u5236\u5230\u4e34\u65f6\u6570\u7ec4\n                    \n                    \/\/\u5904\u7406\u30101%s1\u3011\u7684\u90e8\u5206\n                    printf(\"1\"); \n                    int l = strlen(temp);\n                    for(int i = 0; i < l; i++){\n                        if(temp[i] != '1') printf(\"%c\", temp[i]);\n                        else printf(\"11\");\n                    }\n                    printf(\"1\");\n                    \n                    cnt2 = 0; \/\/\u91cd\u7f6e\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\u957f\u5ea6\n                    memset(temp, '\\0', sizeof(temp));\n                }\n                \/\/\u8f93\u51fa\u8fde\u7eed\u5b57\u7b26\n                printf(\"%d%c\", cnt1, str[j - 1]);\n            }\n            \n        }\n        \/\/\u5904\u7406\u5b57\u7b26\u4e32\u672b\u5c3e\u7684\u975e\u91cd\u590d\u5b57\u7b26\u5e8f\u5217\n        \/\/\u5904\u7406\u30101%s1\u3011\u7684\u90e8\u5206\n        strncpy(temp, str + i - cnt2, cnt2);\n        if(temp[0] != '\\0'){\n            printf(\"1\"); \n            int l = strlen(temp);\n            for(int i = 0; i < l; i++){\n                if(temp[i] != '1') printf(\"%c\", temp[i]);\n                else printf(\"11\");\n            }\n            printf(\"1\");\n                \n        }\n        printf(\"\\n\");\n    }\n}<\/code><\/pre>\n\n\n\n
4206 LC\u663e\u793a\u5668<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4f60\u7684\u4e00\u4e2a\u670b\u53cb\u521a\u4e70\u4e86\u4e00\u53f0\u65b0\u7535\u8111\uff0c\u76ee\u524d\u4e3a\u6b62\uff0c\u4ed6\u66fe\u7ecf\u4f7f\u7528\u8fc7\u7684\u6700\u5f3a\u5927\u7684\u7535\u8111\u4e00\u76f4\u662f\u4e00\u4e2a\u8896\u73cd\u8ba1\u7b97\u5668\u3002\u4ed6\u5bf9\u65b0\u7535\u8111\u975e\u5e38\u5931\u671b\uff0c\u56e0\u4e3a\u4ed6\u559c\u6b22\u90a3\u79cd\u8ba1\u6570\u5668\u7684LC\u663e\u793a\u5668\u3002\u56e0\u6b64\u4f60\u51b3\u5b9a\u7f16\u7a0b\u5728\u4f60\u670b\u53cb\u7684\u7535\u8111\u4e0a\u7528LC\u663e\u793a\u5668\u65b9\u5f0f\u6765\u663e\u793a\u6570\u5b57\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b\u82e5\u5e72\u884c\uff0c\u6bcf\u4e00\u884c\u4e2d\u6709\u4e24\u4e2a\u6574\u6570s\u548cn\uff0c\uff081 <= s <= 10\uff0c0 <= n <= 99999999\uff09\u3002N\u8868\u793a\u8981\u663e\u793a\u7684\u6570\u5b57\uff0cs\u662f\u5b83\u5e94\u663e\u793a\u7684\u5927\u5c0f\u3002\u6700\u540e\u4e00\u884c\u4e3a\u4e24\u4e2a0\uff0c\u8868\u793a\u8f93\u5165\u7ed3\u675f\uff0c\u8fd9\u4e2a\u4e0d\u9700\u8981\u5904\u7406\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u4ee5LC\u663e\u793a\u5668\u7684\u65b9\u5f0f\u8f93\u51fa\u7ed9\u5b9a\u7684\u6570\uff0c\u7528s\u4e2a\u201c-\u201d\u6c34\u5e73\u7ebf\u6bb5\uff0cs\u4e2a\u201c|\u201d\u5782\u76f4\u7ebf\u6bb5\u3002\u6bcf\u4e2a\u6570\u5b57\u521a\u597d\u5360s+2\u5217\uff0c2s+3\u884c\u3002\uff08\u8bf7\u786e\u4fdd\u7528\u7a7a\u683c\u586b\u6ee1\u6240\u6709\u6570\u5b57\u4e4b\u95f4\u7684\u7a7a\u767d\u533a\u57df\uff0c\u5305\u62ec\u6700\u540e\u4e00\u4e2a\u6570\u5b57\uff09\uff0c\u4e24\u4e2a\u6570\u5b57\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u5217\u3002\u6bcf\u7ec4\u6570\u5b57\u540e\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002\u8be6\u89c1\u8f93\u5165\u8f93\u51fa\u6837\u4f8b\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2 12345
 3 67890
 0 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
      —   —       —
    |   |   | | | |  
    |   |   | | | |  
      —   —   —   —
    | |       |   |   |
    | |       |   |   |
      —   —       —
 \u200b
  —   —   —   —   —
 |         | |   | |   | |   |
 |         | |   | |   | |   |
 |         | |   | |   | |   |
  —         —   —      
 |   |     | |   |     | |   |
 |   |     | |   |     | |   |
 |   |     | |   |     | |   |
  —         —   —   —<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u592a\u96be\u6a21\u62df\u4e86\uff0c\u4e0d\u591a\u89e3\u91ca\uff0c\u770b\u4ee3\u7801\u3002<\/p>\n\n\n\n
\u6253\u5370\u7684\u8bdd\u5c31\u6309\u884c\u6253\u5370\uff0c\u7136\u540e\u4f9d\u6b21\u904d\u5386\u6bcf\u4e00\u4e2a\u6570\u5b57\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h>\n\/\/ \u6570\u5b57\u7684LCD\u8868\u793a\u5f62\u5f0f\uff0c0\u8868\u793a\u4e0d\u6253\u5370\uff0c1\u8868\u793a\u6c34\u5e73\u7ebf\u6bb5\uff0c2\u8868\u793a\u5782\u76f4\u7ebf\u6bb5\nint digits[10][7] = {\n    {1, 2, 2, 0, 2, 2, 1}, \/\/ 0\n    {0, 0, 2, 0, 0, 2, 0}, \/\/ 1\n    {1, 0, 2, 1, 2, 0, 1}, \/\/ 2\n    {1, 0, 2, 1, 0, 2, 1}, \/\/ 3\n    {0, 2, 2, 1, 0, 2, 0}, \/\/ 4\n    {1, 2, 0, 1, 0, 2, 1}, \/\/ 5\n    {1, 2, 0, 1, 2, 2, 1}, \/\/ 6\n    {1, 0, 2, 0, 0, 2, 0}, \/\/ 7\n    {1, 2, 2, 1, 2, 2, 1}, \/\/ 8\n    {1, 2, 2, 1, 0, 2, 1}  \/\/ 9\n};\n\n\/\/ \u6253\u5370\u4e00\u4e2a\u6570\u5b57\u7684\u4e00\u884c\nvoid printLine(int digit, int line, int size) {\n    \/\/ \u6839\u636e\u884c\u53f7line\u786e\u5b9a\u6253\u5370\u54ea\u4e00\u90e8\u5206\n    int part = line \/ (size + 1); \/\/ 0, 1, 2\n    int pos = part * 3; \/\/ \u6570\u7ec4\u4e2d\u7684\u4f4d\u7f6e: 0, 3, 6 \u5bf9\u5e94\u4e0a\u4e2d\u4e0b\u7684\u6c34\u5e73\u7ebf\u6bb5\n    if (line % (size + 1) == 0) { \/\/ \u6253\u5370\u6c34\u5e73\u7ebf\u6bb5\n        putchar(' '); \/\/ \u5de6\u8fb9\u7684\u7a7a\u767d\n        for (int i = 0; i < size; i++) {\n            putchar(digits[digit][pos] ? '-' : ' ');\n        }\n        putchar(' '); \/\/ \u53f3\u8fb9\u7684\u7a7a\u767d\n    } else { \/\/ \u6253\u5370\u5782\u76f4\u7ebf\u6bb5\n        putchar(digits[digit][pos + 1] ? '|' : ' '); \/\/ \u5de6\u8fb9\u7684\u5782\u76f4\u7ebf\u6bb5\n        for (int i = 0; i < size; i++) {\n            putchar(' '); \/\/ \u4e2d\u95f4\u7684\u7a7a\u767d\n        }\n        putchar(digits[digit][pos + 2] ? '|' : ' '); \/\/ \u53f3\u8fb9\u7684\u5782\u76f4\u7ebf\u6bb5\n    }\n}\n\n\/\/ \u6253\u5370\u6570\u5b57n\u7684LCD\u8868\u793a\nvoid printLCD(int size, char number[]) {\n    int length = strlen(number);\n    for (int line = 0; line < 2 * size + 3; line++) { \/\/ \u603b\u51712s+3\u884c\n        for (int num = 0; num < length; num++) { \/\/ \u904d\u5386\u6bcf\u4e2a\u6570\u5b57\n            int digit = number[num] - '0'; \/\/ \u5c06\u5b57\u7b26\u8f6c\u6362\u4e3a\u6570\u5b57\n            printLine(digit, line, size); \/\/ \u6253\u5370\u5f53\u524d\u884c\n            if (num < length - 1) {\n                putchar(' '); \/\/ \u6570\u5b57\u4e4b\u95f4\u7684\u7a7a\u767d\u5217\n            }\n        }\n        putchar('\\n'); \/\/ \u6bcf\u4e00\u884c\u540e\u6362\u884c\n    }\n}\n\nint main() {\n    int s;\n    char n[9];\n    \n    while (scanf(\"%d %s\", &s, n) == 2 && (s || strcmp(n, \"0\"))) {\n        printLCD(s, n);\n        printf(\"\\n\"); \/\/ \u6bcf\u7ec4\u6570\u5b57\u540e\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
4207 \u82f1\u8bed\u5230\u6570\u5b57\u7ffb\u8bd1<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u6216\u591a\u4e2a\u8868\u793a\u6574\u6570\u7684\u82f1\u6587\u5355\u8bcd\uff0c\u4f60\u7684\u4efb\u52a1\u5c31\u662f\u628a\u8fd9\u4e9b\u82f1\u6587\u5355\u8bcd\u8868\u793a\u7684\u6574\u6570\u7ffb\u8bd1\u6210\u6570\u5b57\u5f62\u5f0f\u3002\u6570\u5b57\u7684\u8303\u56f4\u662f\u4ece-999999999\u5230+999999999\u3002\u4ee5\u4e0b\u662f\u53ef\u80fd\u51fa\u73b0\u7684\u82f1\u6587\u5355\u8bcd\uff1a negative,zero,one,two,three,four,five,six,seven,eight,nini,ten,eleven,twelve,thirteen,fourteen,fifteen,sixteen,seventeen,eighteen,nineteen,twenty,thirty,forty,fifty, sixty,seventy,eighty,ninety,hundred,thousand,millon<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u9700\u8981\u6ce8\u610f\u4ee5\u4e0b\u8f93\u5165\uff0c\u8d1f\u6570\u524d\u9762\u7528negative\u5355\u8bcd\uff1b\u5f53\u80fd\u7528thousand\u8868\u793a\u65f6\uff0c\u5c31\u4e0d\u7528hundred\u6765\u8868\u793a\u3002\u4f8b\u5982\uff0c1500\u8868\u793a\u6210one thousand five hundred\uff0c\u800c\u4e0d\u662ffifteen hundred\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u7ffb\u8bd1\u540e\u7684\u6574\u6570\uff0c\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 six
 negative seven hundred twenty nine
 one million one hundred one
 eight hundred fourteen thousand twenty two<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 6
 -729
 1000101
 814022<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6309\u7167\u9898\u76ee\u5c31\u6a21\u62df\uff0c\u628a\u82f1\u6587\u8f6c\u6362\u6210\u6570\u5b57\uff0c\u7136\u540e\u9010\u4e2a\u5904\u7406\u3002\u6ca1\u9047\u5230\u4e58\u6570\u8bcd\u4e4b\u524d\u5c31\u7d2f\u52a0\uff0c\u9047\u5230\u5927\u7684\u4e58\u6570\u8bcd\u4e4b\u540e\u5c31\u7ffb\u500d\uff0c\u7136\u540e\u91cd\u65b0\u7d2f\u52a0\u3002<\/p>\n\n\n\n
\u5177\u4f53\u770b\u4ee3\u7801~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\n\nint wordToNumber(char word[]) {\n    if (strcmp(word, \"zero\") == 0) return 0;\n    if (strcmp(word, \"one\") == 0) return 1;\n    if (strcmp(word, \"two\") == 0) return 2;\n    if (strcmp(word, \"three\") == 0) return 3;\n    if (strcmp(word, \"four\") == 0) return 4;\n    if (strcmp(word, \"five\") == 0) return 5;\n    if (strcmp(word, \"six\") == 0) return 6;\n    if (strcmp(word, \"seven\") == 0) return 7;\n    if (strcmp(word, \"eight\") == 0) return 8;\n    if (strcmp(word, \"nine\") == 0) return 9;\n    if (strcmp(word, \"ten\") == 0) return 10;\n    if (strcmp(word, \"eleven\") == 0) return 11;\n    if (strcmp(word, \"twelve\") == 0) return 12;\n    if (strcmp(word, \"thirteen\") == 0) return 13;\n    if (strcmp(word, \"fourteen\") == 0) return 14;\n    if (strcmp(word, \"fifteen\") == 0) return 15;\n    if (strcmp(word, \"sixteen\") == 0) return 16;\n    if (strcmp(word, \"seventeen\") == 0) return 17;\n    if (strcmp(word, \"eighteen\") == 0) return 18;\n    if (strcmp(word, \"nineteen\") == 0) return 19;\n    if (strcmp(word, \"twenty\") == 0) return 20;\n    if (strcmp(word, \"thirty\") == 0) return 30;\n    if (strcmp(word, \"forty\") == 0) return 40;\n    if (strcmp(word, \"fifty\") == 0) return 50;\n    if (strcmp(word, \"sixty\") == 0) return 60;\n    if (strcmp(word, \"seventy\") == 0) return 70;\n    if (strcmp(word, \"eighty\") == 0) return 80;\n    if (strcmp(word, \"ninety\") == 0) return 90;\n    if (strcmp(word, \"hundred\") == 0) return 100;\n    if (strcmp(word, \"thousand\") == 0) return 1000;\n    if (strcmp(word, \"million\") == 0) return 1000000;\n    if (strcmp(word, \"negative\") == 0) return -1;\n    return -2;\n}\n\nint main() {\n    char str[1000] = {'\\0'};\n    while (fgets(str, sizeof(str), stdin)) {\n        \/\/\u5904\u7406\u6362\u884c\u7b26\n        int len = strlen(str);\n        if (str[len - 1] == '\\n') {\n            str[len - 1] = '\\0';\n            len--;\n        }\n        int num = 0;\n        int sum = 0;\n        int tempValue = 0;\n        int multiplier = 1;\n        int negative = 0;\/\/\u5224\u65ad\u6b63\u8d1f\n        char temp[100] = {'\\0'};\n        int last = 0;\n        \n        for (int i = 0; i <= len; i++) {\n            if (str[i] == ' ' || str[i] == '\\0') {\n                int wordLength = i - last;\n                strncpy(temp, str + last, wordLength);\n                temp[wordLength] = '\\0';\n                num = wordToNumber(temp);\/\/\u83b7\u53d6\u6570\u5b57\n                \/\/\u5f00\u59cb\u5904\u7406\n                if (num == -1) { \/\/\u6b63\u8d1f\n                    negative = 1;\n                } else if (num == 100 || num == 1000 || num == 1000000) {\/\/\u9047\u5230\u4e58\u6570\u8bcd\u5f00\u59cb\u7ffb\u500d\n                    if (tempValue == 0) tempValue = 1;\n                    tempValue *= num;\n                    if (num > 100) {\n                        \/\/num == 100\u4e0d\u80fd\u52a0\uff0c\u9632\u6b62\u4ec0\u4e48one hundred twenty three thousand\u7684\u60c5\u51b5\n                        \/\/\u56e0\u4e3athousand\u548cmillion\u524d\u9762\u662f\u53ef\u4ee5\u6709hundred\u7684\n                        sum += tempValue;\/\/\u52a0\u5230sum\u91cc\uff0c\u91cd\u65b0\u7d2f\u52a0,\u4e3a\u5927\u7684\u4e58\u6570\u8bcd\u505a\u51c6\u5907\n                        tempValue = 0;\n                    }\n                } else if (num >= 0) {\/\/\u6b63\u5e38\u52a0\u4e0a\n                    tempValue += num;\n                } else {\n                   \n                }\n                \n                last = i + 1;\n            }\n        }\n        sum += tempValue;\n        if (negative) {\n            sum = -sum;\n        }\n        printf(\"%d\\n\", sum);\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
4208 \u591a\u9879\u5f0f\u8868\u793a<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2a\u591a\u9879\u5f0f\uff0c\u5176\u5e42\u4ece8\u52300\uff0c\u8981\u6c42\u5220\u9664\u591a\u9879\u5f0f\u4e2d\u6ca1\u7528\u7684\u5b57\u7b26\uff0c\u4f7f\u4e4b\u53d8\u6210\u53ef\u8bfb\u683c\u5f0f\u3002\u4f8b\u5982\uff0c\u7ed9\u5b9a\u7684\u7cfb\u6570\u4e3a0\u30010\u30010\u30011\u300122\u3001-333\u30010\u30011\u548c-1\uff0c\u4f60\u5e94\u8be5\u8f93\u51fa\uff1ax5+22x<\/sup>4-333x^3+x-1\u3002 \u8f6c\u6362\u591a\u9879\u5f0f\u65f6\u9700\u8981\u9075\u5b88\u4ee5\u4e0b\u89c4\u5219\uff1a \uff081\uff09\u6309\u5e42\u7684\u6b21\u6570\u9012\u51cf\u987a\u5e8f\u3002 \uff082\uff09\u6307\u6570\u7528\u201c^\u201d\u6765\u8868\u793a\u3002 \uff083\uff09\u5e38\u6570\u9879\u4ec5\u7528\u5e38\u6570\u6765\u8868\u793a\u3002 \uff084\uff09\u53ea\u6709\u975e0\u7cfb\u6570\u9879\u624d\u8868\u793a\u3002\u5982\u679c\u6240\u6709\u9879\u7684\u7cfb\u6570\u5168\u4e3a0\uff0c\u624d\u4f1a\u8f93\u51fa\u5e38\u6570\u98790\u3002 \uff085\uff09\u53ea\u6709\u5728\u201c+\u201d\u548c\u201c-\u201d\u64cd\u4f5c\u7b26\u7684\u5de6\u53f3\u4e24\u8fb9\u624d\u4f1a\u5404\u6709\u4e00\u4e2a\u7a7a\u683c\u3002 \uff086\uff09\u7b2c1\u9879\u7cfb\u6570\u4e3a\u6b63\uff0c\u5219\u4e0d\u9700\u8981\u6b63\u53f7\uff1b\u5982\u679c\u7b2c1\u9879\u7684\u7cfb\u6570\u4e3a\u8d1f\u6570\uff0c\u5219\u8981\u6709\u201c-\u201d\u7b26\u53f7\uff0c\u5982\uff1a-7x^2+30x+66\u3002 \uff087\uff09\u9664\u4e86\u7b2c1\u9879\u5916\uff0c\u7cfb\u6570\u4e3a\u8d1f\u6570\u7684\u9879\u524d\u7684\u8d1f\u53f7\u5e94\u8be5\u8868\u793a\u4e3a\u51cf\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u4e0d\u80fd\u8f93\u51fa\u201cx^2 + – 3x\u201d\uff0c\u800c\u5e94\u8f93\u51fa\u201cx^2-3x\u201d\u3002 \uff088\uff09\u5e38\u65701\u548c-1\u53ea\u80fd\u51fa\u73b0\u5728\u5e38\u6570\u9879\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u4e0d\u80fd\u8f93\u51fa\u201c-1x3+1x<\/sup>2+3x1\u201d\uff0c\u800c\u5e94\u8be5\u8f93\u51fa\u201c-x<\/sup>3+x^2+3x-1\u201d\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u5305\u542b\u82e5\u5e72\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u4e3a\u591a\u9879\u5f0f\u76849\u4e2a\u7cfb\u6570\uff0c\u7528\u7a7a\u683c\u9694\u5f00\uff0c\u6bcf\u4e2a\u7cfb\u6570\u7684\u7edd\u5bf9\u503c\u4e0d\u8d85\u8fc71000\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u6587\u4ef6\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u6240\u7ed9\u51fa\u76849\u4e2a\u7cfb\u6570\uff0c\u8f93\u51fa\u4e00\u884c\uff0c\u4e3a\u5bf9\u5e94\u7684\u591a\u9879\u5f0f\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 0 0 0 1 22 -333 0 1 -1
 0 0 0 0 0 0 -55 5 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 x^5 + 22x^4 – 333x^3 + x – 1
 -55x^2 + 5x<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u4ee3\u7801\u5f88\u597d\u7406\u89e3\uff0c\u601d\u8def\u4e5f\u5f88\u597d\u61c2\u3002\u6211\u4eec\u4ece\u540e\u5f80\u524d\u770b\u4e00\u904d\uff0c\u5224\u65ad\u662f\u5426\u662f\u7b2c\u4e00\u9879\uff0c\u7b2c\u4e00\u9879\u7684\u524d\u9762\u4e0d\u8f93\u51fa\u7b26\u53f7\uff0c\u5176\u4f59\u90fd\u8f93\u51fa\u7b26\u53f7\uff0c\u7136\u540e\u8d1f\u53f7\u4e5f\u505a\u4e00\u4e0b\u5224\u65ad\u3002\u7136\u540e\u770b\u662f\u4e0d\u662f\u7b2c\u4e00\u9879\u6216\u8005\u7b2c\u96f6\u9879\uff0c\u5982\u679c\u4e0d\u662f\u7b2c\u96f6\u9879\u7684\u8bdd\u90fd\u6709x\uff0c\u5982\u679c\u4e0d\u662f\u7b2c\u96f6\u9879\u548c\u7b2c\u4e00\u9879\u7684\u8bdd\u90fd\u6709\u6307\u6570\u6807\u5fd7\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\nint main() {\n    int a[9];\n    \/\/\u5148\u8bfb\u5165\n    while (~scanf(\"%d %d %d %d %d %d %d %d %d\",&a[8],&a[7],&a[6],&a[5],&a[4],&a[3],&a[2],&a[1],&a[0]) == 9) {\n        int first = 1;\n        for (int i = 8;i >= 0;i--) {\n            \/\/ \u8df3\u8fc7\u7cfb\u6570\u4e3a0\u7684\u9879\n            if (a[i] == 0) continue;\n            \/\/ \u5bf9\u4e8e\u7b2c\u4e00\u4e2a\u975e\u96f6\u9879\uff0c\u4e0d\u8f93\u51fa\u52a0\u53f7\n            if (first) {\n                first = 0;\n                \/\/ \u5982\u679c\u7cfb\u6570\u4e3a\u8d1f\u6570\uff0c\u8f93\u51fa\u8d1f\u53f7\n                if (a[i] < 0) printf(\"-\");\n            } else {\n                \/\/ \u5bf9\u4e8e\u540e\u7eed\u9879\uff0c\u6839\u636e\u6b63\u8d1f\u8f93\u51fa\u52a0\u53f7\u6216\u51cf\u53f7\n                printf(\" %c \", (a[i] > 0) ? '+' : '-');\n            }\n            \/\/ \u8f93\u51fa\u7cfb\u6570\uff08\u7edd\u5bf9\u503c\uff09\uff0c\u9664\u975e\u7cfb\u6570\u4e3a1\u6216-1\u4e14\u975e\u5e38\u6570\u9879\n            if (abs(a[i]) != 1 || i == 0) printf(\"%d\", abs(a[i]));\n            \/\/ \u8f93\u51fax\u53ca\u5176\u6b21\u5e42\n            if (i > 0) printf(\"x\");\n            if (i > 1) printf(\"^%d\", i);\n        }\n        \/\/ \u5982\u679c\u6240\u6709\u7cfb\u6570\u90fd\u662f0\uff0c\u8f93\u51fa0\n        if (first) printf(\"0\");\n        printf(\"\\n\");\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
4209 \u5b57\u7b26\u4e32\u7684\u5e42<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32a\u548cb\uff0c\u5b9a\u4e49a * b\u4e3a\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u8054\u63a5\u3002\u4f8b\u5982\uff0ca=\u201cabc\u201d\uff0cb=\u201cdef\u201d\uff0c\u5219a * b=\u201cabcdef\u201d\u3002\u82e5\u5c06\u5b57\u7b26\u4e32\u7684\u8054\u63a5\u770b\u4f5c\u4e58\u6cd5\uff0c\u5219\u5b57\u7b26\u4e32\u7684\u975e\u8d1f\u6574\u6570\u6b21\u5e42\u53ef\u8fd9\u6837\u5b9a\u4e49\uff1aa ^ 0=\u201c\u201d\uff08\u7a7a\u4e32\uff09,a ^ (n+1)=a * (a ^ n)\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u4e3a\u4e00\u4e2a\u5b57\u7b26\u4e32s\uff0cs\u4e2d\u7684\u5b57\u7b26\u90fd\u662f\u53ef\u663e\u793a\u7684\u3002s\u7684\u957f\u5ea6\u81f3\u5c11\u4e3a1\uff0c\u6700\u591a\u4e0d\u8d85\u8fc71000000\u4e2a\u5b57\u7b26\u3002\u5b57\u7b26\u201c.\u201d\uff0c\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u5b57\u7b26\u4e32s\uff0c\u8f93\u51fa\u6700\u5927\u6574\u6570n\uff0c\u6ee1\u8db3\uff1as=a ^ n\uff0ca\u4e3a\u67d0\u4e2a\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 abcd
 aaaa
 ababab<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 1
 4
 3<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u7684\u601d\u8def\u5c31\u662f\u53bb\u627e\u6709\u6ca1\u6709\u5468\u671f\u7684\u5b58\u5728\u3002\u5982\u679c\u5b58\u5728\u5468\u671f\uff0c\u5c31\u628a\u5b57\u7b26\u4e32\u957f\u5ea6\u9664\u4ee5\u5468\u671f\u957f\u5ea6\uff0c\u5c31\u80fd\u8f93\u51fa\u5e42\u6b21\u4e86\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h>\nint find(char s[]) {\n    int len = strlen(s);\n    char ss[2000002]; \/\/\u5206\u914d\u7a7a\u95f4\n    strcpy(ss,s);\n    strcat(ss,s); \/\/\u521b\u5efas + s\n    int i;\n    for (i = 1;i <= len;i++) {\n        if (strncmp(ss + i,s,len) == 0) {\n            break;\n        }\n    }\n    if(i > len){\n        return 1; \/\/\u6ca1\u6709\u5468\u671f\n    }else{\n        return len \/ i; \/\/\u6709\u5468\u671f\n    }\n}\nint main() {\n    char s[1000001];\n    while (~scanf(\"%s\", s)) {\n        if (strcmp(s,\".\") == 0) break;\n        printf(\"%d\\n\", find(s));\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
4210 \u56de\u6587<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u4e00\u4e2a\u89c4\u5219\u7684\u56de\u6587\u662f\u4e00\u4e32\u7531\u5b57\u7b26\u6216\u6570\u5b57\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\uff0c\u4ece\u524d\u5f80\u540e\u8bfb\u4e0e\u4ece\u540e\u5f80\u524d\u8bfb\u5b8c\u5168\u4e00\u6837\u3002\u4f8b\u5982\uff0c\u5b57\u7b26\u4e32\u201cABCDEDCBA\u201d\u5c31\u662f\u4e2a\u56de\u6587\u5b57\u7b26\u4e32\uff0c\u4ece\u5de6\u5230\u53f3\u548c\u4ece\u53f3\u5230\u5de6\u90fd\u662f\u4e00\u6837\u7684\u3002 \u6240\u8c13\u955c\u50cf\u5b57\u7b26\u4e32\uff0c\u5c31\u662f\u5c06\u5b57\u7b26\u4e32\u4e2d\u7684\u6bcf\u4e2a\u5b57\u7b26\u7528\u5bf9\u5e94\u7684\u76f8\u53cd\u5b57\u7b26\uff08\u5982\u679c\u5b58\u5728\u76f8\u53cd\u5b57\u7b26\uff09\u66ff\u6362\u540e\uff0c\u5f97\u5230\u7684\u65b0\u5b57\u7b26\u4e32\u4ece\u540e\u5f80\u524d\u8bfb\uff0c\u8ddf\u539f\u6765\u7684\u5b57\u7b26\u4e32\u4e00\u6837\u3002\u4f8b\u5982\uff0c3AIAE\u5c31\u662f\u4e00\u4e2a\u955c\u50cf\u5b57\u7b26\u4e32\uff0c\u56e0\u4e3aA\u548cI\u662f\u5b83\u4eec\u672c\u8eab\u7684\u76f8\u53cd\u5b57\u7b26\uff0c\u5e76\u4e143\u548cE\u4e92\u4e3a\u76f8\u53cd\u5b57\u7b26\u3002\u5b57\u7b26\u4e323AIAE\u4e2d\uff0c\u5404\u5b57\u7b26\u8f6c\u6362\u6210\u5176\u76f8\u53cd\u5b57\u7b26\u540e\uff0c\u53d8\u6210EAIA3\uff0c\u8fd9\u4e2a\u5b57\u7b26\u4e32\u4ece\u540e\u5f80\u524d\u8bfb\uff0c\u5c31\u662f\u539f\u6765\u7684\u5b57\u7b26\u4e32\u3002 \u955c\u50cf\u56de\u6587\u5c31\u662f\u540c\u65f6\u6ee1\u8db3\u56de\u6587\u5b57\u7b26\u4e32\u548c\u955c\u50cf\u5b57\u7b26\u4e32\u6761\u4ef6\u7684\u5b57\u7b26\u4e32\u3002\u4f8b\u5982\uff0cATOYOTA\u5c31\u662f\u4e00\u4e2a\u955c\u50cf\u56de\u6587\uff0c\u56e0\u4e3a\u8fd9\u4e2a\u5b57\u7b26\u4ece\u540e\u5f80\u524d\u8bfb\u548c\u539f\u6765\u7684\u4e00\u6837\uff0c\u66ff\u6362\u6210\u76f8\u53cd\u5b57\u7b26\u540e\uff0c\u5f97\u5230ATOYOTA\uff0c\u4ece\u540e\u5f80\u524d\u8bfb\u4e5f\u548c\u539f\u6765\u7684\u4e00\u6837\u3002<\/p>\n\n\n\n
\"4210.png\"<\/div><\/figure>\n\n\n\n
\u6ce8\u610f\uff1a\u6570\u5b570\u548c\u5b57\u7b26O\u88ab\u8ba4\u4e3a\u662f\u540c\u4e00\u4e2a\u5b57\u7b26\uff0c\u56e0\u6b64\u53ea\u6709\u5b57\u7b26O\u624d\u662f\u6709\u6548\u7684\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u62ec\u591a\u4e2a\u5b57\u7b26\u4e32\uff0c\u6bcf\u884c\u4e00\u4e2a\uff0c\u6bcf\u4e2a\u5b57\u7b26\u4e32\u5305\u542b1~20\u4e2a\u6709\u6548\u5b57\u7b26\uff0c\u4e0d\u4f1a\u5305\u542b\u65e0\u6548\u5b57\u7b26\u3002\u8f93\u5165\u6570\u636e\u4e00\u76f4\u5230\u6587\u4ef6\u5c3e\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u8f93\u5165\u7684\u6bcf\u4e2a\u5b57\u7b26\u4e32\uff0c\u5728\u7b2c1\u5217\u5f00\u59cb\u8f93\u51fa\u5b57\u7b26\u4e32\u672c\u8eab\uff0c\u63a5\u7740\u8f93\u51fa\u4ee5\u4e0b\u5b57\u7b26\u4e32\u4e2d\u7684\u4e00\u4e2a\uff1a \u201c — is not a palindrome.\u201d \u65e2\u4e0d\u662f\u56de\u6587\uff0c\u4e5f\u4e0d\u662f\u955c\u50cf\u5b57\u7b26\u4e32 \u201c — is a regular palindrome.\u201d\u662f\u56de\u6587\uff0c\u4f46\u4e0d\u662f\u955c\u50cf\u5b57\u7b26\u4e32 \u201c — is a mirrored string.\u201d\u4e0d\u662f\u56de\u6587\uff0c\u4f46\u662f\u955c\u50cf\u5b57\u7b26\u4e32 \u201c — is a mirrored palindrome.\u201d\u65e2\u662f\u56de\u6587\u4e5f\u662f\u955c\u50cf\u5b57\u7b26\u4e32 \u6ce8\u610f\uff1a\u8bf7\u6309\u7167\u8f93\u51fa\u8f93\u51fa\u6837\u4f8b\u7a7a\u683c\u548c\u5b57\u7b26\u201c-\u201d\uff0c\u6bcf\u4e2a\u8f93\u51fa\u540e\u6709\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 NOTAPALINDROME
 ISAPALINILAPASI
 2A3MEAS
 ATOYOTA<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 NOTAPALINDROME — is not a palindrome.
 \u200b
 ISAPALINILAPASI — is a regular palindrome.
 \u200b
 2A3MEAS — is a mirrored string.
 \u200b
 ATOYOTA — is a mirrored palindrome.<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5f88\u66b4\u529b\uff0c\u5c31\u662f1\u3001\u5224\u65ad\u662f\u5426\u662f\u56de\u6587\uff0c2\u3001\u5224\u65ad\u662f\u5426\u662f\u955c\u50cf\u3002<\/p>\n\n\n\n
\u5224\u65ad\u4e5f\u5f88\u5bb9\u6613\uff0c\u56de\u6587\u7684\u5224\u65ad\u5927\u5bb6\u90fd\u4f1a\u3002\u955c\u50cf\u7684\u5224\u65ad\u5c31\u662f\u8981\u53bb\u6253\u4e2a\u8868\u6bd4\u8f83\u9ebb\u70e6\u4ee5\u5916\uff0c\u4e5f\u5f88\u5bb9\u6613\u5f97\u5230\u955c\u50cf\u5b57\u7b26\u4e32\uff0c\u7136\u540e\u5224\u65ad\u4e00\u4e0b\u5c31\u884c\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h> \n\nint main(){\n\t\n\tchar str[1000];\n\t\n\t\n\n\twhile(~scanf(\"%s\",str)){\n    int flag1 = 1,flag2 = 1;\n\t\tchar str2[1000] = {'\\0'};\n\t\tint len = strlen(str);\n\n\t\tint i;\n\t\tfor(i = 0;i <= len\/2;i++){\n\t\t\tif(str[i]!=str[len - i - 1]){\n\t\t\t\tflag1 = 0;\n\t\t\t}\n\n\t\t}\n\t\tint j = 0;\n\t\tfor(i = 0;i < len;i++){\n\t\t\tif(str[i]=='A'||str[i]=='H'||str[i]=='I'||str[i]=='M'||str[i]=='O'||str[i]=='T'||str[i]=='U'||str[i]=='V'||str[i]=='W'||str[i]=='X'||str[i]=='Y'||str[i]=='8')\n\t\t\t\tstr2[j++] = str[i];\n\t\t\tif(str[i]=='E')\n\t\t\t\tstr2[j++] = '3';\n\t\t\tif(str[i]=='J')\n\t\t\t\tstr2[j++] = 'L';\n\t\t\tif(str[i]=='L')\n\t\t\t\tstr2[j++] = 'J';\n\t\t\tif(str[i]=='S')\n\t\t\t\tstr2[j++] = '2';\n\t\t\tif(str[i]=='Z')\n\t\t\t\tstr2[j++] = '5';\n\t\t\tif(str[i]=='2')\n\t\t\t\tstr2[j++] = 'S';\n\t\t\tif(str[i]=='3')\n\t\t\t\tstr2[j++] = 'E';\n\t\t\tif(str[i]=='5')\n\t\t\t\tstr2[j++] = 'Z';\n\t\t}\n\t\tfor(i = 0;i < len;i++){\n\t\t\tif(str2[i] != str[len - i - 1]){\n\t\t\t\tflag2 = 0;\n\t\t\t}\n\t\t}\n\t\tif(flag1==1&&flag2==1){\n\t\t\tprintf(\"%s -- is a mirrored palindrome.\\n\",str);\n\t\t}\n\t\tif(flag1==0&&flag2==0){\n\t\t\tprintf(\"%s -- is not a palindrome.\\n\",str);\n\t\t}\n\t\tif(flag1==1&&flag2==0){\n\t\t\tprintf(\"%s -- is a regular palindrome.\\n\",str);\n\t\t}\n\t\tif(flag1==0&&flag2==1){\n\t\t\tprintf(\"%s -- is a mirrored string.\\n\",str);\n\t\t}\n        printf(\"\\n\");\n\t}\n\t\n\n\treturn 0;\n} <\/code><\/pre>\n\n\n\n
4211 \u586b\u8bcd\u6e38\u620f<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
Alex\u559c\u6b22\u586b\u8bcd\u6e38\u620f\u3002\u586b\u8bcd\u6e38\u620f\u662f\u4e00\u4e2a\u975e\u5e38\u7b80\u5355\u7684\u6e38\u620f\u3002\u586b\u8bcd\u6e38\u620f\u5305\u62ec\u4e00\u4e2aN * M\u5927\u5c0f\u7684\u77e9\u5f62\u65b9\u683c\u76d8\u548cP\u4e2a\u5355\u8bcd\u3002\u7136\u540e\u9700\u8981\u628a\u6bcf\u4e2a\u65b9\u683c\u4e2d\u586b\u4e0a\u4e00\u4e2a\u5b57\u6bcd\u4f7f\u5f97\u6bcf\u4e2a\u5355\u8bcd\u90fd\u80fd\u5728\u65b9\u683c\u76d8\u4e0a\u88ab\u627e\u5230\u3002\u6bcf\u4e2a\u5355\u8bcd\u90fd\u80fd\u88ab\u627e\u5230\u8981\u6ee1\u8db3\u4e0b\u9762\u7684\u6761\u4ef6\uff1a \u6bcf\u4e2a\u65b9\u683c\u90fd\u4e0d\u80fd\u540c\u65f6\u5c5e\u4e8e\u8d85\u8fc7\u4e00\u4e2a\u7684\u5355\u8bcd\u3002\u4e00\u4e2a\u957f\u4e3ak\u7684\u5355\u8bcd\u4e00\u5b9a\u8981\u5360\u636ek\u4e2a\u65b9\u683c\u3002\u5355\u8bcd\u5728\u65b9\u683c\u76d8\u4e2d\u51fa\u73b0\u7684\u65b9\u5411\u53ea\u80fd\u662f\u7ad6\u76f4\u7684\u6216\u8005\u6c34\u5e73\u7684\uff08\u53ef\u4ee5\u7531\u7ad6\u76f4\u8f6c\u5411\u6c34\u5e73\uff0c\u53cd\u4e4b\u4ea6\u7136\uff09\u3002 \u4f60\u7684\u4efb\u52a1\u662f\u9996\u5148\u5728\u65b9\u683c\u76d8\u4e0a\u627e\u5230\u6240\u6709\u7684\u5355\u8bcd\uff0c\u5f53\u7136\u5728\u68cb\u76d8\u4e0a\u53ef\u80fd\u6709\u4e9b\u65b9\u683c\u6ca1\u6709\u88ab\u5355\u8bcd\u5360\u636e\u3002\u7136\u540e\u628a\u8fd9\u4e9b\u6ca1\u6709\u7528\u7684\u65b9\u683c\u627e\u51fa\u6765\uff0c\u628a\u8fd9\u4e9b\u65b9\u683c\u4e0a\u7684\u5b57\u6bcd\u6309\u7167\u5b57\u5178\u5e8f\u7ec4\u6210\u4e00\u4e2a\u201c\u795e\u79d8\u5355\u8bcd\u201d\u3002 \u5982\u679c\u4f60\u8fd8\u4e0d\u4e86\u89e3\u89c4\u5219\uff0c\u6211\u4eec\u53ef\u4ee5\u7528\u4e00\u4e2a\u4f8b\u5b50\u6765\u8bf4\u660e\uff0c\u6bd4\u5982\u5728\u56fe \u4e2d\u5bfb\u627e\u5355\u8bcdBEG\u548cGEE\u3002<\/p>\n\n\n\n
\"4211.png\"<\/div><\/figure>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u5305\u62ec\u4e09\u4e2a\u6574\u6570N\uff0cM\u548cP (2 <= M, N <= 10, 0 <= P<=100)\u3002\u63a5\u4e0b\u6765\u7684N\u884c\uff0c\u6bcf\u884c\u5305\u62ecM\u4e2a\u5b57\u7b26\u6765\u8868\u793a\u65b9\u683c\u76d8\u3002\u63a5\u4e0b\u6765P\u884c\u7ed9\u51fa\u9700\u8981\u5728\u65b9\u683c\u76d8\u4e2d\u627e\u5230\u7684\u5355\u8bcd\u3002 \u8f93\u5165\u4fdd\u8bc1\u586b\u8bcd\u6e38\u620f\u81f3\u5c11\u6709\u4e00\u7ec4\u7b54\u6848\u3002\u8f93\u5165\u4e2d\u7ed9\u51fa\u7684\u5b57\u6bcd\u90fd\u662f\u5927\u5199\u5b57\u6bcd\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u201c\u795e\u79d8\u5355\u8bcd\u201d\uff0c\u6ce8\u610f\u201c\u795e\u79d8\u5355\u8bcd\u201d\u4e2d\u7684\u5b57\u6bcd\u8981\u6309\u7167\u5b57\u5178\u5e8f\u7ed9\u51fa\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 3 3 2
 EBG
 GEE
 EGE
 BEG
 GEE<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 EEG<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6ca1\u90a3\u4e48\u96be\uff0c\u5c31\u662f\u53bb\u91cd\u3002\u524d\u9762\u5148\u8ba1\u6570\uff0c\u770b\u770b\u8868\u683c\u91cc\u6bcf\u4e2a\u5b57\u6bcd\u6709\u591a\u5c11\u4e2a\uff0c\u7136\u540e\u628a\u8981\u8f93\u51fa\u7684\u5355\u8bcd\u7684\u5b57\u6bcd\u7ed9\u53bb\u6389\uff0c\u5269\u4e0b\u7684\u5c31\u662f\u6211\u4eec\u8981\u7684\u4e86\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nchar mx[100][100];\nint vis[1000];\nint main(){\n    int n,m,p;\n    while(~scanf(\"%d %d %d\",&n,&m,&p)){\n        getchar();\n        memset(vis,0,sizeof(vis));\n        char temp[100] = {'\\0'};\n        for(int i = 1;i <= n;i++){\n            scanf(\"%s\",temp);\n            for(int j = 0;j < m;j++){\n                vis[temp[j] - 'A']++;\n            }\n        }\n        \n        for(int i = 1;i <= p;i++){\n            scanf(\"%s\",temp);\n            int len = strlen(temp);\n            for(int j = 0;j < len;j++){\n                vis[temp[j] - 'A']--;\n            }\n        }\n        for(int i = 0;i < 26;i++){\n            while(vis[i] > 0){\n                printf(\"%c\",'A' + i);\n                vis[i]--;\n            }\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
4212 \u5b57\u7b26\u4e32\u76f8\u7b49<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5224\u65ad\u4e24\u4e2a\u7531\u5927\u5c0f\u5199\u5b57\u6bcd\u548c\u7a7a\u683c\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\u5728\u5ffd\u7565\u5927\u5c0f\u5199\u548c\u538b\u7f29\u6389\u7a7a\u683c\u540e\u662f\u5426\u76f8\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\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53602\u884c\uff0c\u7b2c1\u884c\u662f\u7b2c\u4e00\u4e2a\u5b57\u7b26\u4e32s1\uff0c\u7b2c2\u884c\u662f\u7b2c\u4e8c\u4e2a\u5b57\u7b26\u4e32s2\u3002 \u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\uff0c\u6bcf\u884c\u6570\u636e\u4e0d\u8d85\u8fc7100\u4e2a\u5b57\u7b26\uff08\u6ce8\u610f\u5b57\u7b26\u4e32\u7684\u957f\u5ea6\u53ef\u80fd\u4e3a0\uff09\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
n\u884c\uff0c\u76f8\u7b49\u5219\u8f93\u51faYES\uff0c\u5426\u5219\u8f93\u51faNO\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 3
 \u200b
 \u200b
 \u200b
 a A bb BB ccc CCC
 Aa BBbb CCCccc
 \u200b
 a             dfadf             fasdf
 adasddfsfsaf<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 YES
 YES
 NO<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\n#include<ctype.h>\n#define MAXN 100\n\nint solve(char s1[],char s2[]){\n    int i = 0, j = 0;\n    while(s1[i] || s2[j]){\n        \/\/\u8df3\u8fc7\u7a7a\u683c\n        while(s1[i] && s1[i] == ' ') i++;\n        while(s2[j] && s2[j] == ' ') j++;\n        \/\/\u8f6c\u6362\u6210\u5c0f\u5199\u6bd4\u8f83\n        if(tolower((char)s1[i]) != tolower((char)s2[j])){\n            return 0;\n        }\n        if(s1[i]) i++;\n        if(s2[j]) j++;\n    }\n    return 1;\n}\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n    getchar();\n    for (int i = 0; i < n; ++i) {\n        char s1[MAXN + 1], s2[MAXN + 1];\n        fgets(s1, MAXN + 1, stdin);\n        fgets(s2, MAXN + 1, stdin);\n        \/\/\u66ff\u6362\u6362\u884c\u7b26\n        s1[strcspn(s1,\"\\n\")] = '\\0';\n        s2[strcspn(s2,\"\\n\")] = '\\0';\n\n        if (solve(s1, s2)) {\n            printf(\"YES\\n\");\n        } else {\n            printf(\"NO\\n\");\n        }\n        if (i != n - 1) {\n            getchar();\n        }\n    }\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
4213 \u7f6e\u6362\u52a0\u5bc6\u7b97\u6cd5<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7f6e\u6362\u52a0\u5bc6\u7b97\u6cd5\u662f\u6700\u7b80\u5355\u7684\u52a0\u5bc6\u7b97\u6cd5\uff0c\u5c31\u662f\u5c06\u4e00\u4e2a\u5b57\u6bcd\u8868\u4e2d\u7684\u5b57\u7b26\u7f6e\u6362\u6210\u53e6\u4e00\u4e2a\u5b57\u6bcd\u8868\u4e2d\u7684\u5b57\u7b26\uff0c\u8fd9\u79cd\u5bc6\u65b9\u6cd5\uff0c\u5df2\u7ecf\u5b58\u57282000\u591a\u5e74\u7684\u5386\u53f2\u4e86\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u539f\u6587\u5b57\u6bcd\u8868\uff0c\u7b2c2\u884c\u662f\u66ff\u6362\u7528\u7684\u5b57\u6bcd\u8868\u3002\u5269\u4e0b\u7684\u4fbf\u662f\u539f\u6587\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u7684\u7b2c1\u884c\u662f\u66ff\u6362\u7528\u7684\u5b57\u6bcd\u8868\uff0c\u7b2c2\u884c\u662f\u539f\u6587\u5b57\u6bcd\u8868\u3002\u63a5\u4e0b\u6765\u662f\u5c06\u66ff\u6362\u540e\u5f97\u5230\u7684\u5bc6\u6587\u5b57\u7b26\u4e32\u3002 \u6ce8\u610f\uff1a\u6bcf\u884c\u6700\u591a64\u4e2a\u5b57\u7b26\uff08\u5305\u62ec\u7ed3\u675f\u7b26\uff09\u3002\u6240\u6709\u7684\u5b57\u7b26\u90fd\u5728\u539f\u6587\u5b57\u6bcd\u8868\u4e2d\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 abcdefghijklmnopqrstuvwxyz
 zyxwvutsrqponmlkjihgfedcba
 Shar’s Birthday:
 The birthday is October 6th, but the party will be Saturday,
 October 5. It’s my 24th birthday and the first one in some
 years for which I’ve been employed. Plus, I have new clothes.
 So I have cause to celebrate. More importantly, though,
 we’ve cleaned the house! The address is 506-D Albert Street.
 Extra enticement for CS geeks: there are several systems in
 the house, and the party is conveniently scheduled for 3 hours
 after the second CSC programming contest ends (not to mention,
 within easy walking distance)!<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 zyxwvutsrqponmlkjihgfedcba
 abcdefghijklmnopqrstuvwxyz
 Sszi’h Brigswzb:
 Tsv yrigswzb rh Oxglyvi 6gs, yfg gsv kzigb droo yv Szgfiwzb,
 Oxglyvi 5. Ig’h nb 24gs yrigswzb zmw gsv urihg lmv rm hlnv
 bvzih uli dsrxs I’ev yvvm vnkolbvw. Pofh, I szev mvd xolgsvh.
 Sl I szev xzfhv gl xvovyizgv. Mliv rnkligzmgob, gslfts,
 dv’ev xovzmvw gsv slfhv! Tsv zwwivhh rh 506-D Aoyvig Sgivvg.
 Ecgiz vmgrxvnvmg uli CS tvvph: gsviv ziv hvevizo hbhgvnh rm
 gsv slfhv, zmw gsv kzigb rh xlmevmrvmgob hxsvwfovw uli 3 slfih
 zugvi gsv hvxlmw CSC kiltiznnrmt xlmgvhg vmwh (mlg gl nvmgrlm,
 drgsrm vzhb dzoprmt wrhgzmxv)!<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u601d\u8def\u5c31\u662f\u641e\u4e00\u4e2a\u6620\u5c04\uff0c\u6ca1\u4ec0\u4e48\u597d\u8bf4\u7684\u3002\u4f46\u662f\u7b14\u8005\u683c\u5f0f\u9519\u8bef\u4e86\u5f88\u4e45\uff0c\u6700\u540e\u53d1\u73b0\u8bfb\u5165\u5b57\u6bcd\u8868\u7684\u65f6\u5019\u5fc5\u987b\u8981\u7528fgets\uff0c\u9632\u6b62\u7a7a\u683c\u7b49\u7279\u6b8a\u60c5\u51b5\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\n#include <string.h>\n#include <ctype.h>\nchar a[1000];\nchar b[1000];\n\nint find(char x){\n    int len = strlen(a);\n    for(int i = 0; i < len; i++){\n        if(a[i] == x){\n            return i;\n        }\n    }\n    return -1;\n}\n\nint main(){\n    char str[1000] = {'\\0'};\n    fgets(a,sizeof(a),stdin);\n    fgets(b,sizeof(b),stdin);\n    printf(\"%s\",b);\n    printf(\"%s\",a);\n    while(fgets(str,sizeof(str),stdin)){\/\/\u6362\u884c\u7b26\u4e5f\u4f1a\u88ab\u8bfb\u5165\n        int len = strlen(str);\n        for(int i = 0; i < len; i++){\n            \/\/\u4e0d\u662f\u5b57\u6bcd\u5c31\u6b63\u5e38\u8f93\u51fa\n            if(find(str[i]) == -1){\n                printf(\"%c\",str[i]);\n                continue;\n            }\n            \/\/\u5148\u627e\u5230\u8fd9\u4e2a\u5b57\u6bcd\u662f\u539f\u5b57\u6bcd\u8868\u4e2d\u7684\u7b2c\u51e0\u4e2a\n            int index = find(str[i]);\n            printf(\"%c\",b[index]);\n        }\n        memset(str,'\\0',sizeof(str));\n    }\n}<\/code><\/pre>\n\n\n\n
4301 \u8bcd\u7ec4\u7f29\u5199<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5b9a\u4e49\uff1a\u4e00\u4e2a\u8bcd\u7ec4\u4e2d\u6bcf\u4e2a\u5355\u8bcd\u7684\u9996\u5b57\u6bcd\u7684\u5927\u5199\u7ec4\u5408\u79f0\u4e3a\u8be5\u8bcd\u7ec4\u7684\u7f29\u5199\u3002
\u6bd4\u5982\uff0cC\u8bed\u8a00\u91cc\u5e38\u7528\u7684EOF\u5c31\u662fend of file\u7684\u7f29\u5199\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u7684\u7b2c\u4e00\u884c\u662f\u4e00\u4e2a\u6574\u6570T\uff0c\u8868\u793a\u4e00\u5171\u6709T\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002
\u63a5\u4e0b\u6765\u6709T\u884c\uff0c\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u6bcf\u884c\u6709\u4e00\u4e2a\u8bcd\u7ec4\uff0c\u6bcf\u4e2a\u8bcd\u7ec4\u7531\u4e00\u4e2a\u6216\u591a\u4e2a\u5355\u8bcd\u7ec4\u6210\uff1b\u6bcf\u7ec4\u7684\u5355\u8bcd\u4e2a\u6570\u4e0d\u8d85\u8fc710\u4e2a\uff0c\u6bcf\u4e2a\u5355\u8bcd\u6709\u4e00\u4e2a\u6216\u591a\u4e2a\u5927\u5199\u6216\u5c0f\u5199\u5b57\u6bcd\u7ec4\u6210\uff1b
\u5355\u8bcd\u957f\u5ea6\u4e0d\u8d85\u8fc710\uff0c\u7531\u4e00\u4e2a\u6216\u591a\u4e2a\u7a7a\u683c\u5206\u9694\u8fd9\u4e9b\u5355\u8bcd\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8bf7\u4e3a\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u8f93\u51fa\u89c4\u5b9a\u7684\u7f29\u5199\uff0c\u6bcf\u7ec4\u8f93\u51fa\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
1\nend of file<\/code><\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
EOF<\/code><\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6b63\u5e38\u53bb\u6a21\u62df\u5c31\u597d\uff0c\u7a7a\u683c\u540e\u9762\u7684\u7b2c\u4e00\u4e2a\u82f1\u6587\u5b57\u6bcd\u8f6c\u6362\u6210\u5927\u5199\uff0c\u7136\u540e\u5bf9\u4e8e\u6574\u4e2a\u6587\u672c\u7684\u7b2c\u4e00\u4e2a\u82f1\u6587\u5b57\u6bcd\u4e5f\u8981\u8f6c\u6210\u5927\u5199\uff0c\u7b80\u5355\u5904\u7406\u4e00\u4e0b\u5c31\u884c\u3010\u7b14\u8005\u7684\u5199\u6cd5\u6709\u70b9\u4e11\uff0c\u8bfb\u8005\u81ea\u884c\u5904\u7406\u3011<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint t;\nvoid solve(){\n    string s;\n    getline(cin,s);\n    int len = s.size();\n    int flag = 0;\/\/flag \u6765\u7ed9\u7b2c\u4e00\u4e2a\u8f93\u51fa\u7684\u5143\u7d20\u6253\u6807\u8bb0\n    for(int i = 0;i < len;i++){\n        char temp;\n        if(flag == 0 && s[i] != ' ') flag = 1;\n        \/\/\u5927\u5c0f\u5199\u5224\u65ad\n        if(flag == 1 && (s[i] >= 'a' && s[i] <= 'z')){\n           temp = s[i] - 32;\n            cout << temp;\n            flag = 2;\n        }\n        if(flag == 1 && (s[i] >= 'A' && s[i] <= 'Z')){\n            temp = s[i];\n            cout << temp;\n            flag = 2;\n        }\n        if(s[i] == ' ' && (s[i + 1] >= 'a' && s[i + 1] <= 'z')){\n            temp = s[i + 1] - 32;\n            cout << temp;\n        }\n        if(s[i] == ' ' && (s[i + 1] >= 'A' && s[i + 1] <= 'Z')){\n            temp = s[i + 1];\n            cout << temp;\n        }\n    }\n    cout << \"\\n\";\n}\nint main(){\n\n    cin >> t;\n    cin.get();\n    while(t--) solve();\n}<\/code><\/pre>\n\n\n\n
4302 \u5893\u7891\u4e0a\u7684\u5b57\u7b26<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u8003\u53e4\u5b66\u5bb6\u53d1\u73b0\u4e86\u4e00\u5ea7\u5343\u5e74\u53e4\u5893\uff0c\u5893\u7891\u4e0a\u6709\u795e\u79d8\u7684\u5b57\u7b26\u3002\u7ecf\u8fc7\u4ed4\u7ec6\u7814\u7a76\uff0c\u53d1\u73b0\u539f\u6765\u8fd9\u662f\u5f00\u542f\u53e4\u5893\u5165\u53e3\u7684\u65b9\u6cd5\u3002
\u5893\u7891\u4e0a\u67092\u884c\u5b57\u7b26\u4e32\uff0c\u5176\u4e2d\u7b2c\u4e00\u4e2a\u4e32\u7684\u957f\u5ea6\u4e3a\u5076\u6570\uff0c\u73b0\u5728\u8981\u6c42\u628a\u7b2c2\u4e2a\u4e32\u63d2\u5165\u5230\u7b2c\u4e00\u4e2a\u4e32\u7684\u6b63\u4e2d\u592e\uff0c\u5982\u6b64\u4fbf\u80fd\u5f00\u542f\u5893\u7891\u8fdb\u5165\u5893\u4e2d\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6570\u636e\u9996\u5148\u7ed9\u51fa\u4e00\u4e2a\u6574\u6570n\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570\u3002
\u7136\u540e\u662fn\u7ec4\u6570\u636e\uff0c\u6bcf\u7ec4\u6570\u636e2\u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u957f\u5ea6\u5927\u4e8e0\uff0c\u5c0f\u4e8e50\uff0c\u5e76\u4e14\u7b2c\u4e00\u4e2a\u4e32\u7684\u957f\u5ea6\u5fc5\u4e3a\u5076\u6570\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8bf7\u4e3a\u6bcf\u7ec4\u6570\u636e\u8f93\u51fa\u4e00\u4e2a\u80fd\u5f00\u542f\u53e4\u5893\u7684\u5b57\u7b26\u4e32\uff0c\u6bcf\u7ec4\u8f93\u51fa\u5360\u4e00\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
2\nCSJI\nBI\nAB\nCMCLU<\/code><\/pre>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
CSBIJI\nACMCLUB<\/code><\/pre>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u53ef\u4ee5\u53bb\u9009\u62e9\u6a21\u62df\uff0c\u4f46\u662f\u65e0\u8bba\u662fc++\u8fd8\u662fc\u90fd\u5df2\u7ecf\u6709\u4e86\u5f88\u591a\u5b57\u7b26\u4e32\u51fd\u6570~\u76f4\u63a5\u7528\u73b0\u6210\u7684\u5c31\u597d\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C++\uff1a<\/h3>\n\n\n\n
#include<bits\/stdc++.h>\r\nusing namespace std;\r\nvoid solve(){\r\n    string s1,s2;\r\n    cin >> s1 >> s2;\r\n    int index = (s1.size()) \/ 2;\r\n    s1.insert(index,s2);\r\n    cout << s1 << \"\\n\";\r\n}\r\nint main(){\r\n    int n;\r\n    cin >> n;\r\n    while(n--) solve();\r\n}<\/code><\/pre>\n\n\n\n
\u603b\u7ed3<\/h2>\n\n\n\n
    \n
  1. \u771f\u662f\u9163\u7545\u6dcb\u6f13\u7684\u5b57\u7b26\u4e32\u6a21\u62df\u3002\u6574\u4f53\u96be\u5ea6\u4e2d\u7b49\uff0c\u90e8\u5206\u9898\u76ee\u4e2d\u7b49\u504f\u4e0a\uff0c\u5b9e\u5728\u662f\u592a\u96be\u6a21\u62df\u4e86\u3002<\/li>\n\n\n\n
  2. \u5199\u5b57\u7b26\u4e32\u6a21\u62df\u6bd4\u8f83\u8d39\u65f6\u95f4\uff0c\u8bfb\u8005\u8981\u6709\u8010\u5fc3\u3002<\/li>\n\n\n\n
  3. \u9700\u8981\u4e86\u89e3\u5927\u91cf\u5b57\u7b26\u4e32\u51fd\u6570\uff0c\u53ef\u4ee5\u8282\u7701\u5f88\u591a\u65f6\u95f4\uff0c\u6bd4\u5982strstr\u3001strncpy\uff0cstrncmp\u7b49\u7b49\u3002<\/li>\n\n\n\n
  4. \u5b57\u7b26\u4e32\u5904\u7406\u8981\u6ce8\u610f\u8fb9\u754c\u8fd8\u6709’\\0’\uff0c\u6ce8\u610f\u6362\u884c\u7b49\u7b49\u3002<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"
    \u524d\u8a00 \u4e0d\u662f\u6bcf\u4e00\u9053\u9898\u90fd\u6709\u601d\u8def\u89e3\u91ca\uff0c\u6ca1\u6709\u601d\u8def\u89e3\u91ca\u7684\u9898\u76ee\u8bf4\u660e\u53ea\u662f\u7b80\u5355\u7684\u6a21\u62df\uff0c\u4e0d\u9700\u8981\u591a\u4f59\u7684\u8bb2\u89e3\u3002 4001 HTML\u89e3 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,10,8],"tags":[],"class_list":["post-173","post","type-post","status-publish","format-standard","hentry","category-nenuoj","category-10","category-8"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/173","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=173"}],"version-history":[{"count":8,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/173\/revisions"}],"predecessor-version":[{"id":282,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/173\/revisions\/282"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=173"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=173"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=173"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}