{"id":352,"date":"2024-10-13T01:54:23","date_gmt":"2024-10-12T17:54:23","guid":{"rendered":"https:\/\/www.nenuacm.top\/?p=352"},"modified":"2024-10-24T15:19:26","modified_gmt":"2024-10-24T07:19:26","slug":"nenu-%e7%a8%8b%e5%ba%8f%e8%ae%be%e8%ae%a1%e5%9f%ba%e7%a1%80c%e8%af%ad%e8%a8%80-pta%ef%bc%8869%e7%ab%a0%ef%bc%89","status":"publish","type":"post","link":"https:\/\/www.nenuacm.top\/index.php\/2024\/10\/13\/nenu-%e7%a8%8b%e5%ba%8f%e8%ae%be%e8%ae%a1%e5%9f%ba%e7%a1%80c%e8%af%ad%e8%a8%80-pta%ef%bc%8869%e7%ab%a0%ef%bc%89\/","title":{"rendered":"NENU \u7a0b\u5e8f\u8bbe\u8ba1\u57fa\u7840C\u8bed\u8a00 PTA\uff086~9\u7ae0\uff09"},"content":{"rendered":"\n

\u8fd9\u91cc\u662f\u5927\u4e00\u5165\u5b66\u7684\u4e00\u95e8\u5fc5\u4fee\uff0c\u4f1a\u5b9e\u73b0\u6700\u6700\u57fa\u7840\u7684C\u8bed\u8a00\u5185\u5bb9\u3002<\/p>\n\n\n\n

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

\u4f5c\u4e3a\u521d\u5b66\u8005\uff0c\u53ef\u4ee5\u53bb\u5404\u79cd\u5e73\u53f0\u4e0a\u5b66\u4e60C\u8bed\u8a00\u7684\u8bed\u6cd5\u3002<\/p>\n\n\n\n

\u5584\u7528\u641c\u7d22\u5f15\u64ce\u3001\u4ee3\u7801\u8bba\u575b\uff08CSDN\u3001\u7a00\u571f\u6398\u91d1\u3001stack overflow\uff09\u3001AI\uff08\u56fd\u5185\u7684kimi\u3001\u6587\u5fc3\u4e00\u8a00\u3001\u901a\u4e49\u5343\u95ee\uff09\u8fdb\u884c\u5b66\u4e60\u3002<\/p>\n\n\n\n

\u53ef\u4ee5\u5b66\u4e60\u7b14\u8005\u7684\u4ee3\u7801\u98ce\u683c\uff0c\u4e5f\u53ef\u4ee5\u4e0d\u5b66\u4e60\uff0c\u4f46\u662f\u63a8\u8350\u4ee3\u7801\u91cc\u7684\u7b26\u53f7\uff0c\u4f8b\u5982+-*\/=\u7684\u524d\u540e\u90fd\u52a0\u4e0a\u7a7a\u683c\u3002<\/p>\n\n\n\n

\u4ee3\u7801\u6362\u884c\u8981\u6ce8\u610f\uff0c\u4ee5\u53ca\u62ec\u53f7\u6362\u884c\u4e5f\u8981\u6ce8\u610f\uff0c\u8bf7\u5c3d\u91cf\u4fdd\u6301\u4e00\u79cd\u4ee3\u7801\u98ce\u683c\uff0c\u4e0d\u8981\u51fa\u73b0\u5982\u4e0b\u8fd9\u79cd\u4ee3\u7801\uff1a<\/p>\n\n\n\n

#include<stdio.h>\nint main()\n{\n int n;\n scanf(\"%d\",&n);\n for(int i = 1;i <= n;i++){ printf(\"%d\",i);}\n for(int i = n;i >= 1;i--){\n     for(int j = 1;j <= i;j++)\n     {if(j < i) printf(\"%d \",j);\n     }\n     printf(\"\\n\");\n }\n}<\/code><\/pre>\n\n\n\n
\u6ce8\u610f\u5b66\u4f1a\u770b\u62a5\u9519\u4fe1\u606f\uff0cerror\u5f00\u5934\u7684\u90a3\u79cd\uff0c\u4e0d\u4e86\u89e3\u5c31\u5148\u53bb\u641c\u7d22\uff0c\u660e\u767d\u201d\u63d0\u95ee\u7684\u827a\u672f\u201c\u3002<\/p>\n\n\n\n
\u6709\u4e9b\u5b57\u7b26\u6570\u7ec4\u7684\u5904\u7406\u9700\u8981\u7528\u5230\u5934\u6587\u4ef6<string.h>\uff0c\u6709\u4e9b\u7528\u5230\u6839\u53f7sqrt\u8ba1\u7b97\u7684\u9700\u8981\u7528\u5230\u5934\u6587\u4ef6<math.h>\u3002<\/p>\n\n\n\n
fgets\u4e0egets\u7684\u533a\u522b\u548c\u4f5c\u7528\u9700\u8981\u8bfb\u8005\u81ea\u884c\u67e5\u8be2\u5b66\u4e60\uff01\uff01<\/p>\n<\/blockquote>\n\n\n\n
6-1 \u6c42\u6700\u5927\u503c\u53ca\u5176\u4e0b\u6807<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u662f\u4e00\u4e2a\u601d\u7ef4\u65b9\u5f0f\uff1a\u7528\u4e00\u4e2a\u53d8\u91cf\u4e13\u95e8\u5b58\u50a8\u8981\u6c42\u7684\u7ed3\u679c\u3002<\/p>\n\n\n\n
\u8fd9\u91cc\u6211\u4eec\u53ef\u4ee5\u7528\u4e24\u4e2a\u53d8\u91cf\uff0c\u5206\u522b\u5b58\u50a8\u6700\u5927\u503c\u548c\u5176\u5bf9\u5e94\u7684\u4e0b\u6807\uff0c\u5224\u65ad\u65b9\u5f0f\u5c31\u662f\u5224\u65ad\u5927\u5c0f\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 n;\n    scanf(\"%d\",&n);\n    int a[12];\n    for(int i = 0;i < n;i++){\n        scanf(\"%d\",&a[i]);\n    }\n    int maxx = a[0];\n    int index = 0;\n    for(int i = 0;i < n;i++){\n        if(a[i] > maxx){\n            maxx = a[i];\n            index = i;\n        }\n    }\n    printf(\"%d %d\",maxx,index);\n}<\/code><\/pre>\n\n\n\n
6-2 \u5c06\u6570\u7ec4\u4e2d\u7684\u6570\u9006\u5e8f\u5b58\u653e<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6211\u4eec\u5c31\u6309\u7167\u9898\u76ee\u7684\u610f\u601d\u6765\u5b9e\u73b0\u5c31\u884c~<\/p>\n\n\n\n
\u6ce8\u610f\u683c\u5f0f\u95ee\u9898\uff01\uff01<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    int a[12];\n    for(int i = 0;i < n;i++){\n        scanf(\"%d\",&a[i]);\n    }\n    printf(\"%d\",a[n - 1]);\n    for(int i = n - 2;i >= 0;i--){\n        printf(\" %d\",a[i]);\n    }\n}<\/code><\/pre>\n\n\n\n
6-3 \u9009\u62e9\u6cd5\u6392\u5e8f<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u662f\u9009\u62e9\u6cd5\u6392\u5e8f\u3002<\/p>\n\n\n\n
\u6211\u4eec\u7684\u601d\u8def\u662f\u6bcf\u6b21\u904d\u5386\u6574\u4e2a\u6570\u7ec4\uff0c\u7136\u540e\u628a\u6700\u5927\u7684\u5143\u7d20\u653e\u5728\u524d\u9762\u3002<\/p>\n\n\n\n
\u8fd9\u6837\u6211\u4eec\u6bcf\u6b21\u90fd\u80fd\u627e\u5230\u6700\u5927\u7684\uff0c\u5bf9\u4e8e\u5168\u5c40\u6765\u8bf4\uff0c\u5c31\u662f\u7b2c\u4e00\u6b21\u627e\u5230\u6700\u5927\u7684\uff0c\u7b2c\u4e8c\u6b21\u53c8\u627e\u5230\u6700\u5927\u7684\uff0c\u6240\u4ee5\u6211\u4eec\u5e94\u8be5\u662f\u6bcf\u6b21\u5728\u5269\u4f59\u6ca1\u6709\u786e\u5b9a\u7684\u90e8\u5206\u91cc\u5bfb\u627e\uff0c\u6211\u4eec\u6bcf\u6b21\u90fd\u627e\u6700\u5927\u7684\u653e\u524d\u9762\uff0c\u7136\u540e\u5c31\u6709\u4e86\u7b2c\u4e00\u4e2a\u6700\u5927\u3001\u7b2c\u4e8c\u4e2a\u6700\u5927\u3001\u7b2c\u4e09\u4e2a\u6700\u5927\u2026\u2026\u8fd9\u6837\u6211\u4eec\u5c31\u80fd\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\u4e86\uff0c\u6bcf\u4e00\u6b21\u6211\u4eec\u53ef\u4ee5\u627e\u5230\u4e00\u4e2a\u6700\u5927\u7684\u6570\u5b57\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u6211\u4eec\u6bcf\u6b21\u53ef\u4ee5\u5b8c\u5168\u786e\u8ba4\u4e00\u4e2a\u6570\u5b57\u7684\u4f4d\u7f6e\u662f\u6b63\u786e\u7684\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>\nint main(){\n    int n,a[11];\n    scanf(\"%d\",&n);\n    for(int i = 0;i < n;i++){\n        scanf(\"%d\",&a[i]); \/\/ \u5c06n\u4e2a\u6574\u6570\u5b58\u5165\u6570\u7ec4\n    }\n    int temp = 0;\n    int maxx = 0;\n    \/\/ \u63a5\u4e0b\u6765\u8981\u6bd4\u8f83\u5927\u5c0f\uff0c\u7531\u5927\u5230\u5c0f\u4f9d\u6b21\u8f93\u51fa\n    \/\/ \u9009\u62e9\u6cd5\u6392\u5e8f\uff1a\u4ece\u5934\u5230\u5c3e\u626b\u63cf\u5e8f\u5217\uff0c\u627e\u51fa\u6700\u5927\u7684\u5143\u7d20\u4e0e\u7b2c\u4e00\u4e2a\u5143\u7d20\u4ea4\u6362\n    \/\/ \u7136\u540e\u4ece\u5269\u4e0b\u7684\u90e8\u5206\u4e2d\u91cd\u590d\u6b64\u884c\u4e3a\n    for(int i = 0;i < n;i++){\n        maxx = i;\n        for(int j = i + 1;j < n;j++){\n            if(a[maxx] < a[j]) {\n                maxx = j; \n            }\n        }\n        temp = a[maxx];\n        a[maxx] = a[i];\n        a[i] = temp;\n    }\n    printf(\"%d\",a[0]);\n    for(int i = 1;i <= n - 1;i++){\n        printf(\" %d\",a[i]);\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
6-4 \u5192\u6ce1\u6cd5\u6392\u5e8f<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5192\u6ce1\u6392\u5e8f\u4e00\u5b9a\u8981\u641e\u660e\u767d\uff0c\u5f88\u591a\u9762\u8bd5\u9898\u559c\u6b22\u95ee~<\/p>\n\n\n\n
\u9898\u76ee\u5df2\u7ecf\u8bb2\u5f97\u5f88\u660e\u767d\u4e86\uff1a\u4ece\u5934\u5230\u5c3e\u6bd4\u8f83\u76f8\u90bb\u4e24\u4e2a\u5143\u7d20\uff0c\u5982\u679c\u524d\u9762\u7684\u5143\u7d20\u5927\u4e8e\u5176\u7d27\u968f\u7684\u540e\u9762\u5143\u7d20\uff0c\u5219\u4ea4\u6362\u5b83\u4eec\u3002\u901a\u8fc7\u4e00\u904d\u626b\u63cf\uff0c\u5219\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u5fc5\u5b9a\u662f\u6700\u5927\u7684\u5143\u7d20\u3002\u7136\u540e\u7528\u540c\u6837\u7684\u65b9\u6cd5\u5bf9\u524dN\u22121\u4e2a\u5143\u7d20\u8fdb\u884c\u7b2c\u4e8c\u904d\u626b\u63cf\u3002\u4f9d\u6b64\u7c7b\u63a8\uff0c\u6700\u540e\u53ea\u9700\u5904\u7406\u4e24\u4e2a\u5143\u7d20\uff0c\u5c31\u5b8c\u6210\u4e86\u5bf9N\u4e2a\u6570\u7684\u6392\u5e8f\u3002<\/p>\n\n\n\n
\u6240\u4ee5\u6211\u4eec\u8fd9\u6837\u53bb\u5b9e\u73b0\u5373\u53ef~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\nint main(){\n    int n,a[1001];\n    int k;\n    scanf(\"%d %d\",&n,&k);\n    for(int i = 0;i < n;i++){\n        scanf(\"%d\",&a[i]);\n    }\n    \/\/ \u8fd9\u91cc\u8fdb\u884cn - 1\u6b21\u6392\u5e8f\u5373\u53ef\uff0c\u56e0\u4e3a\u6bcf\u6b21\u786e\u8ba4\u4e00\u4e2a\u6570\u5b57\uff0cn - 1\u6b21\u5df2\u7ecf\u786e\u5b9a\u4e86n - 1\u4e2a\u6570\u5b57\u7684\u4f4d\u7f6e\uff0c\u6700\u540e\u4e00\u4e2a\u6570\u5b57\u7684\u4f4d\u7f6e\u4e00\u5b9a\u4e5f\u662f\u786e\u5b9a\u7684\n    for(int i = 0;i < n - 1;i++){\n        \/\/ \u5df2\u7ecf\u6392\u5e8fk\u6b21\u4e86\n        if(i == k) break;\n        \/\/ \u8fd9\u91cc\u5c31\u662f\u5192\u6ce1\u7684\u6838\u5fc3\uff0c\u6bcf\u6b21\u628a\u6700\u5927\u7684\u5f80\u540e\u9762\u653e\uff0c\u7136\u540e\u56e0\u4e3a\u6211\u4eec\u53ea\u904d\u5386\u672a\u786e\u5b9a\u4f4d\u7f6e\u7684\u90e8\u5206\uff0c\u6240\u4ee5\u5185\u5faa\u73af\u662fn - 1\u6b21\u518d\u51cf\u53bbi\u6b21\uff08\u56e0\u4e3a\u8fdb\u884ci\u6b21\u8bf4\u660e\u653e\u5728\u6700\u540ei\u4e2a\u4f4d\u7f6e\u7684\u6570\u5b57\u5df2\u7ecf\u88ab\u786e\u5b9a\u4e86\n        for(int j = 0;j < n - 1 - i;j++){\n            if(a[j] > a[j + 1]){\n                int temp = a[j + 1];\n                a[j + 1] = a[j];\n                a[j] = temp;\n            }\n        }\n    }\n    \/\/ \u6ce8\u610f\u884c\u5c3e\u7a7a\u683c\u7684\u683c\u5f0f\u95ee\u9898\n    printf(\"%d\",a[0]);\n    for(int i = 1;i <= n - 1;i++){\n        printf(\" %d\",a[i]);\n    }\n}<\/code><\/pre>\n\n\n\n
6-5 fibonacci\u6570\u5217<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5c31\u662f\u6309\u9898\u76ee\u610f\u601d\u5904\u7406\u5373\u53ef\uff0c\u8bb0\u5f97\u5148\u8d4b\u521d\u503c\uff0c\u7136\u540e\u5c31\u53ef\u4ee5\u8fdb\u884c\u9012\u63a8\u4e86\uff0c\u7136\u540e\u628a\u524d12\u4e2a\u6570\u5b57\u90fd\u8ba1\u7b97\u51fa\u6765\u4e4b\u540e\uff0c\u6ce8\u610f\u6309\u683c\u5f0f\u8f93\u51fa~<\/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[100];\n    a[0] = 1,a[1] = 1;\n    for(int i = 2;i < 12;i++){\n        a[i] = a[i - 1] + a[i - 2];\n    }\n        \n    for(int i = 0,j = 1;i < 12;i++,j++){\n        printf(\"%6d\",a[i]);\n        if(j % 3 == 0){\n            printf(\"\\n\");\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
6-6 \u6570\u7ec4\u4e2d\u63d2\u5165\u4e00\u4e2a\u6570<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u7b14\u8005\u53d1\u73b0\u81ea\u5df1\u5927\u4e00\u7684\u65f6\u5019\u5c45\u7136\u771f\u7684\u53bb\u6a21\u62df\u4e86\u4e00\u904d\u63d2\u5165\u7684\u8fc7\u7a0bhhh<\/p>\n\n\n\n
\u5176\u5b9e\u8fd9\u9053\u9898\u6211\u4eec\u5c31\u5224\u65ad\uff0c\u8f93\u5165\u7684\u8fd9\u4e2a\u6570\u5b57\uff0c\u5047\u8bbe\u63d2\u5165\u7b2c i \u4e2a\u4f4d\u7f6e\uff0c\u90a3\u4e48\u662f\u5426\u7b2c i – 1\u4e2a\u6570\u5b57\u662f\u5c0f\u4e8e\u7b49\u4e8e\u5b83\u7684\uff0c\u7b2c i + 1\u4e2a\u6570\u5b57\u662f\u5927\u4e8e\u7b49\u4e8e\u5b83\u7684\uff0c\u5982\u679c\u6ee1\u8db3\uff0c\u5c31\u8f93\u51fa\u51fa\u6765\u5373\u53ef\u3002\u3010\u6ce8\u610f\u53ea\u80fd\u8f93\u51fa\u4e00\u6b21\uff0c\u800c\u4e14\u6700\u524d\u9762\u548c\u6700\u540e\u9762\u7684\u60c5\u51b5\u9700\u8981\u7279\u6b8a\u8003\u8651\u3011<\/p>\n\n\n\n
\u6b64\u5916\uff0c\u8bfb\u8005\u4e5f\u53ef\u4ee5\u590d\u4e60\u521a\u521a\u7684\u6392\u5e8f\uff0c\u5373\u628a\u6570\u5b57\u653e\u8fdb\u53bb\uff0c\u7136\u540e\u518d\u5168\u90e8\u6392\u5e8f\u4e00\u6b21\uff0c\u8fd9\u4e2a\u5199\u6cd5\u4e5f\u662f\u53ef\u4ee5\u7684~<\/p>\n\n\n\n
\u7531\u6b64\u4fbf\u53ef\u4ee5\u6709\u4e09\u79cd\u5199\u6cd5\u5566~\u8bfb\u8005\u81ea\u884c\u601d\u8003\uff01<\/p>\n\n\n\n
\u4e0b\u9762\u7ed9\u51fa\u7684\u5c31\u662f\u76f4\u63a5\u8f93\u51fa\u7684\u505a\u6cd5\uff01<\/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[12] = {1, 2, 4, 6, 8, 9, 12, 15, 149, 156};\n    int n;\n    scanf(\"%d\",&n);\n    \/\/ \u6700\u524d\u9762\u7684\u60c5\u51b5\n    if(n < a[0]){\n        printf(\"%5d\",n);\n        for(int i = 0;i < 10;i++){\n            printf(\"%5d\",a[i]);\n        }\n    }else if(n > a[9]){ \/\/ \u6700\u540e\u9762\u7684\u60c5\u51b5\n        for(int i = 0;i < 10;i++){\n            printf(\"%5d\",a[i]);\n        }\n        printf(\"%5d\",n);\n    }else{\n        \/\/ \u7528flag\u8868\u793a\u662f\u5426\u5df2\u7ecf\u8f93\u51fa\n        int flag = 1;\n        printf(\"%5d\",a[0]);\n        for(int i = 1;i < 10;i++){\n            if(flag == 1 && n >= a[i - 1] && n <= a[i]){\n                printf(\"%5d\",n);\n                flag = 0;\n            }\n            printf(\"%5d\",a[i]);\n        }\n    }\n    \n}<\/code><\/pre>\n\n\n\n
6-7 \u6570\u7ec4\u5143\u7d20\u7684\u5220\u9664<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6211\u4eec\u5c31\u6309\u7167\u9898\u76ee\u7684\u8981\u6c42\u6765\u8fdb\u884c\u5220\u9664\uff0c\u4e5f\u5c31\u662f\u6bcf\u6b21\u628a\u8981\u5220\u9664\u7684\u6570\u5b57\u7684\u540e\u9762\u6240\u6709\u6570\u5b57\u90fd\u5411\u524d\u5e73\u79fb\u3002<\/p>\n\n\n\n
\u5177\u4f53\u770b\u4ee3\u7801\u5b9e\u73b0~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\nint main(){\n    int n;\n    int a[102];\n    int cnt = 0; \/\/ \u8bb0\u5f55\u6570\u7ec4\u957f\u5ea6\n    scanf(\"%d\",&n);\n    cnt = n;\n    for(int i = 1;i <= n;i++){\n        scanf(\"%d\",&a[i]);\n    }\n    int k;\n    int index; \/\/ \u8bb0\u5f55\u8981\u88ab\u5220\u9664\u7684\u6570\u5b57\u7684\u4e0b\u6807\n    scanf(\"%d\",&k);\n    while(k--){\n        cnt--;\n        scanf(\"%d\",&index);\n        for(int i = index;i <= n - 1;i++){\n            a[i] = a[i + 1];\n        }\n    }\n    printf(\"%d\",a[1]);\n    for(int i = 2;i <= cnt;i++){\n        printf(\" %d\",a[i]);\n    }\n}<\/code><\/pre>\n\n\n\n
6-8 \u67e5\u627e\u6ee1\u8db3\u6761\u4ef6\u7684\u6240\u6709\u6574\u6570<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6211\u4eec\u7684\u601d\u8def\u5c31\u662f\uff0c\u628a\u6570\u7ec4a\u4e2d\u7684\u6bcf\u4e2a\u6570\u5b57\u90fd\u4e0e\u8981\u627e\u7684\u6570\u5b57x\u8fdb\u884c\u6bd4\u8f83\uff0c\u7136\u540e\u5982\u679c\u662f\uff0c\u6211\u4eec\u5c31\u8f93\u51fa\u3002<\/p>\n\n\n\n
\u6211\u4eec\u53ef\u4ee5\u7528\u4e00\u4e2a\u53d8\u91cf\u8bb0\u5f55\u6211\u4eec\u662f\u5426\u5df2\u7ecf\u8f93\u51fa\u8fc7\u6570\u5b57\u3010\u5373\u662f\u5426\u5df2\u7ecf\u627e\u5230\u4e86\u3011\uff0c\u5982\u679c\u6700\u540e\u6ca1\u627e\u5230\uff0c\u5c31\u8f93\u51fa\u201cNot Found\u201d\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 n,x;\n    scanf(\"%d %d\",&n,&x);\n    int a[12];\n    int flag = 1;\n    for(int i = 1;i <= n;i++){\n        scanf(\"%d\",&a[i]);\n        if(a[i] == x){\n            printf(\"%d\\n\",i - 1);\n            flag = 0;\n        }\n    }\n    if(flag){\n        printf(\"Not Found\\n\");\n    }\n}<\/code><\/pre>\n\n\n\n
6-9 \u6c42\u77e9\u9635\u5404\u884c\u5143\u7d20\u4e4b\u548c<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6211\u4eec\u5c31\u6a21\u62df\u9898\u76ee\u7684\u610f\u601d\uff0c\u5373\u6709m\u884c\uff0c\u6bcf\u884c\u6709n\u4e2a\u8bfb\u5165\uff0c\u6211\u4eec\u7528\u4e00\u4e2a\u53d8\u91cf\u8bb0\u5f55\u6bcf\u4e00\u884c\u7684\u548c\u5373\u53ef\u3002<\/p>\n\n\n\n
\u5982\u679c\u8bfb\u8005\u60f3\u8981\u7528\u4e8c\u7ef4\u6570\u7ec4\u53bb\u5b58\u50a8\uff0c\u7136\u540e\u518d\u904d\u5386\u4e5f\u662f\u53ef\u4ee5\u7684\uff0c\u4f46\u662f\u7b14\u8005\u8fd9\u91cc\u4e3a\u4e86\u51cf\u5c11\u4ee3\u7801\u91cf\uff0c\u5c31\u91c7\u53d6\u4e86\u4e0b\u9762\u7684\u5199\u6cd5~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\nint main(){\n    int m,n;\n    scanf(\"%d %d\",&m,&n);\n    for(int i = 1;i <= m;i++){\n        int sum = 0; \/\/ \u8bb0\u5f55\u6bcf\u4e00\u884c\u7684\u548c\n        for(int i = 1;i <= n;i++){\n            int temp = 0; \/\/ \u4e34\u65f6\u5b58\u50a8\u6bcf\u4e00\u4e2a\u53d8\u91cf\n            scanf(\"%d\",&temp);\n            sum += temp;\n        }\n        printf(\"%d\\n\",sum);\n    }\n}<\/code><\/pre>\n\n\n\n
6-10 \u627e\u978d\u70b9<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u53ef\u80fd\u5bf9\u4e8e\u521d\u5b66\u8005\u6765\u8bf4\u6709\u70b9\u96be\u5ea6\uff0c\u8981\u600e\u4e48\u5224\u65ad\u8fd9\u4e2a\u6570\u5b57\u662f\u884c\u6700\u5927\u4e14\u5217\u6700\u5c0f\u7684\u5462\uff1f<\/p>\n\n\n\n
\u8fd9\u91cc\u63a8\u8350\u91c7\u53d6\u7b14\u8005\u7684\u5199\u6cd5\uff0c\u6bd4\u8f83\u6613\u4e8e\u7406\u89e3\u3010\u76f8\u8f83\u4e8e\u5176\u4ed6\u9898\u89e3\u3011<\/p>\n\n\n\n
\u7b14\u8005\u7684\u601d\u8def\u5c31\u662f\uff0c\u6211\u4eec\u5148\u5047\u8bbe\u6bcf\u4e2a\u70b9\u90fd\u662f\u978d\u70b9\uff0c\u6240\u4ee5\u6211\u4eec\u5c31\u628a\u6bcf\u4e2a\u6570\u5b57\u90fd\u904d\u5386\u4e00\u904d\uff0c\u6bcf\u4e2a\u6570\u5b57\u88ab\u904d\u5386\u5230\u7684\u65f6\u5019\uff0c\u5c31\u53bb\u8fd9\u4e00\u884c\u5224\u65ad\u662f\u4e0d\u662f\u6700\u5927\u7684\uff0c\u518d\u53bb\u8fd9\u4e00\u5217\u5224\u65ad\u662f\u4e0d\u662f\u6700\u5c0f\u7684\uff0c\u5982\u679c\u4e24\u4e2a\u6761\u4ef6\u90fd\u6ee1\u8db3\uff0c\u6211\u4eec\u5c31\u8f93\u51fa\u7ed3\u679c\u3002<\/p>\n\n\n\n
\u5982\u679c\u6211\u4eec\u5168\u7a0b\u6ca1\u53d1\u73b0\u978d\u70b9\uff0c\u5c31\u8f93\u51faNONE\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[8][8];\n    int n;\n    scanf(\"%d\",&n);\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= n;j++){\n            scanf(\"%d\",&a[i][j]);\n        }\n    }\n    int flag = 1; \/\/ \u8bb0\u5f55\u662f\u5426\u5b58\u5728\u978d\u70b9\uff0c\u9ed8\u8ba4\u4e0d\u5b58\u5728\u978d\u70b9\u4e3a1\n    for(int i = 1;i <= n;i++){\n        for(int j = 1;j <= n;j++){\n            \/\/ \u8fd9\u4e2a\u65f6\u5019\u5224\u65ad\u8fd9\u4e2a\u6570\u5b57\u662f\u4e0d\u662f\u8fd9\u4e00\u884c\u6700\u5927\u7684\n            int flag1 = 1; \/\/ \u5982\u679c\u662f\u6700\u5927\u7684\u5c31\u662f1\uff0c\u5982\u679c\u4e0d\u662f\u5c31\u662f0\uff0c\u6211\u4eec\u5047\u8bbe\u8fd9\u4e2a\u6570\u5b57\u5c31\u662f\u884c\u6700\u5927\u7684\n            int maxx = a[i][j]; \/\/ \u5047\u8bbe\u662f\u6700\u5927\u7684\n            for(int k = 1;k <= n;k++){\n                if(a[i][k] > maxx){\n                    flag1 = 0;\n                }\n            }\n            \/\/ \u8fd9\u4e2a\u65f6\u5019\u5224\u65ad\u8fd9\u4e2a\u6570\u5b57\u662f\u4e0d\u662f\u8fd9\u4e00\u5217\u6700\u5c0f\u7684\n            int flag2 = 1; \/\/ \u5982\u679c\u662f\u6700\u5927\u7684\u5c31\u662f1\uff0c\u5982\u679c\u4e0d\u662f\u5c31\u662f0\uff0c\u6211\u4eec\u5047\u8bbe\u8fd9\u4e2a\u6570\u5b57\u5c31\u662f\u5217\u6700\u5c0f\u7684\n            int minn = a[i][j]; \/\/ \u5047\u8bbe\u662f\u6700\u5c0f\u7684\n            for(int k = 1;k <= n;k++){\n                if(a[k][j] < minn){\n                    flag2 = 0;\n                }\n            }\n\n            if(flag1 && flag2){\n                flag = 0;\n                printf(\"%d %d\",i - 1,j - 1);\n            }\n        }\n    }\n    if(flag){\n        printf(\"NONE\");\n    }\n}<\/code><\/pre>\n\n\n\n
6-11 \u7edf\u8ba1\u4e00\u884c\u6587\u672c\u7684\u5355\u8bcd\u4e2a\u6570<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u6211\u4eec\u5c31\u5224\u65ad\u5355\u8bcd+\u7a7a\u683c\u60c5\u51b5\u5373\u53ef\uff0c\u5bf9\u4e8e\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\uff0c\u6211\u4eec\u5c31\u7279\u522b\u5224\u65ad\u4e00\u4e0b~<\/p>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u5b9e\u73b0\u65b9\u5f0f\u5e94\u8be5\u6709\u5176\u4ed6\u7684\uff0c\u7b14\u8005\u76f4\u63a5\u653e\u81ea\u5df1\u5927\u4e00\u65f6\u5019\u7684\u4ee3\u7801\u4e86~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\nint main(){\n    char a[1000]; \/\/ \u7528\u6765\u653e\u5b57\u7b26\u4e32 \n    fgets(a,sizeof(a),stdin); \/\/ \u8bfb\u5165\u4e00\u6574\u884c\n    int len,i;\n\tint num = 0;\n    for(i = 0;a[i] != '\\0';i++); \/\/ \u5faa\u73af\u5230\u8f93\u5165\u7ec8\u6b62 \n\n    len = i; \/\/ \u8bb0\u5f55\u8f93\u5165\u7684\u603b\u957f\u5ea6 \n    \t\n    for (i = 0;i < len;i++){\n        if (a[i] != ' ' && a[i+1] == ' ') num++; \/\/ \u9632\u6b62\u8fde\u7eed\u7a7a\u683c \n        if (a[i] != ' ' && a[i+1] == '\\0') num++; \/\/ \u9632\u6b62\u7ed3\u5c3e\u7a7a\u683c \n    }\n    printf(\"%d\",num);\n}<\/code><\/pre>\n\n\n\n
7-1 \u8fd1\u4f3c\u6c42PI<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5c31\u662f\u6309\u7167\u9898\u76ee\u7ed9\u7684\u516c\u5f0f\u6765\uff0c\u6211\u4eec\u5f88\u5bb9\u6613\u53d1\u73b0\uff0c\u7b2c i \u9879\u5f0f\u5b50\u7684\u7ed3\u679c\u5c31\u662f\u7b2c i – 1\u9879\u7684\u7ed3\u679c\u4e58\u4ee5 i \/\uff082 * i + 1\uff09\uff0c\u6240\u4ee5\u6211\u4eec\u4fbf\u53ef\u4ee5\u63a8\u51fa\u8fd9\u9053\u9898\u7684\u5199\u6cd5~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\ndouble cal(double eps){\n    double pi = 1,n = 1;\n    for(int i = 1;eps <= n;i++){\n        n = n * i \/ (2 * i + 1);\n        pi = pi + n;\n    }\n    return 2 * pi;\n}\n\nint main(){\n    double eps;\n    scanf(\"%le\",&eps);\n    printf(\"PI = %.5lf\",cal(eps));\n}<\/code><\/pre>\n\n\n\n
7-2 \u5224\u65ad\u7d20\u6570<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u5224\u65ad\u7d20\u6570\u7684\u9898\u76ee\u5f88\u7ecf\u5178~<\/p>\n\n\n\n
\u4ee3\u7801\u4e00\u5b9a\u8981\u4f1a\u5199\u54e6\uff01\u6211\u4eec\u5c31\u5bf9\u4e8e\u6bcf\u4e2a\u6570\u5b57\uff0c\u90fd\u4ece2~sqrt(n)\u4e2d\u5224\u65ad\u662f\u5426\u53ef\u4ee5\u6574\u9664\uff0c\u5982\u679c\u53ef\u4ee5\u8bf4\u660e\u4e0d\u662f\u7d20\u6570\uff0c\u5426\u5219\u5c31\u662f\u7d20\u6570\u3002<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<math.h>\nint judge(int n){\n    int flag = 1;\n    if(n == 0) return 0;\n    if(n == 1) return 0;\n    if(n == 1) return 1;\n    for(int i = 2;i <= sqrt(n);i++){\n        if(n % i == 0){\n            flag = 0;\n            break;\n        }\n    }\n    return flag;\n}\n\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    while(n--){\n        int a;\n        scanf(\"%d\",&a);\n        if(judge(a)){\n            printf(\"Yes\\n\");\n        }else{\n            printf(\"No\\n\");\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
7-3 \u5224\u65ad\u6570\u5b57\u5b57\u7b26<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u592a\u7b80\u5355\uff0c\u4e0d\u8bb2\u89e3~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<math.h>\nint judge(char ch){\n    if(ch >= '0' && ch <= '9'){\n        return 1;\n    }\n    return 0;\n}\n\nint main(){\n    char c;\n    scanf(\"%c\",&c);\n    if(judge(c)){\n        printf(\"yes\");\n    }else{\n        printf(\"no\");\n    }\n}<\/code><\/pre>\n\n\n\n
7-4 \u6c49\u8bfa\u5854\u95ee\u9898<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6c49\u8bfa\u5854\u95ee\u9898\u4e5f\u975e\u5e38\u7684\u7ecf\u5178~<\/p>\n\n\n\n
\u7b14\u8005\u8fd9\u91cc\u4e5f\u6ca1\u529e\u6cd5\u8bb2\u6e05\u695a\u8fd9\u4e2a\u7b56\u7565\uff0c\u6240\u4ee5\u63a8\u8350\u8bfb\u8005\u81ea\u884c\u67e5\u8be2\u5b66\u4e60\uff01<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\nvoid han(int n,char a[],char b[],char c[]){\n\tif (n == 1){\n\t\tprintf(\"%s->%s\\n\",a,c);\n\t}\n\telse{\n\t\than(n - 1,a,c,b); \/\/ \u5c06A\u5ea7\u4e0a\u7684n-1\u4e2a\u76d8\u5b50\u501f\u52a9C\u5ea7\u79fb\u5411B\u5ea7\n\t\tprintf(\"%s->%s\\n\",a,c); \/\/ \u5c06A\u5ea7\u4e0a\u6700\u540e\u4e00\u4e2a\u76d8\u5b50\u79fb\u5411C\u5ea7\n\t\than(n - 1,b,a,c); \/\/ \u5c06B\u5ea7\u4e0a\u7684n-1\u4e2a\u76d8\u5b50\u501f\u52a9A\u5ea7\u79fb\u5411C\u5ea7\n\t} \n}\n\nint main(){\n    int n;\n    char a[100],b[100],c[100];\n    scanf(\"%d %s %s %s\",&n,a,b,c);\n    han(n,a,b,c);\n}<\/code><\/pre>\n\n\n\n
7-5 \u8ba1\u7b97\u51fd\u6570P(n,x)<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u5c31\u662f\u6ce8\u610f\u7cbe\u5ea6\u4e0e\u683c\u5f0f~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\ndouble p(int n,double x){\n    if(n == 0)\n        return 1;\n    if(n == 1)\n        return x;\n    if(n > 1)\n        return ((2 * n - 1) * p(n - 1,x) - (n - 1) * p(n - 2,x)) \/ n;\n}\n\nint main(){\n    int n;\n    double x;\n    int rep;\n    scanf(\"%d\",&rep);\n    for(int i = 0;i < rep;i++){\n        scanf(\"%d %lf\",&n,&x);\n        printf(\"p(%d,%.2lf)=%.2lf\\n\",n,x,p(n,x));\n    }\n}<\/code><\/pre>\n\n\n\n
8-1 \u8f93\u51fa\u5b66\u751f\u6210\u7ee9<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u8fd9\u9053\u9898\u4e5f\u662f\u6309\u7167\u9898\u610f\u5373\u53ef\uff0c\u628a\u6210\u7ee9\u5b58\u50a8\u8d77\u6765\uff0c\u8ba1\u7b97\u5e73\u5747\u503c\u3001\u8bb0\u5f55\u6700\u5927\u3001\u6700\u5c0f\u503c\u5373\u53ef\uff01<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<cstdlib>\nint main(){\n    int n;\n    double *s;\n    double sum = 0,ave = 0,maxx = 0,minn = 0;\n    scanf(\"%d\",&n);\n    s = (double*)malloc(sizeof(double)*n);\n    for(int i = 0;i < n;i++){\n        scanf(\"%lf\",s + i);\n    }\n    maxx = minn = s[0];\n    for(int i = 0;i < n;i++){\n        sum = sum + s[i]; \n        if (s[i] < minn)\n            minn = s[i];\n        if (s[i] > maxx)\n            maxx = s[i];\n    }\n    ave = sum \/ n;\n    printf(\"average  =  %.2lf\\nmaxx  =  %.2lf\\nminn  =  %.2lf\",ave,maxx,minn);\n}<\/code><\/pre>\n\n\n\n
8-2 \u7ec4\u7ec7\u661f\u671f\u4fe1\u606f<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u6309\u9898\u610f\u6a21\u62df~<\/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 repeat;\n    char *a[7] = {\"Sunday\",\"Monday\",\"Tuesday\",\"Wednesday\",\"Thursday\",\"Friday\",\"Saturday\"};\n    char str[100][100];\n    scanf(\"%d\",&repeat);\n    for(int i = 1;i <= repeat;i++){\n        scanf(\"%s\",str[i]);\n    }\n    for(int i = 1;i <= repeat;i++){\n        int index = 0;\n        for(int j = 0;j < 7;j++){    \n            if(strcmp(str[i],a[j]) == 0){\n                index = j + 1; \/\/ c\u5b58\u50a8\u904d\u5386\u7684\u4e0b\u6807\n            }\n        }\n        if(index != 0){\n            printf(\"%d\\n\",index);\n        }else{\n            printf(\"-1\\n\");\n        }\n    }\n}<\/code><\/pre>\n\n\n\n
9-1 \u67e5\u627e\u4e66\u7c4d<\/h2>\n\n\n\n
\u601d\u8def\uff1a<\/h3>\n\n\n\n
\n
\u7ed3\u6784\u4f53\u7684\u8fd0\u7528~<\/p>\n\n\n\n
\u8fd9\u9053\u9898\u5c31\u662f\u7528\u7ed3\u6784\u4f53\u5904\u7406\uff0c\u7136\u540e\u627e\u6700\u5927\u6700\u5c0f\u7684\u5373\u53ef\u3002<\/p>\n\n\n\n
\u6ce8\u610f\u6570\u7ec4\u5927\u5c0f\uff0c\u53ef\u4ee5\u9002\u5f53\u5f00\u5927\u4e00\u70b9~<\/p>\n<\/blockquote>\n\n\n\n
\u4ee3\u7801C\u8bed\u8a00\uff1a<\/h3>\n\n\n\n
#include<stdio.h>\n#include<string.h>\nstruct book{\n    char name[32];\n    double price;\n}book[100];\n\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    getchar();\n\n    int index = 1;\n    double price;\n\n    for(int i = 1;i <= n;i++){\n        fgets(book[i].name,sizeof(book[i].name),stdin);\n        scanf(\"%lf\",&book[i].price);\n        getchar();\n    }\n\n    price = book[1].price;\n\n    for(int i = 1;i <= n;i++){\n        if(book[i].price > price){\n            index = i;\n        }\n    }\n    printf(\"%.2lf, %s\",book[index].price,book[index].name);\n\n    price = book[1].price;\n\n    for(int i = 1;i <= n;i++){\n        if(book[i].price < price){\n            index = i;\n        }\n    }\n    printf(\"%.2lf, %s\",book[index].price,book[index].name);\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u8fd9\u91cc\u662f\u5927\u4e00\u5165\u5b66\u7684\u4e00\u95e8\u5fc5\u4fee\uff0c\u4f1a\u5b9e\u73b0\u6700\u6700\u57fa\u7840\u7684C\u8bed\u8a00\u5185\u5bb9\u3002 \u524d\u8a00 6-1 \u6c42\u6700\u5927\u503c\u53ca\u5176\u4e0b\u6807 \u601d\u8def\uff1a \u8fd9\u662f\u4e00\u4e2a\u601d\u7ef4\u65b9 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[20],"tags":[],"class_list":["post-352","post","type-post","status-publish","format-standard","hentry","category-c"],"_links":{"self":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/352","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=352"}],"version-history":[{"count":18,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/352\/revisions"}],"predecessor-version":[{"id":375,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/posts\/352\/revisions\/375"}],"wp:attachment":[{"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/media?parent=352"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/categories?post=352"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.nenuacm.top\/index.php\/wp-json\/wp\/v2\/tags?post=352"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}