{"id":36110,"date":"2025-05-07T15:52:24","date_gmt":"2025-05-07T07:52:24","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/36110.html"},"modified":"2025-05-07T15:52:24","modified_gmt":"2025-05-07T07:52:24","slug":"%e8%93%9d%e6%a1%a5%e6%9d%af%e5%88%b7%e9%a2%98-%e7%ac%ac%e5%8d%81%e4%ba%94%e5%b1%8a%e8%93%9d%e6%a1%a5%e6%9d%af%e5%a4%a7%e8%b5%9b%e8%bd%af%e4%bb%b6%e8%b5%9b%e7%9c%81%e8%b5%9bc-c","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/36110.html","title":{"rendered":"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4"},"content":{"rendered":"

\u4e00\u30010\u63e1\u624b\u95ee\u9898 – \u84dd\u6865\u4e91\u8bfe<\/h2>\n

\"\"<\/p>\n

\u7b97\u6cd5\u4ee3\u7801：<\/h3>\n

#include <iostream>
\nusing namespace std;
\nint main()
\n{
\n int sum=0;
\n for(int i=49;i>=7;i–)
\n sum+=i;
\n cout<<sum<<endl;
\n return 0;
\n} <\/p>\n

\u76f4\u63a5\u66b4\u529b，\u9898\u610f\u5f88\u6e05\u6670，\u7d2f\u52a0\u5373\u53ef\u3002\u00a0<\/p>\n<\/p>\n

\u4e8c\u30010\u5c0f\u7403\u53cd\u5f39 – \u84dd\u6865\u4e91\u8bfe<\/h2>\n

\"\"<\/p>\n

\"\"<\/p>\n

\u7b97\u6cd5\u4ee3\u7801：\u00a0<\/h3>\n

#include<iostream> \/\/ \u5f15\u5165\u8f93\u5165\u8f93\u51fa\u6d41\u5e93，\u7528\u4e8e\u6807\u51c6\u8f93\u5165\u8f93\u51fa\u64cd\u4f5c
\n#include<iomanip> \/\/ \u5f15\u5165\u8f93\u5165\u8f93\u51fa\u64cd\u7eb5\u5e93，\u7528\u4e8e\u683c\u5f0f\u5316\u8f93\u51fa（\u5982\u8bbe\u7f6e\u5c0f\u6570\u70b9\u7cbe\u5ea6）
\n#include<cmath> \/\/ \u5f15\u5165\u6570\u5b66\u51fd\u6570\u5e93，\u7528\u4e8e\u6570\u5b66\u8fd0\u7b97（\u5982\u5e73\u65b9\u6839）<\/p>\n

using namespace std; \/\/ \u4f7f\u7528\u6807\u51c6\u547d\u540d\u7a7a\u95f4，\u907f\u514d\u6bcf\u6b21\u8c03\u7528\u6807\u51c6\u5e93\u51fd\u6570\u65f6\u90fd\u8981\u52a0std::<\/p>\n

\/\/ \u5b9a\u4e49\u4e00\u4e2a\u51fd\u6570check，\u7528\u4e8e\u68c0\u67e5\u4e24\u4e2a\u6574\u6570a\u548cb\u662f\u5426\u6ee1\u8db3\u7279\u5b9a\u6761\u4ef6
\nbool check(int a, int b) {
\n \/\/ \u5982\u679ca\u80fd\u88abb\u6574\u9664，\u5e76\u4e14a\u9664\u4ee5b\u7684\u7ed3\u679c\u662f\u5076\u6570，\u5219\u8fd4\u56detrue
\n if (a % b == 0 && (a \/ b) % 2 == 0) return true;
\n return false; \/\/ \u5426\u5219\u8fd4\u56defalse
\n}<\/p>\n

\/\/ \u4e3b\u51fd\u6570
\nint main() {
\n long long x = 343720, y = 233333; \/\/ \u5b9a\u4e49\u4e24\u4e2a\u957f\u6574\u578b\u53d8\u91cfx\u548cy，\u5e76\u8d4b\u4e88\u521d\u59cb\u503c
\n long long t = 1; \/\/ \u5b9a\u4e49\u957f\u6574\u578b\u53d8\u91cft，\u5e76\u521d\u59cb\u5316\u4e3a1
\n long long lx, ly; \/\/ \u5b9a\u4e49\u4e24\u4e2a\u957f\u6574\u578b\u53d8\u91cflx\u548cly，\u7528\u4e8e\u5b58\u50a8\u8ba1\u7b97\u8fc7\u7a0b\u4e2d\u7684\u4e34\u65f6\u503c<\/p>\n

\/\/ \u8fdb\u5165\u4e00\u4e2a\u65e0\u9650\u5faa\u73af，\u76f4\u5230\u6ee1\u8db3\u7279\u5b9a\u6761\u4ef6\u65f6\u8df3\u51fa\u5faa\u73af
\n while (1) {
\n lx = 15 * t; \/\/ \u8ba1\u7b97lx\u4e3a15\u4e58\u4ee5t
\n ly = 17 * t; \/\/ \u8ba1\u7b97ly\u4e3a17\u4e58\u4ee5t<\/p>\n

\/\/ \u5982\u679clx\u548cx\u6ee1\u8db3check\u51fd\u6570\u7684\u6761\u4ef6，\u4e14ly\u548cy\u4e5f\u6ee1\u8db3check\u51fd\u6570\u7684\u6761\u4ef6，\u5219\u8df3\u51fa\u5faa\u73af
\n if (check(lx, x) && check(ly, y)) break;<\/p>\n

t++; \/\/ \u5426\u5219，t\u81ea\u589e1，\u7ee7\u7eed\u5faa\u73af
\n }<\/p>\n

\/\/ \u8f93\u51falx\u548cly\u7684\u5e73\u65b9\u548c\u7684\u5e73\u65b9\u6839，\u4fdd\u7559\u4e24\u4f4d\u5c0f\u6570
\n cout << setprecision(2) << fixed << sqrt(lx * lx + ly * ly);<\/p>\n

return 0; \/\/ \u7a0b\u5e8f\u6b63\u5e38\u7ed3\u675f，\u8fd4\u56de0
\n} <\/p>\n

\u95ee\u9898\u80cc\u666f<\/h3>\n
  • \n

    \u5c0f\u7403\u8fd0\u52a8：<\/h4>\n
      \n
    • \n

      \u5c0f\u7403\u5728\u957f\u65b9\u5f62\u5185\u4ee5\u56fa\u5b9a\u7684\u901f\u5ea6\u6bd4\u00a0dx:dy=15:17\u8fd0\u52a8\u3002<\/p>\n<\/li>\n

    • \n

      \u5f53\u5c0f\u7403\u78b0\u5230\u957f\u65b9\u5f62\u7684\u8fb9\u6846\u65f6，\u4f1a\u53d1\u751f\u53cd\u5f39（\u5165\u5c04\u89d2\u7b49\u4e8e\u53cd\u5c04\u89d2）\u3002<\/p>\n<\/li>\n

    • \n

      \u6211\u4eec\u9700\u8981\u8ba1\u7b97\u5c0f\u7403\u7b2c\u4e00\u6b21\u56de\u5230\u8d77\u70b9\u65f6\u6240\u7ecf\u8fc7\u7684\u603b\u8def\u5f84\u957f\u5ea6\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

    • \n

      \u53cd\u5f39\u7684\u7b49\u6548\u8def\u5f84：<\/h4>\n
        \n
      • \n

        \u53cd\u5f39\u95ee\u9898\u53ef\u4ee5\u901a\u8fc7\u201c\u955c\u50cf\u53cd\u5c04\u6cd5\u201d\u7b80\u5316\u3002\u5c06\u957f\u65b9\u5f62\u65e0\u9650\u590d\u5236，\u5f62\u6210\u4e00\u4e2a\u7f51\u683c，\u5c0f\u7403\u7684\u8def\u5f84\u53ef\u4ee5\u770b\u4f5c\u4e00\u6761\u76f4\u7ebf\u7a7f\u8fc7\u8fd9\u4e9b\u955c\u50cf\u957f\u65b9\u5f62\u3002<\/p>\n<\/li>\n

      • \n

        \u5c0f\u7403\u7b2c\u4e00\u6b21\u56de\u5230\u8d77\u70b9，\u7b49\u4ef7\u4e8e\u8fd9\u6761\u76f4\u7ebf\u7b2c\u4e00\u6b21\u7a7f\u8fc7\u4e00\u4e2a\u955c\u50cf\u957f\u65b9\u5f62\u7684\u5de6\u4e0a\u89d2\u9876\u70b9\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

        \n

        \u6570\u5b66\u5206\u6790<\/h3>\n
      • \n

        \u8def\u5f84\u6761\u4ef6：<\/h4>\n
          \n
        • \n

          \u5c0f\u7403\u5728\u6c34\u5e73\u65b9\u5411（\u957f）\u79fb\u52a8\u7684\u603b\u8ddd\u79bb\u5fc5\u987b\u662f\u957f\u65b9\u5f62\u957f\u5ea6\u00a0x=343720\u00a0\u7684\u5076\u6570\u500d\u3002\u8fd9\u662f\u56e0\u4e3a\u6bcf\u6b21\u53cd\u5f39\u90fd\u4f1a\u6539\u53d8\u65b9\u5411，\u53ea\u6709\u5076\u6570\u500d\u624d\u80fd\u8ba9\u5c0f\u7403\u56de\u5230\u8d77\u70b9\u7684\u6c34\u5e73\u4f4d\u7f6e\u3002<\/p>\n<\/li>\n

        • \n

          \u540c\u7406，\u5c0f\u7403\u5728\u5782\u76f4\u65b9\u5411（\u5bbd）\u79fb\u52a8\u7684\u603b\u8ddd\u79bb\u5fc5\u987b\u662f\u957f\u65b9\u5f62\u5bbd\u5ea6\u00a0y=233333 \u7684\u5076\u6570\u500d\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

        • \n

          \u516c\u5f0f\u63a8\u5bfc：<\/h4>\n
            \n
          • \n

            \u5c0f\u7403\u5728\u6c34\u5e73\u65b9\u5411\u7684\u79fb\u52a8\u8ddd\u79bb\u4e3a\u00a0lx=15t\u3002<\/p>\n<\/li>\n

          • \n

            \u5c0f\u7403\u5728\u5782\u76f4\u65b9\u5411\u7684\u79fb\u52a8\u8ddd\u79bb\u4e3a\u00a0ly=17t\u3002<\/p>\n<\/li>\n

          • \n

            \u4e3a\u4e86\u6ee1\u8db3\u56de\u5230\u8d77\u70b9\u7684\u6761\u4ef6，\u5fc5\u987b\u540c\u65f6\u6ee1\u8db3：<\/p>\n

            lx=15t=2k\u22c5x（\u6c34\u5e73\u65b9\u5411）ly=17t=2m\u22c5y（\u5782\u76f4\u65b9\u5411） <\/p>\n

            \u5176\u4e2d\u00a0k\u00a0\u548c\u00a0m\u00a0\u662f\u6b63\u6574\u6570\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

          • \n

            \u7b80\u5316\u6761\u4ef6：<\/h4>\n
              \n
            • \n

              \u6211\u4eec\u9700\u8981\u627e\u5230\u6700\u5c0f\u7684\u00a0t，\u4f7f\u5f97\u00a015t \u662f\u00a0x\u00a0\u7684\u5076\u6570\u500d，\u4e14\u00a017t\u662f\u00a0y\u7684\u5076\u6570\u500d\u3002<\/p>\n<\/li>\n

            • \n

              \u8fd9\u7b49\u4ef7\u4e8e：<\/p>\n

              \"\"<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

              \"\"<\/p>\n

              setprecision(2)\u00a0\u662f C++ \u6807\u51c6\u5e93\u00a0<iomanip>\u00a0\u4e2d\u7684\u4e00\u4e2a\u64cd\u7eb5\u7b26，\u7528\u4e8e\u8bbe\u7f6e\u6d6e\u70b9\u6570\u8f93\u51fa\u7684\u7cbe\u5ea6\u3002\u5177\u4f53\u6765\u8bf4，\u5b83\u63a7\u5236\u8f93\u51fa\u6d41\u4e2d\u6d6e\u70b9\u6570\u7684\u5c0f\u6570\u70b9\u540e\u7684\u4f4d\u6570\u3002<\/p>\n

              \u8be6\u7ec6\u89e3\u91ca<\/h3>\n
                \n
              • \n

                setprecision(n)：\u8bbe\u7f6e\u6d6e\u70b9\u6570\u8f93\u51fa\u7684\u5c0f\u6570\u70b9\u540e\u7684\u4f4d\u6570\u4e3a\u00a0n\u3002\u4f8b\u5982，setprecision(2)\u00a0\u8868\u793a\u8f93\u51fa\u6d6e\u70b9\u6570\u65f6\u4fdd\u7559\u4e24\u4f4d\u5c0f\u6570\u3002<\/p>\n<\/li>\n

              • \n

                fixed：\u4e0e\u00a0setprecision\u00a0\u7ed3\u5408\u4f7f\u7528，\u8868\u793a\u4f7f\u7528\u56fa\u5b9a\u5c0f\u6570\u683c\u5f0f\u8f93\u51fa\u3002\u8fd9\u610f\u5473\u7740\u5c0f\u6570\u70b9\u540e\u7684\u4f4d\u6570\u662f\u56fa\u5b9a\u7684，\u800c\u4e0d\u662f\u79d1\u5b66\u8ba1\u6570\u6cd5\u3002<\/p>\n<\/li>\n<\/ul>\n

                \u4e09\u30010\u597d\u6570 – \u84dd\u6865\u4e91\u8bfe\u00a0<\/h2>\n

                \"\"<\/p>\n

                \"\"<\/p>\n

                \u7b97\u6cd5\u4ee3\u7801：<\/h3>\n

                #include <stdio.h>
                \nint main()
                \n{
                \n int n, i;
                \n scanf("%d", &n); \/\/ \u8f93\u5165\u4e00\u4e2a\u6574\u6570 n
                \n for (; n > 0; n–) \/\/ \u4ece n \u5f00\u59cb，\u9012\u51cf\u5230 1
                \n {
                \n for (int m = n; m > 0;) \/\/ \u5bf9\u6bcf\u4e2a\u6570\u5b57 m = n，\u68c0\u67e5\u5176\u6bcf\u4e00\u4f4d
                \n {
                \n if (m % 2 != 0) m \/= 10; \/\/ \u5982\u679c\u6700\u4f4e\u4f4d\u662f\u5947\u6570，\u53bb\u6389\u6700\u4f4e\u4f4d
                \n else break; \/\/ \u5982\u679c\u6700\u4f4e\u4f4d\u662f\u5076\u6570，\u9000\u51fa\u5faa\u73af
                \n if (m % 2 == 0) m \/= 10; \/\/ \u5982\u679c\u65b0\u7684\u6700\u4f4e\u4f4d\u662f\u5076\u6570，\u53bb\u6389\u6700\u4f4e\u4f4d
                \n else break; \/\/ \u5982\u679c\u65b0\u7684\u6700\u4f4e\u4f4d\u662f\u5947\u6570，\u9000\u51fa\u5faa\u73af
                \n if (m == 0) i++; \/\/ \u5982\u679c m \u53d8\u4e3a 0，\u8bf4\u660e\u6ee1\u8db3\u6761\u4ef6，\u8ba1\u6570\u5668 i \u589e\u52a0
                \n }
                \n }
                \n printf("%d", i); \/\/ \u8f93\u51fa\u6ee1\u8db3\u6761\u4ef6\u7684\u6570\u5b57\u7684\u6570\u91cf
                \n return 0;
                \n} <\/p>\n

                \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u9898\u610f\u6e05\u6670，\u76f4\u63a5\u4e00\u4e2a\u4e00\u4e2a\u6570\u5730\u5faa\u73af\u9012\u51cf，\u7136\u540e\u6309\u89c4\u5219，\u76f4\u63a5\u5224\u65ad\u5947\u6570\u4f4d\u548c\u5076\u6570\u4f4d\u662f\u4e0d\u662f\u7b26\u5408\u6761\u4ef6\u3002<\/p>\n<\/p>\n

                \u56db\u30010R \u683c\u5f0f – \u84dd\u6865\u4e91\u8bfe<\/h2>\n

                \"\"<\/p>\n

                \"\"<\/p>\n

                \u81ea\u5df1\u5199\u7684：\u7b97\u6cd5\u4ee3\u7801（\u53ea\u80fd\u901a\u8fc750%\u7684\u6d4b\u8bd5\u7528\u4f8b）\u00a0<\/h3>\n

                #include <bits\/stdc++.h>
                \nusing namespace std;
                \ntypedef long long ll;<\/p>\n

                \/\/ \u5feb\u901f\u5e42\u51fd\u6570，\u8ba1\u7b97 2^n
                \nll fastPow(int n) {
                \n ll a = 2; \/\/ \u5e95\u6570\u4e3a 2
                \n ll sum = 1; \/\/ \u521d\u59cb\u5316 sum \u4e3a 1
                \n while (n) {
                \n if (n & 1) {
                \n sum = sum * a; \/\/ \u5982\u679c\u5f53\u524d\u4f4d\u4e3a 1，\u7d2f\u4e58\u5230 sum
                \n }
                \n a = a * a; \/\/ \u5e95\u6570\u5e73\u65b9
                \n n >>= 1; \/\/ \u53f3\u79fb\u4e00\u4f4d
                \n }
                \n return sum;
                \n}<\/p>\n

                int main() {
                \n int n;
                \n double d;
                \n cin >> n >> d; \/\/ \u8f93\u5165 n \u548c d
                \n ll ans = fastPow(n); \/\/ \u8ba1\u7b97 2^n
                \n ll end_format = round(d * ans); \/\/ \u5c06 d \u4e58\u4ee5 2^n \u5e76\u56db\u820d\u4e94\u5165
                \n \/\/round \u51fd\u6570\u7528\u4e8e\u5bf9\u6d6e\u70b9\u6570\u8fdb\u884c\u56db\u820d\u4e94\u5165\u64cd\u4f5c
                \n printf("%lld\\\\n", end_format); \/\/ \u8f93\u51fa\u7ed3\u679c
                \n return 0;
                \n} <\/p>\n

                \u00a0\u7f57\u52c7\u519b\u8001\u5e08\u7684\u51e0\u884c\u4ee3\u7801（50%）（\u9ad8\u4e0b\u7acb\u5224\u4e86\u5c5e\u4e8e\u662f\u54c8\u54c8）\u7b97\u6cd5\u4ee3\u7801：<\/h3>\n

                #include\u00a0<bits\/stdc++.h>
                \nusing\u00a0namespace\u00a0std;
                \nint\u00a0main()
                \n{\u00a0 \u00a0\u00a0
                \n long\u00a0long\u00a0n;\u00a0 \u00a0\u00a0
                \n double\u00a0s;\u00a0 \u00a0
                \n cin>>n>>s;\u00a0 \u00a0\u00a0
                \n long\u00a0long\u00a0 a =\u00a01<<n;\u00a0 \u00a0\u00a0
                \n long\u00a0long\u00a0b= (long\u00a0long)(a*s*1.0+0.5);\/\/\u52a00.5\u56db\u820d\u4e94\u5165\u00a0 \u00a0
                \n cout << b;
                \n} <\/p>\n

                \u9898\u89e3：<\/h3>\n

                #include<bits\/stdc++.h> \/\/ \u5305\u542b\u6240\u6709\u6807\u51c6\u5e93\u5934\u6587\u4ef6
                \nusing namespace std; \/\/ \u4f7f\u7528\u6807\u51c6\u547d\u540d\u7a7a\u95f4<\/p>\n

                int main()
                \n{
                \n int n;
                \n string d; \/\/ \u7531\u4e8e\u6570\u5b57\u53ef\u80fd\u975e\u5e38\u5927，\u4f7f\u7528\u5b57\u7b26\u4e32\u6765\u8bfb\u53d6
                \n cin >> n >> d; \/\/ \u8f93\u5165\u8f6c\u6362\u53c2\u6570 n \u548c\u6d6e\u70b9\u6570 d<\/p>\n

                vector<int> b; \/\/ \u4f7f\u7528 vector \u6765\u5b58\u50a8\u6570\u5b57\u7684\u6bcf\u4e00\u4f4d，\u65b9\u4fbf\u5904\u7406\u8fdb\u4f4d
                \n int sum = 0, k = 0; \/\/ sum \u7528\u4e8e\u8bb0\u5f55\u603b\u4f4d\u6570，k \u7528\u4e8e\u8bb0\u5f55\u5c0f\u6570\u70b9\u7684\u4f4d\u7f6e<\/p>\n

                \/\/ \u4ece\u5b57\u7b26\u4e32\u672b\u5c3e\u5f00\u59cb\u904d\u5386，\u5c06\u5b57\u7b26\u8f6c\u6362\u4e3a\u6574\u6570\u5e76\u5b58\u50a8\u5230 vector \u4e2d
                \n for(int i = d.size() – 1; i >= 0; i–)
                \n {
                \n if(d[i] != '.')
                \n b.push_back(d[i] – '0'); \/\/ \u5c06\u5b57\u7b26\u8f6c\u6362\u4e3a\u6574\u6570\u5e76\u5b58\u50a8
                \n else {
                \n k = sum; \/\/ \u8bb0\u5f55\u5c0f\u6570\u70b9\u7684\u4f4d\u7f6e
                \n }
                \n sum++; \/\/ \u8bb0\u5f55\u603b\u4f4d\u6570
                \n }<\/p>\n

                int u = b.size(); \/\/ \u8bb0\u5f55\u5f53\u524d\u6570\u5b57\u7684\u4f4d\u6570<\/p>\n

                \/\/ \u8fdb\u884c n \u6b21\u4e58\u4ee5 2 \u7684\u64cd\u4f5c
                \n while(n–)
                \n {
                \n int t = 0; \/\/ t \u7528\u4e8e\u8bb0\u5f55\u8fdb\u4f4d
                \n for(int i = 0; i < b.size(); i++)
                \n {
                \n b[i] = b[i] * 2 + t; \/\/ \u5f53\u524d\u4f4d\u4e58\u4ee5 2 \u5e76\u52a0\u4e0a\u8fdb\u4f4d
                \n if(b[i] >= 10)
                \n {
                \n t = b[i] \/ 10; \/\/ \u8ba1\u7b97\u65b0\u7684\u8fdb\u4f4d
                \n b[i] = b[i] % 10; \/\/ \u53d6\u4f59\u6570\u4f5c\u4e3a\u5f53\u524d\u4f4d\u7684\u503c
                \n }
                \n else {
                \n t = 0; \/\/ \u5982\u679c\u6ca1\u6709\u8fdb\u4f4d，\u7f6e\u4e3a 0
                \n }
                \n }
                \n if(t) \/\/ \u5982\u679c\u6700\u540e\u8fd8\u6709\u8fdb\u4f4d，\u6dfb\u52a0\u5230 vector \u4e2d
                \n b.push_back(t);
                \n }<\/p>\n

                u = b.size(); \/\/ \u66f4\u65b0\u6570\u5b57\u7684\u4f4d\u6570<\/p>\n

                int t = 1; \/\/ \u7528\u4e8e\u5904\u7406\u56db\u820d\u4e94\u5165\u7684\u8fdb\u4f4d
                \n if(k && b[k – 1] >= 5) \/\/ \u5982\u679c\u9700\u8981\u56db\u820d\u4e94\u5165
                \n {
                \n for(int i = k; i < u; i++)
                \n {
                \n b[i] = b[i] + 1; \/\/ \u5f53\u524d\u4f4d\u52a0 1
                \n if(b[i] <= 9) { \/\/ \u5982\u679c\u4e0d\u9700\u8981\u7ee7\u7eed\u8fdb\u4f4d
                \n t = 0;
                \n break;
                \n }
                \n else {
                \n b[i] -= 10; \/\/ \u5982\u679c\u9700\u8981\u7ee7\u7eed\u8fdb\u4f4d
                \n }
                \n }
                \n if(t) \/\/ \u5982\u679c\u6700\u540e\u8fd8\u6709\u8fdb\u4f4d，\u6dfb\u52a0\u5230 vector \u4e2d
                \n b.push_back(t);
                \n }<\/p>\n

                \/\/ \u4ece\u6700\u9ad8\u4f4d\u5f00\u59cb\u8f93\u51fa\u7ed3\u679c，\u5ffd\u7565\u5c0f\u6570\u90e8\u5206
                \n for(int i = b.size() – 1; i >= k; i–)
                \n cout << b[i];<\/p>\n

                return 0; \/\/ \u7a0b\u5e8f\u7ed3\u675f
                \n} <\/p>\n

                1. \u8f93\u5165\u5904\u7406<\/h4>\n
                  \n
                • \n

                  \u8f93\u5165：\u8bfb\u53d6\u6574\u6570\u00a0n\u00a0\u548c\u6d6e\u70b9\u6570\u00a0d\u3002<\/p>\n

                    \n
                  • \n

                    n\u00a0\u662f\u8f6c\u6362\u53c2\u6570，\u8868\u793a\u9700\u8981\u5c06\u6d6e\u70b9\u6570\u4e58\u4ee5\u00a02^n\u3002<\/p>\n<\/li>\n

                  • \n

                    d\u00a0\u662f\u5f85\u8f6c\u6362\u7684\u6d6e\u70b9\u6570，\u53ef\u80fd\u975e\u5e38\u5927，\u56e0\u6b64\u7528\u5b57\u7b26\u4e32\u5b58\u50a8\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                  • \n

                    \u76ee\u6807：\u5c06\u6d6e\u70b9\u6570\u00a0d\u00a0\u8f6c\u6362\u4e3a\u6574\u6570\u5f62\u5f0f，\u65b9\u4fbf\u540e\u7eed\u8ba1\u7b97\u3002<\/p>\n<\/li>\n<\/ul>\n

                    \n

                    2. \u5c06\u6d6e\u70b9\u6570\u8f6c\u6362\u4e3a\u6574\u6570\u5f62\u5f0f<\/h4>\n
                      \n
                    • \n

                      \u904d\u5386\u6d6e\u70b9\u6570\u5b57\u7b26\u4e32：<\/p>\n

                        \n
                      • \n

                        \u4ece\u5b57\u7b26\u4e32\u672b\u5c3e\u5f00\u59cb\u904d\u5386，\u5c06\u6bcf\u4e2a\u6570\u5b57\u5b57\u7b26\u8f6c\u6362\u4e3a\u6574\u6570，\u5e76\u5b58\u50a8\u5230\u00a0vector<int> b\u00a0\u4e2d\u3002<\/p>\n<\/li>\n

                      • \n

                        \u5982\u679c\u9047\u5230\u5c0f\u6570\u70b9\u00a0.，\u8bb0\u5f55\u5c0f\u6570\u70b9\u7684\u4f4d\u7f6e\u00a0k，\u8868\u793a\u5c0f\u6570\u70b9\u540e\u6709\u00a0k\u00a0\u4f4d\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                      • \n

                        \u7ed3\u679c：<\/p>\n

                          \n
                        • \n

                          b\u00a0\u4e2d\u5b58\u50a8\u7684\u662f\u6d6e\u70b9\u6570\u00a0d\u00a0\u7684\u6574\u6570\u5f62\u5f0f（\u53bb\u6389\u5c0f\u6570\u70b9）\u3002<\/p>\n<\/li>\n

                        • \n

                          k\u00a0\u8bb0\u5f55\u4e86\u5c0f\u6570\u70b9\u7684\u4f4d\u7f6e，\u7528\u4e8e\u540e\u7eed\u56db\u820d\u4e94\u5165\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                          \n

                          3. \u9ad8\u7cbe\u5ea6\u4e58\u4ee5\u00a02^n<\/h4>\n
                            \n
                          • \n

                            \u5faa\u73af\u4e58\u4ee5 2：<\/p>\n

                              \n
                            • \n

                              \u8fdb\u884c\u00a0n\u00a0\u6b21\u4e58\u4ee5 2 \u7684\u64cd\u4f5c，\u6bcf\u6b21\u64cd\u4f5c\u90fd\u6a21\u62df\u9ad8\u7cbe\u5ea6\u4e58\u6cd5\u3002<\/p>\n<\/li>\n

                            • \n

                              \u6bcf\u6b21\u4e58\u4ee5 2 \u65f6，\u904d\u5386\u00a0b\u00a0\u4e2d\u7684\u6bcf\u4e00\u4f4d，\u8ba1\u7b97\u5f53\u524d\u4f4d\u4e58\u4ee5 2 \u5e76\u52a0\u4e0a\u8fdb\u4f4d\u3002<\/p>\n<\/li>\n

                            • \n

                              \u5982\u679c\u5f53\u524d\u4f4d\u7684\u7ed3\u679c\u5927\u4e8e\u7b49\u4e8e 10，\u5219\u8ba1\u7b97\u8fdb\u4f4d，\u5e76\u5c06\u5f53\u524d\u4f4d\u7684\u7ed3\u679c\u53d6\u4f59\u3002<\/p>\n<\/li>\n

                            • \n

                              \u5982\u679c\u6700\u540e\u8fd8\u6709\u8fdb\u4f4d，\u5c06\u5176\u6dfb\u52a0\u5230\u00a0b\u00a0\u7684\u672b\u5c3e\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                            • \n

                              \u7ed3\u679c：<\/p>\n

                                \n
                              • \n

                                b\u00a0\u4e2d\u5b58\u50a8\u7684\u662f\u6d6e\u70b9\u6570\u00a0d\u00a0\u4e58\u4ee5\u00a02^n\u7684\u7ed3\u679c，\u4ecd\u7136\u662f\u4e00\u4e2a\u9ad8\u7cbe\u5ea6\u6574\u6570\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                \n

                                4. \u56db\u820d\u4e94\u5165<\/h4>\n
                                  \n
                                • \n

                                  \u5224\u65ad\u662f\u5426\u9700\u8981\u56db\u820d\u4e94\u5165：<\/p>\n

                                    \n
                                  • \n

                                    \u6839\u636e\u5c0f\u6570\u70b9\u7684\u4f4d\u7f6e\u00a0k，\u68c0\u67e5\u5c0f\u6570\u70b9\u540e\u7684\u7b2c\u4e00\u4f4d（\u5373\u00a0b[k-1]）\u662f\u5426\u5927\u4e8e\u7b49\u4e8e 5\u3002<\/p>\n<\/li>\n

                                  • \n

                                    \u5982\u679c\u5927\u4e8e\u7b49\u4e8e 5，\u5219\u9700\u8981\u8fdb\u884c\u56db\u820d\u4e94\u5165\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                                  • \n

                                    \u56db\u820d\u4e94\u5165\u64cd\u4f5c：<\/p>\n

                                      \n
                                    • \n

                                      \u4ece\u5c0f\u6570\u70b9\u4f4d\u7f6e\u5f00\u59cb，\u5411\u9ad8\u4f4d\u9010\u4f4d\u52a0 1，\u76f4\u5230\u6ca1\u6709\u8fdb\u4f4d\u4e3a\u6b62\u3002<\/p>\n<\/li>\n

                                    • \n

                                      \u5982\u679c\u6700\u9ad8\u4f4d\u4ecd\u6709\u8fdb\u4f4d，\u5c06\u5176\u6dfb\u52a0\u5230\u00a0b\u00a0\u7684\u672b\u5c3e\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                                    • \n

                                      \u7ed3\u679c：<\/p>\n

                                        \n
                                      • \n

                                        b\u00a0\u4e2d\u5b58\u50a8\u7684\u662f\u56db\u820d\u4e94\u5165\u540e\u7684\u6700\u7ec8\u7ed3\u679c\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                        \n

                                        5. \u8f93\u51fa\u7ed3\u679c<\/h4>\n
                                          \n
                                        • \n

                                          \u4ece\u6700\u9ad8\u4f4d\u5f00\u59cb\u8f93\u51fa：<\/p>\n

                                            \n
                                          • \n

                                            \u4ece\u00a0b\u00a0\u7684\u6700\u9ad8\u4f4d\u5f00\u59cb，\u8f93\u51fa\u6bcf\u4e00\u4f4d\u6570\u5b57\u3002<\/p>\n<\/li>\n

                                          • \n

                                            \u5ffd\u7565\u5c0f\u6570\u90e8\u5206（\u5373\u5c0f\u6570\u70b9\u540e\u7684\u4f4d\u6570）\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                                          • \n

                                            \u7ed3\u679c：<\/p>\n

                                              \n
                                            • \n

                                              \u8f93\u51fa\u7684\u662f\u6d6e\u70b9\u6570\u00a0d\u00a0\u4e58\u4ee5\u00a02^n\u00a0\u5e76\u56db\u820d\u4e94\u5165\u540e\u7684\u6574\u6570\u7ed3\u679c\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                              \n

                                              6. \u4ee3\u7801\u7684\u6838\u5fc3\u601d\u60f3<\/h4>\n
                                                \n
                                              • \n

                                                \u9ad8\u7cbe\u5ea6\u8ba1\u7b97：<\/p>\n

                                                  \n
                                                • \n

                                                  \u7531\u4e8e\u6d6e\u70b9\u6570\u548c\u00a02^n\u00a0\u53ef\u80fd\u975e\u5e38\u5927，\u666e\u901a\u6570\u636e\u7c7b\u578b\u65e0\u6cd5\u5b58\u50a8，\u56e0\u6b64\u4f7f\u7528\u5b57\u7b26\u4e32\u548c\u00a0vector<int>\u00a0\u6765\u6a21\u62df\u9ad8\u7cbe\u5ea6\u8ba1\u7b97\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                                                • \n

                                                  \u9010\u4f4d\u5904\u7406：<\/p>\n

                                                    \n
                                                  • \n

                                                    \u901a\u8fc7\u9010\u4f4d\u904d\u5386\u548c\u8fdb\u4f4d\u5904\u7406，\u5b9e\u73b0\u4e86\u9ad8\u7cbe\u5ea6\u4e58\u6cd5\u548c\u56db\u820d\u4e94\u5165\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n

                                                  • \n

                                                    \u56db\u820d\u4e94\u5165：<\/p>\n

                                                      \n
                                                    • \n

                                                      \u6839\u636e\u5c0f\u6570\u70b9\u540e\u7684\u7b2c\u4e00\u4f4d\u51b3\u5b9a\u662f\u5426\u9700\u8981\u8fdb\u4f4d，\u6a21\u62df\u4e86\u56db\u820d\u4e94\u5165\u7684\u8fc7\u7a0b\u3002<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                      \u4e94\u3001\u00a00\u5b9d\u77f3\u7ec4\u5408 – \u84dd\u6865\u4e91\u8bfe<\/h2>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      （\u8fd9\u9053\u9898\u6211\u53ea\u4f1a\u66b4\u529b，\u800c\u4e14\u6ca1\u62ff\u5230\u8be5\u62ff\u7684\u5206，\u522b\u63d0\u4e86，\u90fd\u662f\u6cea）<\/p>\n

                                                      \u725b\u903c\u7684\u9898\u89e3：<\/h3>\n

                                                      #include <bits\/stdc++.h> \/\/ \u5305\u542b\u6240\u6709\u6807\u51c6\u5e93\u5934\u6587\u4ef6<\/p>\n

                                                      #define N 500010 \/\/ \u5b9a\u4e49\u5e38\u91cf N，\u8868\u793a\u6570\u7ec4\u7684\u6700\u5927\u5927\u5c0f<\/p>\n

                                                      int gem[N], num[N]; \/\/ \u5b9a\u4e49\u4e24\u4e2a\u6570\u7ec4：gem \u7528\u4e8e\u5b58\u50a8\u8f93\u5165\u7684\u5b9d\u77f3\u7f16\u53f7，num \u7528\u4e8e\u7edf\u8ba1\u6bcf\u79cd\u5b9d\u77f3\u7684\u6570\u91cf<\/p>\n

                                                      int main() {
                                                      \n int n;
                                                      \n scanf("%d", &n); \/\/ \u8f93\u5165\u6574\u6570 n，\u8868\u793a\u5b9d\u77f3\u7684\u6570\u91cf<\/p>\n

                                                      int max = -0x3f3f3f3f; \/\/ \u521d\u59cb\u5316 max \u4e3a\u4e00\u4e2a\u5f88\u5c0f\u7684\u503c，\u7528\u4e8e\u8bb0\u5f55\u5b9d\u77f3\u7f16\u53f7\u7684\u6700\u5927\u503c
                                                      \n for (int i = 0; i < n; i++) {
                                                      \n scanf("%d", &gem[i]); \/\/ \u8f93\u5165\u6bcf\u4e2a\u5b9d\u77f3\u7684\u7f16\u53f7
                                                      \n num[gem[i]]++; \/\/ \u7edf\u8ba1\u6bcf\u79cd\u5b9d\u77f3\u7684\u6570\u91cf
                                                      \n if (gem[i] > max) max = gem[i]; \/\/ \u66f4\u65b0\u5b9d\u77f3\u7f16\u53f7\u7684\u6700\u5927\u503c
                                                      \n }<\/p>\n

                                                      \/\/ \u4ece\u6700\u5927\u503c\u5f00\u59cb，\u5c1d\u8bd5\u627e\u5230\u6ee1\u8db3\u6761\u4ef6\u7684\u4e09\u4e2a\u5b9d\u77f3
                                                      \n for (int i = max; i >= 1; i–) { \/\/ i \u662f\u53ef\u80fd\u7684\u516c\u56e0\u6570
                                                      \n int tmp[3], pos = 0; \/\/ tmp \u7528\u4e8e\u5b58\u50a8\u7b26\u5408\u6761\u4ef6\u7684\u5b9d\u77f3\u7f16\u53f7，pos \u7528\u4e8e\u8bb0\u5f55 tmp \u4e2d\u7684\u4f4d\u7f6e
                                                      \n int cnt = 0; \/\/ cnt \u7528\u4e8e\u7edf\u8ba1\u7b26\u5408\u6761\u4ef6\u7684\u5b9d\u77f3\u6570\u91cf<\/p>\n

                                                      \/\/ \u904d\u5386\u6240\u6709 i \u7684\u500d\u6570，\u68c0\u67e5\u662f\u5426\u5b58\u5728\u5bf9\u5e94\u7684\u5b9d\u77f3
                                                      \n for (int j = i; j <= max; j += i) { \/\/ j \u662f i \u7684\u500d\u6570
                                                      \n if (num[j]) { \/\/ \u5982\u679c\u5b9d\u77f3 j \u5b58\u5728
                                                      \n cnt += num[j]; \/\/ \u7edf\u8ba1\u5b9d\u77f3 j \u7684\u6570\u91cf
                                                      \n for (int k = 0; k < num[j] && pos < 3; k++) { \/\/ \u5c06\u5b9d\u77f3 j \u52a0\u5165 tmp
                                                      \n tmp[pos++] = j;
                                                      \n }
                                                      \n }
                                                      \n if (cnt == 3) break; \/\/ \u5982\u679c\u627e\u5230\u4e09\u4e2a\u5b9d\u77f3，\u8df3\u51fa\u5faa\u73af
                                                      \n }<\/p>\n

                                                      \/\/ \u5982\u679c\u627e\u5230\u4e09\u4e2a\u5b9d\u77f3，\u8f93\u51fa\u7ed3\u679c\u5e76\u7ed3\u675f\u7a0b\u5e8f
                                                      \n if (cnt == 3) {
                                                      \n for (int j = 0; j < 3; j++) {
                                                      \n printf("%d ", tmp[j]); \/\/ \u8f93\u51fa\u4e09\u4e2a\u5b9d\u77f3\u7684\u7f16\u53f7
                                                      \n }
                                                      \n break; \/\/ \u7ed3\u675f\u7a0b\u5e8f
                                                      \n }
                                                      \n }<\/p>\n

                                                      return 0; \/\/ \u7a0b\u5e8f\u7ed3\u675f
                                                      \n} <\/p>\n

                                                      \u4ee3\u7801\u601d\u8def：\u00a0<\/h3>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n<\/p>\n

                                                      \u516d\u30010\u6570\u5b57\u63a5\u9f99 – \u84dd\u6865\u4e91\u8bfe\u00a0<\/h2>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      \u9898\u89e3\u4ee3\u7801：<\/h3>\n

                                                      #include <bits\/stdc++.h> \/\/ \u5305\u542b\u6240\u6709\u6807\u51c6\u5e93\u5934\u6587\u4ef6
                                                      \nusing namespace std;<\/p>\n

                                                      const int N = 11; \/\/ \u5b9a\u4e49\u68cb\u76d8\u7684\u6700\u5927\u5927\u5c0f\u4e3a11\u00d711
                                                      \nint n, k; \/\/ n\u4e3a\u68cb\u76d8\u5927\u5c0f，k\u4e3a\u6570\u5b57\u5faa\u73af\u7684\u8303\u56f4
                                                      \nint g[N][N]; \/\/ \u5b58\u50a8\u68cb\u76d8\u4e0a\u7684\u6570\u5b57
                                                      \nint dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; \/\/ \u5b9a\u4e498\u4e2a\u65b9\u5411\u7684x\u5750\u6807\u504f\u79fb
                                                      \nint dy[8] = {0, 1, 1, 1, 0, -1, -1, -1}; \/\/ \u5b9a\u4e498\u4e2a\u65b9\u5411\u7684y\u5750\u6807\u504f\u79fb
                                                      \nstring path; \/\/ \u5b58\u50a8\u8def\u5f84\u7684\u65b9\u5411\u7f16\u53f7
                                                      \nbool st[N][N]; \/\/ \u6807\u8bb0\u68cb\u76d8\u4e0a\u7684\u683c\u5b50\u662f\u5426\u88ab\u8bbf\u95ee\u8fc7
                                                      \nbool edge[N][N][N][N]; \/\/ \u68c0\u67e5\u8def\u5f84\u662f\u5426\u4ea4\u53c9<\/p>\n

                                                      \/\/ \u6df1\u5ea6\u4f18\u5148\u641c\u7d22\u51fd\u6570，\u7528\u4e8e\u5bfb\u627e\u8def\u5f84
                                                      \nbool dfs(int a, int b) {
                                                      \n \/\/ \u5982\u679c\u5230\u8fbe\u53f3\u4e0b\u89d2\u683c\u5b50，\u68c0\u67e5\u8def\u5f84\u957f\u5ea6\u662f\u5426\u4e3an*n-1（\u56e0\u4e3a\u8d77\u70b9\u4e0d\u8ba1\u5165\u8def\u5f84）
                                                      \n if (a == n – 1 && b == n – 1)
                                                      \n return path.size() == n * n – 1;<\/p>\n

                                                      st[a][b] = true; \/\/ \u6807\u8bb0\u5f53\u524d\u683c\u5b50\u5df2\u8bbf\u95ee
                                                      \n for (int i = 0; i < 8; i++) { \/\/ \u904d\u53868\u4e2a\u65b9\u5411
                                                      \n int x = a + dx[i], y = b + dy[i]; \/\/ \u8ba1\u7b97\u76ee\u6807\u683c\u5b50\u7684\u5750\u6807
                                                      \n \/\/ \u68c0\u67e5\u76ee\u6807\u683c\u5b50\u662f\u5426\u8d8a\u754c\u3001\u662f\u5426\u8bbf\u95ee\u8fc7\u3001\u6570\u5b57\u662f\u5426\u6ee1\u8db3\u5faa\u73af\u5e8f\u5217\u8981\u6c42
                                                      \n if (x < 0 || x >= n || y < 0 || y >= n) continue;
                                                      \n if (st[x][y]) continue;
                                                      \n if (g[x][y] != (g[a][b] + 1) % k) continue;
                                                      \n \/\/ \u68c0\u67e5\u8def\u5f84\u662f\u5426\u4ea4\u53c9（\u5bf9\u4e8e\u659c\u5411\u79fb\u52a8，\u68c0\u67e5\u662f\u5426\u6709\u53cd\u5411\u7684\u8def\u5f84）
                                                      \n if (i % 2 && (edge[a][y][x][b] || edge[x][b][a][y])) continue;<\/p>\n

                                                      edge[a][b][x][y] = true; \/\/ \u6807\u8bb0\u8def\u5f84
                                                      \n path += i + '0'; \/\/ \u5c06\u65b9\u5411\u7f16\u53f7\u52a0\u5165\u8def\u5f84
                                                      \n if (dfs(x, y)) return true; \/\/ \u9012\u5f52\u641c\u7d22\u4e0b\u4e00\u4e2a\u683c\u5b50
                                                      \n path.pop_back(); \/\/ \u56de\u6eaf，\u79fb\u9664\u8def\u5f84\u4e2d\u7684\u6700\u540e\u4e00\u4e2a\u65b9\u5411
                                                      \n edge[a][b][x][y] = false; \/\/ \u56de\u6eaf，\u53d6\u6d88\u8def\u5f84\u6807\u8bb0
                                                      \n }
                                                      \n st[a][b] = false; \/\/ \u56de\u6eaf，\u53d6\u6d88\u5f53\u524d\u683c\u5b50\u7684\u8bbf\u95ee\u6807\u8bb0
                                                      \n return false; \/\/ \u5982\u679c\u6240\u6709\u65b9\u5411\u90fd\u65e0\u6cd5\u5230\u8fbe\u7ec8\u70b9，\u8fd4\u56defalse
                                                      \n}<\/p>\n

                                                      int main() {
                                                      \n cin >> n >> k; \/\/ \u8f93\u5165\u68cb\u76d8\u5927\u5c0f\u548c\u6570\u5b57\u5faa\u73af\u8303\u56f4
                                                      \n for (int i = 0; i < n; i++) \/\/ \u8bfb\u53d6\u68cb\u76d8\u4e0a\u7684\u6570\u5b57
                                                      \n for (int j = 0; j < n; j++)
                                                      \n cin >> g[i][j];<\/p>\n

                                                      \/\/ \u4ece\u8d77\u70b9(0,0)\u5f00\u59cb\u641c\u7d22\u8def\u5f84
                                                      \n if (!dfs(0, 0))
                                                      \n cout << -1 << endl; \/\/ \u5982\u679c\u6ca1\u6709\u627e\u5230\u8def\u5f84，\u8f93\u51fa-1
                                                      \n else
                                                      \n cout << path << endl; \/\/ \u8f93\u51fa\u8def\u5f84\u7684\u65b9\u5411\u7f16\u53f7\u5e8f\u5217<\/p>\n

                                                      return 0;
                                                      \n} <\/p>\n

                                                      \"\"<\/p>\n

                                                      \u7f57\u52c7\u519b\u8001\u5e08\u7684\u5206\u6790：（\u6709\u9053\u7406）<\/p>\n

                                                      \"\"<\/p>\n

                                                      \u00a0<\/p>\n

                                                      \u4e03\u30010\u62d4\u6cb3 – \u84dd\u6865\u4e91\u8bfe<\/h2>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      \"\"<\/p>\n

                                                      \u7b97\u6cd5\u4ee3\u7801（20%\u66b4\u529b\u679a\u4e3e）\u00a0<\/h3>\n

                                                      \/\/20%：\u66b4\u529b\u679a\u4e3e
                                                      \n#include<bits\/stdc++.h> \/\/ \u5305\u542b\u6240\u6709\u6807\u51c6\u5e93\u5934\u6587\u4ef6
                                                      \nusing namespace std; \/\/ \u4f7f\u7528\u6807\u51c6\u547d\u540d\u7a7a\u95f4<\/p>\n

                                                      const int N = 1e3 + 100; \/\/ \u5b9a\u4e49\u5e38\u91cf N，\u8868\u793a\u6570\u7ec4\u7684\u6700\u5927\u5927\u5c0f
                                                      \ntypedef long long ll; \/\/ \u5b9a\u4e49 long long \u7c7b\u578b\u7684\u522b\u540d ll
                                                      \nll a[100]; \/\/ \u5b9a\u4e49\u6570\u7ec4 a，\u7528\u4e8e\u5b58\u50a8\u8f93\u5165\u7684\u6570\u5b57<\/p>\n

                                                      \/\/ \u8ba1\u7b97\u5b50\u6570\u7ec4\u548c\u7684\u51fd\u6570
                                                      \nll sum(int l, int r) {
                                                      \n ll s = 0; \/\/ \u521d\u59cb\u5316\u5b50\u6570\u7ec4\u548c\u4e3a 0
                                                      \n for (int i = l; i <= r; i++) \/\/ \u904d\u5386\u5b50\u6570\u7ec4\u7684\u6bcf\u4e2a\u5143\u7d20
                                                      \n s += a[i]; \/\/ \u7d2f\u52a0\u5b50\u6570\u7ec4\u7684\u5143\u7d20
                                                      \n return s; \/\/ \u8fd4\u56de\u5b50\u6570\u7ec4\u7684\u548c
                                                      \n}<\/p>\n

                                                      int main() {
                                                      \n int n; \/\/ \u5b9a\u4e49\u6574\u6570 n，\u8868\u793a\u6570\u7ec4\u7684\u5927\u5c0f
                                                      \n cin >> n; \/\/ \u8f93\u5165\u6570\u7ec4\u7684\u5927\u5c0f n<\/p>\n

                                                      for (int i = 1; i <= n; i++) \/\/ \u904d\u5386\u6570\u7ec4\u7684\u6bcf\u4e2a\u4f4d\u7f6e
                                                      \n cin >> a[i]; \/\/ \u8f93\u5165\u6570\u7ec4\u7684\u6bcf\u4e2a\u5143\u7d20<\/p>\n

                                                      ll ans = 1e12; \/\/ \u521d\u59cb\u5316\u7b54\u6848\u4e3a\u4e00\u4e2a\u5927\u503c（1e12），\u7528\u4e8e\u5b58\u50a8\u6700\u5c0f\u7edd\u5bf9\u5dee<\/p>\n

                                                      \/\/ \u66b4\u529b\u679a\u4e3e\u6240\u6709\u53ef\u80fd\u7684\u5b50\u6570\u7ec4\u5bf9
                                                      \n for (int l1 = 1; l1 <= n; l1++) { \/\/ \u679a\u4e3e\u7b2c\u4e00\u4e2a\u5b50\u6570\u7ec4\u7684\u8d77\u59cb\u4f4d\u7f6e l1
                                                      \n for (int r1 = l1; r1 <= n; r1++) { \/\/ \u679a\u4e3e\u7b2c\u4e00\u4e2a\u5b50\u6570\u7ec4\u7684\u7ed3\u675f\u4f4d\u7f6e r1
                                                      \n for (int l2 = r1 + 1; l2 <= n; l2++) { \/\/ \u679a\u4e3e\u7b2c\u4e8c\u4e2a\u5b50\u6570\u7ec4\u7684\u8d77\u59cb\u4f4d\u7f6e l2
                                                      \n for (int r2 = l2; r2 <= n; r2++) { \/\/ \u679a\u4e3e\u7b2c\u4e8c\u4e2a\u5b50\u6570\u7ec4\u7684\u7ed3\u675f\u4f4d\u7f6e r2
                                                      \n \/\/ \u8ba1\u7b97\u4e24\u4e2a\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u5dee，\u5e76\u66f4\u65b0\u6700\u5c0f\u503c
                                                      \n ans = min(ans, abs(sum(l2, r2) – sum(l1, r1)));
                                                      \n }
                                                      \n }
                                                      \n }
                                                      \n }<\/p>\n

                                                      cout << ans; \/\/ \u8f93\u51fa\u6700\u5c0f\u7edd\u5bf9\u5dee
                                                      \n return 0; \/\/ \u7a0b\u5e8f\u7ed3\u675f
                                                      \n} <\/p>\n

                                                      \u00a0\u7b97\u6cd5\u4ee3\u7801（40%\u66b4\u529b\u679a\u4e3e+\u524d\u7f00\u548c\u4f18\u5316）\u00a0<\/h3>\n

                                                      #include<bits\/stdc++.h> \/\/ \u5305\u542b\u6240\u6709\u6807\u51c6\u5e93\u5934\u6587\u4ef6
                                                      \nusing namespace std; \/\/ \u4f7f\u7528\u6807\u51c6\u547d\u540d\u7a7a\u95f4<\/p>\n

                                                      const int N = 1e3 + 100; \/\/ \u5b9a\u4e49\u5e38\u91cf N，\u8868\u793a\u6570\u7ec4\u7684\u6700\u5927\u5927\u5c0f
                                                      \ntypedef long long ll; \/\/ \u5b9a\u4e49 long long \u7c7b\u578b\u7684\u522b\u540d ll
                                                      \nll a[N], prefix[N]; \/\/ \u5b9a\u4e49\u6570\u7ec4 a \u548c\u524d\u7f00\u548c\u6570\u7ec4 prefix<\/p>\n

                                                      \/\/ \u8ba1\u7b97\u5b50\u6570\u7ec4\u548c\u7684\u51fd\u6570
                                                      \nll sum(int l, int r) {
                                                      \n return prefix[r] – prefix[l – 1]; \/\/ \u8fd4\u56de\u5b50\u6570\u7ec4 [l, r] \u7684\u548c
                                                      \n}<\/p>\n

                                                      int main() {
                                                      \n int n; \/\/ \u5b9a\u4e49\u6574\u6570 n，\u8868\u793a\u6570\u7ec4\u7684\u5927\u5c0f
                                                      \n cin >> n; \/\/ \u8f93\u5165\u6570\u7ec4\u7684\u5927\u5c0f n<\/p>\n

                                                      \/\/ \u8bfb\u53d6\u6570\u7ec4\u5e76\u8ba1\u7b97\u524d\u7f00\u548c
                                                      \n for (int i = 1; i <= n; i++) {
                                                      \n cin >> a[i]; \/\/ \u8f93\u5165\u6570\u7ec4\u7684\u6bcf\u4e2a\u5143\u7d20
                                                      \n prefix[i] = prefix[i – 1] + a[i]; \/\/ \u8ba1\u7b97\u524d\u7f00\u548c
                                                      \n }<\/p>\n

                                                      ll ans = 1e12; \/\/ \u521d\u59cb\u5316\u7b54\u6848\u4e3a\u4e00\u4e2a\u5927\u503c（1e12），\u7528\u4e8e\u5b58\u50a8\u6700\u5c0f\u7edd\u5bf9\u5dee<\/p>\n

                                                      \/\/ \u679a\u4e3e\u6240\u6709\u5b50\u6570\u7ec4\u5bf9
                                                      \n for (int l1 = 1; l1 <= n; l1++) { \/\/ \u679a\u4e3e\u7b2c\u4e00\u4e2a\u5b50\u6570\u7ec4\u7684\u8d77\u59cb\u4f4d\u7f6e l1
                                                      \n for (int r1 = l1; r1 <= n; r1++) { \/\/ \u679a\u4e3e\u7b2c\u4e00\u4e2a\u5b50\u6570\u7ec4\u7684\u7ed3\u675f\u4f4d\u7f6e r1
                                                      \n ll sum1 = sum(l1, r1); \/\/ \u8ba1\u7b97\u7b2c\u4e00\u4e2a\u5b50\u6570\u7ec4\u7684\u548c
                                                      \n for (int l2 = r1 + 1; l2 <= n; l2++) { \/\/ \u679a\u4e3e\u7b2c\u4e8c\u4e2a\u5b50\u6570\u7ec4\u7684\u8d77\u59cb\u4f4d\u7f6e l2
                                                      \n for (int r2 = l2; r2 <= n; r2++) { \/\/ \u679a\u4e3e\u7b2c\u4e8c\u4e2a\u5b50\u6570\u7ec4\u7684\u7ed3\u675f\u4f4d\u7f6e r2
                                                      \n ll sum2 = sum(l2, r2); \/\/ \u8ba1\u7b97\u7b2c\u4e8c\u4e2a\u5b50\u6570\u7ec4\u7684\u548c
                                                      \n ans = min(ans, abs(sum2 – sum1)); \/\/ \u66f4\u65b0\u6700\u5c0f\u7edd\u5bf9\u5dee
                                                      \n }
                                                      \n }
                                                      \n }
                                                      \n }<\/p>\n

                                                      cout << ans; \/\/ \u8f93\u51fa\u6700\u5c0f\u7edd\u5bf9\u5dee
                                                      \n return 0; \/\/ \u7a0b\u5e8f\u7ed3\u675f
                                                      \n} <\/p>\n

                                                      \"\"<\/p>\n

                                                      \u9006\u5929\u9898\u89e3：（\u771f\u7684\u60f3\u4e0d\u51fa\u6765，\u6211\u662f\u4e2a\u53ea\u4f1a\u66b4\u529b\u7684fw）<\/h3>\n

                                                      \"\"<\/p>\n

                                                      #include<bits\/stdc++.h> \/\/ \u5305\u542b\u6240\u6709\u6807\u51c6\u5e93\u5934\u6587\u4ef6
                                                      \nusing namespace std; \/\/ \u4f7f\u7528\u6807\u51c6\u547d\u540d\u7a7a\u95f4<\/p>\n

                                                      const int N = 1e3 + 10; \/\/ \u5b9a\u4e49\u5e38\u91cf N，\u8868\u793a\u6570\u7ec4\u7684\u6700\u5927\u5927\u5c0f
                                                      \nlong long a[N]; \/\/ \u5b9a\u4e49\u6570\u7ec4 a，\u7528\u4e8e\u5b58\u50a8\u524d\u7f00\u548c
                                                      \nint n; \/\/ \u5b9a\u4e49\u6574\u6570 n，\u8868\u793a\u6570\u7ec4\u7684\u5927\u5c0f
                                                      \nmultiset<long long> s; \/\/ \u5b9a\u4e49 multiset，\u7528\u4e8e\u5b58\u50a8\u6240\u6709\u53ef\u80fd\u7684\u5b50\u6570\u7ec4\u548c<\/p>\n

                                                      \/\/ \u81ea\u5b9a\u4e49\u51fd\u6570，\u8fd4\u56de\u4e24\u4e2a\u6570\u4e2d\u7684\u8f83\u5c0f\u503c
                                                      \nlong long minn(long long a, long long b) {
                                                      \n if (a < b) return a;
                                                      \n else return b;
                                                      \n}<\/p>\n

                                                      int main() {
                                                      \n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); \/\/ \u53d6\u6d88\u540c\u6b65\u6d41，\u52a0\u901f\u8f93\u5165\u8f93\u51fa
                                                      \n cin >> n; \/\/ \u8f93\u5165\u6570\u7ec4\u7684\u5927\u5c0f n<\/p>\n

                                                      \/\/ \u8bfb\u53d6\u6570\u7ec4\u5e76\u6784\u9020\u524d\u7f00\u548c
                                                      \n for (int i = 1; i <= n; i++) {
                                                      \n cin >> a[i];
                                                      \n a[i] += a[i – 1]; \/\/ \u8ba1\u7b97\u524d\u7f00\u548c
                                                      \n }<\/p>\n

                                                      \/\/ \u679a\u4e3e\u6240\u6709\u53ef\u80fd\u7684\u5b50\u6570\u7ec4\u548c，\u5e76\u5c06\u5176\u63d2\u5165 multiset
                                                      \n for (int i = 1; i <= n; i++) {
                                                      \n for (int j = i; j <= n; j++) {
                                                      \n s.insert(a[j] – a[i – 1]); \/\/ \u8ba1\u7b97\u5b50\u6570\u7ec4 [i, j] \u7684\u548c，\u5e76\u63d2\u5165 multiset
                                                      \n }
                                                      \n }<\/p>\n

                                                      long long res = 1e9; \/\/ \u521d\u59cb\u5316\u7ed3\u679c\u4e3a\u4e00\u4e2a\u5927\u503c（1e9），\u7528\u4e8e\u5b58\u50a8\u6700\u5c0f\u7edd\u5bf9\u5dee<\/p>\n

                                                      \/\/ \u904d\u5386\u6240\u6709\u53ef\u80fd\u7684\u7b2c\u4e00\u4e2a\u533a\u95f4\u7684\u53f3\u7aef\u70b9 i
                                                      \n for (int i = 1; i < n; i++) {
                                                      \n \/\/ \u5220\u9664\u4ee5 i \u4f5c\u4e3a\u53f3\u7aef\u70b9\u7684\u6240\u6709\u5b50\u6570\u7ec4\u548c
                                                      \n for (int j = i; j <= n; j++) {
                                                      \n auto k = a[j] – a[i – 1]; \/\/ \u8ba1\u7b97\u5b50\u6570\u7ec4 [i, j] \u7684\u548c
                                                      \n s.erase(s.find(k)); \/\/ \u4ece multiset \u4e2d\u5220\u9664\u8be5\u548c
                                                      \n }<\/p>\n

                                                      \/\/ \u904d\u5386\u6240\u6709\u53ef\u80fd\u7684\u7b2c\u4e00\u4e2a\u533a\u95f4\u7684\u5de6\u7aef\u70b9 j
                                                      \n for (int j = 1; j <= i; j++) {
                                                      \n auto k = a[i] – a[j – 1]; \/\/ \u8ba1\u7b97\u7b2c\u4e00\u4e2a\u5b50\u6570\u7ec4 [j, i] \u7684\u548c<\/p>\n

                                                      \/\/ \u5728 multiset \u4e2d\u67e5\u627e\u6700\u63a5\u8fd1 k \u7684\u503c
                                                      \n auto p = s.lower_bound(k); \/\/ \u627e\u5230\u7b2c\u4e00\u4e2a >= k \u7684\u503c
                                                      \n if (p != s.end()) {
                                                      \n res = minn(res, abs(*p – k)); \/\/ \u66f4\u65b0\u6700\u5c0f\u7edd\u5bf9\u5dee
                                                      \n }
                                                      \n if (p != s.begin()) {
                                                      \n p–; \/\/ \u627e\u5230\u7b2c\u4e00\u4e2a < k \u7684\u503c
                                                      \n res = minn(res, abs(*p – k)); \/\/ \u66f4\u65b0\u6700\u5c0f\u7edd\u5bf9\u5dee
                                                      \n }
                                                      \n }
                                                      \n }<\/p>\n

                                                      cout << res << endl; \/\/ \u8f93\u51fa\u6700\u5c0f\u7edd\u5bf9\u5dee
                                                      \n return 0; \/\/ \u7a0b\u5e8f\u7ed3\u675f
                                                      \n} <\/p>\n

                                                      \"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

                                                      \u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb7.7k\u6b21\uff0c\u70b9\u8d5e87\u6b21\uff0c\u6536\u85cf161\u6b21\u3002\u84dd\u6865\u676f\u771f\u9898\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4<\/p>\n","protected":false},"author":2,"featured_media":36090,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[55,174,729],"topic":[],"class_list":{"0":"post-36110","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","6":"hentry","7":"category-server","8":"tag-c","10":"tag-729"},"yoast_head":"\n\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/36110.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb7.7k\u6b21\uff0c\u70b9\u8d5e87\u6b21\uff0c\u6536\u85cf161\u6b21\u3002\u84dd\u6865\u676f\u771f\u9898\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/36110.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2025-05-07T07:52:24+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/05\/20250507075221-681b11354f672.png\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"8 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/36110.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/36110.html\",\"name\":\"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2025-05-07T07:52:24+00:00\",\"dateModified\":\"2025-05-07T07:52:24+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/36110.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/36110.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/36110.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/36110.html","og_locale":"zh_CN","og_type":"article","og_title":"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb7.7k\u6b21\uff0c\u70b9\u8d5e87\u6b21\uff0c\u6536\u85cf161\u6b21\u3002\u84dd\u6865\u676f\u771f\u9898\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4","og_url":"https:\/\/www.wsisp.com\/helps\/36110.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2025-05-07T07:52:24+00:00","og_image":[{"url":"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/05\/20250507075221-681b11354f672.png"}],"author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"8 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/36110.html","url":"https:\/\/www.wsisp.com\/helps\/36110.html","name":"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2025-05-07T07:52:24+00:00","dateModified":"2025-05-07T07:52:24+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/36110.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/36110.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/36110.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"\u84dd\u6865\u676f\u5237\u9898\u2014\u2014\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/36110","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=36110"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/36110\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media\/36090"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=36110"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=36110"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=36110"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=36110"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}