{"id":631,"date":"2025-11-02T20:13:53","date_gmt":"2025-11-02T12:13:53","guid":{"rendered":"https:\/\/www.george-blog.top\/?p=631"},"modified":"2025-11-02T20:47:08","modified_gmt":"2025-11-02T12:47:08","slug":"2025-acmtc%e7%ac%ac%e4%b8%89%e6%ac%a1%e6%8b%9b%e6%96%b0%e8%b5%9b%e9%a2%98%e8%a7%a3","status":"publish","type":"post","link":"https:\/\/www.george-blog.top\/?p=631","title":{"rendered":"2025–ACM&TC\u7b2c\u4e09\u6b21\u62db\u65b0\u8d5b\u9898\u89e3"},"content":{"rendered":"

2025--ACM&TC\u7b2c\u4e09\u6b21\u62db\u65b0\u8d5b\u9898\u89e3<\/h1>\n

\u9898\u76ee\u96be\u5ea6\uff1a<\/h2>\n

\u7b7e\u5230\uff1a9\u300112<\/p>\n

\u7b80\u5355\uff1a2\u30015\u30018\u300111<\/p>\n

\u4e2d\u7b49\uff1a3\u30014\u30017<\/p>\n

\u56f0\u96be\uff1a1\u30016\u300110<\/p>\n

\u9898\u89e3<\/h2>\n

1\u3001\u4e2d\u4f4d\u6570<\/h3>\n

\u9898\u76ee\u7ed9\u51fa\u7684n\u4e3a\u5947\u6570\uff0c\u90a3\u4e48\u6700\u7ec8\u7684\u4e2d\u4f4d\u6570\u4e00\u5b9a\u662f\u4e2d\u95f4\u7684\u90a3\u4e2a\u6570\uff0c\u4e8e\u662f\u6211\u4eec\u53ef\u4ee5\u4e8c\u5206\u7b54\u6848\uff0c\u4e0d\u65ad\u5730\u53bb\u679a\u4e3e\u7b54\u6848<\/p>\n

#include <bits\/stdc++.h>\nusing namespace std;\n#define int long long\n\nint a[200005];\nint n, k;\n\nbool check(int x) {\n    int sum = 0;\n    int m = (n + 1) \/ 2; \n    for (int i = m; i <= n; i++) {\n        if (a[i] < x) {\n            sum += x - a[i];  \n            if (sum > k) return 1; \n        }\n    }\n    return sum > k;  \n}\n\nsigned main() {\n    ios::sync_with_stdio(0);\n    cin.tie(0);\n\n    cin >> n >> k;\n    for (int i = 1; i <= n; i++) {\n        cin >> a[i];\n    }\n    sort(a + 1, a + 1 + n); \n\n    int l = a[(n + 1) \/ 2], r = 1e18;  \n    while (l + 1 < r) {\n        int mid = (l + r) \/ 2;\n        if (check(mid)) {\n            r = mid; \n        } else {\n            l = mid; \n        }\n    }\n    cout << l << '\\n';  \n\n}<\/code><\/pre>\n
2\u3001\u6015\u6302\u79d1\u7684George<\/h3>\n
\u8fd9\u9898\u8003\u7684\u5c31\u662f\u7ed3\u6784\u4f53\u7684\u6392\u5e8f\uff0c\u4e5f\u662f\u770b\u770b\u4e00\u4e9b\u4eba\u8865\u6ca1\u8865\u9898\uff0c\u5982\u679c\u7b2c\u4e00\u573a\u62db\u65b0\u8d5b\u7684\u7b2c 4 \u9898\u6ca1\u5199\u51fa\u6765\u4f46\u8865\u4e86\u7684\u8bdd\uff0c\u8fd9\u4e00\u9898\u4e5f\u662f\u80af\u5b9a\u80fd\u5199\u51fa\u6765\u7684\u3002\u7136\u540e\u5c31\u662f\u5e73\u5747\u6570\u8bb0\u5f97\u5f00float\u6216\u8005double\uff0c\u611f\u89c9\u4f1a\u6709\u5f88\u591a\u4eba\u5f00int\u7136\u540eWA\u597d\u591a\u53d1\uff08\u5b66\u957f\u8d5b\u524d\u9884\u6d4b\uff09<\/del>\uff0c\u5b66\u957f\u51fa\u9898\u7684\u65f6\u5019\u4e13\u95e8\u624b\u6413\u4e86\u51e0\u4e2a\u5361 int \u7684\u6570\u636e\uff0c\u563f\u563f~\u3002<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\nstruct stus{\n    int s,a;\n}stu[105];\n\nbool cmp(stus c,stus d){\n    return c.s<d.s;\n}\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n    int n,m;\n    cin>>n>>m;\n    double sum=0;\n    for(int i=1;i<=n;++i){\n        cin>>stu[i].s>>stu[i].a;\n        sum+=stu[i].a;\n        if(stu[i].s==m&&stu[i].a<60)\n            stu[i].a=60;\n    }\n    double avg=sum\/n;\n    for(int i=1;i<=n;++i){\n        if(stu[i].s!=m&&stu[i].a>=avg){\n            stu[i].a=max(stu[i].a-2,0);\n        }\n    }\n    sort(stu+1,stu+n+1,cmp);\n    for(int i=1;i<=n;++i){\n        cout<<stu[i].a<<" ";\n    }\n    cout<<endl;\n    return 0;\n}<\/code><\/pre>\n
3\u3001\u4f4d\u8fd0\u7b97\u7ec8\u4e8e\u6765\u4e86<\/h3>\n
\u8fd9\u9053\u9898\u4f60\u9996\u5148\u8981\u6e05\u695a \u5f02\u6216\u8fd0\u7b97\u662f\u4ec0\u4e48\uff0c\u5f53\u524d\u4f4d\u76f8\u540c\u4e3a0\uff0c\u4e0d\u540c\u4e3a1\uff0c\u8fd9\u6837\u6839\u636e\u8fd9\u4e2a\u89c4\u5f8b\u6211\u4eec\u53ef\u4ee5\u5728a\u7684\u5f53\u524d\u4f4d\u4e0eb\u7684\u5f53\u524d\u4f4d\u4e0d\u540c\u65f6\u8ba9a\u53bb\u5f02\u62162\u7684\u5f53\u524d\u4f4d\u6b21\u5e42(1,10,100,1000....)\uff0c\u6bd4\u5982a\uff1a(1001), b: (110),\u5f53\u679a\u4e3e\u5230\u7b2c1\u4f4d\uff08\u4ece\u540e\u5f80\u524d\uff09a\u4e3a0\uff0cb\u4e3a1\u90a3\u9700\u8981\u8ba9a\u5f02\u62162\u76841\u6b21\u65b9\uff0c\u53ef\u4ee5\u8ba9a\u7684\u5f53\u524d\u4f4d\u53d8\u4e3a1\uff0c<\/em><\/u>\u8fd9\u6837\u4f60\u4f1a\u53d1\u73b0\u5f53\u5230\u8fbe\u5f53\u524d\u4f4d\u679a\u4e3e\u8fc7\u7684\u4f4d\u90fd\u662f\u76f8\u540c\u7684\uff0c\u5982\u679c\u679a\u4e3e\u52302\u7684k\u6b21\u65b9\u5927\u4e8ea\uff0c\u90a3\u4e48\u4e0d\u53ef\u80fd\u8ba9a\u6700\u7ec8\u7b49\u4e8eb\uff0c\u5f53\u7136\u8fd8\u6709\u522b\u7684\u505a\u6cd5<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\n#define int long long\n\nint ksm(int a, int b){\n    int ans = 1;\n    while(b){\n        if(b % 2){\n            ans = ans * a;\n        }\n        b = b \/ 2;\n        a = a * a;\n    }\n    return ans;\n}\nvoid solve(){\n    int a, b;\n    cin >> a >> b;\n    if(a == b){\n        cout << 0 << '\\n';\n        return;\n    }\n    int aa = a;\n    vector<int> ans;\n    string s;\n    for(int i = 0;; i++){\n        if (a == 0 && b == 0) break;\n        int x = ksm(2, i);\n        if((a & 1) != (b & 1)){\n            ans.push_back(x);\n            if(x > aa){\n            cout << -1 << '\\n';\n            return;\n        }\n        }\n        a = a >> 1;\n        b = b >> 1;\n    }\n    cout << ans.size() << '\\n';\n    for(auto t : ans){\n        cout << t << ' ';\n    }\n    cout << '\\n';\n}\nsigned main(){\n    ios::sync_with_stdio(0);\n    cin.tie(0);\n\n    int t;\n    cin >> t;\n    while(t--){\n        solve();\n    }\n}<\/code><\/pre>\n
4\u3001\u6211\u8981\u6253\u74e6\uff01\u9897\u79d2\uff01\uff01\u68d2\u68d2\u68d2\u68d2\uff01\uff01\uff01<\/h3>\n
\u8fd9\u9898\u8003\u7684\u5c31\u662f\u4f60\u4eec\u9ad8\u4e2d\u5b66\u7684n\u7684\u5e73\u65b9\u7684\u524dn\u9879\u548c\u901a\u9879\u516c\u5f0f\uff08\u4e0d\u77e5\u9053\u4f60\u4eec\u8001\u5e08\u6709\u6ca1\u6709\u8ba9\u80cc\u8fc7\uff0c\u5927\u90e8\u5206\u8001\u5e08\u5e94\u8be5\u90fd\u8ba9\u80cc\u8fc7\uff09\u3002\u4e0d\u8981\u89c9\u5f97\u8fd9\u9898\u5f88\u5947\u602a\uff0c\u6570\u5b66\u5728\u8ba1\u7b97\u673a\u53ca ACM \u4e2d\u5f88\u91cd\u8981\uff0c\u8bf4\u767d\u4e86\u5bf9\u4e8e ACM \u6765\u8bf4\u7f16\u7a0b\u8bed\u8a00\u53ea\u662f\u5de5\u5177\uff0c\u89e3\u9898\u601d\u8def\u5927\u90e8\u5206\u90fd\u662f\u9760\u6570\u5b66\u601d\u7ef4\uff0c\u5305\u62ec\u4f60\u4eec\u5b66\u7684\u9ad8\u6570\uff0c\u548c\u4ee5\u540e\u5b66\u7684\u7ebf\u4ee3\u3001\u79bb\u6563\u3001\u6982\u7387\u8bba\u7b49\u90fd\u4f1a\u662f ACM \u7684\u8003\u70b9\uff08\u6211\u8bb0\u5f97\u53bb\u5e74\u62db\u65b0\u8d5b\uff0c\u6211\u4eec\u5b66\u957f\u7ed9\u6211\u4eec\u51fa\u4e86\u4e00\u9053\u4e8c\u9879\u5f0f\u5b9a\u7406\uff0c\u611f\u5174\u8da3\u7684\u81ea\u5df1\u53ef\u4ee5\u770b\u4e00\u4e0b\uff09\uff0c\u8ba1\u7b97\u673a\u548c\u6570\u5b66\u76f8\u5173\u6027\u5f88\u5927\u7684\uff0c\u6bd4\u5982\u6570\u5b66\u4e2d\u7684\u79bb\u6563\u548c\u8ba1\u7b97\u673a\u4e2d\u7684\u6570\u636e\u7ed3\u6784\u91cd\u5408\u5ea6\u5f88\u9ad8\uff0c\u5185\u5bb9\u5927\u90e8\u5206\u90fd\u4e00\u6837\u3002\u8fd9\u9898\u7684\u9898\u89e3\u5e9f\u8bdd\u6709\u70b9\u591a\u4e86\uff0c\u4e3b\u8981\u4e5f\u662f\u60f3\u8981\u8ba9\u4f60\u4eec\u4e86\u89e3\u4e00\u4e0b\u6570\u5b66\u548c\u8ba1\u7b97\u673a\u7684\u5173\u7cfb\uff0c\u4e0b\u9762\u662f\u6b63\u5f0f\u9898\u89e3\uff1a<\/p>\n
\u968f\u4fbf\u4e3e\u51e0\u4e2a\u4f8b\u5b50\u753b\u753b\u56fe\u5c31\u80fd\u77e5\u9053\u79fb\u52a8\u7684\u8def\u7ebf\u5c3d\u53ef\u80fd\u5f80\u4e2d\u95f4\u9760\u624d\u80fd\u8ba9 ans \u6700\u5927\u5316\uff0c\u6240\u4ee5\u4f7f ans \u6700\u5927\u5316\u7684\u8def\u7ebf\u5c31\u662f\u5148\u5411\u53f3\u518d\u5411\u4e0b\uff0c\u8fd9\u6837\u4e00\u76f4\u5faa\u73af\u5230 (n,n) \u3002\u901a\u8fc7\u4e0b\u9762\u4e24\u4e2a\u91cd\u8981\u7684\u6570\u5b66\u516c\u5f0f<\/strong>\uff0c\u53ef\u4ee5\u63a8\u5bfc\u51fa\u7b54\u6848\u4e3a\uff1an * (n + 1) * (4 * n - 1) \/ 6<\/strong>\u3002\u9700\u8981\u6ce8\u610f\u6b64\u9898\u9664\u6cd5\u653e\u5728\u6700\u540e<\/strong>\uff0c\u907f\u514d\u524d\u9762\u6ca1\u9664\u5c3d\uff0c\u51fa\u73b0\u5c0f\u6570\u9020\u6210\u8bef\u5dee\uff0c\u6a21\u6570 2022 \u6700\u540e\u53ef\u4ee5\u548c\u5206\u6bcd 6 \u7ea6\u5206\u6210 337 \uff1b\u8fd8\u6709\u5c31\u662f\u8fb9\u8fd0\u7b97\u8fb9\u53d6\u6a21<\/strong>\uff0c\u56e0\u4e3a\u8ba1\u7b97\u8fc7\u7a0b\u4e2d\u4f1a\u8d85\u51fa long long \u7684\u8303\u56f4 1e18 \uff1b\u4ee5\u53can\u4e5f\u9700\u8981\u5f00long long<\/strong> \uff0c\u56e0\u4e3an\u53c2\u4e0e\u4e0b\u9762ans\u7684\u8ba1\u7b97\u4e86\u3002\u5177\u4f53\u8ba1\u7b97\u8fc7\u7a0b\u89c1\u4e0b\u56fe\uff0c\u9ec4\u7ebf\u548c\u5c31\u662fn\u7684\u5e73\u65b9\u7684\u524dn\u9879\u548c\u901a\u9879\u516c\u5f0f<\/strong>\uff0c\u6a59\u7ebf\u548c\u5219\u53ef\u4ee5\u62c6\u6210\u7b49\u5dee\u6570\u5217\u7684\u524dn\u9879\u548c\u901a\u9879\u516c\u5f0f<\/strong>\u4e0en\u7684\u5e73\u65b9\u7684\u524dn\u9879\u548c\u901a\u9879\u516c\u5f0f<\/strong>\u7684\u548c\u3002<\/p>\n
\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\nconst int mod=1e9+7;\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n    int t;\n    cin>>t;\n    while(t--){\n        long long n;\n        cin>>n;\n        long long ans=337*n%mod*(n+1)%mod*(4*n-1)%mod;\n        cout<<ans<<endl;\n    }\n    return 0;\n}<\/code><\/pre>\n
5\u3001\u5e26\u6d3e\u4e0d\u8001\u94c1?<\/h3>\n
\u8d77\u59cb\u4f4d\u7f6e\u7531 ( 0 , 0 ) \u5230 ( x , y ) \uff0c\u5176\u7ed3\u679c\u53ea\u6709\u4e09\u79cd\u60c5\u51b5\u3002
\n1.\u8f93\u51fa\u7ed3\u679c\u4e3a-1\uff1a\u5f53x=y\u6216x=y+1\u6216y=1\u65f6\uff0c\u6b64\u65f6\u4e00\u5b9a\u4e0d\u6ee1\u8db3\u9898\u76ee\u8981\u6c42\uff0c\u8f93\u51fa-1\uff1b
\n2.\u8f93\u51fa\u7ed3\u679c\u4e3a2\uff1a\u6ee1\u8db3y>x\u5373\u53ef
\n3.\u8f93\u51fa\u7ed3\u679c\u4e3a3\uff1a\u5269\u4e0b\u7684\u60c5\u51b5\u90fd\u662f3\u6b65<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n    int t;\n    cin>>t;\n    while(t--){\n        int x,y;\n        cin>>x>>y;\n        if(x==y||x==y+1||y==1)\n            cout<<-1<<endl;\n        else if(x<y)\n            cout<<2<<endl;\n        else\n            cout<<3<<endl;\n    }\n    return 0;\n}\n\n\/\/\n\/\/ \u2800\u2800\u2800             \u2800\u28b8\u28ff\u28ff\u28ff\u2800\u28fc\u28ff\u28ff\u28e6\u2840\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28c0\u2800\u2800\u2800 \u2800\u28b8\u28ff\u28ff\u285f\u28b0\u28ff\u28ff\u28ff\u281f\u2801\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28b0\u28ff\u283f\u28bf\u28e6\u28c0\u2800\u2818\u281b\u281b\u2803\u2838\u283f\u281f\u28eb\u28f4\u28f6\u28fe\u2846\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2838\u28ff\u2840\u2800\u2809\u28bf\u28e6\u2840\u2800\u2800\u2800\u2800\u2800\u2800 \u281b\u283f\u283f\u28ff\u2803\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2819\u28bf\u28e6\u2800\u2800\u2839\u28ff\u28f6\u287e\u281b\u281b\u28b7\u28e6\u28c4\u2800\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28ff\u28e7\u2800\u2800\u2808\u2809\u28c0\u2840\u2800 \u2800\u2819\u28bf\u2847\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2880\u28e0\u28f4\u287f\u281f\u280b\u2800\u2800\u28a0\u28fe\u281f\u2803\u2800\u2800\u2800\u28b8\u28ff\u2846\n\/\/ \u2800\u2800\u2800\u2880\u28e0\u28f6\u287f\u281b\u2809\u2800\u2800\u2800\u2800\u2800\u28fe\u2847\u2800\u2800\u2800\u2800\u2800\u28b8\u28ff\u2807\n\/\/ \u2880\u28e0\u28fe\u283f\u281b\u2801\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2880\u28fc\u28e7\u28c0\u2800\u2800\u2800\u2880\u28fc\u2807\n\/\/ \u2808\u280b\u2801\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2880\u28f4\u287f\u280b\u2819\u281b\u281b\u281b\u281b\u281b\u2801\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28c0\u28fe\u287f\u280b\u2800\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28be\u283f\u280b \n\/\/<\/code><\/pre>\n
6\u3001\u641c\u7d22\u677f\u5b50\u9898<\/h3>\n
\u548c\u9898\u76ee\u540d\u4e00\u6837\uff0c\u5c31\u662f\u641c\u7d22\u677f\u5b50\u9898\uff0c BFS \u548c DFS \u90fd\u80fd\u5199\uff0c\u8fd9\u91cc\u653e\u7684\u662f BFS \u7684AC\u7801\uff0c\u4e3b\u8981\u5c31\u662f\u8ba9\u5b66\u4f1a\u641c\u7d22\u7684\u4eba\u90fd\u80fdAC\uff0c\u6240\u4ee5\u4e5f\u6ca1\u6d89\u53ca\u4efb\u4f55\u601d\u7ef4\uff0c\u5c31\u7eaf\u677f\u5b50\u3002\u8003\u8651\u5230\u8fd9\u662f\u4f60\u4eec\u57f9\u8bad\u8bb2\u7684\u6700\u96be\u7684\u7b97\u6cd5\uff0c\u4f30\u8ba1\u6709\u597d\u591a\u4eba\u8fd8\u6ca1\u5b66\uff0c\u6240\u4ee5\u5f52\u5230\u4e86\u56f0\u96be\u9898\u3002<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\ntypedef pair<int, int> pii;\n\nint w, h;\nchar graph[1001][1001];\nbool visited[1001][1001];\n\nint cnt = 0;\n\nvoid bfs(int startx, int starty) {\n    queue<pii> q;\n    q.push({startx, starty});\n    visited[startx][starty] = true;\n    cnt++;\n\n    int dx[] = {-1, 0, 1, 0};\n    int dy[] = {0, 1, 0, -1};\n\n    while (!q.empty()) {\n        int currentx = q.front().first;\n        int currenty = q.front().second;\n        q.pop();\n\n        for (int i = 0; i < 4; ++i) {\n            int newx = currentx + dx[i];\n            int newy = currenty + dy[i];\n\n            if (newx >= 0 && newx < h && newy >= 0 && newy < w && graph[newx][newy] == '.' && !visited[newx][newy]) {\n                q.push({newx, newy}); \n                visited[newx][newy] = true;\n                cnt++;\n            }\n        }\n    }\n}\n\nint main() {\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n\n    int startx, starty;\n    cin >> w >> h;\n\n    for (int i = 0; i < h; ++i) {\n        for (int j = 0; j < w; ++j) {\n            cin >> graph[i][j];\n            if (graph[i][j] == '@') {\n                startx = i;\n                starty = j;\n            }\n        }\n    }\n\n    bfs(startx, starty);\n    cout << cnt << endl;\n\n    return 0;\n}<\/code><\/pre>\n
7\u3001\u6570\u597d\u6570\u5b57<\/h3>\n
\u8fd9\u9898\u662f\u4e00\u4e2a\u7b80\u5355\u6570\u8bba\uff0c\u867d\u7136\u96be\u5ea6\u4e0d\u9ad8\uff0c\u4f46\u7531\u4e8e\u662f\u6570\u8bba\u6211\u4eec\u8fd8\u662f\u628a\u5b83\u5f52\u4e3a\u4e86\u4e2d\u7b49\u9898\u3002<\/p>\n
\u5927\u6982\u5c31\u662f\u6839\u636e\u597d\u6570<\/strong>\u7684\u5468\u671f\u6027\uff0c\u4ee5210\u4e3a\u5468\u671f\uff0c\u6bcf\u4e2a210\u5185\u7684\u597d\u6570\u6570\u91cf\u90fd\u4e00\u6837\u3002<\/p>\n
\u5148\u8ba1\u7b97\u4e00\u4e0b 2 \u5230 r \u7684\u597d\u6570\u6570\u91cf\uff0c\u518d\u8ba1\u7b97\u4e00\u4e0b 2 \u5230 l \u7684\u597d\u6570\u6570\u91cf\uff0c\u7136\u540e\u4e00\u51cf\u5c31\u662f l \u5230 r \u7684\u597d\u6570\u6570\u91cf\u3002<\/p>\n
\u6ce8\u610f\u5f00long long\uff01\uff01\uff01<\/p>\n
#include <iostream>\nusing namespace std;\n#define endl "\\n"\n\nconst int LCM = 210; \/\/ 2*3*5*7=210\n\n\/\/ \u5224\u65ad\u4e00\u4e2a\u6570\u662f\u5426\u4e0d\u88ab2\u30013\u30015\u30017\u4e2d\u7684\u4efb\u4f55\u4e00\u4e2a\u6574\u9664\nbool good(int x) {\n    return x % 2 > 0 && x % 3 > 0 && x % 5 > 0 && x % 7 > 0;\n}\n\n\/\/ \u8ba1\u7b97[0, x)\u8303\u56f4\u5185\u6ee1\u8db3good\u6761\u4ef6\u7684\u6570\u5b57\u6570\u91cf\nint get_naive(int x) {\n    int ans = 0;\n    for (int i = 1; i <= x; ++i) {\n        if (good(i)) {\n            ans++;\n        }\n    }\n    return ans;\n}\n\n\/\/ \u4f18\u5316\u8ba1\u7b97\uff1a\u5229\u7528210\u662f2\u30013\u30015\u30017\u7684\u6700\u5c0f\u516c\u500d\u6570\uff0c\u51cf\u5c11\u91cd\u590d\u8ba1\u7b97\nlong long get(long long r) {\n    return (r \/ LCM) *48 + get_naive(r % LCM);\n}  \n\nint main() {\n    int t;\n    cin >> t;\n\n    while (t--) {\n        long long l, r;\n        cin >> l >> r;\n        \/\/ \u8ba1\u7b97[l, r]\u8303\u56f4\u5185\u6ee1\u8db3\u6761\u4ef6\u7684\u6570\u5b57\u6570\u91cf\n        cout << get(r) - get(l-1) << endl;\n    }\n\n    return 0;\n}<\/code><\/pre>\n
8\u3001\u4ec0\u4e48\uff1f\u4f60...\u4f60\u7adf\u7136\u662f\u5c0a\u8d35\u7684\u4f20\u5947\u738b\u8005\uff1f<\/h3>\n
\u7b80\u5355\u6570\u5b66\u9898\uff0c\u7531\u5947+\u5947=\u5076\u3001\u5076+\u5076=\u5076\u3001\u5947+\u5076=\u5947\uff0c\u6240\u4ee5\u53ea\u9700\u7edf\u8ba1\u4e00\u4e0b\u5947\u5076\u6570\u91cf\uff0c\u5982\u679c\u5947\u5076\u6570\u91cf\u76f8\u7b49\uff0c\u5219\u5c31\u80fd\u6070\u597d\u5206\u5272\uff0c\u5219\u8f93\u51fa \u201c Yes \u201d \uff0c\u5426\u5219\u8f93\u51fa \u201c No \u201d \u3002<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\nint a[205]={};\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n    int t;\n    cin>>t;\n    while(t--){\n        int cntj=0,cnto=0;\n        int n;\n        cin>>n;\n        for(int i=0;i<2*n;++i){\n            cin>>a[i];\n            if(a[i]%2==1)\n                cntj++;\n            else\n                cnto++;\n        }\n        if(cntj==cnto)\n            cout<<"Yes"<<endl;\n        else\n            cout<<"No"<<endl;\n\n    }\n    return 0;\n}<\/code><\/pre>\n
9\u3001\u8fd9\u662f\u4ec0\u4e48\u56fe\u5f62<\/h3>\n
\u8fd9\u662f\u4e00\u9053\u5c0f\u5b66\u9898\uff0c\u6b63\u65b9\u5f62\u7684\u6027\u8d28\u53ef\u77e5\u5bf9\u89d2\u7ebf\u76f8\u7b49\uff0c\u90a3\u4e48\u4e00\u534a\u90fd\u76f8\u7b49<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    ios::sync_with_stdio(0);\n    cin.tie(0);\n    int t;\n    cin >> t;\n    while (t--) {\n        int l, r, d, u;\n        cin >> l >> r >> d >> u;\n        if (l == r && d == u && l == d) {\n            cout << "Yes\\n";\n        } else {\n            cout << "No\\n";\n        }\n    }\n    return 0;\n}<\/code><\/pre>\n
10\u3001haxin\u5b66\u59d0\u7684\u65c5\u7a0b\u89c4\u5212<\/h3>\n
\u8ba9\u6211\u4eec\u628a\u9648\u8ff0\u4e2d\u7ed9\u51fa\u7684\u7b49\u5f0f\u53d8\u5f62\u91cd\u65b0\u5199\u6210 $c{i+1}\u2212b<\/em>{c{i+1}}=c<\/em>{i}\u2212b{c<\/em>{i}}$ \u3002\u8fd9\u610f\u5473\u7740\u6211\u4eec\u65c5\u884c\u8ba1\u5212\u4e2d\u8def\u5f84\u4e0a\u7684\u6240\u6709\u57ce\u5e02\u5c06\u5177\u6709\u76f8\u540c\u7684 $i\u2212b_{i}$ \u503c\uff0c\u5373\u7d22\u5f15\u503c\u51cf\u53bb\u5bf9\u5e94\u7684\u7f8e\u4e3d\u503c\uff0c\u8fd9\u4e2a\u6027\u8d28\u53ef\u4ee5\u901a\u8fc7\u4e0a\u9762\u90a3\u79cd\u5bf9\u9898\u76ee\u4e2d\u7684\u7b49\u5f0f\u8fdb\u884c\u53d8\u5f62\u5f97\u5230\uff0c\u4e5f\u53ef\u4ee5\u901a\u8fc7\u753b\u56fe\u5f97\u77e5\uff0c\u5c31\u81ea\u5df1\u753b\u4e24\u4e2a\u7ebf\u6bb5\u7136\u540e\u5c31\u80fd\u7422\u78e8\u51fa\u6765\u3002<\/p>\n
\u8fd9\u9898\u7528\u5230C++\u7684\u4e00\u4e2amap\u5bb9\u5668\uff0c\u6ca1\u5b66\u8fc7\u7684\u5b66\u4e00\u4e0b\uff0c\u8fd9\u4e2a\u5bb9\u5668\u633a\u91cd\u8981\u7684\uff0c\u5927\u6982\u5c31\u662f\u80fd\u5c06\u4e24\u4e2a\u91cf\u5173\u8054\u8d77\u6765\u3002\u8fd9\u4e00\u9898\u7684\u601d\u8def\u5c31\u662f\u5148\u904d\u5386\u4e00\u904d\u6570\u7ec4b\uff0c\u5e76\u7528map\u7684\u7b2c\u4e00\u4e2a\u53c2\u6570\u653e $i\u2212b{i}$ \u503c\uff0c\u5c06 $i\u2212b<\/em>{i}$ \u503c\u76f8\u540c\u7684\u5143\u7d20\u7684\u503c\u7d2f\u52a0\u8d77\u6765\u5b58\u5230\u7b2c\u4e8c\u4e2a\u53c2\u6570\u4e2d\uff0c\u8fd9\u6837\u5c31\u628a $i\u2212b{i}$ \u503c\u548c\u4e0e\u5b83\u76f8\u5bf9\u5e94\u7684\u7f8e\u4e3d\u503c\u4e4b\u548c\u5173\u8054\u5728\u4e00\u8d77\u4e86\uff0c\u901a\u8fc7\u7b2c\u4e00\u4e2a\u53c2\u6570\u7684\u503c\u5c31\u80fd\u76f4\u63a5\u8bbf\u95ee\u5230\u4e0e\u4e4b\u5bf9\u5e94\u7684\u7b2c\u4e8c\u4e2a\u53c2\u6570\u7684\u503c\u3002\u6b64\u5916\uff0c\u628a\u6570\u7ec4\u4ece\u5934\u904d\u5386\u5230\u5c3e\uff0c\u5c31\u662f\u6ee1\u8db3\u4e86\u9898\u76ee\u4e2d\u5e8f\u5217\u4e25\u683c\u9012\u589e\u7684\u8981\u6c42\u3002\u6700\u540e\u518d\u904d\u5386\u4e00\u904dmap\uff0cmap\u4e2d\u6700\u5927\u7684\u7b2c\u4e8c\u4e2a\u53c2\u6570\u503c\u5c31\u662f\u7b54\u6848\uff0c\u5373\u6700\u5927\u7f8e\u4e3d\u503c\u3002\u53e6\u5916\uff0c\u6570\u636e\u8303\u56f4\u4e0a\uff0c\u867d\u7136n\u548c $b<\/em>{i}$ \u90fd\u6ca1\u8d85\u8fc7 int \u8303\u56f4\uff0c\u4f46\u662f\u7b54\u6848\u6709\u53ef\u80fd\u5c06 n \u4e2a $b_{i}$ \u76f8\u52a0\uff0c\u8fd9\u5c31\u8d85\u8fc7\u4e86 int \u8303\u56f4\uff0c\u6240\u4ee5\u8981\u5f00long long\uff0cmap\u7684\u7b2c\u4e8c\u4e2a\u53c2\u6570\u548c ans \u90fd\u8981\u5f00 long long\u3002<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\nint b[200050]={};\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n    int n;\n    cin>>n;\n    map<int,long long>mapp;\n    for(int i=1;i<=n;++i){\n        cin>>b[i];\n    }\n    int x;\n    for(int i=1;i<=n;++i){\n        x=i-b[i];\n        mapp[x]+=b[i];\n    }\n    long long ans=0;\n    for(auto p:mapp){\n        if(p.second>ans)\n            ans=p.second;\n    }\n    cout<<ans<<endl;\n    return 0;\n}<\/code><\/pre>\n
11\u3001\u6311\u5254\u7684\u732b<\/h3>\n
\u601d\u8def\uff1a\u5728\u5f00\u59cb\u4e4b\u524d\uff0c\u6211\u4eec\u5148\u6c42\u51fa\u6240\u6709\u5143\u7d20\u7684\u7edd\u5bf9\u503c\uff0c\u56e0\u4e3a\u5b83\u4eec\u7684\u7b26\u53f7\u5e76\u4e0d\u91cd\u8981\u3002\u7136\u540e\uff0c\u5982\u679c\u6570\u7ec4\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u7b49\u4e8e\u6216\u5c0f\u4e8e\u6570\u7ec4\u7684[n\/2]+1\u6700\u5c0f\u5143\u7d20\uff0c\u5219\u7b54\u6848\u662f\u53ef\u80fd\u7684\u3002\u5426\u5219\uff0c\u7b54\u6848\u5c31\u662f\u4e0d\u53ef\u80fd\u7684<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n\nconst int N=1e5+10;\nint a[N];\n\nint main(){\n    int T;\n    scanf("%d",&T);\n    while(T--){\n        int n;scanf("%d",&n);\n        for(int i=1;i<=n;i++)\n            scanf("%d",&a[i]);\n        int f=abs(a[1]);\n        int cnt=0;\n        for(int i=2;i<=n;i++){\n            int z=abs(a[i]);\n            if(z<=f)\n                cnt++;\n        }\n        if(cnt+1<=(n\/2+1))\n            cout<<"YES"<<endl;\n        else\n            cout<<"NO"<<endl;\n    }\n    return 0;\n}<\/code><\/pre>\n
12\u3001\u8fd9\u662f\u5565\u535a\u5f08\uff1f<\/h3>\n
\u8bc8\u9a97\u9898\uff0c\u63d0\u793a\u91cc\u4e5f\u63d0\u9192\u4e86\uff0c\u8f93\u51fa\u83b7\u80dc\u8005\u540d\u5b57\u7684\u7b2c\u4e00\u4e2a\u5b57\u6bcd\uff0c\u800c\u4e24\u4e2a\u4eba\u7684\u7b2c\u4e00\u4e2a\u5b57\u6bcd\u90fd\u662f \u2019 B \u2018 \uff0c\u6240\u4ee5\u76f4\u63a5\u8f93\u5165n\uff0c\u7136\u540e\u76f4\u63a5\u8f93\u51fa \u2019 B \u2018 \u5c31\u884c\u4e86\u3002\u4f46\u5bf9\u4e8e\u8fd9\u9898\u6765\u8bf4\uff0c\u4e5f\u53ef\u4ee5\u4e0d\u7528\u8f93\u5165 n \uff0c\u76f4\u63a5\u8f93\u51fa \u2019 B \u2018 \uff0c\u56e0\u4e3aAC\u7684\u6807\u51c6\u5c31\u662f\u53ea\u770b\u4f60\u8f93\u51fa\u7684\u6570\u636e\u548c\u540e\u53f0\u7684\u6570\u636e\u662f\u5426\u80fd\u5b8c\u5168\u543b\u5408\uff0c\u4e0d\u770b\u8f93\u5165\u3002\u4e0d\u8981\u89c9\u5f97\u8fd9\u79cd\u8bc8\u9a97\u9898\u5f88\u5947\u602a\uff0c\u8fd9\u90fd\u662f\u6211\u4eec\u5e73\u5e38\u78b0\u5230\u8fc7\u7684\uff0c\u5f88\u591a\u6bd4\u8d5b\u90fd\u6709\uff0c\u6bd4\u5982\u6211\u4eec\u5b66\u6821\u524d\u5e74\u4e3e\u529e\u7684\u65b0\u751f\u6cb3\u5357\u7701\u9080\u8bf7\u8d5b\u91cc\u5c31\u6709\u4e00\u9053\uff0c\u5982\u679c\u611f\u5174\u8da3\u7684\u8bdd\uff0c\u53ef\u4ee5\u770b\u770b\u3002<\/p>\n
#include<bits\/stdc++.h>\nusing namespace std;\n#define endl "\\n"\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\ncout.tie(0);\n    cout<<'B'<<endl;\n    return 0;\n}\n\n\/\/\n\/\/ \u2800\u2800\u2800             \u2800\u28b8\u28ff\u28ff\u28ff\u2800\u28fc\u28ff\u28ff\u28e6\u2840\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28c0\u2800\u2800\u2800 \u2800\u28b8\u28ff\u28ff\u285f\u28b0\u28ff\u28ff\u28ff\u281f\u2801\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28b0\u28ff\u283f\u28bf\u28e6\u28c0\u2800\u2818\u281b\u281b\u2803\u2838\u283f\u281f\u28eb\u28f4\u28f6\u28fe\u2846\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2838\u28ff\u2840\u2800\u2809\u28bf\u28e6\u2840\u2800\u2800\u2800\u2800\u2800\u2800 \u281b\u283f\u283f\u28ff\u2803\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2819\u28bf\u28e6\u2800\u2800\u2839\u28ff\u28f6\u287e\u281b\u281b\u28b7\u28e6\u28c4\u2800\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28ff\u28e7\u2800\u2800\u2808\u2809\u28c0\u2840\u2800 \u2800\u2819\u28bf\u2847\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2880\u28e0\u28f4\u287f\u281f\u280b\u2800\u2800\u28a0\u28fe\u281f\u2803\u2800\u2800\u2800\u28b8\u28ff\u2846\n\/\/ \u2800\u2800\u2800\u2880\u28e0\u28f6\u287f\u281b\u2809\u2800\u2800\u2800\u2800\u2800\u28fe\u2847\u2800\u2800\u2800\u2800\u2800\u28b8\u28ff\u2807\n\/\/ \u2880\u28e0\u28fe\u283f\u281b\u2801\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2880\u28fc\u28e7\u28c0\u2800\u2800\u2800\u2880\u28fc\u2807\n\/\/ \u2808\u280b\u2801\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2880\u28f4\u287f\u280b\u2819\u281b\u281b\u281b\u281b\u281b\u2801\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28c0\u28fe\u287f\u280b\u2800\n\/\/ \u2800\u2800\u2800\u2800\u2800\u2800\u2800\u2800\u28be\u283f\u280b \n\/\/<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
2025–ACM&TC\u7b2c\u4e09\u6b21\u62db\u65b0\u8d5b\u9898\u89e3 \u9898\u76ee\u96be\u5ea6\uff1a \u7b7e\u5230\uff1a9\u300112 \u7b80\u5355\uff1a2\u30015\u30018\u300111 \u4e2d\u7b49\uff1a3 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[10,15,9],"class_list":["post-631","post","type-post","status-publish","format-standard","hentry","category-acm","tag-c","tag-15","tag-9"],"_links":{"self":[{"href":"https:\/\/www.george-blog.top\/index.php?rest_route=\/wp\/v2\/posts\/631","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.george-blog.top\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.george-blog.top\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.george-blog.top\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.george-blog.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=631"}],"version-history":[{"count":2,"href":"https:\/\/www.george-blog.top\/index.php?rest_route=\/wp\/v2\/posts\/631\/revisions"}],"predecessor-version":[{"id":633,"href":"https:\/\/www.george-blog.top\/index.php?rest_route=\/wp\/v2\/posts\/631\/revisions\/633"}],"wp:attachment":[{"href":"https:\/\/www.george-blog.top\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=631"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.george-blog.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=631"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.george-blog.top\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=631"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}