{"id":156,"date":"2022-05-20T18:30:33","date_gmt":"2022-05-20T10:30:33","guid":{"rendered":"http:\/\/162.14.82.114\/?p=156"},"modified":"2024-03-24T21:22:35","modified_gmt":"2024-03-24T13:22:35","slug":"%e7%ae%97%e6%b3%95%e5%85%a5%e9%97%a8%e6%af%8f%e6%97%a5%e6%9b%b4%e6%96%b0","status":"publish","type":"post","link":"http:\/\/162.14.82.114\/index.php\/156\/05\/20\/2022\/","title":{"rendered":"\u7b97\u6cd5\u5165\u95e8\uff08\u6d45\u6d45\u8bb0\u5f55\uff09"},"content":{"rendered":"

\u7b97\u6cd5\u5165\u95e8<\/h1>\n

\u7b2c\u4e00\u5929<\/h2>\n

\u9996\u5148\u5fc5\u987b\u63d0\u4e00\u4e0b\u4e07\u80fd\u5934#include<bits\/stdc++.h><\/code> <\/p>\n

\u6392\u5217\u5f0f<\/a><\/h3>\n

\u9898\u76ee<\/h4>\n

\"image-20220518235835014\"<\/div><\/p>\n

\u9898\u89e3\uff1a<\/h4>\n

\u601d\u8def\u662f\uff1a\u6613\u77e5\u662f\u4e5d\u4e2a\u6570\u5b57\uff0c\u56db\u4f4d\u6570\u7b49\u4e8e\u4e24\u4f4d\u6570\u4f4d\u6570\u4e58\u4ee5\u4e00\u4e2a\u4e09\u4f4d\u6570\u6216\u8005\u4e00\u4e2a\u4e00\u4f4d\u6570\u4e58\u4ee5\u4e00\u4e2a\u56db\u4f4d\u6570\uff1a<\/p>\n

#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int acm[9]={1,2,3,4,5,6,7,8,9};\n    do{\n        int result = acm[0]*1000 + acm[1]*100 + acm[2]*10 + acm[3];\n        int one = acm[4];\n        int four = acm[5]*1000 + acm[6]*100 + acm[7]*10 + acm[8];\n        int two = acm[4]*10 + acm[5];\n        int three = acm[6]*100 + acm[7]*10 + acm[8];\n        if(result == one * four){\n            printf("%d = %d x %d\\n",result,one,four);\n        }else if(result == two * three){\n            printf("%d = %d x %d\\n",result,two,three);\n        }\n    }while(next_permutation(acm,acm+9));\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h4>\n
\u6211\u7684\u60f3\u6cd5\u662f\u7a77\u4e3e\uff0c\u5224\u65ad\u662f\u5426\u7b26\u5408\u6761\u4ef6\uff0c\u5b9e\u5728\u662f\u592a\u8d39\u65f6\u95f4\u4e86\uff0c\u54c8\u54c8\u54c8\uff0c\u60f3\u4e86\u4e00\u9635\u5b50\u5b9e\u5728\u6ca1\u60f3\u51fa\u6765\u5c31\u770b\u4e86\u5e08\u5085\u4eec\u7684\u9898\u89e3\uff0c\u53d1\u73b0\u4e86next_permutation(a,a+n)<\/code><\/p>\n
template<class BidirIt>\nbool next_permutation(BidirIt first, BidirIt last)\n{\n    if (first == last) return false;\n    BidirIt i = last;\n    if (first == --i) return false;\n\n    while (true) {\n        BidirIt i1, i2;\n\n        i1 = i;\n        if (*--i < *i1) {\n            i2 = last;\n            while (!(*i < *--i2))\n                ;\n            std::iter_swap(i, i2);\n            std::reverse(i1, last);\n            return true;\n        }\n        if (i == first) {\n            std::reverse(first, last);\n            return false;\n        }\n    }\n}<\/code><\/pre>\n
\u8fd9\u4e2a\u51fd\u6570\u662f\u5b9e\u73b0\u5bf9\u6570\u7ec4a\u7684\u524dn\u4e2a\u5143\u7d20\u8fdb\u884c\u5168\u6392\u5217\uff0c\u4f46\u662f\u8fdb\u884c\u5168\u6392\u5217\u7684\u6570\u7ec4\u4e00\u5b9a\u8981\u662f\u6709\u5e8f\u7684\uff08\u5347\u5e8f\uff09\uff0c\u5982\u679c\u4e0d\u662f\u6309\u7167\u5347\u5e8f\u6392\u5217\u7684\uff0c\u90a3\u7cfb\u7edf\u53ea\u80fd\u627e\u5230\u8be5\u5e8f\u5217\u4e4b\u540e\u7684\u5168\u6392\u5217\u3002<\/p>\n
\u75ab\u60c5\u6b7b\u4ea1\u7387<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220518235924684\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<iostream>\n#include<iomanip>\nusing namespace std;\nint main(){\n    double a,b,c;\n    cin >> a >>b;\n    c = (b\/a)*100;\n    cout << fixed <<setprecision(3) << c << "%" << endl;\n}<\/code><\/pre>\n
\u6bd4\u8f83\u7b80\u6d01\u7684\u5199\u6cd5\uff1a<\/h4>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint main()\n{\n    double a,b;\n    cin>>a>>b;\nprintf("%.3f%%",b\/a*100);\n    return 0;\n}<\/code><\/pre>\n
\u6536\u83b7<\/h4>\n
==\u672c\u9898\u4e2d\u7684 fixed \u662f\u548c setprecision \u8054\u7528\u7684==<\/p>\n
\n
\u5982\u679c\u4e00\u4e2a\u6570\u5b57\u592a\u5927\uff0c\u65e0\u6cd5\u4f7f\u7528 setprecision<\/a> \u6307\u5b9a\u7684\u6709\u6548\u6570\u4f4d\u6570\u6765\u6253\u5370\uff0c\u5219\u8bb8\u591a\u7cfb\u7edf\u4f1a\u4ee5\u79d1\u5b66\u8868\u793a\u6cd5\u7684\u65b9\u5f0f\u6253\u5370\u3002<\/p>\n
\u4e3a\u4e86\u9632\u6b62\u51fa\u73b0\u8fd9\u79cd\u60c5\u51b5\uff0c\u53ef\u4ee5\u4f7f\u7528\u53e6\u4e00\u4e2a\u6d41\u64cd\u4f5c\u7b26 fixed\uff0c\u5b83\u8868\u793a\u6d6e\u70b9\u8f93\u51fa\u5e94\u8be5\u4ee5\u56fa\u5b9a\u70b9\u6216\u5c0f\u6570\u70b9\u8868\u793a\u6cd5\u663e\u793a\uff1a<\/p>\n<\/blockquote>\n
\u5b8c\u6210\u5ea6\u6253\u5361\uff1a<\/h3>\n
\"image-20220519005329057\"<\/div><\/p>\n
\u7b2c\u4e8c\u5929<\/h2>\n
\u6c34\u9898\u518d\u6b21\u6765\u88ad\uff1a\u660e\u5929\u661f\u671f\u51e0\uff1f<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220519110045896\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
\u672c\u9898\u6b63\u5e38\u5e94\u8be5\u4f7f\u7528\u6761\u4ef6\u8bed\u53e5\u8fdb\u884c\u5224\u65ad\u518d\u8fdb\u884c\u89e3\u51b3\uff0c\u4f46\u662f\u53ef\u4ee5\u4f7f\u7528 bool \u7c7b\u578b\u8fdb\u884c\u76f8\u540c\u6548\u679c\u7684\u64cd\u4f5c\uff1a<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int a;\n    bool b;\n    cin>>a;\n    b = 7-a;\n    cout<<a+1-7*(1-b);      \n}<\/code><\/pre>\n
 a+b<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220519112046330\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int a,b;\n    cin>>a>>b;\n    cout<<setbase(16)<<a+b;\n    \/\/printf("%x",a+b);\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h4>\n
\n
\u5934\u6587\u4ef6\uff1a<\/p>\n
#include <\/p>\n
#include <\/p>\n
\u529f\u80fd\uff1a<\/p>\n
std::setw <\/code>\uff1a\u9700\u8981\u586b\u5145\u591a\u5c11\u4e2a\u5b57\u7b26,\u9ed8\u8ba4\u586b\u5145\u7684\u5b57\u7b26\u4e3a' '\u7a7a\u683c<\/p>\n
std::setfill<\/code>\uff1a\u8bbe\u7f6estd::setw\u5c06\u586b\u5145\u4ec0\u4e48\u6837\u7684\u5b57\u7b26\uff0c\u5982:std::setfill('*')<\/p>\n
std::setbase(n)<\/code>\uff1a\u5c06\u8f93\u51fa\u6570\u636e\u8f6c\u6362\u4e3an\u8fdb\u5236<\/p>\n
std::setprecision()<\/code>\uff1a\u63a7\u5236\u8f93\u51fa\u6d41\u663e\u793a\u6d6e\u70b9\u6570\u7684\u6570\u5b57\u4e2a\u6570\uff0cC++\u9ed8\u8ba4\u7684\u6d41\u8f93\u51fa\u6570\u503c\u6709\u6548\u4f4d\u662f6\u3002<\/p>\n<\/blockquote>\n
\u53cd\u5411\u8f93\u51fa\u4e00\u4e2a\u56db\u4f4d\u6570<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220519113935832\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
\u6ca1\u4eba\u8bf4\u53cd\u5411\u56db\u4f4d\u6570\u662f\u4e00\u4e2a\u6570\u5b57\uff0c\u4e0d\u662f\u56db\u4e2a\u6570\u5b57\u554a\uff08\u72d7\u5934\uff09<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    while(n!=0){\n        cout<<n%10;\n        n\/=10;\n    }\n}<\/code><\/pre>\n
 \u7ec4\u961f\u6bd4\u8d5b<\/a><\/h3>\n
