\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u89c2\u5bdf\u9898\u76ee\u53ef\u77e5\uff0c\u5b57\u7b26\u4e32\u7684\u5012\u6570\u7b2c\u4e8c\u4e2a\u5b57\u7b26\u53ef\u4ee5\u786e\u5b9a\u8bed\u8a00\uff1a \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u6839\u636e\u5df2\u7ecf\u5f97\u5230\u7684\u540d\u6b21\u548c\u63a5\u4e0b\u6765\u8981\u6bd4\u8d5b\u7684\u6b21\u6570\uff0c\u6c42\u80fd\u591f\u5f97\u5230\u7684\u540d\u6b21\u4e2d\uff0c\u4ece1,2,3\u2026\u2026v\uff0cv\u6700\u591a\u4e3a\u591a\u5927\u3002<\/p>\n\n\n\n \u5c06\u5df2\u7ecf\u53d6\u5f97\u7684\u540d\u6b21\u5b58\u5165\u6876a\u4e2d\uff0c\u7136\u540ex\u4ece1\u5f00\u59cb\u904d\u5386\uff0c\u6bcf\u6b21\u5c06v+1\uff0c\u5982\u679ca[x]\u4e0d\u5b58\u5728\uff0c\u5219x-1\uff0c\u5373\u6d88\u8017\u4e00\u6b21\u6bd4\u8d5b\u6b21\u6570\u3002\u76f4\u5230x=0\uff0c\u5373\u7528\u5b8c\u6240\u6709\u6bd4\u8d5b\u6b21\u6570\u3002v\u5373\u4e3a\u6240\u6c42\u3002<\/p>\n\n\n\n \u6ce8\u610f\u5224\u65ad\u5f53x=0\u540e\uff0ca[v+1]\u662f\u5426\u5b58\u5728\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u5224\u65ad\u7ed9\u51fa\u7684n\u4e2a2*2\u77e9\u9635\u80fd\u5426\u586b\u6ee1m*m\u7684\u77e9\u9635\uff0c\u5e76\u4e14\u4f7f\u5f97m*m\u77e9\u9635\u5173\u4e8e\u5de6\u4e0a\u5230\u53f3\u4e0b\u7684\u5bf9\u89d2\u7ebf\u5bf9\u79f0\u3002<\/p>\n\n\n\n \u9996\u5148m\u9700\u8981\u662f\u4e2a\u5076\u6570\uff0c\u4e0d\u7136\u65e0\u6cd5\u586b\u6ee1\u3002\u7136\u540en\u4e2a2*2\u77e9\u9635\u4e2d\u53ea\u8981\u6709\u4e00\u4e2a\u53ef\u4ee5\u5173\u4e8e\u5de6\u4e0a\u5230\u53f3\u4e0b\u7684\u5bf9\u89d2\u7ebf\u5bf9\u79f0\uff0c\u5373\u53f3\u4e0a\u89d2\u5143\u7d20\u7b49\u4e8e\u5de6\u4e0a\u89d2\u5143\u7d20\uff0c\u5219\u53ef\u4ee5\u5f97\u5230\u6ee1\u8db3\u8981\u6c42\u7684m*m\u7684\u77e9\u9635\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u8fd9\u9053\u9898\u8981\u6c42\u51fa1-n\u4e2d\u6709\u591a\u5c11\u4e2a\u6570\u5b57\u662f\u53ea\u7531\u4e00\u4e2a\u6570\u6784\u6210\u7684\u3002<\/p>\n\n\n\n \u53ef\u4ee5\u5148\u9884\u5904\u7406\uff0c\u6c42\u51fa\u6240\u6709\u7684\u7b26\u5408\u8981\u6c42\u7684\u6570\uff0c\u7136\u540e\u518d\u8ba1\u7b971-n\u4e2d\u6709\u591a\u5c11\u7b26\u5408\u8981\u6c42\u7684\u6570\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u6709\u4e00\u4e2an*m\u7684\u77e9\u9635\uff0c\u7ed9\u51fa\u6bcf\u884c\u7684\u6570\u5b57\u4f46\u662f\u884c\u4e4b\u95f4\u7684\u987a\u5e8f\u662f\u9519\u7684\uff0c\u518d\u7ed9\u51fa\u6bcf\u5217\u7684\u6570\u5b57\uff0c\u5217\u4e0e\u5217\u4e4b\u95f4\u7684\u987a\u5e8f\u4e5f\u662f\u9519\u7684\u3002\u9700\u8981\u6839\u636e\u8fd9\u4e9b\u4fe1\u606f\u8fd8\u539f\u51fa\u539f\u6765\u7684\u77e9\u9635\u3002<\/p>\n\n\n\n \u53ea\u9700\u8981\u627e\u5230\u7ed9\u51fa\u7684\u6bcf\u4e00\u884c\u7684\u7b2c\u4e00\u4e2a\u6570\u5b57\uff0c\u7136\u540e\u518d\u5728\u7ed9\u51fa\u7684\u5217\u4e2d\u627e\u5230\u5305\u542b\u8fd9\u4e9b\u6570\u5b57\u7684\u90a3\u4e00\u5217\uff0c\u5c31\u80fd\u5f97\u5230\u6bcf\u4e00\u884c\u7684\u6b63\u786e\u987a\u5e8f\uff0c\u4ece\u800c\u8fd8\u539f\u77e9\u9635\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u5b9a\u4e49\u4e00\u4e2a\u64cd\u4f5c\uff1a+1\uff0c\u7136\u540e\u53bb\u9664\u672b\u5c3e\u6240\u6709\u7684\u96f6\u3002\u7ed9\u51fa\u4e00\u4e2a\u6570n\uff0c\u6c42\u4e0d\u65ad\u8fdb\u884c\u8fd9\u79cd\u64cd\u4f5c\u540e\u6700\u591a\u53ef\u4ee5\u5f97\u5230\u591a\u5c11\u4e2a\u4e0d\u540c\u7684\u6570\u5b57\u3002<\/p>\n\n\n\n \u5148\u5b9a\u4e49\u4e00\u4e2amap\uff0c\u7528\u6765\u5b58\u50a8\u5f97\u5230\u7684\u6570\u5b57\uff0c\u7136\u540e\u4e0d\u65ad\u7684\u8fdb\u884c\u4e0a\u8ff0\u64cd\u4f5c\uff0c\u5e76\u5c06\u6570\u5b57\u5b58\u5165map\u4e2d\uff0c\u76f4\u5230\u5f97\u5230\u7684\u6570\u5b57\u5df2\u7ecf\u5728map\u4e2d\u4e86\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u7ed9\u51fa\u4e00\u4e9b\u7269\u54c1\u7684\u5750\u6807\uff0c\u4ece\uff080,0\uff09\u5904\u51fa\u53d1\uff0c\u53ea\u80fd\u5411\u53f3\u6216\u5411\u4e0a\u8d70\uff0c\u95ee\u80fd\u5426\u8fdb\u8fc7\u6240\u6709\u7684\u7269\u54c1\uff0c\u5e76\u4e14\u8f93\u51fa\u8def\u7ebf\u3002<\/p>\n\n\n\n \u5148\u5c06\u6bcf\u4e2a\u7269\u54c1\u5750\u6807\u7684x,y\u76f8\u52a0\u5e76\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u5c31\u80fd\u5f97\u5230\u8fdb\u8fc7\u7269\u54c1\u7684\u987a\u5e8f\uff0c\u5e76\u4e14\u5f53\u51fa\u73b0\u4e24\u4e2a\u7269\u54c1\u7684x+y\u548c\u76f8\u7b49\uff0c\u90a3\u4e48\u5fc5\u7136\u6709\u5176\u4e2d\u4e00\u4e2a\u7269\u54c1\u662f\u65e0\u6cd5\u8fdb\u8fc7\u7684\u3002\u7136\u540e\u6a21\u62df\u79fb\u52a8\u7684\u8fc7\u7a0b\uff0c\u5728\u79fb\u52a8\u4e2d\u82e5\u51fa\u73b0\u4e0b\u4e00\u4e2a\u8981\u7ecf\u8fc7\u7684\u7269\u54c1\uff0c\u5176x\u6216y\u5750\u6807\u4e2d\u4efb\u4f55\u4e00\u4e2a\u5c0f\u4e8e\u5f53\u524d\u7684x\uff0cy\u5750\u6807\uff0c\u90a3\u4e48\u5fc5\u5b9a\u65e0\u6cd5\u7ecf\u8fc7\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u8f93\u5165\u4e00\u5f20\u7531 \u8f93\u5165\u65f6\u540c\u65f6\u5b58\u50a8\u4e0b\u6bcf\u884c\u3001\u6bcf\u5217\u591a\u5c11\u4e2a*\uff0c\u7136\u540e\u904d\u5386\u6bcf\u4e2a\u70b9\uff0c\u5206\u522b\u7528n+m-a[i]-b[j]\u8ba1\u7b97\u9700\u8981\u8865\u5145\u591a\u5c11\u4e2a*\uff0c\u5e76\u4e14\u5f53\u5f53\u524d\u70b9\u4e3a.\u65f6\uff0c\u4f1a\u91cd\u590d\u8ba1\u7b97\uff0c\u9700\u8981\u5c06\u7ed3\u679c\u51cf1\u3002<\/p>\n\n\n\n \u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n \u7ed9\u51fa\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u548c\u4e00\u4e2a\u957f\u5ea6k\uff0c\u8981\u6c42\u4fee\u6539\u5b57\u7b26\u4e32\u4e2d\u7684\u4e00\u4e9b\u5b57\u7b26\u540e\uff0c\u4f7f\u5f97\u5b57\u7b26\u4e32\u4e2d\u7684\u4e00\u4e2a\u957f\u5ea6\u4e3ak\u7684\u5b50\u4e32\uff0c\u540c\u65f6\u4e5f\u4e3a\u65e0\u9650\u5faa\u73af\u5b57\u7b26\u4e32\"RGB\"\u4e2d\u7684\u5b50\u4e32\u3002<\/p>\n\n\n\n \u53ef\u4ee5\u76f4\u63a5\u6a21\u62df\u4e0d\u65ad\u5bf9\u6bd4\u8fd9\u4e2ak\u957f\u7684\u5b50\u4e32\u3002\u7b2c\u4e00\u91cd\u5faa\u73af\u662f\u79fb\u52a8\u5b50\u4e32\u8d77\u59cb\u4f4d\u7f6e\uff0c\u7b2c\u4e8c\u91cd\u662f\u79fb\u52a8\"RGB\"\u4e32\u4e2d\u7684\u8d77\u59cb\u4f4d\u7f6e\uff0c\u7b2c\u4e09\u91cd\u5c31\u662f\u9010\u4e2a\u5b57\u7b26\u6bd4\u5bf9\u3002<\/p>\n\n\n\n
p - Filipino
s - Japanese
d - Korean<\/p>\n\n\n\nint main()\n{\n\tint n;\n\tstring s;\n\tcin>>n;\n\tfor (int i=1;i<=n;i++)\n\t{\n\t\ts.clear();\n\t\tcin>>s;\n\t\tif (s[s.size()-2]=='p') cout<<\"FILIPINO\\n\";\n\t\telse if (s[s.size()-2]=='s') cout<<\"JAPANESE\\n\";\n\t\telse if (s[s.size()-2]=='d') cout<<\"KOREAN\\n\";\n\t}\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n#JC0102. Dreamoon and Ranking Collection<\/h2>\n\n\n\n
int a[1001],t,n,x,v,b;\nint main()\n{\n ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n CI t;\n while(t--)\n {\n clear(a);\n CI n;CI x;\n F(i,1,n)\n {\n CI b;\n a[b]=1;\n }\n v=0;\n while (x>0)\n {\n v++;\n if (!a[v]) x--;\n }\n while (a[v+1])\n v++;\n CO v L;\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0103. Symmetric Matrix<\/h2>\n\n\n\n
int t,n,m,x1,x2,f;\nint main()\n{\n ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n CI t;\n while (t--)\n {\n CI n>>m;\n f=0;\n F(i,1,n)\n {\n CI x1>>x1>>x2;\n if (x1==x2) f=1;\n CI x2;\n }\n if (m%2==0&&f) CO \"YES\" L;\n else CO \"NO\" L;\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0104. Happy Birthday, Polycarp!<\/h2>\n\n\n\n
int t,n,a[1001],x;\nint main()\n{\n string str=\"\";\n x=1;\n F(i,1,9)\n {\n str+=\"1\";\n int t=stoi(str);\n F(j,1,9)\n {\n a[x]=j*t;\n x++;\n }\n }\n a[x]=2000000000;\n CI t;\n while (t--)\n {\n CI n;\n int ans=0;\n while (a[ans+1]<=n) \n ans++;\n CO ans L;\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0105. A New Technique<\/h2>\n\n\n\n
int t,n,m,a[1001][1001],b[1001],x;\nint main()\n{\n ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n CI t;\n while (t--)\n {\n CI n>>m;\n F(i,1,n)\n F(j,1,m)\n CI a[i][j];\n \n int f=0;\n F(i,1,m)\n {\n F(j,1,n)\n {\n CI b[j];\n if (b[j]==a[1][1]) f=1;\n }\n if (f)\n {\n F(j,1,n)\n {\n F(k,1,n)\n if (b[j]==a[k][1]) \n DBA(a[k],1,m)\n }\n f=0;\n }\n }\n \n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0106. Reachable Numbers<\/h2>\n\n\n\n
int n,t=1;\nmap<int,int> a;\nint main()\n{\n CI n;\n a[n]=1;\n while (n>0)\n {\n n++;\n while (n%10==0&&n!=0) \n n\/=10;\n if (a[n]) break;\n else a[n]=1;\n t++;\n }\n CO t L;\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0107. Collecting Packages<\/h2>\n\n\n\n
int t,n,x,y;\nstring ans;\nstruct package{\n int x,y,b;\n} pack[100001];\n\nbool cmp(package p1,package p2)\n{\n return p1.b<p2.b;\n}\n\nint main()\n{\n ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n CI t;\n while (t--)\n {\n map<int,int> m;\n int f=1;\n x=y=0;\n ans=\"\";\n CI n;\n F(i,1,n)\n {\n CI pack[i].x>>pack[i].y;\n pack[i].b=pack[i].x+pack[i].y;\n if (m[pack[i].b]) f=0;\n m[pack[i].b]=1;\n }\n if (f)\n { \n sort(pack+1,pack+n+1,cmp);\n F(i,1,n)\n {\n if (pack[i].x<x||pack[i].y<y)\n {\n f=0;\n break;\n }\n F(j,x,pack[i].x-1)\n ans+=\"R\";\n x=pack[i].x;\n F(j,y,pack[i].y-1)\n ans+=\"U\";\n y=pack[i].y;\n }\n }\n if (f) CO \"YES\" L<<ans L;\n else CO \"NO\" L;\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0108. Yet Another Crosses Problem<\/h2>\n\n\n\n
*<\/code>\uff0c.<\/code>\u6784\u6210\u7684\u56fe\uff0c\u5224\u65ad\u54ea\u4e2a\u70b9\u6240\u5728\u884c\u3001\u5217\u7684*\u603b\u6570\u6700\u591a\uff0c\u5e76\u8ba1\u7b97\u51fa\u8fd8\u9700\u8981\u8865\u5145\u591a\u5c11*\u624d\u80fd\u586b\u6ee1\u6240\u5728\u884c\u3001\u5217\u3002<\/p>\n\n\n\nint t,n,m;\nint a[50005],b[50005],p[500005];\nchar c;\nint main()\n{\n CI t;\n while (t--)\n {\n clear(a)\n clear(b) \n CI n>>m;\n F(i,1,n)\n {\n getchar();\n F(j,1,m)\n {\n CI c;\n if (c=='*')\n {\n a[i]++;\n b[j]++;\n p[i*m+j]=1;\n }\n else p[i*m+j]=0;\n }\n }\n int m1=n+m;\n F(i,1,n)\n {\n F(j,1,m)\n {\n if (p[i*m+j]) m1=min(m1,n+m-a[i]-b[j]);\n else m1=min(m1,n+m-a[i]-b[j]-1);\n if (m1==0) break;\n }\n if (m1==0) break;\n }\n printf(\"%d\\n\",m1);\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0109. RGB Substring (easy version)<\/h2>\n\n\n\n
int t,n,k;\nstring s;\nchar c[]=\"RGB\";\nint main()\n{\n CI t;\n while (t--)\n {\n CI n>>k;\n CI s;\n int ans=n;\n int m=0;\n F(i,0,n-k)\n {\n F(j,0,2)\n {\n m=0;\n F(l,i,i+k-1)\n if (s[l]!=c[(j+l)%3]) m++;\n ans=min(ans,m);\n if (ans==0) goto g1;\n } \n }\n g1:\n CO ans L;\n }\n return 0;\n}<\/code><\/pre>\n\n\n\n#JC0110. System Testing<\/h2>\n\n\n\n