{"id":186,"date":"2024-02-16T01:17:30","date_gmt":"2024-02-15T17:17:30","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=186"},"modified":"2024-02-16T01:17:32","modified_gmt":"2024-02-15T17:17:32","slug":"nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%951%e7%ac%ac5%e7%ab%a0","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/02\/16\/nenuoj-%e4%b9%8b-%e7%ae%97%e6%b3%951%e7%ac%ac5%e7%ab%a0\/","title":{"rendered":"NENUOJ \u4e4b \u7b97\u6cd51\u7b2c5\u7ae0"},"content":{"rendered":"\n

5001 \u7279\u6b8a\u7684\u56db\u4f4d\u6570<\/a><\/h2>\n\n\n\n
\n

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

\u627e\u51fa\u5e76\u8f93\u51fa\u6240\u6709\u5c0f\u4e8e\u7b49\u4e8en\u76844\u4f4d\u6570\uff08\u5341\u8fdb\u5236\u6570\uff09\u4e2d\u5177\u6709\u5982\u4e0b\u5c5e\u6027\u7684\u6570\uff1a\u56db\u4f4d\u6570\u5b57\u4e4b\u548c\u7b49\u4e8e\u5176\u5341\u516d\u8fdb\u5236\u5f62\u5f0f\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\uff0c\u4e5f\u7b49\u4e8e\u5176\u5341\u4e8c\u8fdb\u5236\u5f62\u5f0f\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u3002 \u4f8b\u5982\uff1a\u5341\u8fdb\u5236\u65702991\uff0c\u5176\u56db\u4f4d\u6570\u5b57\u4e4b\u548c2+9+9+1 = 21\u3002\u7531\u4e8e2991 = 1 * 1728 + 8 * 144 + 9 * 12 + 3\uff0c\u5176\u5341\u4e8c\u8fdb\u5236\u5f62\u5f0f\u4e3a1893(12), \u5176\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u4e5f\u4e3a21\u3002\u4f46\u662f\u5b83\u7684\u5341\u516d\u8fdb\u5236\u5f62\u5f0f\u4e3aBAF(16)\uff0c\u5176\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u7b49\u4e8e11+10+15 = 36\u3002\u56e0\u6b64\u4f60\u7684\u7a0b\u5e8f\u8981\u820d\u53bb2991\u8fd9\u4e2a\u6570\u636e\u3002 \u4e0b\u4e00\u4e2a\u65702992\uff0c\u5176\u5341\u8fdb\u5236\u3001\u5341\u4e8c\u8fdb\u5236\u3001\u5341\u516d\u8fdb\u5236\u5f62\u5f0f\u5404\u4f4d\u6570\u5b57\u4e4b\u548c\u5747\u4e3a22\uff0c\u56e0\u6b642992\u7b26\u5408\u8981\u6c42\uff0c\u5e94\u8be5\u8f93\u51fa\u6765\u3002\uff08\u53ea\u8003\u86514\u4f4d\u6570\uff0c2992\u662f\u7b2c\u4e00\u4e2a\u7b26\u5408\u8981\u6c42\u7684\u6570\uff09<\/p>\n\n\n\n

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

\u8f93\u5165\u6709\u591a\u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u6b63\u6574\u6570n\uff08\u56db\u4f4d\u6574\u6570\uff09\u3002<\/p>\n\n\n\n

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

\u4f60\u7684\u7a0b\u5e8f\u8981\u6c42\u8f93\u51fa\u6ee1\u8db3\u8981\u6c42\u7684\u56db\u4f4d\u6570\uff08\u8981\u6c42\u4e25\u683c\u6309\u5347\u5e8f\u8f93\u51fa\uff09\uff0c\u6bcf\u4e2a\u6570\u5360\u4e00\u884c\uff08\u524d\u540e\u90fd\u6ca1\u6709\u7a7a\u884c\uff09\uff0c\u6574\u4e2a\u8f93\u51fa\u4ee5\u6362\u884c\u7b26\u7ed3\u5c3e\u3002\u8f93\u51fa\u4e2d\u6ca1\u6709\u7a7a\u884c\u3002\u8f93\u51fa\u4e2d\u7684\u524d\u51e0\u884c\u5982\u8f93\u51fa\u6837\u4f8b\u6240\u793a\u3002\u5982\u679c\u6ca1\u6709\u5219\u8f93\u51fa0\u3002<\/p>\n\n\n\n

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

 2000
 3000<\/p>\n\n\n\n

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

 0
 2992
 2993
 2994
 2995
 2996
 2997
 2998
 2999<\/p>\n<\/blockquote>\n\n\n\n

\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n

\u5199\u4e60\u60ef\u8fdb\u5236\u8f6c\u6362\u7684\u51fd\u6570\u5c31\u597d~\u7b97\u662f\u4e00\u9053\u6bd4\u8f83\u57fa\u7840\u7684\u8fdb\u5236\u8f6c\u6362\u9898\u76ee\u3002<\/p>\n<\/blockquote>\n\n\n\n

\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\nint find(int n,int base){\r\n    int sum = 0;\r\n    while(n > 0){\r\n        sum += n % base;\r\n        n \/= base;\r\n    }\r\n    return sum;\r\n}\r\nint main(){\r\n    int n;\r\n    while(~scanf(\"%d\",&n)){\r\n        int flag = 0;\r\n        for(int i = 1000;i <= n;i++){\r\n            int sum = find(i,10);\r\n            int sum12 = find(i,12);\r\n            int sum16 = find(i,16);\r\n            if(sum == sum12 && sum == sum16){\r\n                printf(\"%d\\n\", i);\r\n                flag = 1;\r\n            }\r\n        }\r\n        if(!flag){\r\n            flag = 0;\r\n            printf(\"0\\n\");\r\n        }\r\n    }\r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5002 \u8fdb\u5236\u8f6c\u6362<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u8f93\u5165\u4e00\u4e2a\u5341\u8fdb\u5236\u6570N\uff0c\u5c06\u5b83\u8f6c\u6362\u6210R\u8fdb\u5236\u6570\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6570\u636e\u5305\u542b\u591a\u4e2a\u6d4b\u8bd5\u5b9e\u4f8b\uff0c\u6bcf\u4e2a\u6d4b\u8bd5\u5b9e\u4f8b\u5305\u542b\u4e24\u4e2a\u6574\u6570N\uff0832\u4f4d\u6574\u6570\uff09\u548cR\uff082<=R<=16\uff0cR != 10\uff09\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u4e3a\u6bcf\u4e2a\u6d4b\u8bd5\u5b9e\u4f8b\u8f93\u51fa\u8f6c\u6362\u540e\u7684\u6570\uff0c\u6bcf\u4e2a\u8f93\u51fa\u5360\u4e00\u884c\u3002\u5982\u679cR\u5927\u4e8e10\uff0c\u5219\u5bf9\u5e94\u7684\u6570\u5b57\u89c4\u5219\u53c2\u800316\u8fdb\u5236\uff08\u6bd4\u5982\uff0c10\u7528A\u8868\u793a\uff0c\u7b49\u7b49\uff09\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 7 2
 23 12
 -4 3<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 111
 1B
 -11<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5341\u8fdb\u5236\u8f6cR\u8fdb\u5236\uff0c\u9996\u5148\u9700\u8981\u6709\u4e2a\u6570\u7ec4\u5b58\u50a8\u8fdb\u5236\u503c\uff0c\u5982\u4e0b\u65b9\u4ee3\u7801\u7684temp\u6570\u7ec4\u4e00\u6837\u3002<\/p>\n\n\n\n
\u7136\u540e\u7528\u4e2awhile\u5faa\u73af\u4e0d\u65ad\u9664\u4ee5\u8fdb\u5236\u6570R\uff0c\u5c31\u80fd\u5f97\u5230\u5e8f\u5217\u4e86\uff0c\u6700\u540e\u8f93\u51fa\u5373\u53ef\u3002\u8be6\u60c5\u770b\u4ee3\u7801~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\nchar temp[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};\r\nvoid jinzhi(char str[],int n,int r){\r\n    int flag = 0;\r\n    if(n < 0){\r\n        n = -n;\r\n        flag = 1;\r\n    }\r\n    int i = 0;\r\n    while(n){\r\n        str[i++] = temp[n % r];\r\n        n \/= r;\r\n    }\r\n    if(flag == 1) printf(\"-\");\r\n    for(int j = i - 1;j >= 0;j--){\r\n        printf(\"%c\",str[j]);\r\n    }\r\n}\r\nint main(){\r\n    \r\n    int n,r;\r\n    char str[10000];\r\n    while(~scanf(\"%d %d\",&n,&r)){\r\n        jinzhi(str,n,r);\r\n        printf(\"\\n\");\r\n    }\r\n    \r\n\r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5003 skew\u6570<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5728skew \u4e8c\u8fdb\u5236\u6570\u8868\u793a\u4e2d\uff0c\u7b2ck\u4f4d\u7684\u503cxk \u8868\u793axk * (2k+1-1) \u3002\u6bcf\u4e2a\u4f4d\u4e0a\u7684\u53ef\u80fd\u6570\u5b57\u662f0\u62161\uff0c\u6700\u540e\u9762\u4e00\u4e2a\u975e\u96f6\u4f4d\u53ef\u4ee5\u662f2\uff0c\u4f8b\u5982, 10120(skew) = 1 * (25-1) + 0 * (24-1) + 1 * (23-1) + 2 * (22-1) +0 * (21-1) = 31 + 0 + 7 + 6 + 0 = 44. \u524d\u5341\u4e2askew \u6570\u662f 0\u30011\u30012\u300110\u300111\u300112\u300120\u3001100\u3001101\u4ee5\u53ca102\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u4e00\u884c\u6216\u591a\u884c\uff0c\u6bcf\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570n\u3002\u5982\u679cn = 0 \u8868\u793a\u8f93\u5165\u7ed3\u675f\uff0c\u5426\u5219n \u662f\u4e00\u4e2askew \u6570\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e00\u4e2a\u8f93\u5165\uff0c\u8f93\u51fa\u5b83\u7684\u5341\u8fdb\u5236\u8868\u793a\u3002\u8f6c\u6362\u6210\u5341\u8fdb\u5236\u540e\uff0c n \u4e0d\u8d85\u8fc7 231-1 = 2 147 483 647\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 10120
 200000000000000000000000000000
 10
 1000000000000000000000000000000
 11
 100
 11111000001110000101101102000
 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 44
 2147483646
 3
 2147483647
 4
 7
 1041110737<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6309\u9898\u76ee\u610f\u601d\u6a21\u62df\u5373\u53ef\uff0c\u4e00\u4f4d\u4e00\u4f4d\u5904\u7406\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n#include<math.h>\r\nint main(){\r\n     \r\n    char str[10000];\r\n    while(~scanf(\"%s\",str)){\r\n        if(str[0] == '0') break;\r\n        int sum = 0;\r\n        int len = strlen(str);\r\n        for(int i = 0;i <= len - 1;i++){\r\n            sum += (str[i]-'0') * (pow(2,len - i) - 1);\r\n        }\r\n        printf(\"%d\\n\",sum);\r\n        sum = 0;\r\n    }\r\n \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5004 \u5468\u6613<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6709\u4eba\u8bf4\uff0c\u4e2d\u56fd\u53e4\u4ee3\u7684\u201c\u5468\u6613\u201d\u662f\u4e8c\u8fdb\u5236\u7cfb\u7edf\u7684\u8d77\u6e90\uff0c\u5728\u8be5\u7cfb\u7edf\u4e2d\uff0c\u4ed6\u4eec\u7528\u201c- -\u201d\u8868\u793a1\uff0c\u201c—\u201d\u8868\u793a0\u3002\u56e0\u6b64\uff0c\u4e8c\u8fdb\u5236\u6570\u5b57\u201c011010\u201d\u53ef\u4ee5\u8868\u8ff0\u4e3a\u201c—\\n- -\\n- -\\n—\\n- -\\n—\\n\u201d\uff08\u7b26\u53f7\u201c\\n\u201d\u8868\u793a\u6362\u884c\uff09\u3002\u73b0\u5728\u7684\u95ee\u9898\u662f\u5982\u4f55\u628a\u4e00\u4e2a\u5341\u8fdb\u5236\u6570\u8f6c\u6362\u4e3a\u201c\u5468\u6613\u201d\u4e2d\u7684\u4e8c\u8fdb\u5236\uff1f<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u6587\u4ef6\u4e2d\u5305\u542b\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u5305\u62ec\u4e00\u5341\u8fdb\u5236\u6574\u6570n\uff080 <= n <= 1000000\uff09\u548c\u8868\u793a\u4e8c\u8fdb\u5236\u4f4d\u6570\u7684k\uff080 < k <= 20 \u4e14 n < 2k\uff09\u3002 n=0\uff0ck=0\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u201c\u5468\u6613\u201d\u4e2d\u5bf9\u5e94\u7684k\u884c\u4e8c\u8fdb\u5236\u6570\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u4e4b\u95f4\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 7 3
 0 3
 26 6
 0 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 – –
 – –
 – –
 \u200b
 —
 —
 —
 \u200b
 —
 – –
 – –
 —
 – –
 —<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u81ea\u884c\u6a21\u62df\uff0c\u8f6c\u6362\u6210\u4e8c\u8fdb\u5236\uff0c\u9047\u52301\u548c0\u8f93\u51fa\u4e0d\u4e00\u6837\u7684\u3002\u6ce8\u610f\uff0c\u5982\u679ck\u5f88\u5927\uff0c2\u7684k\u6b21\u65b9\u8d85\u8fc7n\uff0c\u5c31\u4f1a\u6709\u4e00\u4e9b0\u7684\u51fa\u73b0\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n#include<math.h>\r\nchar str[10000];\r\nchar temp[] = {'0','1'};\r\nint main(){\r\n    \r\n    int n,k;\r\n    while(~scanf(\"%d %d\",&n,&k)){\r\n        if(!n && !k) break;\r\n        int i = 0,j = 0;\r\n        \/\/\u8f6c\u4e8c\u8fdb\u5236\r\n        while(n){\r\n            str[i++] = temp[n % 2];\r\n            n \/= 2;\r\n        }\r\n        \/\/\u628a\u8d85\u8fc7\u8303\u56f4\u7684\u90a3\u90e8\u5206\u4e8c\u8fdb\u5236\u76840\u8f93\u51fa\u4e86\r\n        if(i < k){\r\n            int len = k - i;\r\n            while(len--){\r\n                printf(\"---\\n\");\r\n            }\r\n        }\r\n        \r\n        for(j = i - 1;j >= 0;j--){\r\n            if(str[j]=='1'){\r\n                printf(\"- -\");\r\n            }\r\n            else{\r\n                printf(\"---\");\r\n            }\r\n            printf(\"\\n\");\r\n        }\r\n        \r\n        printf(\"\\n\");\r\n    }\r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5005 \u5976\u725b\u8ba1\u7b97\u5668<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7531\u4e8e\u7f3a\u4e4f\u6570\u5b66\u7ecf\u9a8c\uff0c\u5976\u725b\u60f3\u5efa\u7acb\u4e00\u4e2a\u8ba1\u7b97\u673a\u5668\uff08\u5b83\u88ab\u79f0\u4e3aCowmpouter\uff09\uff0c\u4f7f\u7528\u4e8c\u8fdb\u5236\u6570\u5b57\uff08\u57fa\u6570\u4e3a2\uff09\uff0c\u4f46\u5b83\u662f\u5efa\u7acb\u5728-2\u7684\u57fa\u7840\u4e0a\u3002\u4ed6\u4eec\u975e\u5e38\u9ad8\u5174\uff0c\u56e0\u4e3a\u5728-2\u8fdb\u5236\u8868\u793a\u7684\u6570\u5b57\u4e2d\u4e0d\u9700\u8981\u7b26\u53f7\u4f4d\u3002 \u4f60\u77e5\u9053\u57fa\u6570\u7684\u6743\u503c\u90fd\u662f\u4ece1\u5f00\u59cb\u7684\uff080\u4f4d\uff09\uff0c\u7136\u540e\u4ece\u53f3\u5230\u5de6\u4f9d\u6b21\u4e3a\u57fa\u65701\u6b21\u65b9\uff0c\u57fa\u65702\u6b21\u65b9\u7b49\u7b49\u3002\u5728-2\u8fdb\u5236\u4e2d\uff0c\u5176\u6743\u503c\u4ece\u53f3\u5230\u5de6\uff0c\u4f9d\u6b21\u4e3a1\uff0c-2\uff0c4\uff0c-8\uff0c16\uff0c-32\uff0c\u2026\u3002\u56e0\u6b64\uff0c\u4ece1\u8ba1\u6570\u4f9d\u6b21\u662f\uff1a1\uff0c110\uff0c111\uff0c100\uff0c101\uff0c11010\uff0c11011\uff0c11000\uff0c11001\u7b49\u7b49\u3002 \u5f88\u602a\u5f02\u7684\u662f\uff0c\u8d1f\u6570\u4e5f\u90a3\u4e2a\u75281\u548c0\u8868\u793a\uff0c\u4f46\u6ca1\u6709\u7b26\u53f7\u4f4d\u3002\u4ece-1\u5411\u4e0b\u8ba1\u6570\u4f9d\u6b21\u4e3a\uff1a11\uff0c10\uff0c1101\uff0c1100\uff0c1111\u7b49\u7b49\u3002 \u8bf7\u5e2e\u52a9\u5976\u725b\u628a\u666e\u901a\u7684\u5341\u8fdb\u5236\u6574\u6570\uff08\u8303\u56f4\u4e3a\uff1a-2,000,000,000\u52302,000,000,000\uff09\u8f6c\u6362\u4e3a-2\u8fdb\u5236\u5bf9\u5e94\u7684\u6570\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u53ea\u6709\u4e00\u884c\uff0c\u4e00\u4e2a\u9700\u8981\u8f6c\u6362\u4e3a-2\u8fdb\u5236\u7684\u5341\u8fdb\u5236\u6574\u6570\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u5e94\u7684-2\u8fdb\u5236\u7684\u6570\uff0c\u6ca1\u6709\u524d\u5bfc0\uff0c0\u5c31\u8868\u793a0\u672c\u8eab\uff0c\u53ea\u75281\u4e2a0\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 -13<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 110111<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u7684\u601d\u8def\u5c31\u662f\uff0c\u4e0d\u65ad\u9664\u4ee5-2\uff0c\u7136\u540e\u8f93\u51fa0\u6216\u80051\u3002\u7136\u540e\u7b80\u5355\u628a\u73a9\u4e00\u4e0b\u6570\u636e\uff0c\u5927\u6982\u5c31\u80fd\u53d1\u73b0\u5947\u6570\u5076\u6570\u5904\u7406\u4e0a\u7684\u4e0d\u540c\uff0c\u6b63\u5947\u6570\u548c\u8d1f\u5947\u6570\u9875\u6709\u6240\u4e0d\u540c\uff0c\u6240\u4ee5\u5c31\u4f1a\u5f97\u5230\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>\r\n\/\/\u8f6c\u6362\u51fd\u6570\r\nvoid convert(int n) {\r\n    if(n == 0) return;\r\n    \/\/\u5982\u679c\u662f\u5076\u6570\uff0c\u5c3e\u6570\u662f0\r\n    if(n % 2 == 0) {\r\n        \/\/\u9664\u4ee5-2\uff0c\u4e4b\u540e\u88650\u3010\u56e0\u4e3a\u4ece\u53f3\u5f80\u5de6\u3011\r\n        convert(-(n \/ 2));\r\n        printf(\"0\");\r\n    } else {\r\n        \/\/\u5982\u679c\u662f\u5947\u6570\uff0c\u5c3e\u6570\u662f1\r\n        \/\/\u9664\u4ee5-2\uff0c\u4e4b\u540e\u88651\u3010\u56e0\u4e3a\u4ece\u53f3\u5f80\u5de6\u3011\r\n        if(n > 0) convert(-(n \/ 2));\r\n        else convert(-(n - 1) \/ 2);\r\n        printf(\"1\");\r\n    }\r\n}\r\n\r\nint main() {\r\n    int n;\r\n    scanf(\"%d\", &n);\r\n    if(n == 0) printf(\"0\");\r\n    else convert(n);\r\n    printf(\"\\n\");\r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5006 \u8ba1\u7b97\u5668\u8bbe\u8ba1<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
Really Neato\u8ba1\u7b97\u5668\u516c\u53f8\u6700\u8fd1\u9080\u8bf7\u4f60\u7684\u56e2\u961f\u4e3a\u4ed6\u4eec\u8bbe\u8ba1\u4e00\u6b3e\u8d85\u7ea7Neato\u4e00\u4ee3\u8ba1\u7b97\u5668\u3002\u4f5c\u4e3a\u8ba1\u7b97\u673a\u79d1\u5b66\u5bb6\uff0c\u4f60\u5efa\u8bae\u8be5\u8ba1\u7b97\u5668\u80fd\u591f\u5728\u5404\u79cd\u8fdb\u5236\u4e4b\u95f4\u8fdb\u884c\u8f6c\u6362\u3002\u4ed6\u4eec\u8ba4\u4e3a\u8fd9\u662f\u4e00\u4e2a\u5f88\u597d\u7684\u60f3\u6cd5\uff0c\u5e76\u8981\u6c42\u4f60\u7684\u56e2\u961f\u5148\u7ed9\u51fa\u5b9e\u73b0\u8fdb\u5236\u8f6c\u6362\u7684\u7b97\u6cd5\u539f\u578b\u3002\u516c\u53f8\u7ecf\u7406\u544a\u8bc9\u4f60\uff0c\u8be5\u8ba1\u7b97\u5668\u5e94\u8be5\u5177\u6709\u4ee5\u4e0b\u4e00\u4e9b\u7279\u5f81\uff1a \uff081\uff09\u53ef\u4ee5\u663e\u793a7\u4f4d\uff1b \uff082\uff09\u6309\u952e\u9664\u4e86\u6570\u5b570\u52309\u5916\uff0c\u8fd8\u5305\u62ec\u5927\u5199\u5b57\u6bcdA\u5230F\uff1b \uff083\uff09\u652f\u63012~16\u8fdb\u5236\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u884c\u4e3a\u4e00\u4e2a\u8fdb\u5236\u8f6c\u6362\uff0c\u5305\u62ec3\u4e2a\u6570\uff0c\u7b2c1\u4e2a\u6570\u662f\u539f\u8fdb\u5236\u4e0b\u7684\u4e00\u4e2a\u6574\u6570\uff0c\u7b2c2\u4e2a\u6570\u5c31\u662f\u539f\u8fdb\u5236\uff0c\u7b2c3\u4e2a\u6570\u662f\u8f6c\u6362\u540e\u7684\u8fdb\u5236\u3002\u8fd93\u4e2a\u6570\u7684\u4e24\u8fb9\u53ef\u80fd\u6709\u4e00\u4e2a\u6216\u591a\u4e2a\u7a7a\u683c\u3002\u8f93\u5165\u6570\u636e\u4e00\u76f4\u5230\u6587\u4ef6\u7ed3\u5c3e\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5b9e\u73b0\u6240\u6709\u7684\u8fdb\u5236\u8f6c\u6362\uff0c\u8f6c\u6362\u540e\u7684\u6570\u53f3\u5bf9\u9f50\u52307\u4f4d\u663e\u793a\u3002\u5982\u679c\u8f6c\u6362\u540e\u7684\u6570\u7684\u4f4d\u6570\u592a\u591a\uff0c\u8d85\u8fc77\u4f4d\uff0c\u5219\u8f93\u51fa\u201cERROR\u201d\uff0c\u4e5f\u662f\u53f3\u5bf9\u9f50\u5230\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 1111000 2 10
 1111000 2 16
 2102101 3 10
 2102101 3 15
  12312 4 2
      1A 15 2
 1234567 10 16
    ABCD 16 15<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
    120
      78
    1765
    7CA
  ERROR
  11001
  12D687
    D071<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n#include<math.h>\r\nchar temp[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};\r\nchar str2[10000];\r\nint solve(char str[],int r1){\r\n    int sum = 0;\r\n    int len = strlen(str);\r\n    int i;\r\n    for(i = len-1;i >= 0;i--){\r\n        if(str[i] >= '0' && str[i] <= '9'){\r\n            sum = sum + (str[i]-'0')*pow(r1,len-i-1);\r\n        }\r\n        if(str[i] >= 'A' && str[i] <= 'F'){\r\n            sum = sum + (str[i]-55)*pow(r1,len-i-1);\r\n        }\r\n    }\r\n    return sum;\r\n}\r\nvoid solve2(int sum,int r2){\r\n    int i = 0,j = 1;\r\n    while(sum){\r\n        str2[i] = temp[sum%r2];\r\n        i++;\r\n        sum \/= r2;\r\n    }\r\n    str2[i] = '\\0';\r\n    int len = strlen(str2);\r\n     \r\n    for(j = 1;j <= 7 - len;j++){\r\n        printf(\" \");\r\n    }if(len > 7){\r\n        printf(\"  ERROR\\n\");\r\n        return;\r\n    }\r\n    for(i = len-1;i >= 0;i--){\r\n        printf(\"%c\",str2[i]);\r\n    }\r\n    printf(\"\\n\");\r\n}\r\nint main(){\r\n     \r\n    char str[10000];\r\n    int r1,r2;\r\n    while(~scanf(\"%s %d %d\",str,&r1,&r2)){\r\n        solve2(solve(str,r1),r2);\r\n    }\r\n     \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5007 \u56de\u6587\u6570<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u5982\u679c\u4e00\u4e2a\u6570\u4ece\u5de6\u5f80\u53f3\u8bfb\u548c\u4ece\u53f3\u5f80\u5de6\u8bfb\u90fd\u662f\u4e00\u6837\u7684\u8bdd\uff0c\u90a3\u4e48\u6211\u4eec\u5c31\u79f0\u5b83\u662f\u4e00\u4e2a\u56de\u6587\u6570\u3002\u4f8b\u5982\uff0c75457\u5c31\u662f\u4e00\u4e2a\u56de\u6587\u6570\u3002 \u5f53\u7136\uff0c\u8fd9\u79cd\u6027\u8d28\u8981\u53d6\u51b3\u4e8e\u8fd9\u4e2a\u6570\u662f\u5728\u4ec0\u4e48\u8fdb\u5236\u4e0b\u3002\u4f8b\u5982\uff0c17\u5728\u5341\u8fdb\u5236\u4e0b\u4e0d\u662f\u4e00\u4e2a\u56de\u6587\u6570\uff0c\u4f46\u5728\u4e8c\u8fdb\u5236\u4e0b\uff0810001\uff09\u5219\u662f\u4e00\u4e2a\u56de\u6587\u6570\u3002 \u9898\u76ee\u8981\u6c42\u4f60\u6765\u9a8c\u8bc1\u7ed9\u5b9a\u7684\u6570\u57282~16\u8fdb\u5236\u4e2d\u7684\u54ea\u4e9b\u8fdb\u5236\u4e0b\u662f\u5426\u662f\u56de\u6587\u6570\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u5305\u542b\u4e86\u82e5\u5e72\u4e2a\u5341\u8fdb\u5236\u6574\u6570n\uff0c0 < n < 50000\uff0c\u6bcf\u4e2a\u6574\u6570\u5360\u4e00\u884c\u30020\u8868\u793a\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5982\u679c\u6574\u6570i\u5728\u67d0\u4e9b\u8fdb\u5236\u4e0b\u662f\u56de\u6587\u6570\uff0c\u5219\u8f93\u51fa\u201cNumber i is palindrom in basis\u201d\uff0c\u7136\u540e\u5206\u522b\u8f93\u51fa\u8fd9\u4e9b\u8fdb\u5236\uff0c\u5176\u4e2di\u662f\u7ed9\u5b9a\u7684\u6574\u6570\u3002\u5982\u679c\u57282~16\u8fdb\u5236\u4e0b\u90fd\u4e0d\u662f\u56de\u6587\u6570\uff0c\u5219\u8f93\u51fa\u201cNumber i is not palindrom\u201d\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 17
 19
 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 Number 17 is palindrom in basis 2 4 16
 Number 19 is not a palindrom<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\nchar temp[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};\r\nvoid jinzhi(char str[],int n,int r){\r\n     \r\n    int i = 0;\r\n    while(n){\r\n        str[i++] = temp[n%r];\r\n        n \/= r;\r\n    }   \r\n}\r\nint judge(char str[]){\r\n    int i;\r\n    int flag = 1;\r\n    int len = strlen(str);\r\n    for(i = 0;i <= len\/2;i++){\r\n \r\n        if(str[i] != str[len - i - 1]){\r\n            flag = 0;\r\n        }\r\n    }\r\n    return flag;\r\n}\r\nvoid solve(int n,int i,int count){\r\n     \r\n        if(count==0)\r\n            printf(\"Number %d is palindrom in basis\",n);\r\n        printf(\" %d\",i);\r\n     \r\n}\r\nint main(){\r\n     \r\n    int n;\r\n    while(1){\r\n        int flag = 0;\r\n        int i;\r\n        scanf(\"%d\",&n);\r\n        if(n==0) break;\r\n        int count = 0;\r\n        for(i = 2;i <= 16;i++){\r\n            char str[100] = {'\\0'};\r\n            jinzhi(str,n,i);\r\n            flag = judge(str);\r\n                if(flag == 1){\r\n                    solve(n,i,count);\r\n                    count++;\r\n            }\r\n        }\r\n        \/\/printf(\"flag = %d\\n\",flag);\r\n        if(count == 0){\r\n            printf(\"Number %d is not a palindrom\",n);\r\n        }\r\n        printf(\"\\n\");\r\n    }\r\n     \r\n \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5101 \u5341\u8fdb\u5236\u8f6c\u6362\u516b\u8fdb\u5236<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u628a\u4e00\u4e2a\u5341\u8fdb\u5236\u6b63\u6574\u6570\u8f6c\u5316\u6210\u516b\u8fdb\u5236\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u82e5\u5e72\u884c\uff0c\u6bcf\u884c\u4ec5\u542b\u4e00\u4e2a\u5341\u8fdb\u5236\u8868\u793a\u7684\u6b63\u6574\u6570a(0 < a < 65536)\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u9488\u5bf9\u8f93\u5165\u7684\u6bcf\u4e00\u884c\u8f93\u51faa\u7684\u516b\u8fdb\u5236\u8868\u793a\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 9
 8<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 11
 10<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\nchar num[] = {'0','1','2','3','4','5','6','7'};\r\nint main(){\r\n    \r\n    int a;\r\n    char str[10000];\r\n    while(~scanf(\"%d\",&a)){\r\n        int temp = a;\r\n        int i = 0,j;\r\n        while(temp){\r\n            str[i] = num[(temp%8)];\r\n            temp \/= 8;\r\n            i++;\r\n        }\r\n        for(j = i - 1; j >= 0;j--){\r\n            printf(\"%c\",str[j]);\r\n        }\r\n        printf(\"\\n\");\r\n    }\r\n    \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5102 Sky\u6570<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
Sky\u4ece\u5c0f\u559c\u6b22\u5947\u7279\u7684\u4e1c\u897f\uff0c\u800c\u4e14\u5929\u751f\u5bf9\u6570\u5b57\u7279\u522b\u654f\u611f\uff0c\u4e00\u6b21\u5076\u7136\u7684\u673a\u4f1a\uff0c\u4ed6\u53d1\u73b0\u4e86\u4e00\u4e2a\u6709\u8da3\u7684\u56db\u4f4d\u65702992\uff0c\u8fd9\u4e2a\u6570\uff0c\u5b83\u7684\u5341\u8fdb\u5236\u6570\u8868\u793a\uff0c\u5176\u56db\u4f4d\u6570\u5b57\u4e4b\u548c\u4e3a2+9+9+2=22\uff0c\u5b83\u7684\u5341\u516d\u8fdb\u5236\u6570BB0\uff0c\u5176\u56db\u4f4d\u6570\u5b57\u4e4b\u548c\u4e5f\u4e3a22\uff0c\u540c\u65f6\u5b83\u7684\u5341\u4e8c\u8fdb\u5236\u6570\u8868\u793a1894\uff0c\u5176\u56db\u4f4d\u6570\u5b57\u4e4b\u548c\u4e5f\u4e3a22\uff0c\u554a\u54c8\uff0c\u771f\u662f\u5de7\u554a\u3002Sky\u975e\u5e38\u559c\u6b22\u8fd9\u79cd\u56db\u4f4d\u6570\uff0c\u7531\u4e8e\u4ed6\u7684\u53d1\u73b0\uff0c\u6240\u4ee5\u8fd9\u91cc\u6211\u4eec\u547d\u540d\u5176\u4e3aSky\u6570\u3002\u4f46\u662f\u8981\u5224\u65ad\u8fd9\u6837\u7684\u6570\u8fd8\u662f\u6709\u70b9\u9ebb\u70e6\u554a\uff0c\u90a3\u4e48\u73b0\u5728\u8bf7\u4f60\u5e2e\u5fd9\u6765\u5224\u65ad\u4efb\u4f55\u4e00\u4e2a\u5341\u8fdb\u5236\u7684\u56db\u4f4d\u6570\uff0c\u662f\u4e0d\u662fSky\u6570\u5427\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u62ec\u591a\u4e2a\u56db\u4f4d\u6b63\u6574\u6570\uff0c\u5982\u679c\u4e3a0\uff0c\u5219\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u82e5n\u4e3aSky\u6570\uff0c\u5219\u8f93\u51fa\u201c#n is a Sky Number.\u201d\uff0c\u5426\u5219\u8f93\u51fa\u201c#n is not a Sky Number.\u201d\u3002\u6bcf\u4e2a\u7ed3\u679c\u5360\u4e00\u884c\u3002\u6ce8\u610f\uff1a#n\u8868\u793a\u6240\u8bfb\u5165\u7684n\u503c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2992
 1234
 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 2992 is a Sky Number.
 1234 is not a Sky Number.<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\nint main(){\r\n    \r\n    int num;\r\n    while(~scanf(\"%d\",&num)){\r\n        if(num == 0) break;\r\n        int sum10 = 0;\r\n        int sum16 = 0;\r\n        int sum12 = 0;\r\n        int temp = num;\r\n        int i,j;\r\n        while(temp){\r\n            sum10 += temp%10;\r\n            temp \/= 10;\r\n        }\r\n        temp = num;\r\n        while(temp){\r\n            sum16 += temp%16;\r\n            temp \/= 16;\r\n        }\r\n        temp = num;\r\n        while(temp){\r\n            sum12 += temp%12;\r\n            temp \/= 12;\r\n        }\r\n        if(sum10 == sum12 && sum10==sum16){\r\n            printf(\"%d is a Sky Number.\\n\",num);\r\n        }\r\n        else{\r\n            printf(\"%d is not a Sky Number.\\n\",num);\r\n        }\r\n    }\r\n    \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5111\u516b\u8fdb\u5236\u8f6c\u6362\u5341\u8fdb\u5236<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u628a\u4e00\u4e2a\u516b\u8fdb\u5236\u6b63\u6574\u6570\u8f6c\u5316\u6210\u5341\u8fdb\u5236\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u591a\u884c\uff0c\u6bcf\u884c\u4ec5\u542b\u4e00\u4e2a\u516b\u8fdb\u5236\u8868\u793a\u7684\u6b63\u6574\u6570a\uff0ca\u7684\u5341\u8fdb\u5236\u8868\u793a\u7684\u8303\u56f4\u662f(0 < a < 65536)\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u4e00\u884c\uff0ca\u7684\u5341\u8fdb\u5236\u8868\u793a\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 11
 10<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 9
 8<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\nchar str[10000];\r\n\r\nint main(){\r\n    while(~scanf(\"%s\",str)){\r\n         int sum = 0;\r\n         int i = strlen(str);\r\n         sum = 0;\r\n         for(int j = 0;j < i;j++){\r\n            sum = sum * 8 + (str[j]-'0');\r\n        }\r\n        printf(\"%d\\n\",sum);\r\n    }\r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5112\u786e\u5b9a\u8fdb\u5236<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
6 * 9 = 42 \u5bf9\u4e8e\u5341\u8fdb\u5236\u6765\u8bf4\u662f\u9519\u8bef\u7684\uff0c\u4f46\u662f\u5bf9\u4e8e13\u8fdb\u5236\u6765\u8bf4\u662f\u6b63\u786e\u7684\u3002\u5373, 6(13) * 9(13) = 42(13)\uff0c \u800c 42(13) = 4 * 13^1 + 2* 13^0 = 54(10)\u3002 \u4f60\u7684\u4efb\u52a1\u662f\u5199\u4e00\u6bb5\u7a0b\u5e8f\u8bfb\u5165\u4e09\u4e2a\u6574\u6570p\u3001q\u548cr\uff0c\u7136\u540e\u786e\u5b9a\u4e00\u4e2a\u8fdb\u5236B(2 <= B <= 16) \u4f7f\u5f97 p * q = r\u3002\u5982\u679c B\u6709\u5f88\u591a\u9009\u62e9\uff0c\u8f93\u51fa\u6700\u5c0f\u7684\u4e00\u4e2a\u3002\u4f8b\u5982\uff1ap = 11\uff0cq = 11\uff0cr = 121\u3002\u5219\u6709 11(3) * 11(3) = 121(3) \u56e0\u4e3a 11(3) = 1 * 3^1 + 1 * 3^0 = 4(10) \u548c 121(3) = 1 * 3^2 + 2 * 3^1 + 1 * 3^0 = 16(10)\u3002 \u5bf9\u4e8e\u8fdb\u523610\u3002\u6709 11(10) * 11(10) = 121(10)\u3002\u8fd9\u79cd\u60c5\u51b5\u4e0b\uff0c\u5e94\u8be5\u8f93\u51fa3\u3002\u5982\u679c\u6ca1\u6709\u5408\u9002\u7684\u8fdb\u5236\uff0c\u5219\u8f93\u51fa0\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709T\u7ec4\u6d4b\u8bd5\u6837\u4f8b\u3002 T\u5728\u7b2c\u4e00\u884c\u7ed9\u51fa\u3002\u6bcf\u4e00\u7ec4\u6d4b\u8bd5\u6837\u4f8b\u5360\u4e00\u884c\uff0c\u5305\u542b\u4e09\u4e2a\u6574\u6570p\u3001q\u3001r\u3002p\u3001q\u3001r\u7684\u6240\u6709\u4f4d\u90fd\u662f\u6570\u5b57\uff0c\u5e76\u4e141 <= p\u3001q\u3001r <= 1,000,000\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u4e2a\u6d4b\u8bd5\u8f93\u51fa\u6837\u4f8b\u4e00\u884c\u3002\u8be5\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570\uff1a\u5373\u4f7f\u5f97p * q = r\u6210\u7acb\u7684\u6700\u5c0f\u7684B\u3002\u5982\u679c\u6ca1\u6709\u5408\u9002\u7684B\uff0c\u5219\u8f93\u51fa 0\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 3
 6 9 42
 11 11 121
 2 2 2<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 13
 3
 0<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n#include<math.h>\r\n\r\nint main(){\r\n    \r\n    int t;\r\n    scanf(\"%d\",&t);\r\n    char p[1000];\r\n    char q[1000];\r\n    char r[1000];\r\n    int i,j,k,l;\r\n    while(t--){\r\n        scanf(\"%s %s %s\",p,q,r);\r\n        \r\n        int len = strlen(r);\r\n        int len1 = strlen(p);\r\n        int len2 = strlen(q);\r\n    \r\n        \r\n        for(i = 2;i <= 16;i++){\r\n            long long sum = 0;\r\n            long long sum1 = 0;\r\n            long long sum2 = 0;\r\n            for(k = len1-1; k >= 0;k--){\r\n                sum1 += (p[k] - '0') * pow(i,len1 - k - 1);\r\n                if((p[k] - '0') >= i) {\r\n                    l  = -3;\r\n                    k = -3;\r\n                    j = -3;\r\n                    break;\r\n                }\r\n            }\r\n           \r\n            for(l = len2-1; l >= 0;l--){\r\n                sum2 += (q[l] - '0') * pow(i,len2 - l - 1);\r\n                if((q[l] - '0') >= i) {\r\n                    l  = -3;\r\n                    k = -3;\r\n                    j = -3;\r\n                    break;\r\n                }\r\n            }\r\n            for(j = len-1;j >= 0;j--){\r\n                sum += (r[j] - '0') * pow(i,len - j - 1);\r\n                if((r[j] - '0') >= i) {\r\n                    l  = -3;\r\n                    k = -3;\r\n                    j = -3;\r\n                    break;\r\n                }\r\n            }\r\n            \r\n            if(sum == sum1 * sum2 && l == -1 && j == -1 && k == -1){\r\n                    printf(\"%d\\n\",i);\r\n                    i = 17;\r\n            }\r\n            if(i == 16){\r\n                printf(\"0\\n\");\r\n            }\r\n        }\r\n    }\r\n    \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5201 \u4e8c\u8fdb\u5236\u4f4d<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4f60\u4e00\u4e2a\u5341\u8fdb\u5236\u6570n\uff080 < n < 1000\uff09\uff0c\u8981\u6c42\u8f93\u51fa\u5176\u4e8c\u8fdb\u5236\u6570\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6709\u591a\u884c\uff0c\u6bcf\u884c\u5305\u62ec\u4e00\u4e2a\u5341\u8fdb\u5236\u7684\u6b63\u6574\u6570n\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u5bf9\u5e94\u7684\u4e8c\u8fdb\u5236\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 1
 2
 3<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 1
 10
 11<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\nint main(){\r\n    int n;\r\n    while(~scanf(\"%d\",&n)){\r\n        int str[1005] = {0};\r\n        int i = 0;\r\n        while(n){\r\n            str[i++] = n % 2;\r\n            n \/= 2;\r\n        }\r\n        for(int j = i - 1;j >= 0;j--){\r\n            printf(\"%d\",str[j]);\r\n        }\r\n        printf(\"\\n\");\r\n    }\r\n}<\/code><\/pre>\n\n\n\n
5202 \u4e8c\u8fdb\u5236\u8f6c\u5316\u4e3a\u5341\u516d\u8fdb\u5236<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u8f93\u5165\u4e00\u4e2a2\u8fdb\u5236\u7684\u6570\uff0c\u8981\u6c42\u8f93\u51fa\u8be52\u8fdb\u5236\u6570\u768416\u8fdb\u5236\u8868\u793a\u3002\u572816\u8fdb\u5236\u7684\u8868\u793a\u4e2d\uff0cA-F\u8868\u793a10-15\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u7b2c1\u884c\u662f\u6d4b\u8bd5\u6570\u636e\u7684\u7ec4\u6570n\uff0c\u540e\u9762\u8ddf\u7740n\u884c\u8f93\u5165\u3002\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\u53601\u884c\uff0c\u5305\u62ec\u4e00\u4e2a\u4ee50\u548c1\u7ec4\u6210\u7684\u5b57\u7b26\u4e32\uff0c\u5b57\u7b26\u4e32\u957f\u5ea6\u81f3\u5c11\u662f1\uff0c\u81f3\u591a\u662f10000\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<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2
 100000
 111<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 20
 7<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n#include<math.h>\r\nchar str2[10005];\r\nint j = 0;\r\nchar temp[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G'};\r\nvoid jinzhi(char str[]){\r\n\tint i;\r\n\tint len = strlen(str);\r\n\tint count = 0;\r\n\tint sum = 0;\r\n\tj = 0;\r\n\tfor(i = len - 1;i >= 0;i--){\r\n\t\tsum += (int)((str[i] - '0') * pow(2,count));\r\n\t\tcount++;\r\n\t\tif(count % 4 == 0){\r\n\t\t\tcount = 0;\r\n\t\t\tstr2[j++] = temp[sum];\r\n\t\t\tsum = 0;\r\n\t\t}\r\n\t}\r\n\tif(count!=0){\r\n\t\tstr2[j++] = temp[sum];\r\n\t}\r\n}\r\nint main(){\r\n\r\n\tint n;\r\n\tint i = 0;\r\n\tscanf(\"%d\",&n);\r\n\twhile(n--){\r\n\t\tchar str[10005] = {'\\0'};\r\n\t\tscanf(\"%s\",str);\r\n\t\tjinzhi(str);\r\n\t\tfor(i = j - 1;i >= 0;i--){\r\n\t\t\tprintf(\"%c\",str2[i]);\r\n\t\t}\r\n\t\tprintf(\"\\n\");\r\n\t}\r\n\r\n\treturn 0;\r\n}<\/code><\/pre>\n\n\n\n
5203 \u5468\u6613II<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u6709\u4eba\u8bf4\uff0c\u4e2d\u56fd\u53e4\u4ee3\u7684\u201c\u5468\u6613\u201d\u662f\u4e8c\u8fdb\u5236\u7cfb\u7edf\u7684\u8d77\u6e90\uff0c\u5728\u8be5\u7cfb\u7edf\u4e2d\uff0c\u4ed6\u4eec\u7528\u201c- -\u201d\u8868\u793a1\uff0c\u201c—\u201d\u8868\u793a0\u3002\u56e0\u6b64\uff0c\u4e8c\u8fdb\u5236\u6570\u5b57\u201c011010\u201d\u53ef\u4ee5\u8868\u8ff0\u4e3a\u201c—\\n- -\\n- -\\n—\\n- -\\n—\\n\u201d\uff08\u7b26\u53f7\u201c\\n\u201d\u8868\u793a\u6362\u884c\uff09\u3002\u73b0\u5728\u7684\u95ee\u9898\u662f\u5982\u4f55\u628a\u4e00\u4e2a\u201c\u5468\u6613\u201d\u4e2d\u7684\u4e8c\u8fdb\u5236\u8f6c\u6362\u4e3a\u76f8\u5e94\u7684\u5341\u8fdb\u5236\u6570\uff1f<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u6587\u4ef6\u4e2d\u5305\u542b\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u90fd\u662f\u4ee5\u4e00\u4e2a\u6570\u5b57k (0 < k <= 20)\u5f00\u59cb\uff0c\u8868\u793a\u8fd9\u4e2a\u6570\u5728\u4e8c\u8fdb\u5236\u4e2d\u7684\u4f4d\u6570\u3002\u63a5\u4e0b\u6765\u5c31\u662fk\u884c\uff0c\u5c31\u662f\u5b57\u7b26\u4e32—\u6216- -\uff0c\u7b2c1\u4f4d\u8868\u793a\u6700\u9ad8\u4f4d\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u4e8e\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u5bf9\u5e94\u7684\u5341\u8fdb\u5236\u6570\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 3
 – –
 – –
 – –
 3
 —
 —
 —
 6
 —
 – –
 – –
 —
 – –
 —<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 7
 0
 26<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8003\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6709\u810f\u6570\u636e\u3010\u786e\u4fe1\u3011\u800c\u4e14\u8fd8\u6709Linux\u7cfb\u7edf\u5f88\u8be1\u5f02\u7684\u6362\u884c\u95ee\u9898\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u7b14\u8005\u63a8\u8350\u6bcf\u4e00\u884c\u90fd\u7528fgets\u628a\u6362\u884c\u7b26\u7ed9\u8bfb\u5165\u4e86\uff0c\u4e0d\u7136\u53ef\u80fd\u4ea7\u751f\u4e0d\u77e5\u540d\u7684\u9519\u8bef\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00 \u4ee3\u7801\u4e00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\nint main(){\r\n     \r\n    char str[1000][1000];\r\n    int n;\r\n    int i;\r\n    char res[1000];\r\n    while(~scanf(\"%d\",&n)){\r\n        int j = 0;\r\n        getchar();\r\n        getchar();\r\n        for(i = 0;i < n;i++){\r\n            gets(str[i]);\r\n            if(strncmp(str[i],\"- -\",3)==0){\r\n                res[j++] = '1';\r\n            }\r\n            if(strncmp(str[i],\"---\",3)==0){\r\n                res[j++] = '0';\r\n            }\r\n        }\/\/011010\r\n        long long sum = 0;\r\n        for(i = 0;i < j;i++){\r\n            sum = sum * 2 + (res[i]-'0');\r\n        }\r\n        printf(\"%lld\\n\",sum);\r\n    }\r\n     \r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00 \u4ee3\u7801\u4e8c\uff1a<\/h3>\n\n\n\n
#include<stdio.h> \r\n#include<string.h>\r\nint str[10000];\r\nlong long solve(int n){\r\n    long long sum = 0;\r\n    for(int j = n;j >= 1;j--){\r\n        sum += str[j] * pow(2,n - j);\r\n    }\r\n    return sum;\r\n}\r\nint main()\r\n{\r\n    char first[1000] = {'\\0'};\r\n    while(fgets(first,sizeof(first),stdin)){\r\n        int k = first[0] - '0';\r\n        for(int i = 1;i <= k;i++){\r\n            char temp[1000] = {'\\0'};\r\n            fgets(temp,sizeof(temp),stdin);\r\n            str[i] = temp[1] == '-' ? 0 : 1;\r\n        }\r\n        printf(\"%lld\\n\",solve(k));\r\n    }\r\n    return 0;\r\n}\r\n<\/code><\/pre>\n\n\n\n
5204 \u4e8c\u8fdb\u5236\u6570<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2a\u6b63\u6574\u6570n\uff0c\u8981\u6c42\u8f93\u51fa\u5bf9\u5e94\u7684\u4e8c\u8fdb\u5236\u6570\u4e2d\u6240\u6709\u6570\u7801\u201c1\u201d\u7684\u4f4d\u7f6e\u3002\u6ce8\u610f\u6700\u4f4e\u4f4d\u4e3a\u7b2c0\u4f4d\u3002\u4f8b\u598213\u7684\u4e8c\u8fdb\u5236\u5f62\u5f0f\u4e3a1101\uff0c\u56e0\u6b64\u6570\u78011\u7684\u4f4d\u7f6e\u4e3a\uff1a0,2,3\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u7b2c1\u884c\u4e3a\u4e00\u4e2a\u6b63\u6574\u6570d\uff0c\u8868\u793a\u8f93\u5165\u6587\u4ef6\u4e2d\u6d4b\u8bd5\u6570\u636e\u7684\u4e2a\u6570\uff0c1<=d<=10\uff0c\u63a5\u4e0b\u6765\u6709d\u4e2a\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u53ea\u6709\u4e00\u4e2a\u6574\u6570n\uff0c1<=n<= 106\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u8f93\u51fa\u5305\u62ecd\u884c\uff0c\u5373\u5bf9\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u8f93\u51fa\u4e00\u884c\u3002\u7b2ci\u884c\uff0c1 <= i <= d\uff0c\u4ee5\u5347\u5e8f\u7684\u987a\u5e8f\u8f93\u51fa\u7b2ci\u4e2a\u6d4b\u8bd5\u6570\u636e\u4e2d\u7684\u6574\u6570\u7684\u4e8c\u8fdb\u5236\u5f62\u5f0f\u4e2d\u6240\u6709\u6570\u78011\u7684\u4f4d\u7f6e\uff0c\u4f4d\u7f6e\u4e4b\u95f4\u67091\u4e2a\u7a7a\u683c\uff0c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e\u540e\u9762\u6ca1\u6709\u7a7a\u683c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2
 13
 127<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 0 2 3
 0 1 2 3 4 5 6<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00 \u4ee3\u7801\u4e00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n#include<math.h>\r\nchar str[10000];\r\nchar temp[] = {'0','1'};\r\nint main(){\r\n    int d;\r\n    scanf(\"%d\",&d);\r\n    while(d--){\r\n        int n;\r\n        scanf(\"%d\",&n);\r\n        int i = 0,j = 0;\r\n        while(n){\r\n            str[i++] = temp[n%2];\r\n            n \/= 2;\r\n        }\r\n        for(j = 0;j < i;j++){\r\n            if(str[j]=='1'){\r\n                printf(\"%d \",j);\r\n            }\r\n        }\r\n        printf(\"\\n\");\r\n    }\r\n\treturn 0;\r\n}<\/code><\/pre>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00 \u4ee3\u7801\u4e8c\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\r\nint main() {\r\n    int d;\r\n    scanf(\"%d\", &d);\r\n    while(d--) {\r\n        int n;\r\n        scanf(\"%d\",&n);\r\n        int first = 1;\r\n        for(int i = 0;i < 31;i++){\r\n            if((n & (1 << i)) != 0) {\r\n                if(first){\r\n                    printf(\"%d\", i);\r\n                    first = 0;\r\n                }else{\r\n                    printf(\" %d\", i);\r\n                }\r\n            }\r\n        }\r\n        printf(\"\\n\");\r\n    }\r\n    return 0;\r\n}\r\n<\/code><\/pre>\n\n\n\n
5205 \u7559\u4e0b\u6700\u5c11<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2a\u57fa\u6570b\uff0c\u548cb\u8fdb\u5236\u4e0b\u7684\u4e24\u4e2a\u975e\u8d1f\u6574\u6570p\u548cm\uff0c\u8ba1\u7b97p%m\uff0c\u5e76\u8f93\u51fab\u8fdb\u5236\u4e0b\u7684\u7ed3\u679c\u3002p%m\u7684\u7ed3\u679c\u88ab\u5b9a\u4e49\u4e3a\u975e\u8d1f\u6574\u6570k\uff0c\u8981\u6c42k\u662f\u6ee1\u8db3p=a * m + k\u4e2d\u7684\u6700\u5c0f\u503c\uff08a\u4e3a\u67d0\u4e9b\u6574\u6570\uff09\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u5305\u542b\u591a\u7ec4\u6d4b\u8bd5\u6570\u636e\u3002\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\u5360\u4e00\u884c\uff0c\u75313\u4e2a\u65e0\u7b26\u53f7\u7684\u6574\u6570\u6784\u6210\uff0c\u7b2c\u4e00\u4e2a\u6574\u6570\u4e3ab\uff0c\u4e00\u4e2a\u4ecb\u4e8e2\u523010\u4e4b\u95f4\u7684\u5341\u8fdb\u5236\u6570\u3002\u7b2c\u4e8c\u4e2a\u4e3ap\uff0c\u53ef\u80fd\u75311000\u4f4d\u76840\u5230b-1\u6784\u6210\u3002\u7b2c\u4e09\u4f4d\u662fm\uff0c\u75319\u4f4d0\u5230b-1\u6784\u6210\u3002 \u6700\u540e\u4e00\u4e2a\u6d4b\u8bd5\u6570\u636e\u4e3a0\uff0c\u8868\u793a\u8f93\u5165\u7ed3\u675f\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u5e94\u6bcf\u7ec4\u6d4b\u8bd5\u6570\u636e\uff0c\u8981\u6c42\u8f93\u51fa\u4e00\u884cb\u8fdb\u5236\u4e0b\u7684p%m\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 2 1100 101
 10 123456789123456789123456789 1000
 0<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 10
 789<\/p>\n<\/blockquote>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u4e00\u4e2a\u4efb\u610f\u8fdb\u5236\u7684\u6570\uff0c\u5bf9x\u53d6\u4f59\u7684\u7ed3\u679c \u7b49\u4e8e \u5176\u5404\u4e2a\u6570\u4f4d\u4e0a\u7684\u6570\u5bf9x\u53d6\u4f59\u7684\u7ed3\u679c\u7684\u548c \u518d\u5bf9x\u53d6\u4f59\u3002<\/p>\n\n\n\n
\u5373 \u5bf9\u4e8e\u4efb\u4f55\u6574\u6570 a, b, m\uff0c\u6211\u4eec\u6709 $(a + b) \\% m = ((a \\% m) + (b \\% m)) \\% m$<\/p>\n\n\n\n
\u6bd4\u5982 $123456789$\uff0c\u5373 $1*10^8 + 2*10^7 + 3*10^6 + 4*10^5 + 5*10^4 + 6*10^3 + 7*10^2 + 8*10^1 + 9*10^0$<\/p>\n\n\n\n
$(1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9) \\% 10 = 45 \\% 10 = 5$\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u8fd9\u9053\u9898\u6211\u4eec\u6c42\u7684\u867d\u7136\u662f$p \\% m$\uff0c\u5b9e\u9645\u4e0a\u5c31\u662f\uff1a\u5982\u679c\u4e00\u4e2a\u6570p\u5728\u4efb\u610f\u8fdb\u5236\u4e0b\u8868\u793a\u4e3a$d_1d_2d_3…d_n$\uff0c\u90a3\u4e48$p\\%m = ((d_1\\%m) + (d_2\\%m) + … + (d_n\\%m)) \\% m$<\/p>\n\n\n\n
\u7136\u540e\u5177\u4f53\u8bf7\u770b\u4ee3\u7801~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\r\n#include<string.h>\r\n\r\nint main(){\r\n    int b;\r\n    char p[1005], m[10];\r\n    while(scanf(\"%d\", &b) != EOF && b) {\r\n        scanf(\"%s %s\",p,m);\r\n        long long mx = 0;\r\n        int len_m = strlen(m);\r\n        \/\/\u6c42m\u7684\u503c\r\n        for(int i = 0;i < len_m;i++)\r\n            mx = mx * b + m[i] - '0';\r\n        long long px = 0;\r\n        int len_p = strlen(p);\r\n        \/\/\u7528\u6a21\u8fd0\u7b97\u6c42p\u7684\u503c\r\n        for(int i = 0; i < len_p; i++){\r\n            px = px * b + p[i] - '0';\r\n            px %= mx;\r\n        }\r\n        \/\/\u7279\u52240\r\n        if(px == 0)\r\n            printf(\"0\\n\");\r\n        else{\r\n            char ans[1005];\r\n            int len = 0;\r\n            \/\/\u8fdb\u5236\u8f6c\u6362\u6210b\u8fdb\u5236\r\n            while(px > 0){\r\n                ans[len++] = px % b + '0';\r\n                px \/= b;\r\n            }\r\n            for(int i = len - 1;i >= 0;i--)\r\n                printf(\"%c\", ans[i]);\r\n            printf(\"\\n\");\r\n        }\r\n    }\r\n    return 0;\r\n}<\/code><\/pre>\n\n\n\n
5206 \u8fdb\u5236\u8f6c\u6362<\/a><\/h2>\n\n\n\n
\n
\u9898\u76ee\u63cf\u8ff0<\/h4>\n\n\n\n
\u7f16\u5199\u7a0b\u5e8f\uff0c\u5b9e\u73b0\u5c06\u4e00\u4e2a\u6570\u4ece\u4e00\u79cd\u8fdb\u5236\u8f6c\u6362\u5230\u53e6\u4e00\u79cd\u8fdb\u5236\u3002\u5728\u8fd9\u4e9b\u8fdb\u5236\u4e2d\uff0c\u53ef\u4ee5\u51fa\u73b0\u7684\u6570\u7801\u670962\u4e2a\uff1a{0-9,A-Z,a-z}\u3002<\/p>\n\n\n\n
\u8f93\u5165<\/h4>\n\n\n\n
\u8f93\u5165\u6587\u4ef6\u7684\u7b2c1\u884c\u662f\u4e00\u4e2a\u6b63\u6574\u6570N\uff0c\u8868\u793a\u6d4b\u8bd5\u6570\u636e\u7684\u4e2a\u6570\uff0c\u63a5\u4e0b\u6765\u6709N\u884c\uff0c\u6bcf\u884c\u7684\u683c\u5f0f\u4e3a\uff1a\u8f93\u5165\u6570\u636e\u7684\u8fdb\u5236\uff08\u7528\u5341\u8fdb\u5236\u8868\u793a\uff09\uff0c\u8f93\u51fa\u6570\u636e\u7684\u8fdb\u5236\uff08\u7528\u5341\u8fdb\u5236\u8868\u793a\uff09\uff0c\u6700\u540e\u4e00\u4e2a\u662f\u7528\u8f93\u5165\u6570\u636e\u7684\u8fdb\u5236\u6240\u8868\u793a\u7684\u6570\u3002\u8f93\u5165\/\u8f93\u51fa\u6570\u636e\u7684\u8fdb\u5236\u8303\u56f4\u662f2 ~ 62\uff0c\u4e5f\u5c31\u662f\u8bf4A ~ Z\u76f8\u5f53\u4e8e\u5341\u8fdb\u5236\u4e2d\u768410 ~ 35\uff0ca ~ z\u76f8\u5f53\u4e8e\u5341\u8fdb\u5236\u4e2d\u768436 ~ 61\u3002<\/p>\n\n\n\n
\u8f93\u51fa<\/h4>\n\n\n\n
\u5bf9\u6bcf\u4e2a\u6d4b\u8bd5\u6570\u636e\uff0c\u7a0b\u5e8f\u8f93\u51fa3\u884c\uff0c\u7b2c1\u884c\u662f\u8f93\u5165\u6570\u636e\u7684\u8fdb\u5236\uff0c\u7a7a\u683c\uff0c\u7136\u540e\u662f\u5728\u8be5\u8fdb\u5236\u4e0b\u7684\u8f93\u5165\u6570\u636e\uff1b\u7b2c2\u884c\u662f\u8f93\u51fa\u6570\u636e\u7684\u8fdb\u5236\uff0c\u7a7a\u683c\uff0c\u7136\u540e\u662f\u5728\u8be5\u8fdb\u5236\u4e0b\u7684\u8f93\u51fa\u6570\u636e\uff1b\u7b2c3\u884c\u4e3a\u7a7a\u884c\u3002<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u5165 \u590d\u5236<\/h4>\n\n\n\n
 8
 62 2 abcdefghiz
 10 16 1234567890123456789012345678901234567890
 16 35 3A0C92075C0DBF3B8ACBC5F96CE3F0AD2
 35 23 333YMHOUE8JPLT7OX6K9FYCQ8A
 23 49 946B9AA02MI37E3D3MMJ4G7BL2F05
 49 61 1VbDkSIMJL3JjRgAdlUfcaWj
 61 5 dl9MDSWqwHjDnToKcsWE1S
 5 10 42104444441001414401221302402201233340311104212022133030<\/p>\n\n\n\n
\u6837\u4f8b\u8f93\u51fa \u590d\u5236<\/h4>\n\n\n\n
 62 abcdefghiz
 2 11011100000100010111110010010110011111001001100011010010001
 \u200b
 10 1234567890123456789012345678901234567890
 16 3A0C92075C0DBF3B8ACBC5F96CE3F0AD2
 \u200b
 16 3A0C92075C0DBF3B8ACBC5F96CE3F0AD2
 35 333YMHOUE8JPLT7OX6K9FYCQ8A
 \u200b
 35 333YMHOUE8JPLT7OX6K9FYCQ8A
 23 946B9AA02MI37E3D3MMJ4G7BL2F05
 \u200b
 23 946B9AA02MI37E3D3MMJ4G7BL2F05
 49 1VbDkSIMJL3JjRgAdlUfcaWj
 \u200b
 49 1VbDkSIMJL3JjRgAdlUfcaWj
 61 dl9MDSWqwHjDnToKcsWE1S
 \u200b
 61 dl9MDSWqwHjDnToKcsWE1S
 5 42104444441001414401221302402201233340311104212022133030
 \u200b
 5 42104444441001414401221302402201233340311104212022133030
 10 1234567890123456789012345678901234567890<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include <stdio.h>\r\n#include <string.h>\r\n\r\nint main() {\r\n    int t;\r\n    scanf(\"%d\", &t);\r\n    while(t--){\r\n        int a, b;\r\n        char c[100],d[100];\r\n        scanf(\"%d %d %s\",&a,&b,c);\r\n        int arr[100] = {0},res[100] = {0};\r\n        int arr_size = 0;\r\n        int len_c = strlen(c);\r\n        \r\n        for(int i = len_c - 1;i >=0;i--){\/\/\u53cd\u8f6c\u5f97\u5230\u6570\u7ec4\r\n            if(c[i] >='0' && c[i] <='9') arr[arr_size++] = c[i] - '0';\r\n            if(c[i] >='A' && c[i] <='Z') arr[arr_size++] = c[i] - 'A' + 10;\r\n            if(c[i] >='a' && c[i] <= 'z') arr[arr_size++] = c[i] - 'a' + 36;\r\n        }\r\n        int res_size = 0;\r\n        \r\n        while(arr_size){ \r\n            int r = 0;\r\n            \/\/\u8fdb\u5236\u8f6c\u6362\r\n            for(int i = arr_size - 1;i >=0;i--){\r\n                arr[i] += r * a;\r\n                r = arr[i] % b;\r\n                arr[i] \/= b;\r\n            }\r\n            res[res_size++] = r;\/\/\u6bcf\u6b21\u5c06\u4f59\u6570\u52a0\u5165\u5230\u6570\u7ec4\u4e2d\r\n            while(arr_size && arr[arr_size - 1] == 0) arr_size--;\/\/\u53bb\u9664\u524d\u5bfc0\r\n        }\r\n        \r\n        int d_index = 0;\r\n        \/\/\u628a\u6570\u5b57\u8f6c\u6362\u6210\u8fdb\u5236\u7684\u5b57\u7b26\r\n        for(int i = res_size - 1;i >= 0;i--){\r\n            if(res[i] >= 0 && res[i] <= 9) d[d_index++] = res[i] + '0';\r\n            if(res[i] >= 10 && res[i] <= 35) d[d_index++] = res[i] + 'A' - 10;\r\n            if(res[i] >= 36) d[d_index++] = res[i] + 'a' - 36;\r\n        }\r\n        d[d_index] = '\\0';\r\n        \r\n        printf(\"%d %s\\n\",a,c);\r\n        printf(\"%d %s\\n\\n\",b,d);\r\n    }\r\n    return 0;\r\n}\r\n<\/code><\/pre>\n\n\n\n
\u603b\u7ed3<\/h2>\n\n\n\n
    \n
  1. \u8fd9\u5957\u9898\u90fd\u662f\u8fdb\u5236\u8f6c\u6362\uff0c\u5927\u591a\u6570\u9898\u76ee\u8003\u5bdf\u7684\u5185\u5bb9\u90fd\u662f\u4e00\u81f4\u7684\uff0c\u672c\u8d28\u4e0a\u5c31\u662f\u8fdb\u5236\u8f6c\u6362\uff0c\u5584\u7528\u77ed\u9664\u6cd5\u5904\u7406\uff0c\u628a\u4f59\u6570\u5b58\u50a8\uff0c\u5c31\u53ef\u4ee5\u5f97\u5230\u4e0d\u540c\u7684\u8fdb\u5236\u3002<\/li>\n\n\n\n
  2. \u90e8\u5206\u9898\u76ee\u4f1a\u6d89\u53ca\u5230\u5b57\u7b26\u4e32\u7684\u4f7f\u7528\uff0c\u8fd8\u6709\u50cf\u5468\u6613\u2161\u8be5\u9898\u4f1a\u51fa\u73b0\u5b57\u7b26\u5904\u7406\u7684\u60c5\u51b5\uff0c\u9700\u8981\u7528fgets\u6574\u884c\u8bfb\u5165\u4e3a\u597d\u3002<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"
    5001 \u7279\u6b8a\u7684\u56db\u4f4d\u6570 \u9898\u76ee\u63cf\u8ff0 \u627e\u51fa\u5e76\u8f93\u51fa\u6240\u6709\u5c0f\u4e8e\u7b49\u4e8en\u76844\u4f4d\u6570\uff08\u5341\u8fdb\u5236\u6570\uff09\u4e2d\u5177\u6709\u5982\u4e0b\u5c5e\u6027\u7684\u6570\uff1a\u56db\u4f4d\u6570\u5b57\u4e4b\u548c […]<\/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,11],"tags":[],"class_list":["post-186","post","type-post","status-publish","format-standard","hentry","category-nenuoj","category-10","category-8","category-11"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/186","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=186"}],"version-history":[{"count":1,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/186\/revisions"}],"predecessor-version":[{"id":187,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/186\/revisions\/187"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=186"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=186"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=186"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}