\u9898\u76ee<\/h4>\n
\"image-20220519152653640\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int a[3];\n    int i,j,temp;\n    int b = 3681;\n    cin>>a[0]>>a[1]>>a[2]>>a[3];\n\n    do{\n        b = abs((a[0]+a[1])-(a[2]+a[3])) > b ? b : ((a[0]+a[1])-(a[2]+a[3]));\n    }while(next_permutation(a,a+4));\n    printf("%d",b);\n}<\/code><\/pre>\n
\u7eb8\u724c<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220520013131746\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main(){\n    int n;\n    cin >> n;\n    if (n%2 == 0){\n        cout << n\/2;\n    } \n    if (n%2 == 1){\n        cout << n\/2+1;\n    } \n    return 0;\n}<\/code><\/pre>\n
\u89e3\u6790\uff1a\uff08\u8fd9\u91cc\u53c2\u8003\u7684\u662fJesCaim\u5e08\u5085\u7684\u89e3\u6790\u8fc7\u7a0b\uff09<\/h4>\n
\u91c7\u7528\u5bf9\u5206\u6700\u5c0f<\/code>\u7684\u539f\u5219\uff1a\u539f\u6587\u94fe\u63a5\uff1a\u987a\u5e8f\u7ed3\u6784\u4e60\u9898-1042\u7eb8\u724c\u95ee\u9898\u9898\u89e3_\u725b\u5ba2\u535a\u5ba2 (nowcoder.net)<\/a><\/p>\n
\"image-20220520013457546\"<\/div><\/p>\n
\u5f97\u4e0d\u5230\u7684\u7231\u60c5<\/a><\/h3>\n
\u9898\u76ee<\/h4>\n
\"image-20220520020544428\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main(){\n    long long  n,m;\n    cin>>n>>m;\n    cout<<n*m-n-m<<endl;\n    return 0;\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a\u8d5b\u74e6\u7ef4\u65af\u7279\u5b9a\u7406<\/h4>\n
\"image-20220520020505786\"<\/div><\/p>\n
\u6536\u83b7<\/h3>\n
\u53d6\u6574<\/h4>\n
\n
ceil() \u5411\u4e0a\u53d6\u6574\uff0c\u5f80\u8f83\u5927\u7684\u6b63\u6570\u9760\u9f50<\/p>\n
floor() \u5411\u4e0b\u53d6\u6574\uff0c\u5f80\u8f83\u5c0f\u7684\u6b63\u6570\u9760\u9f50<\/p>\n
round() \u56db\u820d\u4e94\u5165<\/p>\n
\u5934\u6587\u4ef6\u662f<\/p>\n<\/blockquote>\n
\u4e0d\u7b49\u5f0f\uff1a<\/h4>\n
\u53ef\u4ee5\u53c2\u8003OI\u4e2d\u4f60\u53ef\u80fd\u4f1a\u7528\u5230\u7684\u4e00\u4e9b\u4e0d\u7b49\u5f0f\u53ca\u5176\u8bc1\u660e - -_- - \u6d1b\u8c37\u535a\u5ba2 (luogu.org)<\/a><\/p>\n
\u5b8c\u6210\u5ea6\u6253\u5361\uff1a<\/h3>\n
\"image-20220520021439832\"<\/div><\/p>\n
\u7b2c\u4e09\u5929<\/h2>\n
\u9001\u5206\u9898<\/a><\/h3>\n
\u9898\u76ee<\/h4>\n
\"image-20220520170334524\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<iostream>\n#include <algorithm>\nusing namespace std;\nint arr[6];\nint main(){\n    int a,b,c;\n    cin>>a>>b>>c;\n    arr[0]=a+b+c;\n    arr[1]=a*(b+c);\n    arr[2]=a*b*c;\n    arr[3]=(a+b)*c;\n    arr[4]=a*b+c;\n    arr[5]=a+b*c;\n    sort(arr,arr+6);\n    cout<<arr[5]; \n    return 0;\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h4>\n
\n
\u67e5\u770b\u76f8\u5173\u535a\u5ba2\uff1a<\/p>\n
sort(first_pointer,first_pointer+n,cmp)<\/code><\/p>\n
\u8be5\u51fd\u6570\u53ef\u4ee5\u7ed9\u6570\u7ec4\uff0c\u6216\u8005\u94fe\u8868list\u3001\u5411\u91cf\u6392\u5e8f\u3002<\/p>\n
\u5b9e\u73b0\u539f\u7406\uff1asort\u5e76\u4e0d\u662f\u7b80\u5355\u7684\u5feb\u901f\u6392\u5e8f\uff0c\u5b83\u5bf9\u666e\u901a\u7684\u5feb\u901f\u6392\u5e8f\u8fdb\u884c\u4e86\u4f18\u5316\uff0c\u6b64\u5916\uff0c\u5b83\u8fd8\u7ed3\u5408\u4e86\u63d2\u5165\u6392\u5e8f\u548c\u63a8\u6392\u5e8f\u3002\u7cfb\u7edf\u4f1a\u6839\u636e\u4f60\u7684\u6570\u636e\u5f62\u5f0f\u548c\u6570\u636e\u91cf\u81ea\u52a8\u9009\u62e9\u5408\u9002\u7684\u6392\u5e8f\u65b9\u6cd5\uff0c\u8fd9\u5e76\u4e0d\u662f\u8bf4\u5b83\u6bcf\u6b21\u6392\u5e8f\u53ea\u9009\u62e9\u4e00\u79cd\u65b9\u6cd5\uff0c\u5b83\u662f\u5728\u4e00\u6b21\u5b8c\u6574\u6392\u5e8f\u4e2d\u4e0d\u540c\u7684\u60c5\u51b5\u9009\u7528\u4e0d\u540c\u65b9\u6cd5\uff0c\u6bd4\u5982\u7ed9\u4e00\u4e2a\u6570\u636e\u91cf\u8f83\u5927\u7684\u6570\u7ec4\u6392\u5e8f\uff0c\u5f00\u59cb\u91c7\u7528\u5feb\u901f\u6392\u5e8f\uff0c\u5206\u6bb5\u9012\u5f52\uff0c\u5206\u6bb5\u4e4b\u540e\u6bcf\u4e00\u6bb5\u7684\u6570\u636e\u91cf\u8fbe\u5230\u4e00\u4e2a\u8f83\u5c0f\u503c\u540e\u5b83\u5c31\u4e0d\u7ee7\u7eed\u5f80\u4e0b\u9012\u5f52\uff0c\u800c\u662f\u9009\u62e9\u63d2\u5165\u6392\u5e8f\uff0c\u5982\u679c\u9012\u5f52\u7684\u592a\u6df1\uff0c\u4ed6\u4f1a\u9009\u62e9\u63a8\u6392\u5e8f\u3002<\/p>\n
\u6b64\u51fd\u6570\u67093\u4e2a\u53c2\u6570\uff1a<\/p>\n
\u53c2\u65701\uff1a\u7b2c\u4e00\u4e2a\u53c2\u6570\u662f\u6570\u7ec4\u7684\u9996\u5730\u5740\uff0c\u4e00\u822c\u5199\u4e0a\u6570\u7ec4\u540d\u5c31\u53ef\u4ee5\uff0c\u56e0\u4e3a\u6570\u7ec4\u540d\u662f\u4e00\u4e2a\u6307\u9488\u5e38\u91cf\u3002<\/p>\n
\u53c2\u65702\uff1a\u7b2c\u4e8c\u4e2a\u53c2\u6570\u76f8\u5bf9\u8f83\u597d\u7406\u89e3\uff0c\u5373\u9996\u5730\u5740\u52a0\u4e0a\u6570\u7ec4\u7684\u957f\u5ea6n\uff08\u4ee3\u8868\u5c3e\u5730\u5740\u7684\u4e0b\u4e00\u5730\u5740\uff09\u3002<\/p>\n
\u53c2\u65703\uff1a\u9ed8\u8ba4\u53ef\u4ee5\u4e0d\u586b\uff0c\u5982\u679c\u4e0d\u586bsort\u4f1a\u9ed8\u8ba4\u6309\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f\u3002\u4e5f\u5c31\u662f1,2,3,4\u6392\u5e8f\u3002\u4e5f\u53ef\u4ee5\u81ea\u5b9a\u4e49\u4e00\u4e2a\u6392\u5e8f\u51fd\u6570\uff0c\u6539\u6392\u5e8f\u65b9\u5f0f\u4e3a\u964d\u5e8f\u4ec0\u4e48\u7684\uff0c\u4e5f\u5c31\u662f4,3,2,1\u8fd9\u6837\u3002<\/p>\n
\u66f4\u591a\u5185\u5bb9\u67e5\u770b\uff1a[C++ \u4e2d\u7684sort()\u6392\u5e8f\u51fd\u6570\u7528\u6cd5 - \u5b66\u4e60\u968f\u7b14\u8bb0 - \u535a\u5ba2\u56ed (cnblogs.com)](https:\/\/www.cnblogs.com\/stones-dream\/p\/10183210.html#:~:text=C%2B%2B<\/a> \u4e2d\u7684sort ()\u6392\u5e8f\u51fd\u6570\u7528\u6cd5. sort,(first_pointer%2Cfirst_pointer%2Bn%2Ccmp) )<\/p>\n<\/blockquote>\n
[NOIP2008]ISBN\u53f7\u7801<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220520181805663\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main()\n{\n    string s;\n    cin >> s;\n    int ans=0;\n    int k=1;\n    for(int i=0;i<=10;i++)\n    {\n        if(s[i]=='-')\n        {\n            continue;\n        }\n        ans+=(s[i]-'0')*(k);\n        ans%=11;\n        k++;\n    }\n    if(ans==10)\n    {\n        if(s[12]=='X') cout << "Right";\n        else\n\n        {\n            s[12] = 'X';\n            cout << s;\n         }\n         return 0;\n    }\n    if(s[12]-'0'==ans)\n    cout << "Right";\n    else\n    {\n        s[12] = ans+'0';\n        cout << s;\n    }\n    return 0;\n}<\/code><\/pre>\n
\u9898\u89e3\uff1a<\/h4>\n
\u672c\u9898\u8bef\u4f1a\u8981\u8f93\u5165\u540e\u5224\u65ad\u7b2c\u56db\u4e2a\u8f93\u5165\u503c\u662f\u5426\u4e3a\u5b57\u7b26\u4e32\u7136\u540e\u518d\u8f6c\u5316\uff0c\u89e3\u9898\u7684\u65f6\u5019\u5341\u5206\u574e\u5777\uff0c\u968f\u540e\u5c31\u770b\u4e86\u70df\u53f0\u5927\u5b66_\u8d3a\u5b9c\u5f64<\/a>\u8fd9\u4f4d\u5e08\u5085\u7684\u9898\u89e3\uff0c\u8c41\u7136\u5f00\u6717\uff0c\u901a\u8fc7\u4e00\u4e2a\u6570\u7ec4\u52a0\u8f7d\u8f93\u5165\u9879\uff0c\u518d\u8bfb\u53d6\u5224\u65ad\uff0c\u66f4\u65b0\u6570\u7ec4\uff0c\u79d2\u4e0d\u53ef\u8a00:dog:!<\/p>\n
\u6536\u83b7\uff1a<\/h3>\n
\u505a\u9898\u7684\u65f6\u5019\u7ecf\u5e38\u5fd8\u8bb0\u53c2\u6570\u8303\u56f4\u5927\u5c0f\u5bfc\u81f4\u65e0\u6cd5\u901a\u8fc7\u6d4b\u8bd5\u6848\u4f8b\uff0c\u4eca\u540e\u4e00\u5b9a\u8981\u6ce8\u610f\uff01\uff01\uff01<\/p>\n
\u5b8c\u6210\u5ea6\u6253\u5361\uff1a<\/h3>\n
\"image-20220520182342097\"<\/div><\/p>\n
\u7b2c\u56db\u5929<\/h2>\n
\u4e0a\u4e0b\u91d1\u5b57\u5854<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220521153848455\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint main(){\n    int n;\n    while(cin>>n){\n        for (int i=1; i<=2*n-1; i++){\n            for (int j=1; j<=2*n-1; j++){\n                if(abs(i - n) + abs(j - n) < n) cout << '*';\n                else cout << ' ' ;\n            }\n            cout << endl;\n        }\n    }\n}<\/code><\/pre>\n
\u5b57\u7b26\u91d1\u5b57\u5854<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220521171017279\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<iostream>\nusing namespace std;\nint main()\n{\n    char c;\n    cin>>c;\n    int n=c-'A'+1;\n    for(int i=1;i<=n;i++)\n    {\n        for(int j=1;j<=n*2-1;j++)\n        {\n            int d=abs(n-i)+abs(n-j);\n            if(d<n) cout<<(char)(c-d);\n            else cout<<' ';\n        }\n        cout<<endl;\n    }\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h3>\n
\u8bb0\u4f4f\u83f1\u5f62\u661f\u661f\u7684\u516c\u5f0f\u4e0e\u601d\u8def\uff0c\u9047\u5230\u7684\u8bdd\u53ef\u4ee5\u5feb\u901f\u91cd\u73b0\u4ee3\u7801\uff0c\u4fdd\u6301\u4ee3\u7801\u6781\u7b80\u5316\u7684\u601d\u60f3\u3002<\/p>\n
\u5b8c\u6210\u5ea6\u6253\u5361<\/h3>\n
\"image-20220521183624334\"<\/div><\/p>\n
\u7b2c\u4e94\u5929<\/h2>\n
\u725b\u725b\u5b66\u6570\u52176<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220522220546611\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<stdio.h>\nint main()\n{\n    int n,i;\n    int a[20]={0,1,1};\n    scanf("%d",&n);\n    for(i=3;i<n;i++) a[i]=a[i-3]+2*a[i-2]+a[i-1];\n    printf("%d",a[i-1]);\n}<\/code><\/pre>\n
 [NOIP2018]\u6807\u9898\u7edf\u8ba1<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220523010342858\"<\/div><\/p>\n
\u89e3\u7b54\uff1a<\/h4>\n
\u4e24\u79cd\u601d\u8def\uff0c\u4e00\u79cd\u662f\u5c06\u5b57\u7b26\u4e32\u4f20\u9012\u5230\u6570\u7ec4\u5185\uff0c\u4e00\u79cd\u662f\u76f4\u63a5\u8ba1\u91cf\uff1a<\/p>\n
\/\/\u4f20\u9012\u6570\u7ec4\n#include<bits\/stdc++.h>\nusing namespace std;\nstring str;\nint main()\n{\n    getline(cin,str);\n    int n = 0;\n    for(int i = 0; i < str.size(); i++)\n    {\n        if(str[i] >= '0' && str[i] <= '9') n++;\n        else if(str[i] >= 'a' && str[i] <= 'z') n++;\n        else if(str[i] >= 'A' && str[i] <= 'Z') n++;\n    }\n    cout<<n<<endl;\n    return 0;\n}\n\/\/\u76f4\u63a5\u8ba1\u91cf\n#include<stdio.h>\nint main()\n{\n    char a;\n    int sum=0;\n    while(scanf("%c",&a)!=EOF)\n    {\n        if(a==' '||a=='\\n')\n        {\n            continue;\n        }\n        sum++;\n    }\n    printf("%d\\n",sum);\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h4>\n
\n
1\u3001\u5f53 cin \u8bfb\u53d6\u6570\u636e\u65f6\uff0c\u5b83\u4f1a\u4f20\u9012\u5e76\u5ffd\u7565\u4efb\u4f55\u524d\u5bfc\u767d\u8272\u7a7a\u683c\u5b57\u7b26\uff08\u7a7a\u683c\u3001\u5236\u8868\u7b26\u6216\u6362\u884c\u7b26\uff09\u3002\u4e00\u65e6\u5b83\u63a5\u89e6\u5230\u7b2c\u4e00\u4e2a\u975e\u7a7a\u683c\u5b57\u7b26\u5373\u5f00\u59cb\u9605\u8bfb\uff0c\u5f53\u5b83\u8bfb\u53d6\u5230\u4e0b\u4e00\u4e2a\u7a7a\u767d\u5b57\u7b26\u65f6\uff0c\u5b83\u5c06\u505c\u6b62\u8bfb\u53d6\u3002<\/p>\n
2\u3001getline \u51fd\u6570\u5982\u4e0b\u6240\u793a\uff1a<\/p>\n
getline(cin, inputLine);<\/code><\/pre>\n
\u5176\u4e2d cin \u662f\u6b63\u5728\u8bfb\u53d6\u7684\u8f93\u5165\u6d41\uff0c\u800c inputLine \u662f\u63a5\u6536\u8f93\u5165\u5b57\u7b26\u4e32\u7684 string \u53d8\u91cf\u7684\u540d\u79f0\u3002<\/p>\n
\u6b64\u51fd\u6570\u53ef\u8bfb\u53d6\u6574\u884c\uff0c\u5305\u62ec\u524d\u5bfc\u548c\u5d4c\u5165\u7684\u7a7a\u683c\uff0c\u5e76\u5c06\u5176\u5b58\u50a8\u5728\u5b57\u7b26\u4e32\u5bf9\u8c61\u4e2d\u3002<\/p>\n<\/blockquote>\n
\u6709\u8da3\u7684\u4e8c\u8fdb\u5236<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220523014304054\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main()\n{\n    long long n;\n    while(cin>>n){\n        bitset<64>s(n);\n        cout<<s.count()<<endl;\n    }\nreturn 0;\n}<\/code><\/pre>\n
#include <iostream>\nusing namespace std;\nint main (){\n    unsigned long long int n;\n    while(cin>>n){\n        int sum = 0;\n        while(n){\n            if(n%2 == 1)\n                sum++;\n            n \/= 2;\n        }\n        cout<<sum<<endl;\n        sum = 0;\n    }\n    return 0;\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h4>\n
\n
bitset\u5b58\u50a8\u4e8c\u8fdb\u5236\u6570\u4f4d\uff0c\u5c31\u50cf\u4e00\u4e2abool\u7c7b\u578b\u7684\u6570\u7ec4\u4e00\u6837\uff0c\u4f46\u662f\u6709\u7a7a\u95f4\u4f18\u5316\u2014\u2014bitset\u4e2d\u7684\u4e00\u4e2a\u5143\u7d20\u4e00\u822c\u53ea\u53601 bit\uff0c\u76f8\u5f53\u4e8e\u4e00\u4e2achar\u5143\u7d20\u6240\u5360\u7a7a\u95f4\u7684\u516b\u5206\u4e4b\u4e00,bitset\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u90fd\u80fd\u5355\u72ec\u88ab\u8bbf\u95ee\uff0c\u6574\u6570\u7c7b\u578b\u548c\u5e03\u5c14\u6570\u7ec4\u90fd\u80fd\u8f6c\u5316\u6210bitset\u3002<\/p>\n
bitset\u7684\u76f8\u5173\u51fd\u6570<\/p>\n
 .size()<\/code> \u8fd4\u56de\u5927\u5c0f\uff08\u4f4d\u6570\uff09
\n .count()<\/code> \u8fd4\u56de1\u7684\u4e2a\u6570
\n .any()<\/code> \u8fd4\u56de\u662f\u5426\u67091
\n .none()<\/code> \u8fd4\u56de\u662f\u5426\u6ca1\u67091
\n .set()<\/code> \u5168\u90fd\u53d8\u62101
\n .set(p)<\/code> \u5c06\u7b2cp + 1\u4f4d\u53d8\u62101
\n .set(p, x)<\/code> \u5c06\u7b2cp + 1\u4f4d\u53d8\u6210x
\n .reset()<\/code> \u5168\u90fd\u53d8\u62100
\n .reset(p)<\/code> \u5c06\u7b2cp + 1\u4f4d\u53d8\u62100
\n .flip()<\/code> \u5168\u90fd\u53d6\u53cd
\n .flip(p)<\/code> \u5c06\u7b2cp + 1\u4f4d\u53d6\u53cd
\n .to_ulong()<\/code> \u8fd4\u56de\u5b83\u8f6c\u6362\u4e3aunsigned long\u7684\u7ed3\u679c\uff0c\u5982\u679c\u8d85\u51fa\u8303\u56f4\u5219\u62a5\u9519
\n .to_ullong()<\/code> \u8fd4\u56de\u5b83\u8f6c\u6362\u4e3aunsigned long long\u7684\u7ed3\u679c\uff0c\u5982\u679c\u8d85\u51fa\u8303\u56f4\u5219\u62a5\u9519
\n .to_string()<\/code> \u8fd4\u56de\u5b83\u8f6c\u6362\u4e3astring\u7684\u7ed3\u679c<\/p>\n
\u66f4\u591a\u53ef\u4ee5\u53c2\u8003\u80e1\u5c0f\u5154\u7684OI\u535a\u5ba2<\/a><\/p>\n<\/blockquote>\n
 [NOIP2006]\u6570\u5217<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220523020002859\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main() {\n    long long k,n,sum=0,f=1;\n    cin>>k>>n;\n    while(n) {\n        sum+=(n%2)*f;\n        f*=k;\n        n\/=2;\n    }\n    cout<<sum<<endl;\n    return 0;\n}<\/code><\/pre>\n
\u53ea\u80fd\u5403\u571f\u8c46\u7684\u725b\u725b<\/a><\/h3>\n
\u9898\u76ee\uff1a<\/h4>\n
\"image-20220523020206862\"<\/div><\/p>\n
\u9898\u89e3\uff1a<\/h4>\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main() {\n    int t;\n    cin>>t;\n    for(int i=1; i<=t; i++) {\n        long long k,f=1,sum=0;\n        cin>>k;\n        while(k) {\n            sum+=(k%2)*f;\n            f*=3;\n            k\/=2;\n        }\n        cout<<"Case #"<<i<<": "<<sum<<endl;\n    }\n    return 0;\n}<\/code><\/pre>\n
\u6536\u83b7\uff1a<\/h3>\n
\u6570\u5217\u548c\u53ea\u80fd\u5403\u571f\u8c46\u7684\u725b\u725b\u90fd\u9075\u4ece\u4e00\u6837\u7684\u903b\u8f91\uff0c\u4ee5\u6570\u5217\u4e3a\u4f8b\uff1a<\/p>\n
\n
k=3\u65f6\uff0c\u6570\u5217\u4e3a\uff1a1\uff0c3\uff0c4\uff0c9\uff0c10\uff0c12\uff0c13..<\/code>\u8f6c\u6362\u6210\u4e09\u8fdb\u5236\u5c31\u662f\uff1a1\uff0c10\uff0c11\uff0c100\uff0c101\uff0c110\uff0c111..<\/code>\u770b\u8d77\u6765\u50cf\u662f\u4e8c\u8fdb\u5236\uff0c\u8f6c\u5316\u6210\u5341\u8fdb\u5236\u770b\u770b1,2,3,4,5,6,7..<\/code>\u663e\u7136,\u7b2cn\u9879\u5c31\u662fn\uff0c\u7a0b\u5e8f\u5c31\u628a\u8fd9\u4e2a\u8fc7\u7a0b\u9006\u56de\u53bb\uff0c\u5148\u628an\u8f6c\u6362\u6210\u4e8c\u8fdb\u5236\uff0c\u518d\u628a\u5b83\u5f53\u6210K\u8fdb\u5236\uff0c\u91cd\u65b0\u8f6c\u6362\u4e3a\u5341\u8fdb\u5236.<\/p>\n<\/blockquote>\n
\u5b8c\u6210\u5ea6\u6253\u5361\uff1a<\/h3>\n
\"image-20220523020345598\"<\/div><\/p>\n","protected":false},"excerpt":{"rendered":"
\u7b97\u6cd5\u5165\u95e8 \u7b2c\u4e00\u5929 \u9996\u5148\u5fc5\u987b\u63d0\u4e00\u4e0b\u4e07\u80fd\u5934#include<bits\/stdc++.h> \u6392\u5217\u5f0f \u9898\u76ee […]<\/p>\n","protected":false},"author":1,"featured_media":118,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14,25],"tags":[],"class_list":["post-156","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-acm","category-25"],"_links":{"self":[{"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/posts\/156","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/comments?post=156"}],"version-history":[{"count":4,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/posts\/156\/revisions"}],"predecessor-version":[{"id":456,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/posts\/156\/revisions\/456"}],"wp:featuredmedia":[{"embeddable":true,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/media\/118"}],"wp:attachment":[{"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/media?parent=156"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/categories?post=156"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/162.14.82.114\/index.php\/wp-json\/wp\/v2\/tags?post=156"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}