{"id":111649,"date":"2026-10-01T13:24:57","date_gmt":"2026-10-01T05:24:57","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/111649.html"},"modified":"2026-10-01T13:24:57","modified_gmt":"2026-10-01T05:24:57","slug":"haue%e8%bd%af%e4%bb%b6%e5%ad%a6%e9%99%a2oj%e9%a2%98%e8%a7%a3%e6%b1%87%e6%80%bb_%e7%ac%ac2%e7%af%87_1050-1099","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/111649.html","title":{"rendered":"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099"},"content":{"rendered":"

\u6cb3\u5357\u5de5\u7a0b\u5b66\u9662\u8f6f\u4ef6\u5b66\u9662 OJ \u9898\u89e3（\u7b2c 2 \u7bc7 \/ \u5171 4 \u7bc7）：\u9898\u53f7 1050\u20131099<\/h2>\n

\u9898\u5e93：http:\/\/oj.software.haue.edu.cn\/ \u3000\u8bed\u8a00：C++（g++ -std=c++14 -O2）
\n\u8986\u76d6\u9898\u53f7：1050\u20131099（\u672c\u7bc7 50 \u9898）\u3000\u5185\u5bb9：\u7b2c4\u7ae0 \u5faa\u73af\u7ed3\u6784
\n\u5168\u5957\u5171 4 \u7bc7：1000\u20131049 ／ 1050\u20131099 ／ 1100\u20131149 ／ 1150\u20131199<\/p>\n

\u26a0\ufe0f \u672c\u7bc7\u542b 1095：\u8be5\u9898\u88ab\u7ba1\u7406\u5458\u505c\u7528，\u65e0\u9898\u9762，\u4ee3\u7801\u4e3a\u5360\u4f4d\u3002<\/p>\n

\u9a8c\u8bc1\u65b9\u5f0f：\u6bcf\u9898\u6e90\u7801\u90fd\u5728\u672c\u673a\u7528 g++ \u7f16\u8bd1\u901a\u8fc7，\u5e76\u8dd1\u9898\u9762\u6837\u4f8b\u4e0e\u8f93\u51fa\u9010\u5b57\u7b26\u6bd4\u5bf9；
\n\u6bd4\u5bf9\u57fa\u51c6\u53d6\u81ea OJ \u539f\u59cb\u9875\u9762（\u4fdd\u7559\u6837\u4f8b\u7684\u884c\u672b\u7a7a\u683c\u4e0e\u7a7a\u884c），\u6309 HUSTOJ \u9ed8\u8ba4\u5bbd\u677e\u5224\u9898\u89c4\u5219\u5224\u5b9a\u3002
\n\u5168\u90e8 200 \u9898\u4e2d 199 \u9898\u5df2\u5411 OJ \u771f\u673a\u63d0\u4ea4\u9a8c\u8bc1\u5e76 AC：
\n1095 \u88ab\u7ba1\u7406\u5458\u505c\u7528\u65e0\u6cd5\u9a8c\u8bc1；1198 \u56e0\u9898\u9762\u6b67\u4e49\u901a\u8fc7 81%（\u8be6\u89c1\u8be5\u9898\u8bf4\u660e）\u3002
\n\u771f\u673a\u6d4b\u8bd5\u53d1\u73b0\u5e76\u4fee\u590d 4 \u5904：1083 \u8f93\u51fa\u5bf9\u9f50\u30011057 \u7528\u5238\u7ec4\u5408\u53d6\u6700\u5c0f\u30011165 \u5dee\u503c\u7b26\u53f7\u30011199 \u964d\u6863\u53d1\u653e\u3002<\/p>\n

\u63d0\u4ea4\u65b9\u6cd5：\u6253\u5f00\u9898\u76ee\u9875 \u2192 \u63d0\u4ea4 \u2192 \u8bed\u8a00\u9009 C++ \u2192 \u7c98\u8d34\u672c\u6587\u6863\u4e2d\u5bf9\u5e94\u9898\u7684\u4ee3\u7801\u3002<\/p>\n

\n

\u5feb\u901f\u7d22\u5f15（\u672c\u7bc7 50 \u9898）<\/h3>\n\n\u9898\u53f7\u9898\u76ee\u601d\u8def\u590d\u6742\u5ea6<\/tr>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
1050<\/td>\n\u52a0\u73ed\u8d39<\/td>\n\u6309 160 \u5c0f\u65f6\u5206\u6bb5：\u672a\u8d85\u51fa\u90e8\u5206 10 \u5143\/\u65f6，\u8d85\u51fa\u90e8\u5206 30 \u5143\/\u65f6（3 \u500d\u5de5\u8d44）\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1051<\/td>\n\u67d0\u5e74\u67d0\u6708\u7684\u5929\u6570<\/td>\n\u6708\u4efd\u5929\u6570\u6253\u8868，\u4ec5 2 \u6708\u5728\u95f0\u5e74\u65f6\u6539\u4e3a 29；\u95f0\u5e74\u5224 `(y%4==0&&y%100!=0)<\/td>\n<\/td>\n<\/tr>\n
1052<\/td>\n\u8682\u8681\u7684\u4f4d\u7f6e<\/td>\n\u6bd4\u8f83 x\u00b2+y\u00b2 \u4e0e r\u00b2=20.25，\u52a0 1e-6 \u5bb9\u5dee\u540e\u8f93\u51fa in\/on\/out，\u907f\u514d\u4e34\u754c\u70b9\u88ab\u6d6e\u70b9\u8bef\u5dee\u5e26\u504f\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1053<\/td>\n\u5403\u6c34\u679c<\/td>\nswitch \u6620\u5c04 A\/B\/C\/D \u2192 Apple\/Banana\/Cherry\/Durian，\u5927\u5199\u5c0f\u5199\u540c\u6620\u5c04，\u5176\u4f59 \u2192 Mango\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1054<\/td>\n\u8fdb\u5236\u8f6c\u6362<\/td>\n\u6309\u5b57\u7b26\u4e32\u8bfb\u5165\u4e8c\u8fdb\u5236\u6570（\u4fdd\u7559\u524d\u5bfc 0），\u9010\u4f4d v=v*2+(c-'0')，long long \u627f\u63a5 31 \u4f4d\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n
1055<\/td>\n\u6574\u6570\u5bf9\u6570<\/td>\nprintf("%4d%8.4f") \u2014\u2014 \u6574\u6570\u5360 4 \u5217\u3001\u5bf9\u6570（\u81ea\u7136\u5bf9\u6570 ln）\u5360 8 \u5217\u53f3\u5bf9\u9f50，\u5360\u4f4d\u5217\u4e0d\u80fd\u7701\u3002<\/td>\nO(n-m+1)<\/td>\n<\/tr>\n
1056<\/td>\n\u6574\u6570\u6570\u5b57<\/td>\n\u6309\u5b57\u7b26\u4e32\u9010\u4f4d\u8f93\u51fa\u6bcf\u4e2a\u6570\u5b57，\u4e14\u6bcf\u4f4d\u6570\u5b57\u540e\u90fd\u8ddf\u4e00\u4e2a\u7a7a\u683c\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n
1057<\/td>\n\u4f18\u60e0\u652f\u4ed8<\/td>\n\u6ee1\u51cf\u5238\/\u6253\u6298\u5238\u53ef\u540c\u7528\u6216\u53ea\u7528\u4e00\u79cd，\u300c\u6700\u5c11\u652f\u4ed8\u300d= 4 \u79cd\u65b9\u6848（\u90fd\u4e0d\u7528 \/ \u53ea\u6253\u6298 \/ \u53ea\u6ee1\u51cf \/ \u5148\u6298\u540e\u51cf）\u53d6\u6700\u5c0f，\u6bcf\u79cd\u91d1\u989d\u94b3 0 \u540e\u8f93\u51fa %.2f\u3002\u771f\u673a\u9a8c\u8bc1：\u53ea\u7b97\u300c\u5148\u6298\u540e\u51cf\u300d\u4f1a\u6302\u6570\u636e（AC:95%），\u53d6 min \u540e AC\u3002<\/td>\nO(\u5546\u54c1\u884c\u6570)<\/td>\n<\/tr>\n
1058<\/td>\n\u6700\u4e0d\u9ad8\u5174<\/td>\n7 \u5929\u6c42\u548c，\u53ea\u6709\u548c\u6570 >8 \u624d\u7b97\u4e0d\u9ad8\u5174；\u4e25\u683c\u6bd4\u8f83\u4fdd\u8bc1\u5e76\u5217\u65f6\u53d6\u6700\u65e9\u7684\u4e00\u5929\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1059<\/td>\n\u753b\u77e9\u5f62<\/td>\n\u5b9e\u5fc3\u6bcf\u884c w \u4e2a\u5b57\u7b26；\u7a7a\u5fc3\u9996\u672b\u884c w \u4e2a\u5b57\u7b26\u3001\u4e2d\u95f4\u884c\u4e24\u7aef\u5404 1 \u4e2a\u5b57\u7b26\u3001\u4e2d\u95f4\u7559 w-2 \u4e2a\u7a7a\u683c\u3002<\/td>\nO(h\u00b7w)<\/td>\n<\/tr>\n
1060<\/td>\n\u89d2\u8c37\u731c\u60f3<\/td>\n\u89d2\u8c37\u731c\u60f3：\u5947\u6570 n=n*3+1\u3001\u5076\u6570 n=n\/2，\u6bcf\u6b65\u8f93\u51fa\u7b97\u5f0f，\u6700\u540e\u8f93\u51fa End\u3002<\/td>\nO(\u6b65\u6570)<\/td>\n<\/tr>\n
1061<\/td>\n\u516c\u5f0f\u6c42\u503c<\/td>\ne=1+\u03a31\/i!，\u7528 term\/=i \u9012\u63a8\u907f\u514d\u76f4\u63a5\u7b97\u9636\u4e58，\u8f93\u51fa 10 \u4f4d\u5c0f\u6570\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1062<\/td>\n\u6574\u6570\u7d2f\u52a0<\/td>\n\u7b49\u5dee\u6570\u5217\u6c42\u548c (m+n)*(n-m+1)\/2，\u7528\u516c\u5f0f\u66ff\u4ee3\u5faa\u73af\u5e76\u9632\u6ea2\u51fa\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1063<\/td>\n\u591a\u5b9e\u4f8b\u6d4b\u8bd5<\/td>\n\u591a\u5b9e\u4f8b：while(scanf(…)==2) \u8bfb\u5230 EOF，\u6bcf\u7ec4\u8f93\u51fa\u4e00\u884c a+b\u3002<\/td>\nO(\u7ec4\u6570)<\/td>\n<\/tr>\n
1064<\/td>\n\u6700\u5c0f\u6574\u6570<\/td>\n\u627e\u6700\u5c0f i \u4f7f i(i+1)\/2 \u2265 n；\u7528 sqrt \u4f30\u7b97\u540e\u53cc\u5411\u5fae\u8c03，\u505a\u5230 O(1) \u800c\u975e\u7d2f\u52a0\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1065<\/td>\n\u8d28\u6570\u5224\u65ad<\/td>\nn\u22652 \u624d\u53ef\u80fd\u8d28\u6570；\u8bd5\u9664\u5230 sqrt(n)，\u5199\u6210 i<=n\/i \u9632\u6b62 i*i \u6ea2\u51fa\u3002<\/td>\nO(\u221an)<\/td>\n<\/tr>\n
1066<\/td>\n\u524dn\u9879\u548c<\/td>\n\u7b2c i \u9879 = (-1)^(i-1)\u00b7i\/(2i-1)，\u7d2f\u52a0\u540e\u8f93\u51fa 3 \u4f4d\u5c0f\u6570\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1067<\/td>\n\u8d28\u6570\u5224\u65ad（break）<\/td>\n\u4e0e 1065 \u540c\u89e3，\u663e\u5f0f\u7528 break \u5728\u627e\u5230\u56e0\u5b50\u65f6\u63d0\u524d\u8df3\u51fa，\u6ee1\u8db3\u9898\u76ee\u5bf9 break \u7684\u8981\u6c42\u3002<\/td>\nO(\u221an)<\/td>\n<\/tr>\n
1068<\/td>\n\u6574\u6570\u6574\u9664<\/td>\n\u679a\u4e3e a\u2026b \u8f93\u51fa\u6240\u6709\u4e0d\u80fd\u88ab 3 \u6574\u9664\u7684\u6570，\u7528 first \u6807\u5fd7\u63a7\u5236\u7a7a\u683c\u4ee5\u4fdd\u8bc1\u884c\u672b\u65e0\u7a7a\u683c\u3002<\/td>\nO(b-a)<\/td>\n<\/tr>\n
1069<\/td>\nm\u94b1\u4e70m\u53ea\u9e21<\/td>\n\u6d88\u5143\u5f97 7x+4y=m，x \u4ece 0 \u679a\u4e3e，\u9996\u4e2a\u53ef\u884c\u89e3\u5373\u516c\u9e21\u6700\u5c11\u7684\u89e3；\u8f93\u51fa\u987a\u5e8f\u4e3a \u516c\u9e21 \u6bcd\u9e21 \u5c0f\u9e21\u3002<\/td>\nO(m)<\/td>\n<\/tr>\n
1070<\/td>\n\u8d28\u6570\u6570\u76ee<\/td>\n\u533a\u95f4\u7b5b：\u5148\u7528\u8bd5\u9664\u7b5b\u51fa \u221ab \u5185\u7684\u8d28\u6570，\u518d\u6309\u6bb5\u7b5b [a,b] \u5e76\u8ba1\u6570；\u6ce8\u610f 1 \u4e0d\u662f\u8d28\u6570\u3002<\/td>\nO(\u221ab+(b-a))<\/td>\n<\/tr>\n
1071<\/td>\nm\u94b1\u4e70m\u53ea\u9e21（\u65e0\u89e3\u8f93\u51fa\u201cNo answer\u201d）<\/td>\n\u540c 1069 \u7684\u6d88\u5143\u679a\u4e3e，\u65e0\u89e3\u65f6\u8f93\u51fa\u534a\u89d2 No answer\u3002<\/td>\nO(m)<\/td>\n<\/tr>\n
1072<\/td>\n\u6574\u6570\u7684\u4f4d\u6570（while\u5b9e\u73b0）<\/td>\nwhile(n>0){cnt++;n\/=10;} \u9010\u4f4d\u53bb\u6389\u672b\u4f4d\u8ba1\u6570，\u7528 long long\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n
1073<\/td>\n\u6570\u5b57\u53cd\u8f6c<\/td>\n\u53d6\u7edd\u5bf9\u503c\u540e\u7b97\u672f\u53cd\u8f6c\u518d\u8865\u7b26\u53f7，\u672b\u5c3e\u7684 0 \u81ea\u7136\u6d88\u5931（1200\u219221）\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n
1074<\/td>\n\u793c\u7269\u6570\u91cf<\/td>\n\u7b2c n \u4e2a\u4e0d\u542b\u6570\u5b57 4 \u7684\u6b63\u6574\u6570：\u628a n \u7684\u5404\u4f4d\u5f53\u4f5c 9 \u8fdb\u5236\u52a0\u6743，\u6570\u5b57 >4 \u65f6\u51cf 1\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n
1075<\/td>\n\u5206\u89e3\u8d28\u56e0\u5b50<\/td>\n\u4ece\u5c0f\u5230\u5927\u8bd5\u9664\u5206\u89e3\u8d28\u56e0\u5b50，\u7528 * \u8fde\u63a5\u8f93\u51fa（\u6309\u9898\u9762\u6837\u4f8b\u4e0d\u52a0 n= \u524d\u7f00）\u3002<\/td>\nO(\u221an)<\/td>\n<\/tr>\n
1076<\/td>\n\u6570\u5217\u7d2f\u52a0<\/td>\nterm=term*10+a \u751f\u6210 a, aa, aaa\u2026 \u5e76\u7d2f\u52a0，\u7528 long long \u9632\u6ea2\u51fa\u3002<\/td>\nO(n\u00b7\u4f4d\u6570)<\/td>\n<\/tr>\n
1077<\/td>\n\u96f6\u82b1\u94b1\u5956\u52b1<\/td>\nm \u662f\u767e\u5143\u949e\u7968\u5f20\u6570（\u603b\u989d 100m）；\u9010\u5929\u6a21\u62df，\u8fde\u7eed\u6512\u591f k \u5929\u5373 +10 \u5143\u5e76\u91cd\u7f6e\u8ba1\u6570\u3002<\/td>\nO(\u5929\u6570)<\/td>\n<\/tr>\n
1078<\/td>\n\u9636\u4e58\u6700\u9ad8\u4f4d<\/td>\n\u9636\u4e58\u9996\u4f4d：\u7528 long double \u7d2f\u52a0\u5bf9\u6570，\u9996\u4f4d = \u230a10^\u5c0f\u6570\u90e8\u5206\u230b，\u907f\u514d\u76f4\u63a5\u7b97\u9636\u4e58\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1079<\/td>\n\u5c0f\u8f66\u7684\u4f4d\u7f6e<\/td>\n\u65b9\u5411\u6570\u7ec4 {\u5317,\u897f,\u5357,\u4e1c}，\u5148\u6309 (t-prev)*10 \u884c\u9a76\u518d\u6267\u884c\u8f6c\u5411\/\u505c\u6b62\u547d\u4ee4\u3002<\/td>\nO(\u547d\u4ee4\u6570)<\/td>\n<\/tr>\n
1080<\/td>\n\u4e58\u79ef\u53cd\u8f6c<\/td>\na*b \u540e\u9010\u4f4d\u53cd\u8f6c\u62fc\u63a5 r=r*10+n%10，\u524d\u5bfc\u96f6\u81ea\u7136\u4e22\u5f03\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n
1081<\/td>\n\u4e24\u4e2a\u6570\u7684\u6700\u5927\u516c\u7ea6\u6570<\/td>\n\u8f97\u8f6c\u76f8\u9664\u6cd5（\u6b27\u51e0\u91cc\u5f97\u7b97\u6cd5）\u6c42\u6700\u5927\u516c\u7ea6\u6570\u3002<\/td>\nO(log min(a,b))<\/td>\n<\/tr>\n
1082<\/td>\n\u4e24\u4e2a\u6570\u7684\u6700\u5c0f\u516c\u500d\u6570<\/td>\na\/gcd*b \u2014\u2014 \u5148\u9664\u540e\u4e58，\u907f\u514d a*b \u6ea2\u51fa\u3002<\/td>\nO(log min(a,b))<\/td>\n<\/tr>\n
1083<\/td>\n\u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e00）<\/td>\n\u7b2c i \u884c\u8f93\u51fa j=1\u2026i，\u683c\u5f0f i*j=i*j，\u9879\u95f4\u5355\u7a7a\u683c\u3001\u884c\u672b\u65e0\u7a7a\u683c\u3002\u6ce8\u610f：\u9898\u9762\u6837\u4f8b\u91cc\u7684\u5bbd\u5bf9\u9f50\u662f\u6392\u7248\u6548\u679c，\u5224\u9898\u6570\u636e\u4e3a\u5355\u7a7a\u683c\u5206\u9694（\u771f\u673a\u63d0\u4ea4 AC \u8bc1\u5b9e）\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1084<\/td>\n\u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e8c）<\/td>\n\u53cd\u4e09\u89d2\u5f62：\u7b2c i \u884c\u8f93\u51fa j=i\u20269；n \u7ec4\u6570\u636e，\u7ec4\u4e0e\u7ec4\u4e4b\u95f4\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002<\/td>\nO(n\u00b781)<\/td>\n<\/tr>\n
1085<\/td>\n\u5b57\u7b26\u7edf\u8ba1（\u4e00）<\/td>\ngetline \u8bfb\u6574\u884c，\u7528\u5b57\u7b26\u533a\u95f4（a-z\/A-Z\/0-9\/\u7a7a\u683c）\u5206\u7c7b\u7edf\u8ba1，\u907f\u5f00 isalpha \u7684 locale \u5f71\u54cd\u3002<\/td>\nO(\u884c\u957f)<\/td>\n<\/tr>\n
1086<\/td>\n\u8fde\u7eed\u9636\u4e58\u6c42\u548c<\/td>\ndouble \u8fb9\u4e58\u8fb9\u52a0\u6c42 \u03a3i!，\u7528 %.0f \u8f93\u51fa（\u4e0e\u6559\u6750\u53c2\u8003\u89e3\u4e00\u81f4）\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1087<\/td>\n\u6c42\u5f0f\u5b50\u7684\u548c<\/td>\n\u4e09\u9879\u6c42\u548c \u03a3k + \u03a3k\u00b2 + \u03a31\/k = 5050+42925+2.928968\u2026，\u8f93\u51fa 6 \u4f4d\u5c0f\u6570\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1088<\/td>\n\u6c34\u4ed9\u82b1\u6570<\/td>\n\u679a\u4e3e 100\u2026999，\u5224\u65ad\u5404\u4f4d\u6570\u5b57\u7684\u7acb\u65b9\u548c\u662f\u5426\u7b49\u4e8e\u81ea\u8eab\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1089<\/td>\n\u7ae5\u5e74\u751f\u6d3b\u4e8c\u4e09\u4e8b<\/td>\n\u722c\u697c\u68af\u5373\u6590\u6ce2\u90a3\u5951 f(1)=1,f(2)=2；\u591a\u7ec4\u8f93\u5165\u8bfb\u5230 0 \u7ed3\u675f\u4e14\u4e0d\u8f93\u51fa 0\u3002<\/td>\nO(\u8be2\u95ee\u6570)<\/td>\n<\/tr>\n
1090<\/td>\n\u97e9\u4fe1\u70b9\u5175<\/td>\n\u97e9\u4fe1\u70b9\u5175：\u679a\u4e3e\u6ee1\u8db3\u300c\u4e09\u4e09\u6570\u4e4b\u5269 a\u3001\u4e94\u4e94\u6570\u4e4b\u5269 b\u3001\u4e03\u4e03\u6570\u4e4b\u5269 c\u300d\u7684\u6700\u5c0f\u6b63\u6574\u6570\u3002<\/td>\nO(105)<\/td>\n<\/tr>\n
1091<\/td>\n\u5c0f\u7403\u8e66\u8e66\u8df3<\/td>\n\u9010\u6b21\u53cd\u5f39\u6a21\u62df：\u7b2c i \u6b21\u843d\u5730\u8def\u7a0b\u52a0\u4e0a 2 \u500d\u53cd\u5f39\u9ad8\u5ea6，\u6700\u540e\u4e00\u6b21\u4e0d\u518d\u52a0\u53cd\u5f39\u8def\u7a0b\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1092<\/td>\n\u5f53\u6708\u5929\u6570（\u6570\u7ec4\u5b9e\u73b0）<\/td>\n\u6708\u4efd\u5929\u6570\u6570\u7ec4 + \u95f0\u5e74\u4fee\u6b63 2 \u6708，\u7528\u6570\u7ec4\u5b9e\u73b0\u800c\u975e switch\u3002<\/td>\nO(1)<\/td>\n<\/tr>\n
1093<\/td>\n\u6458\u82f9\u679c<\/td>\n\u82f9\u679c\u9ad8\u5ea6 \u2264 \u624b\u9ad8 + \u677f\u51f3\u9ad8 \u5373\u53ef\u6458\u5230，\u9010\u4e2a\u8ba1\u6570\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1094<\/td>\n\u6821\u95e8\u5916\u7684\u6811<\/td>\n\u5dee\u5206\/\u6807\u8bb0：\u628a\u6bcf\u6bb5\u780d\u6811\u533a\u95f4（\u542b\u7aef\u70b9）\u6253\u4e0a\u6807\u8bb0，\u6700\u540e\u7edf\u8ba1\u672a\u88ab\u8986\u76d6\u7684\u6811（\u5171 L+1 \u68f5）\u3002<\/td>\nO(L+m)<\/td>\n<\/tr>\n
1095<\/td>\n\u8f6f\u4ef6\u5b66\u9662OJ<\/td>\n\u9898\u76ee\u5df2\u88ab\u7ba1\u7406\u5458\u505c\u7528（\u9875\u9762\u63d0\u793a\u300c\u9898\u76ee\u5f53\u524d\u4e0d\u53ef\u7528\u300d），\u9898\u9762\u4e0e\u6d4b\u8bd5\u6570\u636e\u5747\u4e0d\u53ef\u89c1\u3002<\/td>\n\u2014<\/td>\n<\/tr>\n
1096<\/td>\n\u76f8\u540c\u6570\u4e2a\u6570<\/td>\n\u9010\u4e2a\u6bd4\u8f83，\u7edf\u8ba1\u4e0e\u7ed9\u5b9a\u503c\u76f8\u540c\u7684\u5143\u7d20\u4e2a\u6570\u3002<\/td>\nO(n)<\/td>\n<\/tr>\n
1097<\/td>\n\u51b0\u96f9\u731c\u60f3<\/td>\n\u51b0\u96f9\u731c\u60f3：\u5947\u6570 3n+1\u3001\u5076\u6570 n\/2，\u8bb0\u5f55\u5e8f\u5217\u540e\u5012\u5e8f\u8f93\u51fa\u76f4\u5230 1\u3002<\/td>\nO(\u6b65\u6570)<\/td>\n<\/tr>\n
1098<\/td>\n\u5361\u7247\u6e38\u620f<\/td>\n\u9010\u4e2a\u6570\u7edf\u8ba1\u5404\u6570\u5b57\u7684\u5361\u7247\u9700\u6c42，\u9700\u6c42\u8d85\u8fc7 30 \u5f20\u5e93\u5b58\u5373\u505c；\u6ce8\u610f 11 \u8fd9\u79cd\u91cd\u590d\u6570\u5b57\u8981\u4e00\u6b21\u6263\u4e24\u5f20 1\u3002<\/td>\nO(\u7b54\u6848\u4f4d\u6570)<\/td>\n<\/tr>\n
1099<\/td>\n\u6574\u6570\u4f4d\u5e8f<\/td>\n\u6574\u6570\u4f4d\u5e8f：\u4ece\u6700\u9ad8\u4f4d\u5230\u6700\u4f4e\u4f4d\u9010\u4f4d\u8f93\u51fa\u5404\u4f4d\u6570\u5b57\u3002<\/td>\nO(\u4f4d\u6570)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n

1050 \u52a0\u73ed\u8d39<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1050 \u52a0\u73ed\u8d39<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u7f16\u5199\u4e00\u4e2a\u8ba1\u7b97\u5458\u5de5\u6536\u5165\u7684\u7a0b\u5e8f，\u516c\u53f8\u6309\u7167\u89c4\u5b9a\u5de5\u65f6\u7684\u5de5\u8d4410\u5143\/\u5c0f\u65f6\u4ed8\u7ed9\u6bcf\u4e2a\u5458\u5de5160\u4e2a\u5de5\u65f6\u7684\u85aa\u6c34，\u63093\u500d\u7684\u5de5\u8d44\u7387\u4ed8\u7ed9160\u4e2a\u5de5\u65f6\u4ee5\u5916\u7684\u5de5\u8d44\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u5458\u5de5\u7684\u5de5\u65f6\u6570，1\u4e2a\u6574\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8ba1\u7b97\u5458\u5de5\u7684\u6536\u5165<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

20<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

200<\/p>\n

\u601d\u8def：\u6309 160 \u5c0f\u65f6\u5206\u6bb5：\u672a\u8d85\u51fa\u90e8\u5206 10 \u5143\/\u65f6，\u8d85\u51fa\u90e8\u5206 30 \u5143\/\u65f6（3 \u500d\u5de5\u8d44）\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1050 \u52a0\u73ed\u8d39<\/span>
\n\/\/ 160 \u5de5\u65f6\u4ee5\u5185 10 \u5143\/\u5c0f\u65f6；\u8d85\u51fa\u90e8\u5206\u6309 3 \u500d\u5de5\u8d44\u7387（30 \u5143\/\u5c0f\u65f6）<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> h;<\/span>
\n while<\/span> (<\/span>cin >><\/span> h)<\/span> {<\/span>
\n long<\/span> long<\/span> ans;<\/span>
\n if<\/span> (<\/span>h <=<\/span> 160<\/span>)<\/span> ans =<\/span> h *<\/span> 10<\/span>;<\/span>
\n else<\/span> ans =<\/span> 160LL<\/span> *<\/span> 10<\/span> +<\/span> (<\/span>h –<\/span> 160<\/span>)<\/span> *<\/span> 30<\/span>;<\/span> \/\/ \u8d85\u51fa\u90e8\u5206\u6309 3 \u500d<\/span>
\n cout <<<\/span> ans <<<\/span> "\\\\n"<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1051 \u67d0\u5e74\u67d0\u6708\u7684\u5929\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1051 \u67d0\u5e74\u67d0\u6708\u7684\u5929\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165x\u548cy，\u8f93\u51fax\u5e74y\u6708\u6709\u591a\u5c11\u5929\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u884c\u4e24\u4e2a\u6b63\u6574\u6570x\u548cy，\u5206\u522b\u8868\u793a\u5e74\u4efd\u548c\u6708\u4efd\u3002x\u5728int\u8303\u56f4\u4ee5\u5185，y\u4e3a1～12\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4e00\u884c\u4e00\u4e2a\u6574\u6570，\u8868\u793a\u8be5\u5e74\u8be5\u6708\u6709\u591a\u5c11\u5929\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

2021 3<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

31<\/p>\n

\u601d\u8def：\u6708\u4efd\u5929\u6570\u6253\u8868，\u4ec5 2 \u6708\u5728\u95f0\u5e74\u65f6\u6539\u4e3a 29；\u95f0\u5e74\u5224 (y%4==0&&y%100!=0)||y%400==0\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1051 \u67d0\u5e74\u67d0\u6708\u7684\u5929\u6570<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> x;<\/span> \/\/ \u5e74\u4efd（int \u8303\u56f4）<\/span>
\n int<\/span> y;<\/span> \/\/ \u6708\u4efd 1~12<\/span>
\n int<\/span> d[<\/span>13<\/span>]<\/span> =<\/span> {<\/span>0<\/span>,<\/span> 31<\/span>,<\/span> 28<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>}<\/span>;<\/span>
\n while<\/span> (<\/span>cin >><\/span> x >><\/span> y)<\/span> {<\/span>
\n int<\/span> ans =<\/span> d[<\/span>y]<\/span>;<\/span>
\n if<\/span> (<\/span>y ==<\/span> 2<\/span>)<\/span> {<\/span>
\n \/\/ \u95f0\u5e74：\u80fd\u88ab4\u6574\u9664\u4e14\u4e0d\u80fd\u88ab100\u6574\u9664，\u6216\u80fd\u88ab400\u6574\u9664<\/span>
\n if<\/span> (<\/span>(<\/span>x %<\/span> 4<\/span> ==<\/span> 0<\/span> &&<\/span> x %<\/span> 100<\/span> !=<\/span> 0<\/span>)<\/span> ||<\/span> x %<\/span> 400<\/span> ==<\/span> 0<\/span>)<\/span> ans =<\/span> 29<\/span>;<\/span>
\n }<\/span>
\n cout <<<\/span> ans <<<\/span> "\\\\n"<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1052 \u8682\u8681\u7684\u4f4d\u7f6e<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1052 \u8682\u8681\u7684\u4f4d\u7f6e<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6709\u4e00\u53ea\u8682\u8681\u5728\u4e00\u4e2a\u5706\u4e0a\u722c\u884c，\u5706\u5fc3\u5750\u6807\u662f(0,0)，\u534a\u5f84r=4.5，\u4efb\u610f\u8f93\u5165\u8682\u8681\u5728\u5706\u4e0a\u7684\u5750\u6807(x,y)，\u5224\u65ad\u8fd9\u53ea\u8682\u8681\u662f\u5728\u5706\u5185，\u5706\u5468\u4e0a，\u8fd8\u662f\u5728\u5706\u5916\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e24\u4e2a\u6d6e\u70b9\u6570x,y<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5982\u679c\u5728\u5706\u5185，\u8f93\u51fain
\n\u5982\u679c\u5728\u5706\u5916，\u8f93\u51faout
\n\u5982\u679c\u5728\u5706\u4e0a，\u8f93\u51faon<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

1.0 1.0<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

in<\/p>\n

\u601d\u8def：\u6bd4\u8f83 x\u00b2+y\u00b2 \u4e0e r\u00b2=20.25，\u52a0 1e-6 \u5bb9\u5dee\u540e\u8f93\u51fa in\/on\/out，\u907f\u514d\u4e34\u754c\u70b9\u88ab\u6d6e\u70b9\u8bef\u5dee\u5e26\u504f\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1052 \u8682\u8681\u7684\u4f4d\u7f6e：\u5706 x^2+y^2 = 4.5^2 = 20.25<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n double<\/span> x,<\/span> y;<\/span>
\n const<\/span> double<\/span> R2 =<\/span> 4.5<\/span> *<\/span> 4.5<\/span>;<\/span> \/\/ 20.25<\/span>
\n const<\/span> double<\/span> eps =<\/span> 1e-6<\/span>;<\/span> \/\/ \u6d6e\u70b9\u8bef\u5dee\u5bb9\u9650<\/span>
\n while<\/span> (<\/span>cin >><\/span> x >><\/span> y)<\/span> {<\/span>
\n double<\/span> d =<\/span> x *<\/span> x +<\/span> y *<\/span> y;<\/span>
\n if<\/span> (<\/span>d <<\/span> R2 –<\/span> eps)<\/span> cout <<<\/span> "in\\\\n"<\/span>;<\/span>
\n else<\/span> if<\/span> (<\/span>d ><\/span> R2 +<\/span> eps)<\/span> cout <<<\/span> "out\\\\n"<\/span>;<\/span>
\n else<\/span> cout <<<\/span> "on\\\\n"<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1053 \u5403\u6c34\u679c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1053 \u5403\u6c34\u679c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5988\u5988\u53bb\u8d85\u5e02\u4e70\u6c34\u679c，\u5979\u95ee\u5c0f\u660e\u60f3\u5403\u4ec0\u4e48\u6c34\u679c，\u73b0\u5728\u8d85\u5e02\u53ea\u6709\u4e94\u79cd\u6c34\u679c，\u5206\u522b\u662fApple \u82f9\u679c，Banana \u9999\u8549，Cherry \u6a31\u6843，Durian \u69b4\u83b2，Mango \u8292\u679c\u3002\u5982\u679c\u5c0f\u660e\u8bf4\u2019A\u2019，\u5c31\u662f\u60f3\u5403Apple，\u5982\u679c\u5c0f\u660e\u8bf4\u2019B\u2019，\u5c31\u662f\u60f3\u5403Banana，\u5982\u679c\u5c0f\u660e\u8bf4\u2019C\u2019，\u5c31\u662f\u60f3\u5403Cherry ,\u5982\u679c\u5c0f\u660e\u8bf4\u2019D\u2019，\u5c31\u662f\u60f3\u5403Durian，\u5982\u679c\u5c0f\u660e\u968f\u4fbf\u8bf4\u5176\u5b83\u5b57\u6bcd，\u5988\u5988\u5c31\u4e70Mango\u3002
\n\u8bf7\u91c7\u7528switch\u8bed\u53e5\u5b9e\u73b0\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u6c34\u679c\u7684\u82f1\u6587\u5355\u8bcd\u9996\u5b57\u6bcd\u7684\u5927\u5c0f\u5f62\u5f0f<\/p>\n

\u8f93\u51fa<\/h4>\n

\u6c34\u679c\u7684\u82f1\u6587\u5355\u8bcd<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

A<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

Apple <\/p>\n

\u601d\u8def：switch \u6620\u5c04 A\/B\/C\/D \u2192 Apple\/Banana\/Cherry\/Durian，\u5927\u5199\u5c0f\u5199\u540c\u6620\u5c04，\u5176\u4f59 \u2192 Mango\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1053 \u5403\u6c34\u679c：switch \u5b9e\u73b0，A\/B\/C\/D -> \u5bf9\u5e94\u6c34\u679c，\u5176\u5b83 -> Mango<\/span>
\n\/\/ \u8f93\u5165\u4e3a\u9996\u5b57\u6bcd\u7684\u5927\u5c0f\u5199\u5f62\u5f0f，\u4e24\u79cd\u90fd\u5bf9\u5e94\u540c\u4e00\u79cd\u6c34\u679c<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n char<\/span> ch;<\/span>
\n if<\/span> (<\/span>cin >><\/span> ch)<\/span> {<\/span>
\n switch<\/span> (<\/span>ch)<\/span> {<\/span>
\n case<\/span> 'A'<\/span>:<\/span> case<\/span> 'a'<\/span>:<\/span> cout <<<\/span> "Apple\\\\n"<\/span>;<\/span> break<\/span>;<\/span>
\n case<\/span> 'B'<\/span>:<\/span> case<\/span> 'b'<\/span>:<\/span> cout <<<\/span> "Banana\\\\n"<\/span>;<\/span> break<\/span>;<\/span>
\n case<\/span> 'C'<\/span>:<\/span> case<\/span> 'c'<\/span>:<\/span> cout <<<\/span> "Cherry\\\\n"<\/span>;<\/span> break<\/span>;<\/span>
\n case<\/span> 'D'<\/span>:<\/span> case<\/span> 'd'<\/span>:<\/span> cout <<<\/span> "Durian\\\\n"<\/span>;<\/span> break<\/span>;<\/span>
\n default<\/span>:<\/span> cout <<<\/span> "Mango\\\\n"<\/span>;<\/span> break<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1054 \u8fdb\u5236\u8f6c\u6362<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1054 \u8fdb\u5236\u8f6c\u6362<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5c06\u4e00\u4e2a\u4e8c\u8fdb\u5236\u6570，\u8f6c\u6362\u4e3a\u5bf9\u5e94\u7684\u5341\u8fdb\u5236\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u53ea\u542b\u67090\u548c1\u7684\u5b57\u7b26\u4e32，\u4ee5\u56de\u8f66\u7ed3\u675f，\u8868\u793a\u4e00\u4e2a\u4e8c\u8fdb\u5236\u6570\u3002\u8be5\u4e8c\u8fdb\u5236\u6570\u65e0\u7b26\u53f7\u4f4d，\u957f\u5ea6\u4e0d\u8d85\u8fc731\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u4e00\u4e2a\u6574\u6570，\u4e3a\u8be5\u4e8c\u8fdb\u5236\u6570\u5bf9\u5e94\u7684\u5341\u8fdb\u5236\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u7b2c4\u7ae0\u5faa\u73af\u7ed3\u6784<\/p>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100000000001<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

2049<\/p>\n

\u601d\u8def：\u6309\u5b57\u7b26\u4e32\u8bfb\u5165\u4e8c\u8fdb\u5236\u6570（\u4fdd\u7559\u524d\u5bfc 0），\u9010\u4f4d v=v*2+(c-'0')，long long \u627f\u63a5 31 \u4f4d\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1054 \u8fdb\u5236\u8f6c\u6362：\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32 -> \u5341\u8fdb\u5236（\u957f\u5ea6<=31，\u7528 long long \u9632\u6ea2\u51fa）<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n string s;<\/span>
\n while<\/span> (<\/span>cin >><\/span> s)<\/span> {<\/span>
\n long<\/span> long<\/span> v =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>size_t i =<\/span> 0<\/span>;<\/span> i <<\/span> s.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> ++<\/span>i)<\/span>
\n v =<\/span> v *<\/span> 2<\/span> +<\/span> (<\/span>s[<\/span>i]<\/span> –<\/span> '0'<\/span>)<\/span>;<\/span>
\n cout <<<\/span> v <<<\/span> "\\\\n"<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1055 \u6574\u6570\u5bf9\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1055 \u6574\u6570\u5bf9\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u4e24\u4e2a\u6b63\u6574\u6570m\u548cn，\u8f93\u51fam\u5230n\u4e4b\u95f4\u6bcf\u4e2a\u6574\u6570\u7684\u81ea\u7136\u5bf9\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u5305\u62ec\u4e24\u4e2a\u6574\u6570m\u548cn（m < n），\u4e4b\u95f4\u7528\u4e00\u4e2a\u7a7a\u683c\u9694\u5f00\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u6bcf\u884c\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\u53ca\u5176\u5bf9\u6570，\u6574\u6570\u53604\u5217，\u5bf9\u6570\u53608\u5217，\u53f3\u5bf9\u9f50，\u5bf9\u6570\u4fdd\u75594\u4f4d\u5c0f\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

2 4<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

2 0.6931
\n 3 1.0986
\n 4 1.3863<\/p>\n

\u601d\u8def：printf("%4d%8.4f") \u2014\u2014 \u6574\u6570\u5360 4 \u5217\u3001\u5bf9\u6570（\u81ea\u7136\u5bf9\u6570 ln）\u5360 8 \u5217\u53f3\u5bf9\u9f50，\u5360\u4f4d\u5217\u4e0d\u80fd\u7701\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n-m+1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1055 \u6574\u6570\u5bf9\u6570：\u6574\u6570\u53604\u5217\u3001\u5bf9\u6570\u53608\u5217\u3001\u53f3\u5bf9\u9f50\u3001\u5bf9\u6570\u4fdd\u75594\u4f4d\u5c0f\u6570<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> m,<\/span> n;<\/span>
\n while<\/span> (<\/span>cin >><\/span> m >><\/span> n)<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> m;<\/span> i <=<\/span> n;<\/span> ++<\/span>i)<\/span>
\n printf<\/span>(<\/span>"%4d%8.4f\\\\n"<\/span>,<\/span> i,<\/span> log<\/span>(<\/span>(<\/span>double<\/span>)<\/span>i)<\/span>)<\/span>;<\/span> \/\/ \u81ea\u7136\u5bf9\u6570 ln<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1056 \u6574\u6570\u6570\u5b57<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1056 \u6574\u6570\u6570\u5b57<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n（n \u2264 109），\u4ece\u9ad8\u4f4d\u5f00\u59cb\u9010\u4f4d\u5206\u5272\u5e76\u8f93\u51fa\u5404\u4f4d\u6570\u5b57\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4f9d\u6b21\u8f93\u51fa\u5404\u4f4d\u4e0a\u7684\u6570\u5b57，\u6bcf\u4e00\u4e2a\u6570\u5b57\u540e\u9762\u6709\u4e00\u4e2a\u7a7a\u683c，\u8f93\u51fa\u5360\u4e00\u884c\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

12345<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

1 2 3 4 5<\/p>\n

\u601d\u8def：\u6309\u5b57\u7b26\u4e32\u9010\u4f4d\u8f93\u51fa\u6bcf\u4e2a\u6570\u5b57，\u4e14\u6bcf\u4f4d\u6570\u5b57\u540e\u90fd\u8ddf\u4e00\u4e2a\u7a7a\u683c\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1056 \u6574\u6570\u6570\u5b57：\u4ece\u9ad8\u4f4d\u5230\u4f4e\u4f4d\u9010\u4f4d\u8f93\u51fa，\u6bcf\u4e2a\u6570\u5b57\u540e\u9762\u8ddf\u4e00\u4e2a\u7a7a\u683c<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n while<\/span> (<\/span>cin >><\/span> n)<\/span> {<\/span>
\n string s =<\/span> to_string<\/span>(<\/span>n)<\/span>;<\/span> \/\/ n \u4e3a\u6b63\u6574\u6570<\/span>
\n for<\/span> (<\/span>size_t i =<\/span> 0<\/span>;<\/span> i <<\/span> s.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> ++<\/span>i)<\/span>
\n printf<\/span>(<\/span>"%c "<\/span>,<\/span> s[<\/span>i]<\/span>)<\/span>;<\/span> \/\/ \u6bcf\u4e2a\u6570\u5b57\u540e\u4e00\u4e2a\u7a7a\u683c<\/span>
\n printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1057 \u4f18\u60e0\u652f\u4ed8<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1057 \u4f18\u60e0\u652f\u4ed8<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u53cc11\u6765\u4e34，\u5546\u573a\u7ed9\u51fa\u5404\u79cd\u4f18\u60e0\u6d3b\u52a8，\u6709\u6ee1\u51cf\u5238\u548c\u6253\u6298\u5238\u3002\u5c0f\u660e\u4e5f\u51c6\u5907\u4e70\u51e0\u8eab\u6f02\u4eae\u8863\u670d，\u597d\u597d\u628a\u81ea\u5df1\u6253\u626e\u4e00\u756a\u3002\u6ee1\u51cf\u5238\u548c\u6253\u6298\u5238\u53ef\u4ee5\u540c\u65f6\u4f7f\u7528，\u4e5f\u53ef\u4ee5\u4f7f\u7528\u4e00\u79cd，\u540c\u65f6\u4f7f\u7528\u65f6\u5148\u8fdb\u884c\u6253\u6298，\u6253\u6298\u540e\u7684\u91d1\u989d\u518d\u8fdb\u884c\u6ee1\u51cf，\u8bf7\u4f60\u8ba1\u7b97\u4e00\u4e0b\u5c0f\u660e\u9700\u8981\u652f\u4ed8\u591a\u5c11\u94b1？<\/p>\n

\u8f93\u5165<\/h4>\n

\u7b2c\u4e00\u884c\u8f93\u5165\u4e24\u4e2a\u6574\u6570\u8868\u793a\u6ee1\u51cf\u4f18\u60e0\u6d3b\u52a8，\u4f8b\u5982：100 50\u8868\u793a\u6bcf\u6ee1100\u51cf50\u3002\u7b2c\u4e8c\u884c\u8f93\u5165\u4e00\u4e2a(0, 1)\u533a\u95f4\u4e0a\u7684\u5b9e\u6570，\u8868\u793a\u6253\u6298\u4f18\u60e0\u6d3b\u52a8\u3002\u4ee5\u4e0b\u591a\u884c\u8f93\u5165\u6240\u9009\u5546\u54c1\u7684\u5355\u4ef7\u548c\u6570\u91cf，\u5355\u4ef7\u4e0d\u4e00\u5b9a\u662f\u6574\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u8d2d\u4e70\u5546\u54c1\u6700\u5c11\u9700\u8981\u652f\u4ed8\u7684\u91d1\u989d，\u4fdd\u7559\u4e24\u4f4d\u5c0f\u6570\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6ce8\u610f：\u672c\u9898\u6837\u4f8b\u5b58\u5728\u6ee1x\u51cfy(x<y)\u7684\u60c5\u51b5，\u4f46\u652f\u4ed8\u91d1\u989d\u4e0d\u80fd\u4e3a\u8d1f\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100 50
\n0.75
\n120 1
\n69 2<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

143.50<\/p>\n

\u601d\u8def：\u6ee1\u51cf\u5238\/\u6253\u6298\u5238\u53ef\u540c\u7528\u6216\u53ea\u7528\u4e00\u79cd，\u300c\u6700\u5c11\u652f\u4ed8\u300d= 4 \u79cd\u65b9\u6848（\u90fd\u4e0d\u7528 \/ \u53ea\u6253\u6298 \/ \u53ea\u6ee1\u51cf \/ \u5148\u6298\u540e\u51cf）\u53d6\u6700\u5c0f，\u6bcf\u79cd\u91d1\u989d\u94b3 0 \u540e\u8f93\u51fa %.2f\u3002\u771f\u673a\u9a8c\u8bc1：\u53ea\u7b97\u300c\u5148\u6298\u540e\u51cf\u300d\u4f1a\u6302\u6570\u636e（AC:95%），\u53d6 min \u540e AC\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u5546\u54c1\u884c\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1057 \u4f18\u60e0\u652f\u4ed8：\u6ee1\u51cf\u5238\u4e0e\u6253\u6298\u5238\u53ef\u540c\u65f6\u7528\/\u53ea\u7528\u4e00\u79cd，\u6c42"\u6700\u5c11"\u652f\u4ed8\u91d1\u989d<\/span>
\n\/\/ 4 \u79cd\u65b9\u6848\u53d6\u6700\u5c0f：\u90fd\u4e0d\u7528 \/ \u53ea\u6253\u6298 \/ \u53ea\u6ee1\u51cf \/ \u5148\u6253\u6298\u540e\u6ee1\u51cf（\u9898\u9762\u89c4\u5b9a\u540c\u7528\u65f6\u5148\u6298\u540e\u51cf），<\/span>
\n\/\/ \u6bcf\u79cd\u65b9\u6848\u91d1\u989d\u5747\u4e0d\u80fd\u4e3a\u8d1f（\u94b3 0）\u3002\u6ee1\u51cf\u6309"\u6bcf\u6ee1 x \u51cf y"\u8ba1\u7b97\u6b21\u6570\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

double<\/span> clamp0<\/span>(<\/span>double<\/span> v)<\/span> {<\/span> return<\/span> v <<\/span> 0<\/span> ?<\/span> 0<\/span> :<\/span> v;<\/span> }<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> x,<\/span> y;<\/span> \/\/ \u6bcf\u6ee1 x \u51cf y<\/span>
\n double<\/span> disc;<\/span> \/\/ \u6298\u6263\u7387 (0,1)<\/span>
\n if<\/span> (<\/span>!<\/span>(<\/span>cin >><\/span> x >><\/span> y)<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n cin >><\/span> disc;<\/span><\/p>\n

double<\/span> total =<\/span> 0.0<\/span>;<\/span> \/\/ \u5546\u54c1\u603b\u4ef7<\/span>
\n double<\/span> p,<\/span> q;<\/span> \/\/ \u5355\u4ef7\u3001\u6570\u91cf<\/span>
\n while<\/span> (<\/span>cin >><\/span> p >><\/span> q)<\/span> total +=<\/span> p *<\/span> q;<\/span><\/p>\n

auto<\/span> manjian =<\/span> [<\/span>&<\/span>]<\/span>(<\/span>double<\/span> v)<\/span> -><\/span> double<\/span> {<\/span>
\n long<\/span> long<\/span> cnt =<\/span> 0<\/span>;<\/span>
\n if<\/span> (<\/span>x ><\/span> 0<\/span>)<\/span> cnt =<\/span> (<\/span>long<\/span> long<\/span>)<\/span>floor<\/span>(<\/span>v \/<\/span> (<\/span>double<\/span>)<\/span>x +<\/span> 1e-9<\/span>)<\/span>;<\/span>
\n return<\/span> clamp0<\/span>(<\/span>v –<\/span> (<\/span>double<\/span>)<\/span>cnt *<\/span> y)<\/span>;<\/span>
\n }<\/span>;<\/span><\/p>\n

double<\/span> pay0 =<\/span> clamp0<\/span>(<\/span>total)<\/span>;<\/span> \/\/ \u90fd\u4e0d\u7528<\/span>
\n double<\/span> pay1 =<\/span> clamp0<\/span>(<\/span>total *<\/span> disc)<\/span>;<\/span> \/\/ \u53ea\u6253\u6298<\/span>
\n double<\/span> pay2 =<\/span> manjian<\/span>(<\/span>total)<\/span>;<\/span> \/\/ \u53ea\u6ee1\u51cf<\/span>
\n double<\/span> pay3 =<\/span> manjian<\/span>(<\/span>total *<\/span> disc)<\/span>;<\/span> \/\/ \u5148\u6253\u6298\u540e\u6ee1\u51cf<\/span><\/p>\n

double<\/span> ans =<\/span> min<\/span>(<\/span>min<\/span>(<\/span>pay0,<\/span> pay1)<\/span>,<\/span> min<\/span>(<\/span>pay2,<\/span> pay3)<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%.2f\\\\n"<\/span>,<\/span> ans)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1058 \u6700\u4e0d\u9ad8\u5174<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1058 \u6700\u4e0d\u9ad8\u5174<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5c0f\u660e\u4e0a\u521d\u4e2d\u4e86\u3002\u5988\u5988\u8ba4\u4e3a\u5c0f\u660e\u5e94\u8be5\u66f4\u52a0\u7528\u529f\u5b66\u4e60，\u6240\u4ee5\u5c0f\u660e\u9664\u4e86\u4e0a\u5b66\u4e4b\u5916，\u8fd8\u8981\u53c2\u52a0\u5988\u5988\u4e3a\u4ed6\u62a5\u540d\u7684\u5404\u79d1\u590d\u4e60\u73ed\u3002\u53e6\u5916\u6bcf\u5468\u5988\u5988\u8fd8\u4f1a\u9001\u4ed6\u53bb\u5b66\u4e60\u6717\u8bf5\u3001\u821e\u8e48\u548c\u94a2\u7434\u3002\u4f46\u662f\u5c0f\u660e\u5982\u679c\u4e00\u5929\u4e0a\u8bfe\u8d85\u8fc7\u516b\u4e2a\u5c0f\u65f6\u5c31\u4f1a\u4e0d\u9ad8\u5174，\u800c\u4e14\u4e0a\u5f97\u8d8a\u4e45\u5c31\u4f1a\u8d8a\u4e0d\u9ad8\u5174\u3002
\n\u5047\u8bbe\u5c0f\u660e\u4e0d\u4f1a\u56e0\u4e3a\u5176\u5b83\u4e8b\u4e0d\u9ad8\u5174，\u5e76\u4e14\u4ed6\u7684\u4e0d\u9ad8\u5174\u4e0d\u4f1a\u6301\u7eed\u5230\u7b2c\u4e8c\u5929\u3002\u8bf7\u4f60\u5e2e\u5fd9\u68c0\u67e5\u5c0f\u660e\u4e0b\u5468\u7684\u65e5\u7a0b\u5b89\u6392，\u770b\u770b\u4e0b\u5468\u4ed6\u662f\u5426\u4f1a\u4e0d\u9ad8\u5174；\u5982\u679c\u4f1a\u7684\u8bdd，\u54ea\u5929\u6700\u4e0d\u9ad8\u5174？<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u5305\u62ec 7 \u884c\u6570\u636e，\u5206\u522b\u8868\u793a\u5468\u4e00\u5230\u5468\u65e5\u7684\u65e5\u7a0b\u5b89\u6392\u3002\u6bcf\u884c\u5305\u62ec\u4e24\u4e2a\u5c0f\u4e8e 10 \u7684\u975e\u8d1f\u6574\u6570，\u7528\u7a7a\u683c\u9694\u5f00，\u5206\u522b\u8868\u793a\u5c0f\u660e\u5728\u5b66\u6821\u4e0a\u8bfe\u7684\u65f6\u95f4\u548c\u5988\u5988\u5b89\u6392\u4ed6\u4e0a\u8bfe\u7684\u65f6\u95f4\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4e00\u4e2a\u6570\u5b57\u3002\u5982\u679c\u4e0d\u4f1a\u4e0d\u9ad8\u5174\u5219\u8f93\u51fa 0，\u5982\u679c\u4f1a\u5219\u8f93\u51fa\u6700\u4e0d\u9ad8\u5174\u7684\u662f\u5468\u51e0（\u7528 1-7\u5206\u522b\u8868\u793a\u5468\u4e00\u81f3\u5468\u65e5）\u3002\u5982\u679c\u6709\u4e24\u5929\u6216\u4e24\u5929\u4ee5\u4e0a\u4e0d\u9ad8\u5174\u7684\u7a0b\u5ea6\u76f8\u5f53，\u5219\u8f93\u51fa\u65f6\u95f4\u6700\u9760\u524d\u7684\u4e00\u5929\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

5 3
\n6 2
\n7 2
\n5 3
\n5 4
\n0 4
\n0 6<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

3<\/p>\n

\u601d\u8def：7 \u5929\u6c42\u548c，\u53ea\u6709\u548c\u6570 >8 \u624d\u7b97\u4e0d\u9ad8\u5174；\u4e25\u683c\u6bd4\u8f83\u4fdd\u8bc1\u5e76\u5217\u65f6\u53d6\u6700\u65e9\u7684\u4e00\u5929\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1058 \u6700\u4e0d\u9ad8\u5174：7\u5929，\u6bcf\u5929\u4e24\u6bb5\u65f6\u95f4\u4e4b\u548c >8 \u5373\u4e0d\u9ad8\u5174，\u53d6\u6700\u4e0d\u9ad8\u5174\u4e14\u6700\u9760\u524d\u7684\u4e00\u5929<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> bestDay =<\/span> 0<\/span>,<\/span> bestSum =<\/span> –<\/span>1<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> 7<\/span>;<\/span> ++<\/span>i)<\/span> {<\/span>
\n int<\/span> a,<\/span> b;<\/span>
\n cin >><\/span> a >><\/span> b;<\/span>
\n int<\/span> s =<\/span> a +<\/span> b;<\/span>
\n if<\/span> (<\/span>s ><\/span> bestSum)<\/span> {<\/span> bestSum =<\/span> s;<\/span> bestDay =<\/span> i;<\/span> }<\/span> \/\/ \u4e25\u683c\u5927\u4e8e => \u5e76\u5217\u53d6\u6700\u9760\u524d<\/span>
\n }<\/span>
\n if<\/span> (<\/span>bestSum <=<\/span> 8<\/span>)<\/span> cout <<<\/span> 0<\/span> <<<\/span> "\\\\n"<\/span>;<\/span>
\n else<\/span> cout <<<\/span> bestDay <<<\/span> "\\\\n"<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1059 \u753b\u77e9\u5f62<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1059 \u753b\u77e9\u5f62<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6839\u636e\u53c2\u6570，\u753b\u51fa\u77e9\u5f62\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u884c，\u5305\u62ec\u56db\u4e2a\u53c2\u6570：\u524d\u4e24\u4e2a\u53c2\u6570\u4e3a\u6574\u6570，\u4f9d\u6b21\u4ee3\u8868\u77e9\u5f62\u7684\u9ad8\u548c\u5bbd（\u9ad8\u4e0d\u5c11\u4e8e3\u884c\u4e0d\u591a\u4e8e10\u884c，\u5bbd\u4e0d\u5c11\u4e8e5\u5217\u4e0d\u591a\u4e8e10\u5217）；\u7b2c\u4e09\u4e2a\u53c2\u6570\u662f\u4e00\u4e2a\u5b57\u7b26，\u8868\u793a\u7528\u6765\u753b\u56fe\u7684\u77e9\u5f62\u7b26\u53f7；\u7b2c\u56db\u4e2a\u53c2\u6570\u4e3a0\u62161，0\u4ee3\u8868\u7a7a\u5fc3，1\u4ee3\u8868\u5b9e\u5fc3\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u753b\u51fa\u7684\u56fe\u5f62\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

7 7 # 0<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

#######
\n# #
\n# #
\n# #
\n# #
\n# #
\n#######<\/p>\n

\u601d\u8def：\u5b9e\u5fc3\u6bcf\u884c w \u4e2a\u5b57\u7b26；\u7a7a\u5fc3\u9996\u672b\u884c w \u4e2a\u5b57\u7b26\u3001\u4e2d\u95f4\u884c\u4e24\u7aef\u5404 1 \u4e2a\u5b57\u7b26\u3001\u4e2d\u95f4\u7559 w-2 \u4e2a\u7a7a\u683c\u3002<\/p>\n

\u590d\u6742\u5ea6：O(h\u00b7w)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1059 \u753b\u77e9\u5f62：flag=1 \u5b9e\u5fc3；flag=0 \u7a7a\u5fc3<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> h,<\/span> w,<\/span> flag;<\/span>
\n char<\/span> c;<\/span>
\n while<\/span> (<\/span>cin >><\/span> h >><\/span> w >><\/span> c >><\/span> flag)<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> h;<\/span> ++<\/span>i)<\/span> {<\/span>
\n if<\/span> (<\/span>flag ==<\/span> 1<\/span> ||<\/span> i ==<\/span> 0<\/span> ||<\/span> i ==<\/span> h –<\/span> 1<\/span>)<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <<\/span> w;<\/span> ++<\/span>j)<\/span> putchar<\/span>(<\/span>c)<\/span>;<\/span> \/\/ \u5b9e\u5fc3\u884c\/\u4e0a\u4e0b\u8fb9\u6846<\/span>
\n putchar<\/span>(<\/span>'\\\\n'<\/span>)<\/span>;<\/span>
\n }<\/span> else<\/span> {<\/span>
\n putchar<\/span>(<\/span>c)<\/span>;<\/span> \/\/ \u7a7a\u5fc3\u884c：\u8fb9\u6846 + \u7a7a\u683c<\/span>
\n for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <<\/span> w –<\/span> 2<\/span>;<\/span> ++<\/span>j)<\/span> putchar<\/span>(<\/span>' '<\/span>)<\/span>;<\/span>
\n putchar<\/span>(<\/span>c)<\/span>;<\/span>
\n putchar<\/span>(<\/span>'\\\\n'<\/span>)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1060 \u89d2\u8c37\u731c\u60f3<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1060 \u89d2\u8c37\u731c\u60f3<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u89d2\u8c37\u731c\u60f3\u662f\u6307\u5bf9\u4e8e\u4efb\u610f\u4e00\u4e2a\u6b63\u6574\u6570，\u5982\u679c\u662f\u5947\u6570，\u5219\u4e583\u52a01，\u5982\u679c\u662f\u5076\u6570，\u5219\u9664\u4ee52，\u5f97\u5230\u7684\u7ed3\u679c\u518d\u6309\u7167\u4e0a\u8ff0\u89c4\u5219\u91cd\u590d\u5904\u7406，\u6700\u7ec8\u603b\u80fd\u591f\u5f97\u52301\u3002\u5982，\u5047\u5b9a\u521d\u59cb\u6574\u6570\u4e3a5，\u8ba1\u7b97\u8fc7\u7a0b\u5206\u522b\u4e3a16\u30018\u30014\u30012\u30011\u3002\u7a0b\u5e8f\u8981\u6c42\u8f93\u5165\u4e00\u4e2a\u6574\u6570，\u5c06\u7ecf\u8fc7\u5904\u7406\u5f97\u52301\u7684\u8fc7\u7a0b\u8f93\u51fa\u6765\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570N（N \u2264 106）\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4ece\u8f93\u5165\u6574\u6570\u52301\u7684\u6b65\u9aa4，\u6bcf\u4e00\u6b65\u4e3a\u4e00\u884c，\u6bcf\u4e00\u6b65\u4e2d\u63cf\u8ff0\u8ba1\u7b97\u8fc7\u7a0b\u3002\u6700\u540e\u4e00\u884c\u8f93\u51fa\u201cEnd\u201d\u3002\u5982\u679c\u8f93\u5165\u4e3a1，\u76f4\u63a5\u8f93\u51fa\u201cEnd\u201d\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

5<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

5*3+1=16
\n16\/2=8
\n8\/2=4
\n4\/2=2
\n2\/2=1
\nEnd<\/p>\n

\u601d\u8def：\u89d2\u8c37\u731c\u60f3：\u5947\u6570 n=n*3+1\u3001\u5076\u6570 n=n\/2，\u6bcf\u6b65\u8f93\u51fa\u7b97\u5f0f，\u6700\u540e\u8f93\u51fa End\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u6b65\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1060 \u89d2\u8c37\u731c\u60f3（3n+1 \u731c\u60f3）<\/span>
\n\/\/ \u5947\u6570：n*3+1；\u5076\u6570：n\/2；\u6bcf\u4e00\u6b65\u8f93\u51fa\u4e00\u884c\u8fc7\u7a0b，\u6700\u540e\u8f93\u51fa End；n=1 \u65f6\u76f4\u63a5\u8f93\u51fa End\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

\/\/ \u8fc7\u7a0b\u4e2d\u6570\u503c\u53ef\u80fd\u8d85\u8fc7 int（\u4f8b\u5982 3n+1），\u7528 long long \u66f4\u7a33\u59a5<\/span>
\n while<\/span> (<\/span>n !=<\/span> 1<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>n %<\/span> 2<\/span> ==<\/span> 1<\/span>)<\/span> {<\/span> \/\/ \u5947\u6570：\u4e58 3 \u52a0 1<\/span>
\n printf<\/span>(<\/span>"%lld*3+1=%lld\\\\n"<\/span>,<\/span> n,<\/span> n *<\/span> 3<\/span> +<\/span> 1<\/span>)<\/span>;<\/span>
\n n =<\/span> n *<\/span> 3<\/span> +<\/span> 1<\/span>;<\/span>
\n }<\/span> else<\/span> {<\/span> \/\/ \u5076\u6570：\u9664\u4ee5 2<\/span>
\n printf<\/span>(<\/span>"%lld\/2=%lld\\\\n"<\/span>,<\/span> n,<\/span> n \/<\/span> 2<\/span>)<\/span>;<\/span>
\n n \/=<\/span> 2<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"End\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1061 \u516c\u5f0f\u6c42\u503c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1061 \u516c\u5f0f\u6c42\u503c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5229\u7528\u516c\u5f0fe = 1 + 1\/1! + 1\/2! + 1\/3! + \u2026 + 1\/n! \u6c42e\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u53ea\u6709\u4e00\u884c，\u8be5\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570n（n \u2265 1），\u8868\u793a\u8ba1\u7b97e\u65f6\u7d2f\u52a0\u52301\/n！\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u53ea\u6709\u4e00\u884c，\u8be5\u884c\u5305\u542b\u8ba1\u7b97\u51fa\u6765\u7684e\u7684\u503c，\u8981\u6c42\u6253\u5370\u5c0f\u6570\u70b9\u540e10\u4f4d\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

10<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

2.7182818011<\/p>\n

\u601d\u8def：e=1+\u03a31\/i!，\u7528 term\/=i \u9012\u63a8\u907f\u514d\u76f4\u63a5\u7b97\u9636\u4e58，\u8f93\u51fa 10 \u4f4d\u5c0f\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1061 \u516c\u5f0f\u6c42\u503c：e = 1 + 1\/1! + 1\/2! + … + 1\/n!，\u4fdd\u7559 10 \u4f4d\u5c0f\u6570<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

double<\/span> e =<\/span> 1.0<\/span>;<\/span> \/\/ \u7b2c 0 \u9879 1\/0! = 1<\/span>
\n double<\/span> term =<\/span> 1.0<\/span>;<\/span> \/\/ \u5f53\u524d\u9879 1\/i!<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> n;<\/span> ++<\/span>i)<\/span> {<\/span>
\n term \/=<\/span> i;<\/span> \/\/ \u9012\u63a8\u6c42 1\/i!，\u907f\u514d\u76f4\u63a5\u7b97\u9636\u4e58\u5bfc\u81f4\u6ea2\u51fa<\/span>
\n e +=<\/span> term;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%.10f\\\\n"<\/span>,<\/span> e)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1062 \u6574\u6570\u7d2f\u52a0<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1062 \u6574\u6570\u7d2f\u52a0<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6c42m+(m+1)+\u2026+n\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e24\u4e2a\u6b63\u6574\u6570m\u548cn（m<n）\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4ecem\u52a0\u5230n\u7684\u548c\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

1 3<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

6<\/p>\n

\u601d\u8def：\u7b49\u5dee\u6570\u5217\u6c42\u548c (m+n)*(n-m+1)\/2，\u7528\u516c\u5f0f\u66ff\u4ee3\u5faa\u73af\u5e76\u9632\u6ea2\u51fa\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1062 \u6574\u6570\u7d2f\u52a0：\u6c42 m+(m+1)+…+n（m<n，n \u53ef\u80fd\u5f88\u5927，\u7528 long long \u9632\u6ea2\u51fa）<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> m,<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>m,<\/span> &<\/span>n)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

\/\/ \u7b49\u5dee\u6570\u5217\u6c42\u548c：(\u9996\u9879 + \u672b\u9879) * \u9879\u6570 \/ 2<\/span>
\n long<\/span> long<\/span> sum =<\/span> (<\/span>m +<\/span> n)<\/span> *<\/span> (<\/span>n –<\/span> m +<\/span> 1<\/span>)<\/span> \/<\/span> 2<\/span>;<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> sum)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1063 \u591a\u5b9e\u4f8b\u6d4b\u8bd5<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1063 \u591a\u5b9e\u4f8b\u6d4b\u8bd5<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u591a\u7ec4\u6570\u636e，\u6bcf\u7ec4\u6570\u636e\u5305\u542b\u4e24\u4e2a\u6574\u6570a\u548cb，\u5bf9\u6bcf\u7ec4\u6570\u636e\u8f93\u51faa+b\u7684\u7ed3\u679c\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u591a\u7ec4\u6570\u636e，\u6bcf\u7ec4\u4e00\u884c，\u4e3a\u4e24\u4e2a\u4ee5\u7a7a\u683c\u5206\u9694\u7684\u6574\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5bf9\u6bcf\u7ec4\u6570\u636e\u8f93\u51faa+b\u7684\u7ed3\u679c，\u6bcf\u7ec4\u7ed3\u679c\u5360\u4e00\u884c\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u4fdd\u8bc1\u7ed3\u679c\u90fd\u5728\u6574\u578b\u8303\u56f4\u5185，\u5e76\u4e14 \u6570\u636e\u4e2a\u6570 \u2264 100<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

1 2
\n3 4<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

3
\n7<\/p>\n

\u601d\u8def：\u591a\u5b9e\u4f8b：while(scanf(…)==2) \u8bfb\u5230 EOF，\u6bcf\u7ec4\u8f93\u51fa\u4e00\u884c a+b\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u7ec4\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1063 \u591a\u5b9e\u4f8b\u6d4b\u8bd5：\u8bfb\u5165\u5230 EOF，\u6bcf\u884c\u4e00\u5bf9 a b，\u8f93\u51fa a+b<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> a,<\/span> b;<\/span>
\n while<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b)<\/span> ==<\/span> 2<\/span>)<\/span> {<\/span> \/\/ \u8bfb\u5230\u6587\u4ef6\u7ed3\u675f<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> a +<\/span> b)<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1064 \u6700\u5c0f\u6574\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1064 \u6700\u5c0f\u6574\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u6b63\u6574\u6570n，\u6c42\u4f7f1+2+\u2026+i>=n\u6210\u7acb\u7684\u6700\u5c0f\u6574\u6570i\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4f7f1+2+\u2026+i>=n\u6210\u7acb\u7684\u6700\u5c0f\u6574\u6570i\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

123<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

16<\/p>\n

\u601d\u8def：\u627e\u6700\u5c0f i \u4f7f i(i+1)\/2 \u2265 n；\u7528 sqrt \u4f30\u7b97\u540e\u53cc\u5411\u5fae\u8c03，\u505a\u5230 O(1) \u800c\u975e\u7d2f\u52a0\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1064 \u6700\u5c0f\u6574\u6570：\u6c42\u6700\u5c0f\u7684 i \u4f7f 1+2+…+i >= n，\u5373 i(i+1)\/2 >= n<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

\/\/ \u5148\u7528\u6c42\u6839\u516c\u5f0f\u4f30\u7b97 i（\u89e3 i^2+i-2n=0），\u518d\u505a\u5fae\u8c03，\u907f\u514d\u6734\u7d20\u5faa\u73af\u5728\u5927 n \u65f6\u8d85\u65f6<\/span>
\n long<\/span> long<\/span> i =<\/span> (<\/span>long<\/span> long<\/span>)<\/span>(<\/span>(<\/span>sqrtl<\/span>(<\/span>1.0L<\/span> +<\/span> 8.0L<\/span> *<\/span> (<\/span>long<\/span> double<\/span>)<\/span>n)<\/span> –<\/span> 1.0L<\/span>)<\/span> \/<\/span> 2.0L<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>i <<\/span> 1<\/span>)<\/span> i =<\/span> 1<\/span>;<\/span>
\n \/\/ \u7528 long double \u6bd4\u8f83，\u907f\u514d\u5927 n \u65f6 i*(i+1) \u6ea2\u51fa<\/span>
\n while<\/span> (<\/span>(<\/span>long<\/span> double<\/span>)<\/span>i *<\/span> (<\/span>i +<\/span> 1<\/span>)<\/span> \/<\/span> 2.0L<\/span> <<\/span> (<\/span>long<\/span> double<\/span>)<\/span>n)<\/span> ++<\/span>i;<\/span> \/\/ \u4fdd\u8bc1\u6ee1\u8db3\u4e0d\u7b49\u5f0f<\/span>
\n while<\/span> (<\/span>i ><\/span> 1<\/span> &&<\/span> (<\/span>long<\/span> double<\/span>)<\/span>(<\/span>i –<\/span> 1<\/span>)<\/span> *<\/span> i \/<\/span> 2.0L<\/span> >=<\/span> (<\/span>long<\/span> double<\/span>)<\/span>n)<\/span> —<\/span>i;<\/span> \/\/ \u4fdd\u8bc1 i \u6700\u5c0f<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> i)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1065 \u8d28\u6570\u5224\u65ad<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1065 \u8d28\u6570\u5224\u65ad<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u6b63\u6574\u6570n，\u5224\u5b9a\u5b83\u662f\u5426\u4e3a\u7d20\u6570(prime，\u53c8\u79f0\u8d28\u6570)\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u82e5n\u4e3a\u8d28\u6570\u5219\u8f93\u51fa\u201cYes\u201d，\u5426\u5219\u8f93\u51fa\u201cNo\u201d\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

n \u5728\u6574\u578b\u8303\u56f4\u5185<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

5<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

Yes<\/p>\n

\u601d\u8def：n\u22652 \u624d\u53ef\u80fd\u8d28\u6570；\u8bd5\u9664\u5230 sqrt(n)，\u5199\u6210 i<=n\/i \u9632\u6b62 i*i \u6ea2\u51fa\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u221an)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1065 \u8d28\u6570\u5224\u65ad：n \u5728\u6574\u578b\u8303\u56f4\u5185<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

\/\/ 1 \u4e0d\u662f\u8d28\u6570；2 \u662f\u6700\u5c0f\u7684\u8d28\u6570<\/span>
\n bool<\/span> prime =<\/span> (<\/span>n >=<\/span> 2<\/span>)<\/span>;<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> i =<\/span> 2<\/span>;<\/span> i <=<\/span> n \/<\/span> i;<\/span> ++<\/span>i)<\/span> {<\/span> \/\/ \u8bd5\u9664\u5230 sqrt(n)，\u5199\u6210 n\/i \u53ef\u907f\u514d i*i \u6ea2\u51fa<\/span>
\n if<\/span> (<\/span>n %<\/span> i ==<\/span> 0<\/span>)<\/span> {<\/span>
\n prime =<\/span> false<\/span>;<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%s\\\\n"<\/span>,<\/span> prime ?<\/span> "Yes"<\/span> :<\/span> "No"<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1066 \u524dn\u9879\u548c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1066 \u524dn\u9879\u548c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u6b63\u6574\u6570n，\u6c421-2\/3+3\/5-4\/7+5\/9-6\/11+\u2026\u7684\u524dn\u9879\u548c，\u7ed3\u679c\u4fdd\u75593\u4f4d\u5c0f\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u6c421-2\/3+3\/5-4\/7+5\/9-6\/11+\u2026\u7684\u524dn\u9879\u548c\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

0.391<\/p>\n

\u601d\u8def：\u7b2c i \u9879 = (-1)^(i-1)\u00b7i\/(2i-1)，\u7d2f\u52a0\u540e\u8f93\u51fa 3 \u4f4d\u5c0f\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1066 \u524dn\u9879\u548c：1 – 2\/3 + 3\/5 – 4\/7 + 5\/9 – …<\/span>
\n\/\/ \u7b2c i \u9879\u4e3a (-1)^(i-1) * i\/(2i-1)，\u5171 n \u9879，\u7ed3\u679c\u4fdd\u7559 3 \u4f4d\u5c0f\u6570<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

double<\/span> s =<\/span> 0.0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> n;<\/span> ++<\/span>i)<\/span> {<\/span>
\n double<\/span> t =<\/span> (<\/span>double<\/span>)<\/span>i \/<\/span> (<\/span>2.0<\/span> *<\/span> i –<\/span> 1.0<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>i %<\/span> 2<\/span> ==<\/span> 1<\/span>)<\/span> s +=<\/span> t;<\/span> \/\/ \u5947\u6570\u9879\u4e3a\u6b63<\/span>
\n else<\/span> s -=<\/span> t;<\/span> \/\/ \u5076\u6570\u9879\u4e3a\u8d1f<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%.3f\\\\n"<\/span>,<\/span> s)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1067 \u8d28\u6570\u5224\u65ad（break）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1067 \u8d28\u6570\u5224\u65ad（break）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u6b63\u6574\u6570n，\u5224\u5b9a\u5b83\u662f\u5426\u4e3a\u7d20\u6570(prime，\u53c8\u79f0\u8d28\u6570)，\u8981\u6c42\u4f7f\u7528break\u8bed\u53e5\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u82e5n\u4e3a\u8d28\u6570\u5219\u8f93\u51fa\u201cYes\u201d，\u5426\u5219\u8f93\u51fa\u201cNo\u201d\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

7<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

Yes<\/p>\n

\u601d\u8def：\u4e0e 1065 \u540c\u89e3，\u663e\u5f0f\u7528 break \u5728\u627e\u5230\u56e0\u5b50\u65f6\u63d0\u524d\u8df3\u51fa，\u6ee1\u8db3\u9898\u76ee\u5bf9 break \u7684\u8981\u6c42\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u221an)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1067 \u8d28\u6570\u5224\u65ad（break）：\u4e0e 1065 \u76f8\u540c，\u53ea\u662f\u8981\u6c42\u7528 break \u63d0\u524d\u7ed3\u675f\u5faa\u73af<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

bool<\/span> prime =<\/span> (<\/span>n >=<\/span> 2<\/span>)<\/span>;<\/span> \/\/ 1 \u4e0d\u662f\u8d28\u6570，2 \u662f\u8d28\u6570<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> i =<\/span> 2<\/span>;<\/span> i <=<\/span> n \/<\/span> i;<\/span> ++<\/span>i)<\/span> {<\/span> \/\/ \u8bd5\u9664\u5230 sqrt(n)，n\/i \u5199\u6cd5\u53ef\u907f\u514d i*i \u6ea2\u51fa<\/span>
\n if<\/span> (<\/span>n %<\/span> i ==<\/span> 0<\/span>)<\/span> {<\/span>
\n prime =<\/span> false<\/span>;<\/span>
\n break<\/span>;<\/span> \/\/ \u627e\u5230\u56e0\u5b50\u7acb\u5373\u8df3\u51fa<\/span>
\n }<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%s\\\\n"<\/span>,<\/span> prime ?<\/span> "Yes"<\/span> :<\/span> "No"<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1068 \u6574\u6570\u6574\u9664<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1068 \u6574\u6570\u6574\u9664<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u51faa\u5230b\u4e4b\u95f4\u7684\u4e0d\u80fd\u88ab3\u6574\u9664\u7684\u6574\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e24\u4e2a\u6b63\u6574\u6570a\u3001b\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

a\u5230b\u4e4b\u95f4\u7684\u4e0d\u80fd\u88ab3\u6574\u9664\u7684\u6574\u6570，\u4ee5\u7a7a\u683c\u5206\u9694\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

1 10<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

1 2 4 5 7 8 10<\/p>\n

\u601d\u8def：\u679a\u4e3e a\u2026b \u8f93\u51fa\u6240\u6709\u4e0d\u80fd\u88ab 3 \u6574\u9664\u7684\u6570，\u7528 first \u6807\u5fd7\u63a7\u5236\u7a7a\u683c\u4ee5\u4fdd\u8bc1\u884c\u672b\u65e0\u7a7a\u683c\u3002<\/p>\n

\u590d\u6742\u5ea6：O(b-a)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1068 \u6574\u6570\u6574\u9664：\u8f93\u51fa [a,b] \u4e4b\u95f4\u6240\u6709\u4e0d\u80fd\u88ab 3 \u6574\u9664\u7684\u6574\u6570，\u7a7a\u683c\u5206\u9694（\u884c\u672b\u65e0\u591a\u4f59\u7a7a\u683c）<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> a,<\/span> b;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

\/\/ \u6309\u9898\u9762\u201c\u4ece a \u5230 b\u201d\u987a\u5e8f\u904d\u5386（\u9898\u9762\u4fdd\u8bc1 a\u3001b \u4e3a\u6b63\u6574\u6570\u4e14 a \u5728\u524d）<\/span>
\n bool<\/span> first =<\/span> true<\/span>;<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> i =<\/span> a;<\/span> i <=<\/span> b;<\/span> ++<\/span>i)<\/span> {<\/span>
\n if<\/span> (<\/span>i %<\/span> 3<\/span> !=<\/span> 0<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>!<\/span>first)<\/span> putchar<\/span>(<\/span>' '<\/span>)<\/span>;<\/span> \/\/ \u6570\u5b57\u4e4b\u95f4\u624d\u8f93\u51fa\u7a7a\u683c<\/span>
\n printf<\/span>(<\/span>"%lld"<\/span>,<\/span> i)<\/span>;<\/span>
\n first =<\/span> false<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n putchar<\/span>(<\/span>'\\\\n'<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1069 m\u94b1\u4e70m\u53ea\u9e21<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1069 m\u94b1\u4e70m\u53ea\u9e21<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u516c\u9e21\u4e94\u6587\u94b1\u4e00\u53ea，\u6bcd\u9e21\u4e09\u6587\u94b1\u4e00\u53ea，\u5c0f\u9e21\u4e00\u6587\u94b1\u4e09\u53ea，\u7528m\u6587\u94b1\u4e70m\u53ea\u9e21，\u516c\u9e21\u3001\u6bcd\u9e21\u3001\u5c0f\u9e21\u5404\u4e70\u591a\u5c11\u53ea？（\u4ec5\u8003\u8651\u6709\u89e3\u7684\u60c5\u51b5）<\/p>\n

\u8f93\u5165<\/h4>\n

\u6b63\u6574\u6570m\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u516c\u9e21\u3001\u6bcd\u9e21\u548c\u5c0f\u9e21\u7684\u53ea\u6570（\u82e5\u6709\u591a\u4e2a\u89e3\u5219\u4ec5\u8f93\u51fa\u516c\u9e21\u6570\u91cf\u6700\u5c11\u7684\u90a3\u4e2a\u89e3）\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

0 25 75<\/p>\n

\u601d\u8def：\u6d88\u5143\u5f97 7x+4y=m，x \u4ece 0 \u679a\u4e3e，\u9996\u4e2a\u53ef\u884c\u89e3\u5373\u516c\u9e21\u6700\u5c11\u7684\u89e3；\u8f93\u51fa\u987a\u5e8f\u4e3a \u516c\u9e21 \u6bcd\u9e21 \u5c0f\u9e21\u3002<\/p>\n

\u590d\u6742\u5ea6：O(m)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1069 m\u94b1\u4e70m\u53ea\u9e21<\/span>
\n\/\/ \u8bbe\u516c\u9e21 x\u3001\u6bcd\u9e21 y\u3001\u5c0f\u9e21 z：x + y + z = m，5x + 3y + z\/3 = m（z \u4e3a 3 \u7684\u500d\u6570）<\/span>
\n\/\/ \u6d88\u5143\u5f97：7x + 4y = m，\u5373 y = (m – 7x)\/4，z = m – x – y = 3(m + x)\/4<\/span>
\n\/\/ x \u4ece 0 \u5f00\u59cb\u679a\u4e3e，\u7b2c\u4e00\u4e2a\u53ef\u884c\u89e3\u5373\u4e3a\u516c\u9e21\u6570\u91cf\u6700\u5c11\u7684\u89e3\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> m;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>m)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

for<\/span> (<\/span>long<\/span> long<\/span> x =<\/span> 0<\/span>;<\/span> x <=<\/span> m;<\/span> ++<\/span>x)<\/span> {<\/span>
\n long<\/span> long<\/span> r =<\/span> m –<\/span> 7<\/span> *<\/span> x;<\/span>
\n if<\/span> (<\/span>r <<\/span> 0<\/span>)<\/span> break<\/span>;<\/span> \/\/ y \u4f1a\u4e3a\u8d1f，\u4e4b\u540e\u66f4\u4e0d\u53ef\u80fd<\/span>
\n if<\/span> (<\/span>r %<\/span> 4<\/span> !=<\/span> 0<\/span>)<\/span> continue<\/span>;<\/span> \/\/ y \u5fc5\u987b\u662f\u6574\u6570<\/span>
\n long<\/span> long<\/span> y =<\/span> r \/<\/span> 4<\/span>;<\/span>
\n long<\/span> long<\/span> z =<\/span> m –<\/span> x –<\/span> y;<\/span>
\n if<\/span> (<\/span>z <<\/span> 0<\/span> ||<\/span> z %<\/span> 3<\/span> !=<\/span> 0<\/span>)<\/span> continue<\/span>;<\/span>
\n if<\/span> (<\/span>5<\/span> *<\/span> x +<\/span> 3<\/span> *<\/span> y +<\/span> z \/<\/span> 3<\/span> ==<\/span> m)<\/span> {<\/span> \/\/ \u518d\u6309\u539f\u65b9\u7a0b\u6821\u9a8c\u4e00\u6b21<\/span>
\n printf<\/span>(<\/span>"%lld %lld %lld\\\\n"<\/span>,<\/span> x,<\/span> y,<\/span> z)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span> \/\/ \u9898\u9762\u4fdd\u8bc1\u6709\u89e3<\/span>
\n}<\/span><\/p>\n

\n

1070 \u8d28\u6570\u6570\u76ee<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1070 \u8d28\u6570\u6570\u76ee<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u7edf\u8ba1a\u5230b\u4e4b\u95f4\u5b58\u5728\u591a\u5c11\u4e2a\u8d28\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e24\u4e2a\u6b63\u6574\u6570a\u3001b\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

a\u5230b\u4e4b\u95f4\u7684\u5168\u90e8\u8d28\u6570\u7684\u6570\u76ee\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100 200<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

21<\/p>\n

\u601d\u8def：\u533a\u95f4\u7b5b：\u5148\u7528\u8bd5\u9664\u7b5b\u51fa \u221ab \u5185\u7684\u8d28\u6570，\u518d\u6309\u6bb5\u7b5b [a,b] \u5e76\u8ba1\u6570；\u6ce8\u610f 1 \u4e0d\u662f\u8d28\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u221ab+(b-a))<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1070 \u8d28\u6570\u6570\u76ee：\u7edf\u8ba1 [a,b] \u5185\u7684\u8d28\u6570\u4e2a\u6570<\/span>
\n\/\/ \u91c7\u7528\u5206\u6bb5\u7b5b（\u57c3\u6c0f\u7b5b\u7684\u6309\u6bb5\u5b9e\u73b0）：\u5148\u7b5b\u51fa sqrt(b) \u4ee5\u5185\u7684\u8d28\u6570\u505a"\u7b5b\u5b50"，<\/span>
\n\/\/ \u518d\u628a [a,b] \u5207\u6210\u6bcf\u6bb5 1e6 \u4e2a\u6570\u9010\u4e2a\u7b5b\u6389\u5408\u6570，\u533a\u95f4\u5f88\u5927\u4e5f\u4e0d\u4f1a\u7206\u5185\u5b58\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> a,<\/span> b;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n if<\/span> (<\/span>a ><\/span> b)<\/span> swap<\/span>(<\/span>a,<\/span> b)<\/span>;<\/span> \/\/ \u4fdd\u9669：\u4fdd\u8bc1 a<=b<\/span>
\n if<\/span> (<\/span>b <<\/span> 2<\/span>)<\/span> {<\/span> printf<\/span>(<\/span>"0\\\\n"<\/span>)<\/span>;<\/span> return<\/span> 0<\/span>;<\/span> }<\/span> \/\/ \u533a\u95f4\u91cc\u6ca1\u6709\u8d28\u6570<\/span>
\n if<\/span> (<\/span>a <<\/span> 2<\/span>)<\/span> a =<\/span> 2<\/span>;<\/span> \/\/ 1 \u4e0d\u662f\u8d28\u6570<\/span><\/p>\n

\/\/ 1) \u7b5b\u51fa sqrt(b) \u4ee5\u5185\u7684\u6240\u6709\u8d28\u6570<\/span>
\n long<\/span> long<\/span> lim =<\/span> (<\/span>long<\/span> long<\/span>)<\/span>sqrtl<\/span>(<\/span>(<\/span>long<\/span> double<\/span>)<\/span>b)<\/span> +<\/span> 1<\/span>;<\/span>
\n vector<<\/span>char<\/span>><\/span> comp<\/span>(<\/span>(<\/span>size_t)<\/span>lim +<\/span> 1<\/span>,<\/span> 0<\/span>)<\/span>;<\/span>
\n vector<<\/span>long<\/span> long<\/span>><\/span> base;<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> i =<\/span> 2<\/span>;<\/span> i <=<\/span> lim;<\/span> i++<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>!<\/span>comp[<\/span>i]<\/span>)<\/span> {<\/span>
\n base.<\/span>push_back<\/span>(<\/span>i)<\/span>;<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> j =<\/span> i *<\/span> i;<\/span> j <=<\/span> lim;<\/span> j +=<\/span> i)<\/span> comp[<\/span>j]<\/span> =<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n }<\/span><\/p>\n

\/\/ 2) \u9010\u6bb5\u7b5b [a,b]<\/span>
\n const<\/span> long<\/span> long<\/span> CH =<\/span> 1<\/span> <<<\/span> 20<\/span>;<\/span> \/\/ \u6bcf\u6bb5\u957f\u5ea6<\/span>
\n vector<<\/span>char<\/span>><\/span> seg<\/span>(<\/span>(<\/span>size_t)<\/span>CH,<\/span> 0<\/span>)<\/span>;<\/span>
\n long<\/span> long<\/span> cnt =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> L =<\/span> a;<\/span> L <=<\/span> b;<\/span> L +=<\/span> CH)<\/span> {<\/span>
\n long<\/span> long<\/span> R =<\/span> min<\/span>(<\/span>b,<\/span> L +<\/span> CH –<\/span> 1<\/span>)<\/span>;<\/span>
\n fill<\/span>(<\/span>seg.<\/span>begin<\/span>(<\/span>)<\/span>,<\/span> seg.<\/span>begin<\/span>(<\/span>)<\/span> +<\/span> (<\/span>size_t)<\/span>(<\/span>R –<\/span> L +<\/span> 1<\/span>)<\/span>,<\/span> 0<\/span>)<\/span>;<\/span>
\n for<\/span> (<\/span>size_t k =<\/span> 0<\/span>;<\/span> k <<\/span> base.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> k++<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> p =<\/span> base[<\/span>k]<\/span>;<\/span>
\n if<\/span> (<\/span>p *<\/span> p ><\/span> R)<\/span> break<\/span>;<\/span> \/\/ \u5927\u4e8e sqrt(R) \u7684\u8d28\u6570\u4e0d\u7528\u518d\u7b5b<\/span>
\n long<\/span> long<\/span> st =<\/span> max<\/span>(<\/span>p *<\/span> p,<\/span> (<\/span>L +<\/span> p –<\/span> 1<\/span>)<\/span> \/<\/span> p *<\/span> p)<\/span>;<\/span> \/\/ \u6bb5\u5185\u7b2c\u4e00\u4e2a p \u7684\u500d\u6570<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> j =<\/span> st;<\/span> j <=<\/span> R;<\/span> j +=<\/span> p)<\/span> seg[<\/span>(<\/span>size_t)<\/span>(<\/span>j –<\/span> L)<\/span>]<\/span> =<\/span> 1<\/span>;<\/span>
\n }<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> x =<\/span> L;<\/span> x <=<\/span> R;<\/span> x++<\/span>)<\/span>
\n if<\/span> (<\/span>!<\/span>seg[<\/span>(<\/span>size_t)<\/span>(<\/span>x –<\/span> L)<\/span>]<\/span>)<\/span> cnt++<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> cnt)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1071 m\u94b1\u4e70m\u53ea\u9e21（\u65e0\u89e3\u8f93\u51fa\u201cNo answer\u201d）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1071 m\u94b1\u4e70m\u53ea\u9e21（\u65e0\u89e3\u8f93\u51fa\u201cNo answer\u201d）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u516c\u9e21\u4e94\u6587\u94b1\u4e00\u53ea，\u6bcd\u9e21\u4e09\u6587\u94b1\u4e00\u53ea，\u5c0f\u9e21\u4e00\u6587\u94b1\u4e09\u53ea，\u7528m\u6587\u94b1\u4e70m\u53ea\u9e21，\u516c\u9e21\u3001\u6bcd\u9e21\u3001\u5c0f\u9e21\u5404\u4e70\u591a\u5c11\u53ea？（\u65e2\u8003\u8651\u6709\u89e3\u7684\u60c5\u51b5，\u53c8\u8003\u8651\u65e0\u89e3\u7684\u60c5\u51b5）<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570m\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u82e5\u6709\u89e3\u53ea\u8f93\u51fa\u4e00\u4e2a\u89e3，\u5373\u516c\u9e21\u6570\u91cf\u6700\u5c11\u7684\u90a3\u4e2a\u89e3；\u82e5\u65e0\u89e3\u8f93\u51fa\u201cNo answer\u201d\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

0 25 75<\/p>\n

\u601d\u8def：\u540c 1069 \u7684\u6d88\u5143\u679a\u4e3e，\u65e0\u89e3\u65f6\u8f93\u51fa\u534a\u89d2 No answer\u3002<\/p>\n

\u590d\u6742\u5ea6：O(m)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1071 m\u94b1\u4e70m\u53ea\u9e21：\u516c\u9e215\u6587\u3001\u6bcd\u9e213\u6587\u3001\u5c0f\u9e211\u65873\u53ea<\/span>
\n\/\/ \u8bbe\u516c\u9e21 r\u3001\u6bcd\u9e21 h\u3001\u5c0f\u9e21 c：r+h+c=m, 5r+3h+c\/3=m<\/span>
\n\/\/ \u6d88\u5143\u5f97 c = 3(m+r)\/4，h = m-r-c；r \u4ece\u5c0f\u5230\u5927\u679a\u4e3e\u5373"\u516c\u9e21\u6700\u5c11"<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> m;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>m)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

for<\/span> (<\/span>long<\/span> long<\/span> r =<\/span> 0<\/span>;<\/span> r <=<\/span> m;<\/span> r++<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> s =<\/span> m +<\/span> r;<\/span>
\n if<\/span> (<\/span>s %<\/span> 4<\/span> !=<\/span> 0<\/span>)<\/span> continue<\/span>;<\/span> \/\/ \u5c0f\u9e21\u6570\u5fc5\u987b\u4e3a\u6574\u6570（3*s\/4）<\/span>
\n long<\/span> long<\/span> c =<\/span> 3<\/span> *<\/span> s \/<\/span> 4<\/span>;<\/span>
\n long<\/span> long<\/span> h =<\/span> m –<\/span> r –<\/span> c;<\/span>
\n if<\/span> (<\/span>h >=<\/span> 0<\/span> &&<\/span> c >=<\/span> 0<\/span>)<\/span> {<\/span> \/\/ \u627e\u5230\u516c\u9e21\u6700\u5c11\u7684\u89e3<\/span>
\n printf<\/span>(<\/span>"%lld %lld %lld\\\\n"<\/span>,<\/span> r,<\/span> h,<\/span> c)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"No answer\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1072 \u6574\u6570\u7684\u4f4d\u6570（while\u5b9e\u73b0）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1072 \u6574\u6570\u7684\u4f4d\u6570（while\u5b9e\u73b0）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570，\u8f93\u51fa\u5176\u4f4d\u6570（\u7528while\u8bed\u53e5\u5b9e\u73b0）\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u6b63\u6574\u6570\u7684\u4f4d\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

123<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

3<\/p>\n

\u601d\u8def：while(n>0){cnt++;n\/=10;} \u9010\u4f4d\u53bb\u6389\u672b\u4f4d\u8ba1\u6570，\u7528 long long\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1072 \u6574\u6570\u7684\u4f4d\u6570（while\u5b9e\u73b0）<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

int<\/span> cnt =<\/span> 0<\/span>;<\/span>
\n while<\/span> (<\/span>n ><\/span> 0<\/span>)<\/span> {<\/span> \/\/ \u6bcf\u6b21\u53bb\u6389\u6700\u4f4e\u4f4d，\u53bb\u6389\u51e0\u4f4d\u5c31\u662f\u51e0\u4f4d\u6570<\/span>
\n cnt++<\/span>;<\/span>
\n n \/=<\/span> 10<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> cnt)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1073 \u6570\u5b57\u53cd\u8f6c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1073 \u6570\u5b57\u53cd\u8f6c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u7ed9\u5b9a\u4e00\u4e2a\u6574\u6570，\u8bf7\u5c06\u8be5\u6570\u5404\u4e2a\u6570\u4f4d\u4e0a\u7684\u6570\u5b57\u53cd\u8f6c\u5f97\u5230\u4e00\u4e2a\u65b0\u6570\u3002\u65b0\u6570\u4e5f\u5e94\u6ee1\u8db3\u6574\u6570\u7684\u5e38\u89c1\u5f62\u5f0f，\u5373\u9664\u975e\u7ed9\u5b9a\u7684\u539f\u6570\u4e3a\u96f6，\u5426\u5219\u53cd\u8f6c\u540e\u5f97\u5230\u7684\u65b0\u6570\u7684\u6700\u9ad8\u4f4d\u6570\u5b57\u4e0d\u5e94\u4e3a\u96f6\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u5341\u8fdb\u5236\u6574\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5bf9\u5e94\u7684\u53cd\u8f6c\u6570\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u4fdd\u8bc1\u6570\u636e\u2264100000<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

-690<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

-96<\/p>\n

\u601d\u8def：\u53d6\u7edd\u5bf9\u503c\u540e\u7b97\u672f\u53cd\u8f6c\u518d\u8865\u7b26\u53f7，\u672b\u5c3e\u7684 0 \u81ea\u7136\u6d88\u5931（1200\u219221）\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1073 \u6570\u5b57\u53cd\u8f6c：-690 -> -96，1200 -> 21（\u65b0\u6570\u4e0d\u80fd\u6709\u524d\u5bfc\u96f6）<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

if<\/span> (<\/span>n ==<\/span> 0<\/span>)<\/span> {<\/span> printf<\/span>(<\/span>"0\\\\n"<\/span>)<\/span>;<\/span> return<\/span> 0<\/span>;<\/span> }<\/span> \/\/ \u539f\u6570\u4e3a 0 \u65f6\u53cd\u8f6c\u4ecd\u662f 0<\/span><\/p>\n

int<\/span> sign =<\/span> 1<\/span>;<\/span>
\n if<\/span> (<\/span>n <<\/span> 0<\/span>)<\/span> {<\/span> sign =<\/span> –<\/span>1<\/span>;<\/span> n =<\/span> –<\/span>n;<\/span> }<\/span> \/\/ \u5148\u6309\u6b63\u6570\u5904\u7406，\u6700\u540e\u8865\u7b26\u53f7<\/span><\/p>\n

long<\/span> long<\/span> rev =<\/span> 0<\/span>;<\/span>
\n while<\/span> (<\/span>n ><\/span> 0<\/span>)<\/span> {<\/span>
\n rev =<\/span> rev *<\/span> 10<\/span> +<\/span> n %<\/span> 10<\/span>;<\/span> \/\/ \u672b\u5c3e\u7684 0 \u81ea\u7136\u88ab\u4e22\u6389<\/span>
\n n \/=<\/span> 10<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> sign *<\/span> rev)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1074 \u793c\u7269\u6570\u91cf<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1074 \u793c\u7269\u6570\u91cf<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5c0f\u660e\u4e70\u4e86\u8bb8\u591a\u793c\u7269\u51c6\u5907\u7528\u4e8e\u73ed\u7ea7\u6d3b\u52a8，\u56de\u5bb6\u540e\u611f\u89c9\u592a\u7d2f\u4e86，\u4fbf\u8ba9\u673a\u5668\u4eba\u5c0f\u7075\u5e2e\u5fd9\u6570\u4e00\u4e0b\u793c\u7269\u4e00\u5171\u6709\u591a\u5c11\u4efd\u3002\u4f46\u662f\u5c0f\u7075\u4e0d\u559c\u6b22\u6570\u5b574，\u56e0\u6b64\u6bcf\u6b21\u6570\u5230\u5305\u542b\u6570\u5b574\u65f6\u4fbf\u8df3\u8fc7\u8be5\u6570\u3002\u4f8b\u5982\u5c0f\u7075\u6570\u5230639\u65f6，\u4e0b\u4e00\u4efd\u793c\u7269\u5c0f\u7075\u5c31\u4f1a\u6570650\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u4e0d\u542b4\u7684\u6b63\u6574\u6570n，\u8868\u793a\u5c0f\u7075\u7ed9\u51fa\u7684\u793c\u7269\u7684\u4efd\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u4e00\u4e2a\u6574\u6570\u4ee3\u8868\u793c\u7269\u7684\u5b9e\u9645\u4efd\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

55<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

40<\/p>\n

\u601d\u8def：\u7b2c n \u4e2a\u4e0d\u542b\u6570\u5b57 4 \u7684\u6b63\u6574\u6570：\u628a n \u7684\u5404\u4f4d\u5f53\u4f5c 9 \u8fdb\u5236\u52a0\u6743，\u6570\u5b57 >4 \u65f6\u51cf 1\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1074 \u793c\u7269\u6570\u91cf：\u5c0f\u7075\u4ece 1 \u5f00\u59cb\u6570\u4e14\u8df3\u8fc7\u6240\u6709\u542b\u6570\u5b57 4 \u7684\u6570，<\/span>
\n\/\/ \u5b83\u62a5\u51fa\u7684 n \u5728"\u4e0d\u542b4\u6570\u5217"\u4e2d\u7684\u5e8f\u53f7\u5c31\u662f\u5b9e\u9645\u4efd\u6570\u3002<\/span>
\n\/\/ \u628a n \u7684\u6bcf\u4e00\u4f4d\u6570\u5b57\u6309 9 \u8fdb\u5236\u4f4d\u503c\u7d2f\u52a0（>=5 \u7684\u6570\u5b57\u51cf 1）\u5373\u5f97\u5e8f\u53f7\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

long<\/span> long<\/span> ans =<\/span> 0<\/span>,<\/span> base =<\/span> 1<\/span>;<\/span> \/\/ base = 9 \u7684\u5e42<\/span>
\n while<\/span> (<\/span>n ><\/span> 0<\/span>)<\/span> {<\/span>
\n int<\/span> d =<\/span> (<\/span>int<\/span>)<\/span>(<\/span>n %<\/span> 10<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>d ><\/span> 4<\/span>)<\/span> d—<\/span>;<\/span> \/\/ 1..3 \u4e0d\u53d8，5..9 \u51cf 1（4 \u4e0d\u4f1a\u51fa\u73b0）<\/span>
\n ans +=<\/span> (<\/span>long<\/span> long<\/span>)<\/span>d *<\/span> base;<\/span>
\n base *=<\/span> 9<\/span>;<\/span>
\n n \/=<\/span> 10<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> ans)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1075 \u5206\u89e3\u8d28\u56e0\u5b50<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1075 \u5206\u89e3\u8d28\u56e0\u5b50<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5c06\u4e00\u4e2a\u6574\u6570\u8868\u793a\u4e3a\u5176\u8d28\u56e0\u5b50\u76f8\u4e58\u5f62\u5f0f\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

n\u7684\u8d28\u56e0\u6570\u7684\u4e58\u79ef\u5f62\u5f0f\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

36<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

2*2*3*3<\/p>\n

\u601d\u8def：\u4ece\u5c0f\u5230\u5927\u8bd5\u9664\u5206\u89e3\u8d28\u56e0\u5b50，\u7528 * \u8fde\u63a5\u8f93\u51fa（\u6309\u9898\u9762\u6837\u4f8b\u4e0d\u52a0 n= \u524d\u7f00）\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u221an)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1075 \u5206\u89e3\u8d28\u56e0\u5b50：\u8f93\u51fa\u5f62\u5982 2*2*3*3（\u9898\u9762\u6837\u4f8b\u6ca1\u6709 "n=" \u524d\u7f00）<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

if<\/span> (<\/span>n ==<\/span> 1<\/span>)<\/span> {<\/span> printf<\/span>(<\/span>"1\\\\n"<\/span>)<\/span>;<\/span> return<\/span> 0<\/span>;<\/span> }<\/span> \/\/ 1 \u6ca1\u6709\u8d28\u56e0\u5b50，\u4e58\u79ef\u5f62\u5f0f\u4e3a 1<\/span><\/p>\n

long<\/span> long<\/span> x =<\/span> n;<\/span>
\n bool<\/span> first =<\/span> true<\/span>;<\/span> \/\/ \u63a7\u5236 '*' \u4e0d\u6253\u5370\u5728\u6700\u524d\u9762<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> p =<\/span> 2<\/span>;<\/span> p *<\/span> p <=<\/span> x;<\/span> p++<\/span>)<\/span> {<\/span> \/\/ x \u4e0d\u65ad\u53d8\u5c0f，\u5faa\u73af\u4e0a\u754c\u968f\u4e4b\u6536\u7f29<\/span>
\n while<\/span> (<\/span>x %<\/span> p ==<\/span> 0<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>!<\/span>first)<\/span> printf<\/span>(<\/span>"*"<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%lld"<\/span>,<\/span> p)<\/span>;<\/span>
\n first =<\/span> false<\/span>;<\/span>
\n x \/=<\/span> p;<\/span>
\n }<\/span>
\n }<\/span>
\n if<\/span> (<\/span>x ><\/span> 1<\/span>)<\/span> {<\/span> \/\/ \u5269\u4e0b\u7684\u4e00\u5b9a\u662f\u8d28\u6570<\/span>
\n if<\/span> (<\/span>!<\/span>first)<\/span> printf<\/span>(<\/span>"*"<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%lld"<\/span>,<\/span> x)<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1076 \u6570\u5217\u7d2f\u52a0<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1076 \u6570\u5217\u7d2f\u52a0<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165n\u548ca，\u6c42a+aa+aaa+\u2026aa\u2026a(n\u4e2aa)，\u5982\u5f53n=3，a=2\u65f6，2+22+222=246\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u5305\u542b\u4e24\u4e2a\u6574\u6570，n\u548ca,\u542b\u4e49\u5982\u4e0a\u8ff0，n\u548ca\u90fd\u662f\u5c0f\u4e8e10\u7684\u975e\u8d1f\u6574\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u524dn\u9879\u548c，\u5355\u72ec\u5360\u4e00\u884c<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

3 2<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

246<\/p>\n

\u601d\u8def：term=term*10+a \u751f\u6210 a, aa, aaa\u2026 \u5e76\u7d2f\u52a0，\u7528 long long \u9632\u6ea2\u51fa\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n\u00b7\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1076 \u6570\u5217\u7d2f\u52a0：a+aa+aaa+…（n \u9879，n \u4e0e a \u90fd\u5c0f\u4e8e 10）<\/span>
\n\/\/ \u7528 long long \u9632\u6ea2\u51fa（9+99+…+999999999 \u8d85\u8fc7 int）<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n,<\/span> a;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d %d"<\/span>,<\/span> &<\/span>n,<\/span> &<\/span>a)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

long<\/span> long<\/span> term =<\/span> 0<\/span>,<\/span> sum =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\n term =<\/span> term *<\/span> 10<\/span> +<\/span> a;<\/span> \/\/ 2 -> 22 -> 222<\/span>
\n sum +=<\/span> term;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> sum)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1077 \u96f6\u82b1\u94b1\u5956\u52b1<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1077 \u96f6\u82b1\u94b1\u5956\u52b1<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5988\u5988\u7ed9\u4e86\u5c0f\u660em\u5f20\u767e\u5143\u949e\u7968，\u4e3a\u4e86\u9f13\u52b1\u5c0f\u660e\u8282\u7ea6，\u8bf4\u5982\u679c\u5c0f\u660e\u8fde\u7eedk\u5929\u6bcf\u5929\u4ec5\u82b110\u5143，\u5c31\u53ef\u4ee5\u5f97\u523010\u5143\u989d\u5916\u5956\u52b1，\u5982\u679c\u542c\u5988\u5988\u7684\u8bdd\u5c0f\u660e\u6700\u591a\u53ef\u4ee5\u82b1\u591a\u5c11\u5929？<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u51652\u4e2a\u6574\u6570m\u3001k，(2 <= k<=m<= 1000)\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u4e00\u4e2a\u6574\u6570，\u8868\u793am\u5143\u53ef\u4ee5\u6d88\u8d39\u7684\u5929\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

4 3<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

59<\/p>\n

\u601d\u8def：m \u662f\u767e\u5143\u949e\u7968\u5f20\u6570（\u603b\u989d 100m）；\u9010\u5929\u6a21\u62df，\u8fde\u7eed\u6512\u591f k \u5929\u5373 +10 \u5143\u5e76\u91cd\u7f6e\u8ba1\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u5929\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1077 \u96f6\u82b1\u94b1\u5956\u52b1：m \u5f20\u767e\u5143\u949e\u7968\u5171 100*m \u5143，\u6bcf\u5929\u82b1 10 \u5143；<\/span>
\n\/\/ \u6bcf\u8fde\u7eed k \u5929\u53ea\u82b1 10 \u5143\u5c31\u518d\u5f97 10 \u5143\u5956\u52b1（\u5956\u52b1\u53ef\u4ee5\u7ee7\u7eed\u7528\u6765\u82b1）\u3002<\/span>
\n\/\/ \u9010\u5929\u6a21\u62df：\u82b1\u5f97\u8d77\u5c31\u82b1，\u6512\u591f k \u5929\u7acb\u523b\u53d1\u5956\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> m,<\/span> k;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>m,<\/span> &<\/span>k)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

long<\/span> long<\/span> money =<\/span> m *<\/span> 100<\/span>;<\/span> \/\/ \u603b\u94b1\u6570（\u5143）<\/span>
\n long<\/span> long<\/span> days =<\/span> 0<\/span>,<\/span> streak =<\/span> 0<\/span>;<\/span> \/\/ \u5df2\u82b1\u7684\u8fde\u7eed\u5929\u6570<\/span>
\n while<\/span> (<\/span>money >=<\/span> 10<\/span>)<\/span> {<\/span>
\n money -=<\/span> 10<\/span>;<\/span>
\n days++<\/span>;<\/span>
\n streak++<\/span>;<\/span>
\n if<\/span> (<\/span>streak ==<\/span> k)<\/span> {<\/span> \/\/ \u8fde\u7eed k \u5929\u8fbe\u6210，\u7ed9 10 \u5143\u5956\u52b1<\/span>
\n money +=<\/span> 10<\/span>;<\/span>
\n streak =<\/span> 0<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> days)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1078 \u9636\u4e58\u6700\u9ad8\u4f4d<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1078 \u9636\u4e58\u6700\u9ad8\u4f4d<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

Normal07.8 \u78c502falsefalsefalseMicrosoftInternetExplorer4
\n\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n\u3002\u8f93\u51fan!\u7684\u6700\u9ad8\u4f4d\u4e0a\u7684\u6570\u5b57\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n(n<=1000)\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

Normal07.8 \u78c502falsefalsefalseMicrosoftInternetExplorer4
\n\u8f93\u51fan!\u7684\u6700\u9ad8\u4f4d\u4e0a\u7684\u6570\u5b57\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

1000<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

4<\/p>\n

\u601d\u8def：\u9636\u4e58\u9996\u4f4d：\u7528 long double \u7d2f\u52a0\u5bf9\u6570，\u9996\u4f4d = \u230a10^\u5c0f\u6570\u90e8\u5206\u230b，\u907f\u514d\u76f4\u63a5\u7b97\u9636\u4e58\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1078 \u9636\u4e58\u6700\u9ad8\u4f4d：n<=1000，n! \u7528 long double \u5b58\u653e\u4e0d\u4e0b，<\/span>
\n\/\/ \u6539\u7528\u5bf9\u6570\u6cd5：log10(n!) = 1*log10(1)+…+log10(n)，<\/span>
\n\/\/ \u5c0f\u6570\u90e8\u5206 f \u6ee1\u8db3 n! = 10^(\u6574\u6570\u90e8\u5206+f)，\u6700\u9ad8\u4f4d = floor(10^f)\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

if<\/span> (<\/span>n <=<\/span> 1<\/span>)<\/span> {<\/span> printf<\/span>(<\/span>"1\\\\n"<\/span>)<\/span>;<\/span> return<\/span> 0<\/span>;<\/span> }<\/span> \/\/ 0! = 1! = 1<\/span><\/p>\n

long<\/span> double<\/span> s =<\/span> 0.0L<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 2<\/span>;<\/span> i <=<\/span> n;<\/span> i++<\/span>)<\/span> s +=<\/span> log10l<\/span>(<\/span>(<\/span>long<\/span> double<\/span>)<\/span>i)<\/span>;<\/span><\/p>\n

long<\/span> double<\/span> f =<\/span> s –<\/span> floorl<\/span>(<\/span>s)<\/span>;<\/span> \/\/ \u5c0f\u6570\u90e8\u5206<\/span>
\n int<\/span> d =<\/span> (<\/span>int<\/span>)<\/span>floorl<\/span>(<\/span>powl<\/span>(<\/span>10.0L<\/span>,<\/span> f)<\/span>)<\/span>;<\/span> \/\/ \u9996\u4f4d\u6570\u5b57<\/span>
\n if<\/span> (<\/span>d <<\/span> 1<\/span>)<\/span> d =<\/span> 1<\/span>;<\/span>
\n if<\/span> (<\/span>d ><\/span> 9<\/span>)<\/span> d =<\/span> 9<\/span>;<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> d)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1079 \u5c0f\u8f66\u7684\u4f4d\u7f6e<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1079 \u5c0f\u8f66\u7684\u4f4d\u7f6e<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6709\u4e00\u8f86\u667a\u80fd\u5c0f\u8f66，\u6700\u521d(\u65f6\u95f4\u4e3a0)\u7684\u4f4d\u7f6e\u4e3a(0,0)，\u6211\u4eec\u60f3\u77e5\u9053\u5b83\u6700\u540e\u7684\u4f4d\u7f6e\u3002\u5c0f\u8f66\u4ee5\u6bcf\u5c0f\u65f610\u516c\u91cc\u7684\u901f\u5ea6\u5411\u5317\u79fb\u52a8(\u5317\u4e3ay\u8f74\u6b63\u5411，\u4e1c\u4e3ax\u8f74\u6b63\u5411)\u3002\u5c0f\u8f66\u4f1a\u6536\u5230\u4e00\u7cfb\u5217\u4f9d\u7167\u65f6\u95f4\u6233\u8bb0\u6392\u5e8f\u7684\u547d\u4ee4，1\u8868\u793a\u201c\u5411\u5de6\u8f6c\u201d，2\u8868\u793a\u201c\u5411\u53f3\u8f6c\u201d，3\u8868\u793a\u201c\u505c\u6b62\u201d\u3002\u6bcf\u4e2a\u547d\u4ee4\u7684\u524d\u9762\u6709\u4e00\u4e2a\u65f6\u95f4\u6233\u8bb0，\u6240\u4ee5\u77e5\u9053\u8be5\u547d\u4ee4\u662f\u4f55\u65f6\u53d1\u51fa\u7684\u3002\u6700\u540e\u4e00\u4e2a\u547d\u4ee4\u4e00\u5b9a\u662f\u201c\u505c\u6b62\u201d\u3002\u53e6\u5916\u5047\u8bbe，\u8fd9\u8f86\u5c0f\u8f66\u975e\u5e38\u7075\u6d3b，\u5b83\u53ef\u4ee5\u5728\u77ac\u95f4\u8f6c\u5f2f\u3002
\n\u4f8b，\u5c0f\u8f66\u5728\u65f6\u95f4\u4e3a5\u65f6\u6536\u5230\u4e00\u4e2a\u201c\u5411\u5de6\u8f6c\u201d\u7684\u547d\u4ee41，\u5728\u65f6\u95f410\u6536\u5230\u4e00\u4e2a\u201c\u5411\u53f3\u8f6c\u201d\u7684\u547d\u4ee42，\u5728\u65f6\u95f415\u6536\u5230\u4e00\u4e2a\u201c\u505c\u6b62\u201d\u7684\u547d\u4ee43\u3002\u90a3\u4e48\u5728\u6700\u540e\u65f6\u95f415\u65f6，\u5c0f\u8f66\u7684\u4f4d\u7f6e\u5c06\u5728（-50,100）\u3002\u7a0b\u5e8f\u53ea\u8981\u6c42\u8f93\u51fa\u5c0f\u8f66\u6700\u540e\u7684\u4f4d\u7f6e，\u7b2c\u4e00\u4e2a\u6574\u6570\u662fx\u5750\u6807，\u7b2c\u4e8c\u4e2a\u6574\u6570\u662fy\u5750\u6807\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u5305\u542b\u591a\u4e2a\u547d\u4ee4，\u6bcf\u4e2a\u547d\u4ee4\u7531\u6574\u6570time\u548ccommand\u7ec4\u6210，\u8868\u793a\u5728\u65f6\u523btime\u53d1\u51fa\u547d\u4ee4command\u3002command\u7684\u53d6\u503c\u8303\u56f41-3，\u542b\u4e49\u5982\u4e0a\u6240\u8ff0\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

Normal07.8 \u78c502falsefalsefalseMicrosoftInternetExplorer4
\n\u8f93\u51fa\u5360\u4e00\u884c，\u5305\u542b\u4e24\u4e2a\u6574\u6570，\u8868\u793a\u5c0f\u8f66\u7684\u6700\u7ec8\u4f4d\u7f6e\u3002\u4e24\u4e2a\u6574\u6570\u4e4b\u95f4\u7531\u7a7a\u683c\u9694\u5f00\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

5 1
\n10 2
\n15 3<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

-50 100<\/p>\n

\u601d\u8def：\u65b9\u5411\u6570\u7ec4 {\u5317,\u897f,\u5357,\u4e1c}，\u5148\u6309 (t-prev)*10 \u884c\u9a76\u518d\u6267\u884c\u8f6c\u5411\/\u505c\u6b62\u547d\u4ee4\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u547d\u4ee4\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

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

\/\/ 1079 \u5c0f\u8f66\u7684\u4f4d\u7f6e：\u8d77\u70b9 (0,0)，\u901f\u5ea6 10\/\u5c0f\u65f6，\u521d\u59cb\u671d\u5317（y \u8f74\u6b63\u5411）\u3002<\/span>
\n\/\/ \u6bcf\u8bfb\u5230\u4e00\u6761\u547d\u4ee4，\u5148\u6309"\u4e0a\u4e00\u65f6\u523b->\u672c\u65f6\u523b"\u7684\u65f6\u957f\u6cbf\u5f53\u524d\u65b9\u5411\u524d\u8fdb，<\/span>
\n\/\/ \u518d\u6267\u884c\u8f6c\u5f2f（1 \u5de6\u8f6c\u30012 \u53f3\u8f6c\u30013 \u505c\u6b62）；\u547d\u4e2d\u7684\u6700\u540e\u4e00\u4e2a\u547d\u4ee4\u4e00\u5b9a\u662f 3\u3002<\/span>
\nint<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n \/\/ \u65b9\u5411\u987a\u5e8f：0 \u5317\u30011 \u897f\u30012 \u5357\u30013 \u4e1c（\u5de6\u8f6c +1，\u53f3\u8f6c +3，\u6b63\u597d\u662f\u540c\u4e00\u5957\u4e0b\u6807）<\/span>
\n int<\/span> dx[<\/span>4<\/span>]<\/span> =<\/span> {<\/span>0<\/span>,<\/span> –<\/span>1<\/span>,<\/span> 0<\/span>,<\/span> 1<\/span>}<\/span>;<\/span>
\n int<\/span> dy[<\/span>4<\/span>]<\/span> =<\/span> {<\/span>1<\/span>,<\/span> 0<\/span>,<\/span> –<\/span>1<\/span>,<\/span> 0<\/span>}<\/span>;<\/span><\/p>\n

int<\/span> t,<\/span> c,<\/span> prev =<\/span> 0<\/span>,<\/span> dir =<\/span> 0<\/span>;<\/span>
\n long<\/span> long<\/span> x =<\/span> 0<\/span>,<\/span> y =<\/span> 0<\/span>;<\/span><\/p>\n

while<\/span> (<\/span>scanf<\/span>(<\/span>"%d %d"<\/span>,<\/span> &<\/span>t,<\/span> &<\/span>c)<\/span> ==<\/span> 2<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> dt =<\/span> (<\/span>long<\/span> long<\/span>)<\/span>t –<\/span> prev;<\/span> \/\/ \u672c\u6bb5\u884c\u9a76\u65f6\u957f<\/span>
\n x +=<\/span> (<\/span>long<\/span> long<\/span>)<\/span>dx[<\/span>dir]<\/span> *<\/span> 10<\/span> *<\/span> dt;<\/span>
\n y +=<\/span> (<\/span>long<\/span> long<\/span>)<\/span>dy[<\/span>dir]<\/span> *<\/span> 10<\/span> *<\/span> dt;<\/span>
\n prev =<\/span> t;<\/span><\/p>\n

if<\/span> (<\/span>c ==<\/span> 1<\/span>)<\/span> dir =<\/span> (<\/span>dir +<\/span> 1<\/span>)<\/span> %<\/span> 4<\/span>;<\/span> \/\/ \u5de6\u8f6c<\/span>
\n else<\/span> if<\/span> (<\/span>c ==<\/span> 2<\/span>)<\/span> dir =<\/span> (<\/span>dir +<\/span> 3<\/span>)<\/span> %<\/span> 4<\/span>;<\/span> \/\/ \u53f3\u8f6c<\/span>
\n else<\/span> break<\/span>;<\/span> \/\/ 3：\u505c\u6b62，\u4f4d\u7f6e\u5c31\u662f\u7ec8\u70b9<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld %lld\\\\n"<\/span>,<\/span> x,<\/span> y)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1080 \u4e58\u79ef\u53cd\u8f6c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1080 \u4e58\u79ef\u53cd\u8f6c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u505a\u4f5c\u4e1a\u7684\u65f6\u5019，\u90bb\u5ea7\u7684\u5c0f\u670b\u53cb\u95ee\u4f60：\u201c\u4e94\u4e58\u4ee5\u4e03\u7b49\u4e8e\u591a\u5c11？\u201d\u4f60\u5e94\u8be5\u4e0d\u5931\u793c\u8c8c\u5730\u5fae\u7b11\u7740\u544a\u8bc9\u4ed6：\u201c\u4e94\u5341\u4e09\u201d\u3002\u672c\u9898\u8981\u6c42\u5bf9\u4efb\u4f55\u4e00\u5bf9\u7ed9\u5b9a\u7684\u6b63\u6574\u6570，\u9006\u5411\u8f93\u51fa\u5b83\u4eec\u7684\u4e58\u79ef\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u884c，\u7ed9\u51fa\u4e24\u4e2a\u4e0d\u8d85\u8fc7 1000 \u7684\u6b63\u6574\u6570 a \u548c b，\u4ee5\u7a7a\u683c\u5206\u9694\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5728\u4e00\u884c\u4e2d\u9006\u5411\u8f93\u51fa a \u548c b \u7684\u4e58\u79ef\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6ce8\u610f\u524d\u5bfc0\u4e0d\u8981\u8f93\u51fa\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

50 7<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

53<\/p>\n

\u601d\u8def：a*b \u540e\u9010\u4f4d\u53cd\u8f6c\u62fc\u63a5 r=r*10+n%10，\u524d\u5bfc\u96f6\u81ea\u7136\u4e22\u5f03\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1080 \u4e58\u79ef\u53cd\u8f6c<\/span>
\n\/\/ \u601d\u8def：\u5148\u6c42 a*b，\u518d\u628a\u4e58\u79ef\u7684\u6570\u5b57\u9006\u5e8f\u201c\u62fc\u201d\u56de\u6765（\u81ea\u7136\u53bb\u6389\u524d\u5bfc\u96f6）\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> a,<\/span> b;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n long<\/span> long<\/span> n =<\/span> a *<\/span> b;<\/span> \/\/ a,b<=1000，\u4e58\u79ef\u6700\u5927 10^6，long long \u8db3\u591f<\/span>
\n long<\/span> long<\/span> r =<\/span> 0<\/span>;<\/span>
\n while<\/span> (<\/span>n ><\/span> 0<\/span>)<\/span> {<\/span>
\n r =<\/span> r *<\/span> 10<\/span> +<\/span> n %<\/span> 10<\/span>;<\/span> \/\/ \u9006\u5e8f\u6784\u9020，\u524d\u5bfc\u96f6\u81ea\u52a8\u6d88\u5931<\/span>
\n n \/=<\/span> 10<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> r)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1081 \u4e24\u4e2a\u6570\u7684\u6700\u5927\u516c\u7ea6\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1081 \u4e24\u4e2a\u6570\u7684\u6700\u5927\u516c\u7ea6\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u51652\u4e2a\u6b63\u6574\u6570a，b，\u6c42a\u4e0eb\u7684\u6700\u5927\u516c\u7ea6\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

2\u4e2a\u6b63\u6574\u6570a，b，\u4e2d\u95f4\u7528\u7a7a\u683c\u9694\u5f00\u3002(1<=a,b <= 104)<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51faa\u4e0eb\u7684\u6700\u5927\u516c\u7ea6\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

6 15<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

3<\/p>\n

\u601d\u8def：\u8f97\u8f6c\u76f8\u9664\u6cd5（\u6b27\u51e0\u91cc\u5f97\u7b97\u6cd5）\u6c42\u6700\u5927\u516c\u7ea6\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(log min(a,b))<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1081 \u4e24\u4e2a\u6570\u7684\u6700\u5927\u516c\u7ea6\u6570<\/span>
\n\/\/ \u601d\u8def：\u8f97\u8f6c\u76f8\u9664\u6cd5（\u6b27\u51e0\u91cc\u5f97\u7b97\u6cd5）\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> a,<\/span> b;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n while<\/span> (<\/span>b !=<\/span> 0<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> t =<\/span> a %<\/span> b;<\/span>
\n a =<\/span> b;<\/span>
\n b =<\/span> t;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> a)<\/span>;<\/span> \/\/ \u5faa\u73af\u7ed3\u675f\u65f6 a \u5373 gcd<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1082 \u4e24\u4e2a\u6570\u7684\u6700\u5c0f\u516c\u500d\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1082 \u4e24\u4e2a\u6570\u7684\u6700\u5c0f\u516c\u500d\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6b63\u6574\u6570a\u548c\u6b63\u6574\u6570b\u7684\u6700\u5c0f\u516c\u500d\u6570\u662f\u6307\u80fd\u88aba\u548cb\u6574\u9664\u7684\u6700\u5c0f\u7684\u6b63\u6574\u6570\u503c，\u8bbe\u8ba1\u4e00\u4e2a\u7b97\u6cd5，\u6c42\u8f93\u5165a\u548cb\u7684\u6700\u5c0f\u516c\u500d\u6570\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e24\u4e2a\u6b63\u6574\u6570a\u548cb\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51faa\u548cb\u7684\u6700\u5c0f\u516c\u500d\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

5 3<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

15<\/p>\n

\u601d\u8def：a\/gcd*b \u2014\u2014 \u5148\u9664\u540e\u4e58，\u907f\u514d a*b \u6ea2\u51fa\u3002<\/p>\n

\u590d\u6742\u5ea6：O(log min(a,b))<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1082 \u4e24\u4e2a\u6570\u7684\u6700\u5c0f\u516c\u500d\u6570<\/span>
\n\/\/ \u601d\u8def：lcm(a,b) = a \/ gcd(a,b) * b，\u5148\u9664\u540e\u4e58\u907f\u514d\u6ea2\u51fa\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> a,<\/span> b;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld %lld"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n long<\/span> long<\/span> x =<\/span> a,<\/span> y =<\/span> b;<\/span>
\n while<\/span> (<\/span>y !=<\/span> 0<\/span>)<\/span> {<\/span> \/\/ \u8f97\u8f6c\u76f8\u9664\u6c42 gcd<\/span>
\n long<\/span> long<\/span> t =<\/span> x %<\/span> y;<\/span>
\n x =<\/span> y;<\/span>
\n y =<\/span> t;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> a \/<\/span> x *<\/span> b)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1083 \u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e00）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1083 \u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e00）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6211\u4eec\u5c0f\u65f6\u5019\u5b66\u8fc7\u7684\u4e5d\u4e5d\u4e58\u6cd5\u8868\u4e5f\u8bb8\u7ec8\u751f\u96be\u5fd8，\u73b0\u5728\u8ba9\u6211\u4eec\u91cd\u6e29\u8fd9\u4e2a\u7f8e\u597d\u7684\u8bb0\u5fc6，\u8bf7\u7f16\u7a0b\u8f93\u51fa\u4e5d\u4e5d\u4e58\u6cd5\u8868\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u65e0<\/p>\n

\u8f93\u51fa<\/h4>\n

11=1
\n21=2 22=4
\n31=3 32=6 33=9
\n41=4 42=8 43=12 44=16
\n51=5 52=10 53=15 54=20 55=25
\n61=6 62=12 63=18 64=24 65=30 66=36
\n71=7 72=14 73=21 74=28 75=35 76=42 77=49
\n81=8 82=16 83=24 84=32 85=40 86=48 87=56 88=64
\n91=9 92=18 93=27 94=36 95=45 96=54 97=63 98=72 9*9=81<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

\u65e0<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

1*1=1
\n2*1=2 2*2=4
\n3*1=3 3*2=6 3*3=9
\n4*1=4 4*2=8 4*3=12 4*4=16
\n5*1=5 5*2=10 5*3=15 5*4=20 5*5=25
\n6*1=6 6*2=12 6*3=18 6*4=24 6*5=30 6*6=36
\n7*1=7 7*2=14 7*3=21 7*4=28 7*5=35 7*6=42 7*7=49
\n8*1=8 8*2=16 8*3=24 8*4=32 8*5=40 8*6=48 8*7=56 8*8=64
\n9*1=9 9*2=18 9*3=27 9*4=36 9*5=45 9*6=54 9*7=63 9*8=72 9*9=81<\/p>\n

\u601d\u8def：\u7b2c i \u884c\u8f93\u51fa j=1\u2026i，\u683c\u5f0f i*j=i*j，\u9879\u95f4\u5355\u7a7a\u683c\u3001\u884c\u672b\u65e0\u7a7a\u683c\u3002\u6ce8\u610f：\u9898\u9762\u6837\u4f8b\u91cc\u7684\u5bbd\u5bf9\u9f50\u662f\u6392\u7248\u6548\u679c，\u5224\u9898\u6570\u636e\u4e3a\u5355\u7a7a\u683c\u5206\u9694（\u771f\u673a\u63d0\u4ea4 AC \u8bc1\u5b9e）\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1083 \u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e00）<\/span>
\n\/\/ \u601d\u8def：\u7b2c i \u884c\u8f93\u51fa j=1..i \u7684 "i*j=i*j"，\u4e58\u6570\u987a\u5e8f\u4e3a i*j\u3002<\/span>
\n\/\/ \u683c\u5f0f：\u9898\u9762\u300c\u8f93\u51fa\u300d\u90e8\u5206\u4e3a\u5355\u7a7a\u683c\u5206\u9694（\u5224\u9898\u6570\u636e\u4ee5\u6b64\u4e3a\u51c6；\u6837\u4f8b\u91cc\u7684\u5bf9\u9f50\u7a7a\u683c\u662f\u6392\u7248\u6548\u679c），<\/span>
\n\/\/ \u9879\u95f4\u4e00\u4e2a\u7a7a\u683c，\u884c\u672b\u65e0\u7a7a\u683c\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> 9<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> j =<\/span> 1<\/span>;<\/span> j <=<\/span> i;<\/span> j++<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>j ><\/span> 1<\/span>)<\/span> printf<\/span>(<\/span>" "<\/span>)<\/span>;<\/span> \/\/ \u9879\u95f4\u5355\u7a7a\u683c<\/span>
\n printf<\/span>(<\/span>"%d*%d=%d"<\/span>,<\/span> i,<\/span> j,<\/span> i *<\/span> j)<\/span>;<\/span> \/\/ \u4e58\u6570\u987a\u5e8f：i*j<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1084 \u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e8c）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1084 \u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e8c）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8bf7\u6309\u8981\u6c42\u8f93\u51fa\u4e5d\u4e5d\u4e58\u6cd5\u8868\u3002\u8981\u6c42\u6240\u8f93\u51fa\u5b83\u7684\u683c\u5f0f\u4e0e\u5e73\u5e38\u7684\u4e0d\u540c，\u662f\u90a3\u79cd\u53cd\u8fc7\u6765\u7684\u4e09\u89d2\u5f62，\u53ef\u4e0d\u8981\u770b\u9519\u4e86！<\/p>\n

\u8f93\u5165<\/h4>\n

\u7b2c\u4e00\u884c\u6709\u4e00\u4e2a\u6574\u6570，\u8868\u793a\u6709n\u7ec4\u6570\u636e\u3002（n<10)
\n\u63a5\u4e0b\u6765\u6709n\u884c，\u6bcf\u884c\u53ea\u6709\u4e00\u4e2a\u6574\u6570m（1<=m<= 9）\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5bf9\u5e94\u6bcf\u4e2a\u6574\u6570m，\u6839\u636e\u8981\u6c42\u8f93\u51fa\u4e58\u6cd5\u8868\u7684\u524dm\u884c，\u5177\u4f53\u683c\u5f0f\u53c2\u89c1\u8f93\u5165\u6837\u4f8b.
\n\u6bcf\u4e24\u7ec4\u6d4b\u8bd5\u6570\u636e\u7ed3\u679c\u4e4b\u95f4\u6709\u4e00\u4e2a\u7a7a\u884c\u9694\u5f00，\u5177\u4f53\u5982\u8f93\u51fa\u6837\u4f8b\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

3
\n2
\n1
\n5<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

1*1=1 1*2=2 1*3=3 1*4=4 1*5=5 1*6=6 1*7=7 1*8=8 1*9=9
\n2*2=4 2*3=6 2*4=8 2*5=10 2*6=12 2*7=14 2*8=16 2*9=18 <\/p>\n

1*1=1 1*2=2 1*3=3 1*4=4 1*5=5 1*6=6 1*7=7 1*8=8 1*9=9 <\/p>\n

1*1=1 1*2=2 1*3=3 1*4=4 1*5=5 1*6=6 1*7=7 1*8=8 1*9=9
\n2*2=4 2*3=6 2*4=8 2*5=10 2*6=12 2*7=14 2*8=16 2*9=18
\n3*3=9 3*4=12 3*5=15 3*6=18 3*7=21 3*8=24 3*9=27
\n4*4=16 4*5=20 4*6=24 4*7=28 4*8=32 4*9=36
\n5*5=25 5*6=30 5*7=35 5*8=40 5*9=45 <\/p>\n

\u601d\u8def：\u53cd\u4e09\u89d2\u5f62：\u7b2c i \u884c\u8f93\u51fa j=i\u20269；n \u7ec4\u6570\u636e，\u7ec4\u4e0e\u7ec4\u4e4b\u95f4\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n\u00b781)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1084 \u4e5d\u4e5d\u4e58\u6cd5\u8868（\u4e8c）<\/span>
\n\/\/ \u601d\u8def：n \u7ec4\u6570\u636e，\u6bcf\u7ec4\u7ed9\u5b9a m，\u8f93\u51fa\u201c\u53cd\u8fc7\u6765\u7684\u4e09\u89d2\u5f62\u201d\u524d m \u884c：<\/span>
\n\/\/ \u7b2c i \u884c\u8f93\u51fa j=i..9 \u7684 "i*j=i*j"，\u9879\u95f4\u4e00\u4e2a\u7a7a\u683c；<\/span>
\n\/\/ \u76f8\u90bb\u4e24\u7ec4\u7ed3\u679c\u4e4b\u95f4\u8f93\u51fa\u4e00\u4e2a\u7a7a\u884c\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> t =<\/span> 1<\/span>;<\/span> t <=<\/span> n;<\/span> t++<\/span>)<\/span> {<\/span>
\n int<\/span> m;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>m)<\/span> !=<\/span> 1<\/span>)<\/span> break<\/span>;<\/span>
\n if<\/span> (<\/span>t ><\/span> 1<\/span>)<\/span> printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span> \/\/ \u4e24\u7ec4\u4e4b\u95f4\u7684\u7a7a\u884c<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> m;<\/span> i++<\/span>)<\/span> {<\/span> \/\/ \u53ea\u8f93\u51fa\u524d m \u884c<\/span>
\n for<\/span> (<\/span>int<\/span> j =<\/span> i;<\/span> j <=<\/span> 9<\/span>;<\/span> j++<\/span>)<\/span> {<\/span> \/\/ \u6bcf\u884c\u4ece i*i \u4e00\u76f4\u5230 i*9<\/span>
\n if<\/span> (<\/span>j ><\/span> i)<\/span> printf<\/span>(<\/span>" "<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%d*%d=%d"<\/span>,<\/span> i,<\/span> j,<\/span> i *<\/span> j)<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n }<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1085 \u5b57\u7b26\u7edf\u8ba1（\u4e00）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1085 \u5b57\u7b26\u7edf\u8ba1（\u4e00）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u4e00\u884c\u5b57\u7b26，\u5206\u522b\u7edf\u8ba1\u5176\u4e2d\u82f1\u6587\u5b57\u6bcd\u3001\u7a7a\u683c\u3001\u6570\u5b57\u548c\u5176\u4ed6\u5b57\u7b26\u7684\u4e2a\u6570，\u5206\u884c\u8f93\u51fa\u8be5\u7ed3\u679c\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u884c\u5b57\u7b26，\u53ef\u4ee5\u5305\u542b\u5b57\u6bcd\u3001\u6570\u5b57\u3001\u7a7a\u683c\u3001\u6807\u70b9\u7b49\u7b26\u53f7\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5206\u884c\u8f93\u51fa\u5927\u5c0f\u5199\u82f1\u6587\u5b57\u6bcd\u3001\u7a7a\u683c\u3001\u6570\u5b57\u548c\u5176\u4ed6\u5b57\u7b26\u7684\u4e2a\u6570\u3002
\n\u5982：
\ncharacters=\u5b57\u6bcd\u4e2a\u6570
\nspaces=\u7a7a\u683c\u4e2a\u6570
\nnumbers=\u6570\u5b57\u4e2a\u6570
\nothers=\u5176\u4ed6\u5b57\u7b26\u4e2a\u6570<\/p>\n

\u63d0\u793a<\/h4>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

My input123 @%chars.<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

characters=12
\nspaces=2
\nnumbers=3
\nothers=3<\/p>\n

\u601d\u8def：getline \u8bfb\u6574\u884c，\u7528\u5b57\u7b26\u533a\u95f4（a-z\/A-Z\/0-9\/\u7a7a\u683c）\u5206\u7c7b\u7edf\u8ba1，\u907f\u5f00 isalpha \u7684 locale \u5f71\u54cd\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u884c\u957f)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1085 \u5b57\u7b26\u7edf\u8ba1（\u4e00）<\/span>
\n\/\/ \u601d\u8def：\u8bfb\u5165\u4e00\u6574\u884c，\u9010\u5b57\u7b26\u5206\u7c7b\u8ba1\u6570：\u82f1\u6587\u5b57\u6bcd \/ \u7a7a\u683c \/ \u6570\u5b57 \/ \u5176\u4ed6\u3002<\/span>
\n\/\/ \u5224\u5b9a\u7528\u5b57\u7b26\u8303\u56f4\u6bd4\u8f83，\u907f\u514d\u53d7 locale \u5f71\u54cd\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n string s;<\/span>
\n if<\/span> (<\/span>!<\/span>getline<\/span>(<\/span>cin,<\/span> s)<\/span>)<\/span> s =<\/span> ""<\/span>;<\/span> \/\/ \u6781\u7aef\u60c5\u51b5：\u7a7a\u884c\u5219\u56db\u4e2a\u8ba1\u6570\u5747\u4e3a 0<\/span>
\n int<\/span> letters =<\/span> 0<\/span>,<\/span> spaces =<\/span> 0<\/span>,<\/span> digits =<\/span> 0<\/span>,<\/span> others =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>size_t i =<\/span> 0<\/span>;<\/span> i <<\/span> s.<\/span>size<\/span>(<\/span>)<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\n char<\/span> c =<\/span> s[<\/span>i]<\/span>;<\/span>
\n if<\/span> (<\/span>(<\/span>c >=<\/span> 'a'<\/span> &&<\/span> c <=<\/span> 'z'<\/span>)<\/span> ||<\/span> (<\/span>c >=<\/span> 'A'<\/span> &&<\/span> c <=<\/span> 'Z'<\/span>)<\/span>)<\/span> letters++<\/span>;<\/span>
\n else<\/span> if<\/span> (<\/span>c ==<\/span> ' '<\/span>)<\/span> spaces++<\/span>;<\/span>
\n else<\/span> if<\/span> (<\/span>c >=<\/span> '0'<\/span> &&<\/span> c <=<\/span> '9'<\/span>)<\/span> digits++<\/span>;<\/span>
\n else<\/span> others++<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"characters=%d\\\\n"<\/span>,<\/span> letters)<\/span>;<\/span>
\n printf<\/span>(<\/span>"spaces=%d\\\\n"<\/span>,<\/span> spaces)<\/span>;<\/span>
\n printf<\/span>(<\/span>"numbers=%d\\\\n"<\/span>,<\/span> digits)<\/span>;<\/span>
\n printf<\/span>(<\/span>"others=%d\\\\n"<\/span>,<\/span> others)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1086 \u8fde\u7eed\u9636\u4e58\u6c42\u548c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1086 \u8fde\u7eed\u9636\u4e58\u6c42\u548c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570N，\u6c421!+2!+3!+\u2026+N!，\u5373\u6c42<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570N\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

1~N\u8fde\u7eed\u9636\u4e58\u7684\u548c，1!+2!+3!+\u2026+N!\u7684\u548c，\u672b\u5c3e\u6362\u884c\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u7531\u4e8e\u5927\u4e8e10\u7684\u6574\u6570\u7684\u9636\u4e58\u975e\u5e38\u5927，\u5df2\u8d85\u51fa\u6574\u6570\u7684\u8868\u793a\u8303\u56f4，\u6545\u6c42\u9636\u4e58\u65f6，\u9700\u8981\u5c06\u53d8\u91cf\u5b9a\u4e49\u4e3adouble\u7c7b\u578b\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

10<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

4037913<\/p>\n

\u601d\u8def：double \u8fb9\u4e58\u8fb9\u52a0\u6c42 \u03a3i!，\u7528 %.0f \u8f93\u51fa（\u4e0e\u6559\u6750\u53c2\u8003\u89e3\u4e00\u81f4）\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1086 \u8fde\u7eed\u9636\u4e58\u6c42\u548c<\/span>
\n\/\/ \u601d\u8def：\u6309\u9898\u9762\u63d0\u793a，\u9636\u4e58\u4e0e\u548c\u90fd\u7528 double \u4fdd\u5b58（N \u8f83\u5927\u65f6\u9636\u4e58\u8d85\u51fa\u6574\u6570\u8303\u56f4），<\/span>
\n\/\/ \u8fb9\u4e58\u8fb9\u52a0：f = i!，s \u7d2f\u52a0；\u6700\u540e\u6309\u6574\u6570\u5f62\u5f0f\u8f93\u51fa（\u4fdd\u7559 0 \u4f4d\u5c0f\u6570）\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n double<\/span> f =<\/span> 1.0<\/span>,<\/span> s =<\/span> 0.0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\n f *=<\/span> i;<\/span> \/\/ f = i!<\/span>
\n s +=<\/span> f;<\/span> \/\/ \u7d2f\u52a0 1!+2!+…+i!<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%.0f\\\\n"<\/span>,<\/span> s)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1087 \u6c42\u5f0f\u5b50\u7684\u548c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1087 \u6c42\u5f0f\u5b50\u7684\u548c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 64 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6c42\u5982\u4e0b\u5f0f\u5b50\u7684\u548c
\n\u8bf7\u5c06\u7ed3\u679c\u5b9a\u4e49\u4e3adouble\u7c7b\u578b\u3002
\n\u6ce8\u610f\u6c42\u5e73\u65b9，\u4e0d\u8981\u7528C\u6570\u5b66\u5e93\u4e2d\u63d0\u4f9b\u7684\u51fd\u6570pow\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u65e0<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5c0f\u6570\u70b9\u540e\u4fdd\u75596\u4f4d\u5c0f\u6570，\u672b\u5c3e\u6362\u884c\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

\u65e0<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

47977.928968<\/p>\n

\u601d\u8def：\u4e09\u9879\u6c42\u548c \u03a3k + \u03a3k\u00b2 + \u03a31\/k = 5050+42925+2.928968\u2026，\u8f93\u51fa 6 \u4f4d\u5c0f\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1087 \u6c42\u5f0f\u5b50\u7684\u548c<\/span>
\n\/\/ \u5f0f\u5b50：sum(k, k=1..100) + sum(k^2, k=1..50) + sum(1\/k, k=1..10)<\/span>
\n\/\/ = 5050 + 42925 + 2.928968… = 47977.928968…<\/span>
\n\/\/ \u601d\u8def：\u7528 double \u7d2f\u52a0，\u5e73\u65b9\u7528 k*k \u76f4\u63a5\u76f8\u4e58，\u8f93\u51fa\u4fdd\u7559 6 \u4f4d\u5c0f\u6570\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n double<\/span> s =<\/span> 0.0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> k =<\/span> 1<\/span>;<\/span> k <=<\/span> 100<\/span>;<\/span> k++<\/span>)<\/span> s +=<\/span> k;<\/span> \/\/ \u7b2c\u4e00\u9879：1+2+…+100<\/span>
\n for<\/span> (<\/span>int<\/span> k =<\/span> 1<\/span>;<\/span> k <=<\/span> 50<\/span>;<\/span> k++<\/span>)<\/span> s +=<\/span> (<\/span>double<\/span>)<\/span>k *<\/span> k;<\/span> \/\/ \u7b2c\u4e8c\u9879：1^2+2^2+…+50^2<\/span>
\n for<\/span> (<\/span>int<\/span> k =<\/span> 1<\/span>;<\/span> k <=<\/span> 10<\/span>;<\/span> k++<\/span>)<\/span> s +=<\/span> 1.0<\/span> \/<\/span> k;<\/span> \/\/ \u7b2c\u4e09\u9879：1\/1+1\/2+…+1\/10<\/span>
\n printf<\/span>(<\/span>"%.6f\\\\n"<\/span>,<\/span> s)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1088 \u6c34\u4ed9\u82b1\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1088 \u6c34\u4ed9\u82b1\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 64 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6625\u5929\u662f\u9c9c\u82b1\u7684\u5b63\u8282，\u6c34\u4ed9\u82b1\u5c31\u662f\u5176\u4e2d\u6700\u8ff7\u4eba\u7684\u4ee3\u8868，\u6570\u5b66\u4e0a\u6709\u4e2a\u6c34\u4ed9\u82b1\u6570，\u5b83\u662f\u8fd9\u6837\u5b9a\u4e49\u7684：\u201c\u6c34\u4ed9\u82b1\u6570\u201d\u662f\u6307\u4e00\u4e2a\u4e09\u4f4d\u6570，\u5b83\u7684\u5404\u4f4d\u6570\u5b57\u7684\u7acb\u65b9\u548c\u7b49\u4e8e\u5176\u672c\u8eab，\u6bd4\u5982：153=13+53+33\u3002\u8bf7\u8f93\u51fa\u6240\u6709\u7684\u201c\u6c34\u4ed9\u82b1\u6570\u201d\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u65e0<\/p>\n

\u8f93\u51fa<\/h4>\n

\u6bcf\u884c\u8f93\u51fa\u4e00\u4e2a\u6c34\u4ed9\u82b1\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

\u65e0<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

153
\n370
\n371
\n407<\/p>\n

\u601d\u8def：\u679a\u4e3e 100\u2026999，\u5224\u65ad\u5404\u4f4d\u6570\u5b57\u7684\u7acb\u65b9\u548c\u662f\u5426\u7b49\u4e8e\u81ea\u8eab\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1088 \u6c34\u4ed9\u82b1\u6570<\/span>
\n\/\/ \u601d\u8def：\u679a\u4e3e\u5168\u90e8\u4e09\u4f4d\u6570 100..999，\u5224\u65ad\u5404\u4f4d\u6570\u5b57\u7acb\u65b9\u548c\u662f\u5426\u7b49\u4e8e\u81ea\u8eab，\u6bcf\u884c\u8f93\u51fa\u4e00\u4e2a\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 100<\/span>;<\/span> i <=<\/span> 999<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\n int<\/span> a =<\/span> i \/<\/span> 100<\/span>;<\/span> \/\/ \u767e\u4f4d<\/span>
\n int<\/span> b =<\/span> i \/<\/span> 10<\/span> %<\/span> 10<\/span>;<\/span> \/\/ \u5341\u4f4d<\/span>
\n int<\/span> c =<\/span> i %<\/span> 10<\/span>;<\/span> \/\/ \u4e2a\u4f4d<\/span>
\n if<\/span> (<\/span>a *<\/span> a *<\/span> a +<\/span> b *<\/span> b *<\/span> b +<\/span> c *<\/span> c *<\/span> c ==<\/span> i)<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> i)<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1089 \u7ae5\u5e74\u751f\u6d3b\u4e8c\u4e09\u4e8b<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1089 \u7ae5\u5e74\u751f\u6d3b\u4e8c\u4e09\u4e8b<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 64 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

Redraiment\u5c0f\u65f6\u5019\u8d70\u8def\u559c\u6b22\u8e66\u8e66\u8df3\u8df3，\u4ed6\u6700\u559c\u6b22\u5728\u697c\u68af\u4e0a\u8df3\u6765\u8df3\u53bb\u3002 \u4f46\u5e74\u5e7c\u7684\u4ed6\u4e00\u6b21\u53ea\u80fd\u8d70\u4e0a\u4e00\u9636\u6216\u8005\u4e00\u4e0b\u5b50\u8e66\u4e0a\u4e24\u9636\u3002 \u73b0\u5728\u4e00\u5171\u6709N\u9636\u53f0\u9636，\u8bf7\u4f60\u8ba1\u7b97\u4e00\u4e0bRedraiment\u4ece\u7b2c0\u9636\u5230\u7b2cN\u9636\u5171\u6709\u51e0\u79cd\u8d70\u6cd5\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u5305\u62ec\u591a\u7ec4\u6570\u636e\u3002 \u6bcf\u7ec4\u6570\u636e\u5305\u62ec\u4e00\u884c:N(1\u2264N\u226440)\u3002 \u8f93\u5165\u4ee50\u7ed3\u675f\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5bf9\u5e94\u6bcf\u4e2a\u8f93\u5165\u5305\u62ec\u4e00\u4e2a\u8f93\u51fa\u3002 \u4e3aredraiment\u5230\u8fbe\u7b2cn\u9636\u4e0d\u540c\u8d70\u6cd5\u7684\u6570\u91cf\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

1
\n2
\n0<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

1
\n2<\/p>\n

\u601d\u8def：\u722c\u697c\u68af\u5373\u6590\u6ce2\u90a3\u5951 f(1)=1,f(2)=2；\u591a\u7ec4\u8f93\u5165\u8bfb\u5230 0 \u7ed3\u675f\u4e14\u4e0d\u8f93\u51fa 0\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u8be2\u95ee\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1089 \u7ae5\u5e74\u751f\u6d3b\u4e8c\u4e09\u4e8b<\/span>
\n\/\/ \u601d\u8def：\u6bcf\u6b21\u53ea\u80fd\u8d70 1 \u9636\u6216 2 \u9636，\u8d70\u6cd5\u6570\u5373\u6590\u6ce2\u90a3\u5951：<\/span>
\n\/\/ f(1)=1, f(2)=2, f(n)=f(n-1)+f(n-2)；N<=40 \u7528 long long \u6253\u8868\u3002<\/span>
\n\/\/ \u591a\u7ec4\u8f93\u5165，\u8bfb\u5230 0 \u7ed3\u675f\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n const<\/span> int<\/span> LIM =<\/span> 92<\/span>;<\/span> \/\/ \u9898\u76ee\u4fdd\u8bc1 N<=40，\u591a\u6253\u4e00\u6bb5\u8868\u4ee5\u9632\u8d8a\u754c（long long \u8db3\u591f\u5bb9\u7eb3\u8be5\u6570\u5217\u524d 92 \u9879）<\/span>
\n static<\/span> long<\/span> long<\/span> f[<\/span>LIM +<\/span> 1<\/span>]<\/span>;<\/span>
\n f[<\/span>0<\/span>]<\/span> =<\/span> 1<\/span>;<\/span>
\n f[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>;<\/span> \/\/ \u8d70\u5230\u7b2c 1 \u9636：1 \u79cd<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 2<\/span>;<\/span> i <=<\/span> LIM;<\/span> i++<\/span>)<\/span> f[<\/span>i]<\/span> =<\/span> f[<\/span>i –<\/span> 1<\/span>]<\/span> +<\/span> f[<\/span>i –<\/span> 2<\/span>]<\/span>;<\/span> \/\/ \u7b2c 2 \u9636\u4e3a 2 \u79cd<\/span>
\n int<\/span> n;<\/span>
\n while<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> ==<\/span> 1<\/span> &&<\/span> n !=<\/span> 0<\/span>)<\/span> {<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> f[<\/span>n]<\/span>)<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1090 \u97e9\u4fe1\u70b9\u5175<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1090 \u97e9\u4fe1\u70b9\u5175<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u6dee\u5b89\u6c11\u95f4\u4f20\u8bf4\u7740\u4e00\u5219\u6545\u4e8b\u2014\u2014\u201c\u97e9\u4fe1\u70b9\u5175\u201d，\u76f8\u5173\u6210\u8bed\u201c\u97e9\u4fe1\u70b9\u5175，\u591a\u591a\u76ca\u5584\u201d\u3002\u97e9\u4fe1\u4ece\u4e0d\u76f4\u63a5\u6e05\u70b9\u81ea\u5df1\u519b\u961f\u7684\u4eba\u6570，\u53ea\u8981\u8ba9\u58eb\u5175\u5148\u540e\u4ee5\u4e09\u4eba\u4e00\u6392\u3001\u4e94\u4eba\u4e00\u6392\u3001\u4e03\u4eba\u4e00\u6392\u5730\u53d8\u6362\u961f\u5f62，\u800c\u4ed6\u6bcf\u6b21\u53ea\u63a0\u4e00\u773c\u961f\u4f0d\u7684\u6392\u5c3e\u5c31\u77e5\u9053\u603b\u4eba\u6570\u4e86\u3002
\n\u8f93\u51653\u4e2a\u975e\u8d1f\u6574\u6570a，b，c ，\u8868\u793a\u6bcf\u79cd\u961f\u5f62\u6392\u5c3e\u7684\u4eba\u6570（a<3,b<5,c<7），\u8f93\u51fa\u603b\u4eba\u6570\u7684\u6700\u5c0f\u503c（\u6216\u62a5\u544a\u65e0\u89e3）\u3002\u5df2\u77e5\u603b\u4eba\u6570\u4e0d\u5c0f\u4e8e10，\u4e0d\u8d85\u8fc7100 \u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u51653\u4e2a\u975e\u8d1f\u6574\u6570 ，\u8868\u793a\u6bcf\u79cd\u961f\u5f62\u6392\u5c3e\u7684\u4eba\u6570（a<3,b<5,c<7）\u3002\u4f8b\u5982,\u8f93\u5165：2 4 5<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u603b\u4eba\u6570\u7684\u6700\u5c0f\u503c（\u6216\u62a5\u544a\u65e0\u89e3，\u5373\u8f93\u51faNo answer）\u3002\u5b9e\u4f8b，\u8f93\u51fa：89<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

2 1 6<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

41<\/p>\n

\u601d\u8def：\u97e9\u4fe1\u70b9\u5175：\u679a\u4e3e\u6ee1\u8db3\u300c\u4e09\u4e09\u6570\u4e4b\u5269 a\u3001\u4e94\u4e94\u6570\u4e4b\u5269 b\u3001\u4e03\u4e03\u6570\u4e4b\u5269 c\u300d\u7684\u6700\u5c0f\u6b63\u6574\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(105)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1090 \u97e9\u4fe1\u70b9\u5175<\/span>
\n\/\/ \u603b\u4eba\u6570 n \u6ee1\u8db3 10 <= n <= 100，\u4e14 n%3==a, n%5==b, n%7==c<\/span>
\n\/\/ \u76f4\u63a5\u4ece\u5c0f\u5230\u5927\u679a\u4e3e\u7b2c\u4e00\u4e2a\u6ee1\u8db3\u6761\u4ef6\u7684\u5373\u4e3a\u6700\u5c0f\u503c；\u65e0\u89e3\u8f93\u51fa No answer<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> a,<\/span> b,<\/span> c;<\/span>
\n while<\/span> (<\/span>scanf<\/span>(<\/span>"%d %d %d"<\/span>,<\/span> &<\/span>a,<\/span> &<\/span>b,<\/span> &<\/span>c)<\/span> ==<\/span> 3<\/span>)<\/span> {<\/span>
\n int<\/span> ans =<\/span> –<\/span>1<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> n =<\/span> 10<\/span>;<\/span> n <=<\/span> 100<\/span>;<\/span> n++<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>n %<\/span> 3<\/span> ==<\/span> a &&<\/span> n %<\/span> 5<\/span> ==<\/span> b &&<\/span> n %<\/span> 7<\/span> ==<\/span> c)<\/span> {<\/span>
\n ans =<\/span> n;<\/span>
\n break<\/span>;<\/span> \/\/ \u7b2c\u4e00\u4e2a\u6ee1\u8db3\u7684\u5c31\u662f\u6700\u5c0f\u503c<\/span>
\n }<\/span>
\n }<\/span>
\n if<\/span> (<\/span>ans <<\/span> 0<\/span>)<\/span>
\n printf<\/span>(<\/span>"No answer\\\\n"<\/span>)<\/span>;<\/span>
\n else<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> ans)<\/span>;<\/span>
\n }<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1091 \u5c0f\u7403\u8e66\u8e66\u8df3<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1091 \u5c0f\u7403\u8e66\u8e66\u8df3<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8c03\u76ae\u7684\u5c0f\u660e\u5c06\u76ae\u7403\u4ece100m\u7684\u9ad8\u5ea6\u81ea\u7531\u843d\u4e0b，\u6bcf\u6b21\u843d\u5730\u540e\u53cd\u5f39\u56de\u539f\u9ad8\u5ea6\u7684\u4e00\u534a，\u518d\u843d\u4e0b，\u518d\u53cd\u5f39\u3002
\n\u6c42\u5b83\u5728\u7b2cN\u6b21\u843d\u5730\u65f6，\u5171\u7ecf\u8fc7\u4e86\u591a\u5c11\u7c73，\u7b2cN\u6b21\u53cd\u5f39\u591a\u9ad8\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u4e00\u4e2a\u6b63\u6574\u6570N，\u8868\u793a\u7403\u843d\u5730\u7684\u6b21\u6570\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

length=\u7403\u7b2cN\u6b21\u843d\u5730\u65f6\u6240\u7ecf\u8fc7\u4e86\u8ddd\u79bb
\nhigh=\u7403\u7b2cN\u6b21\u843d\u5730\u53cd\u5f39\u7684\u9ad8\u5ea6
\n\u5c0f\u6570\u70b9\u540e\u4fdd\u75594\u4f4d\u5c0f\u6570\u3002
\n\u6ce8\u610f：\u672b\u5c3e\u8f93\u51fa\u6362\u884c\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

10<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

length=299.6094
\nhigh=0.0977<\/p>\n

\u601d\u8def：\u9010\u6b21\u53cd\u5f39\u6a21\u62df：\u7b2c i \u6b21\u843d\u5730\u8def\u7a0b\u52a0\u4e0a 2 \u500d\u53cd\u5f39\u9ad8\u5ea6，\u6700\u540e\u4e00\u6b21\u4e0d\u518d\u52a0\u53cd\u5f39\u8def\u7a0b\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1091 \u5c0f\u7403\u8e66\u8e66\u8df3<\/span>
\n\/\/ \u4ece 100m \u843d\u4e0b，\u6bcf\u6b21\u843d\u5730\u540e\u53cd\u5f39\u56de\u539f\u9ad8\u5ea6\u7684\u4e00\u534a<\/span>
\n\/\/ \u7b2c i \u6b21\u843d\u5730\u65f6\u7ecf\u8fc7\u7684\u8def\u7a0b：i=1 \u65f6\u5c31\u662f 100；\u4e4b\u540e\u6bcf\u6b21\u591a\u8d70 2*\u4e0a\u4e00\u6b21\u53cd\u5f39\u9ad8\u5ea6<\/span>
\n\/\/ \u7b2c N \u6b21\u843d\u5730\u540e\u7684\u53cd\u5f39\u9ad8\u5ea6 = 100 \/ 2^N<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n double<\/span> h =<\/span> 100.0<\/span>;<\/span> \/\/ \u5f53\u524d\u9ad8\u5ea6：\u7b2c\u4e00\u6b21\u843d\u5730\u524d\u4e3a 100，\u4e4b\u540e\u4e3a\u4e0a\u4e00\u6b21\u53cd\u5f39\u9ad8\u5ea6<\/span>
\n double<\/span> len =<\/span> 0.0<\/span>;<\/span> \/\/ \u7d2f\u8ba1\u7ecf\u8fc7\u7684\u8def\u7a0b<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span>;<\/span> i <=<\/span> n;<\/span> i++<\/span>)<\/span> {<\/span>
\n len +=<\/span> h;<\/span> \/\/ \u843d\u4e0b\u8fd9\u4e00\u6bb5<\/span>
\n h \/=<\/span> 2.0<\/span>;<\/span> \/\/ \u53cd\u5f39\u9ad8\u5ea6（\u7b2c i \u6b21\u843d\u5730\u540e\u7684\u53cd\u5f39\u9ad8\u5ea6）<\/span>
\n if<\/span> (<\/span>i <<\/span> n)<\/span> len +=<\/span> h;<\/span> \/\/ \u4e0d\u662f\u6700\u540e\u4e00\u6b21\u843d\u5730，\u8fd8\u8981\u628a\u8fd9\u6b21\u5f39\u8d77\u518d\u843d\u4e0b\u7684\u4e0a\u5347\u6bb5\u8ba1\u5165<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"length=%.4f\\\\n"<\/span>,<\/span> len)<\/span>;<\/span>
\n printf<\/span>(<\/span>"high=%.4f\\\\n"<\/span>,<\/span> h)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1092 \u5f53\u6708\u5929\u6570（\u6570\u7ec4\u5b9e\u73b0）<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1092 \u5f53\u6708\u5929\u6570（\u6570\u7ec4\u5b9e\u73b0）<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u5165\u5e74\u4efd\u548c\u6708\u4efd，\u8f93\u51fa\u8fd9\u4e00\u5e74\u7684\u8fd9\u4e00\u6708\u6709\u591a\u5c11\u5929\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e24\u4e2a\u6b63\u6574\u6570，\u5206\u522b\u8868\u793a\u5e74\u4efdy \u548c\u6708\u4efdm，\u4ee5\u7a7a\u683c\u5206\u9694\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u4e00\u4e2a\u6b63\u6574\u6570，\u8868\u793a\u8fd9\u4e2a\u6708\u6709\u591a\u5c11\u5929\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u7b2c5\u7ae0\u6570\u7ec4<\/p>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

2000 2<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

29<\/p>\n

\u601d\u8def：\u6708\u4efd\u5929\u6570\u6570\u7ec4 + \u95f0\u5e74\u4fee\u6b63 2 \u6708，\u7528\u6570\u7ec4\u5b9e\u73b0\u800c\u975e switch\u3002<\/p>\n

\u590d\u6742\u5ea6：O(1)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1092 \u5f53\u6708\u5929\u6570（\u6570\u7ec4\u5b9e\u73b0）<\/span>
\n\/\/ \u7528\u6570\u7ec4\u5b58\u6bcf\u6708\u5929\u6570，\u95f0\u5e74\u65f6 2 \u6708\u6539\u4e3a 29<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> days[<\/span>13<\/span>]<\/span> =<\/span> {<\/span>0<\/span>,<\/span> 31<\/span>,<\/span> 28<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>,<\/span> 30<\/span>,<\/span> 31<\/span>}<\/span>;<\/span>
\n int<\/span> y,<\/span> m;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d %d"<\/span>,<\/span> &<\/span>y,<\/span> &<\/span>m)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n bool<\/span> leap =<\/span> (<\/span>y %<\/span> 400<\/span> ==<\/span> 0<\/span>)<\/span> ||<\/span> (<\/span>y %<\/span> 4<\/span> ==<\/span> 0<\/span> &&<\/span> y %<\/span> 100<\/span> !=<\/span> 0<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>leap)<\/span> days[<\/span>2<\/span>]<\/span> =<\/span> 29<\/span>;<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> days[<\/span>m]<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1093 \u6458\u82f9\u679c<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1093 \u6458\u82f9\u679c<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5c0f\u660e\u5bb6\u7684\u9662\u5b50\u91cc\u6709\u4e00\u68f5\u82f9\u679c\u6811，\u6bcf\u5230\u79cb\u5929\u6811\u4e0a\u5c31\u4f1a\u7ed3\u51fa10\u4e2a\u82f9\u679c\u3002\u82f9\u679c\u6210\u719f\u7684\u65f6\u5019，\u5c0f\u660e\u5c31\u4f1a\u8dd1\u53bb\u6458\u82f9\u679c\u3002\u5c0f\u660e\u6709\u4e2a30\u5398\u7c73\u9ad8\u7684\u677f\u51f3，\u5f53\u4ed6\u4e0d\u80fd\u76f4\u63a5\u7528\u624b\u6458\u5230\u82f9\u679c\u7684\u65f6\u5019，\u5c31\u4f1a\u8e29\u5230\u677f\u51f3\u4e0a\u518d\u8bd5\u8bd5\u3002\u73b0\u5728\u5df2\u77e510\u4e2a\u82f9\u679c\u5230\u5730\u9762\u7684\u9ad8\u5ea6，\u4ee5\u53ca\u5c0f\u660e\u628a\u624b\u4f38\u76f4\u7684\u65f6\u5019\u80fd\u591f\u8fbe\u5230\u7684\u6700\u5927\u9ad8\u5ea6，\u8bf7\u5e2e\u5c0f\u660e\u7b97\u4e00\u4e0b\u4ed6\u80fd\u591f\u6458\u5230\u7684\u82f9\u679c\u7684\u6570\u76ee\u3002\u5047\u8bbe\u4ed6\u78b0\u5230\u82f9\u679c，\u82f9\u679c\u5c31\u4f1a\u6389\u4e0b\u6765\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u5305\u62ec\u4e24\u884c\u6570\u636e\u3002\u7b2c\u4e00\u884c\u5305\u542b10\u4e2a100\u5230200\u4e4b\u95f4（\u5305\u62ec100\u548c200）\u7684\u6574\u6570（\u4ee5\u5398\u7c73\u4e3a\u5355\u4f4d）\u5206\u522b\u8868\u793a10\u4e2a\u82f9\u679c\u5230\u5730\u9762\u7684\u9ad8\u5ea6，\u4e24\u4e2a\u76f8\u90bb\u7684\u6574\u6570\u4e4b\u95f4\u7528\u4e00\u4e2a\u7a7a\u683c\u5206\u9694\u3002
\n\u7b2c\u4e8c\u884c\u53ea\u5305\u62ec\u4e00\u4e2a100\u5230120\u4e4b\u95f4（\u5305\u542b100\u548c120）\u7684\u6574\u6570（\u4ee5\u5398\u7c73\u4e3a\u5355\u4f4d），\u8868\u793a\u5c0f\u660e\u628a\u624b\u4f38\u76f4\u7684\u65f6\u5019\u80fd\u591f\u8fbe\u5230\u7684\u6700\u5927\u9ad8\u5ea6\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5305\u62ec\u4e00\u884c，\u8fd9\u4e00\u884c\u53ea\u5305\u542b\u4e00\u4e2a\u6574\u6570，\u8868\u793a\u5c0f\u660e\u80fd\u591f\u6458\u5230\u7684\u82f9\u679c\u7684\u6570\u76ee\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

100 200 150 140 129 134 167 198 200 111
\n110<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

5<\/p>\n

\u601d\u8def：\u82f9\u679c\u9ad8\u5ea6 \u2264 \u624b\u9ad8 + \u677f\u51f3\u9ad8 \u5373\u53ef\u6458\u5230，\u9010\u4e2a\u8ba1\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1093 \u6458\u82f9\u679c<\/span>
\n\/\/ 10 \u4e2a\u82f9\u679c，\u5c0f\u660e\u624b\u4f38\u76f4\u9ad8\u5ea6 h，\u8e29 30cm \u677f\u51f3\u540e\u53ef\u591f\u5230 h+30<\/span>
\n\/\/ \u82f9\u679c\u9ad8\u5ea6 <= h+30 \u5373\u53ef\u6458\u5230（\u78b0\u5230\u5c31\u6389）<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> apple[<\/span>10<\/span>]<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> 10<\/span>;<\/span> i++<\/span>)<\/span> scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>apple[<\/span>i]<\/span>)<\/span>;<\/span>
\n int<\/span> h;<\/span>
\n scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>h)<\/span>;<\/span>
\n int<\/span> reach =<\/span> h +<\/span> 30<\/span>,<\/span> cnt =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> 10<\/span>;<\/span> i++<\/span>)<\/span>
\n if<\/span> (<\/span>apple[<\/span>i]<\/span> <=<\/span> reach)<\/span> cnt++<\/span>;<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> cnt)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1094 \u6821\u95e8\u5916\u7684\u6811<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1094 \u6821\u95e8\u5916\u7684\u6811<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u67d0\u6821\u5927\u95e8\u5916\u957f\u5ea6\u4e3aL\u7684\u9a6c\u8def\u4e0a\u6709\u4e00\u6392\u6811，\u6bcf\u4e24\u68f5\u76f8\u90bb\u7684\u6811\u95f4\u9694\u5747\u4e3a1\u7c73\u3002\u53ef\u4ee5\u628a\u9a6c\u8def\u770b\u6210\u4e00\u4e2a\u6570\u8f74，\u9a6c\u8def\u7684\u4e00\u7aef\u5728\u6570\u8f740\u7684\u4f4d\u7f6e，\u53e6\u4e00\u7aef\u5728L\u7684\u4f4d\u7f6e；\u6570\u8f74\u4e0a\u7684\u6bcf\u4e2a\u6574\u6570\u70b9，\u53730，1，2，\u2026\u2026，L，\u90fd\u79cd\u6709\u4e00\u68f5\u6811\u3002\u7531\u4e8e\u9a6c\u8def\u4e0a\u6709\u4e00\u4e9b\u533a\u57df\u8981\u7528\u6765\u5efa\u5730\u94c1\u3002\u8fd9\u4e9b\u533a\u57df\u7528\u5b83\u4eec\u5728\u6570\u8f74\u4e0a\u7684\u8d77\u59cb\u70b9\u548c\u7ec8\u6b62\u70b9\u8868\u793a\u3002\u5df2\u77e5\u4efb\u4e00\u533a\u57df\u7684\u8d77\u59cb\u70b9\u548c\u7ec8\u6b62\u70b9\u7684\u5750\u6807\u90fd\u662f\u6574\u6570，\u533a\u57df\u4e4b\u95f4\u53ef\u80fd\u6709\u91cd\u5408\u7684\u90e8\u5206\u3002\u73b0\u5728\u8981\u628a\u8fd9\u4e9b\u533a\u57df\u4e2d\u7684\u6811（\u5305\u62ec\u533a\u57df\u7aef\u70b9\u5904\u7684\u4e24\u68f5\u6811）\u79fb\u8d70\u3002\u8bf7\u8ba1\u7b97\u5c06\u8fd9\u4e9b\u6811\u90fd\u79fb\u8d70\u540e，\u9a6c\u8def\u4e0a\u8fd8\u6709\u591a\u5c11\u68f5\u6811\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u7b2c\u4e00\u884c\u6709\u4e24\u4e2a\u6574\u6570L（1 \u2264 L \u2264 10000）\u548c M（1 \u2264 M \u2264 100），L\u4ee3\u8868\u9a6c\u8def\u7684\u957f\u5ea6，M\u4ee3\u8868\u533a\u57df\u7684\u6570\u76ee，L\u548cM\u4e4b\u95f4\u7528\u4e00\u4e2a\u7a7a\u683c\u5206\u9694\u3002\u63a5\u4e0b\u6765\u7684M\u884c\u6bcf\u884c\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u7684\u6574\u6570，\u7528\u4e00\u4e2a\u7a7a\u683c\u5206\u9694，\u8868\u793a\u4e00\u4e2a\u533a\u57df\u7684\u8d77\u59cb\u70b9\u548c\u7ec8\u6b62\u70b9\u7684\u5750\u6807\u3002
\n\u5bf9\u4e8e20%\u7684\u6570\u636e，\u533a\u57df\u4e4b\u95f4\u6ca1\u6709\u91cd\u5408\u7684\u90e8\u5206；\u5bf9\u4e8e\u5176\u5b83\u7684\u6570\u636e，\u533a\u57df\u4e4b\u95f4\u6709\u91cd\u5408\u7684\u60c5\u51b5\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5305\u62ec\u4e00\u884c，\u8fd9\u4e00\u884c\u53ea\u5305\u542b\u4e00\u4e2a\u6574\u6570，\u8868\u793a\u9a6c\u8def\u4e0a\u5269\u4f59\u7684\u6811\u7684\u6570\u76ee\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

500 3
\n150 300
\n100 200
\n470 471<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

298<\/p>\n

\u601d\u8def：\u5dee\u5206\/\u6807\u8bb0：\u628a\u6bcf\u6bb5\u780d\u6811\u533a\u95f4（\u542b\u7aef\u70b9）\u6253\u4e0a\u6807\u8bb0，\u6700\u540e\u7edf\u8ba1\u672a\u88ab\u8986\u76d6\u7684\u6811（\u5171 L+1 \u68f5）\u3002<\/p>\n

\u590d\u6742\u5ea6：O(L+m)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1094 \u6821\u95e8\u5916\u7684\u6811<\/span>
\n\/\/ \u6570\u8f74\u4e0a 0..L \u6bcf\u4e2a\u6574\u6570\u70b9\u4e00\u68f5\u6811，\u5171 L+1 \u68f5<\/span>
\n\/\/ \u79fb\u8d70 M \u4e2a\u533a\u95f4（\u542b\u4e24\u7aef\u70b9）\u5185\u7684\u6811，\u533a\u95f4\u53ef\u80fd\u91cd\u5408，\u7528\u6807\u8bb0\u6570\u7ec4\u7edf\u8ba1\u5269\u4f59<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> L,<\/span> M;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d %d"<\/span>,<\/span> &<\/span>L,<\/span> &<\/span>M)<\/span> !=<\/span> 2<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n vector<<\/span>int<\/span>><\/span> removed<\/span>(<\/span>L +<\/span> 1<\/span>,<\/span> 0<\/span>)<\/span>;<\/span> \/\/ 0..L \u5171 L+1 \u4e2a\u70b9<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> M;<\/span> i++<\/span>)<\/span> {<\/span>
\n int<\/span> s,<\/span> e;<\/span>
\n scanf<\/span>(<\/span>"%d %d"<\/span>,<\/span> &<\/span>s,<\/span> &<\/span>e)<\/span>;<\/span>
\n if<\/span> (<\/span>s ><\/span> e)<\/span> swap<\/span>(<\/span>s,<\/span> e)<\/span>;<\/span>
\n if<\/span> (<\/span>s <<\/span> 0<\/span>)<\/span> s =<\/span> 0<\/span>;<\/span>
\n if<\/span> (<\/span>e ><\/span> L)<\/span> e =<\/span> L;<\/span>
\n for<\/span> (<\/span>int<\/span> j =<\/span> s;<\/span> j <=<\/span> e;<\/span> j++<\/span>)<\/span> removed[<\/span>j]<\/span> =<\/span> 1<\/span>;<\/span> \/\/ \u7aef\u70b9\u5904\u7684\u6811\u4e5f\u8981\u79fb\u8d70<\/span>
\n }<\/span>
\n int<\/span> cnt =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <=<\/span> L;<\/span> j++<\/span>)<\/span>
\n if<\/span> (<\/span>!<\/span>removed[<\/span>j]<\/span>)<\/span> cnt++<\/span>;<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> cnt)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1095 \u8f6f\u4ef6\u5b66\u9662OJ<\/h3>\n

\u26a0\ufe0f \u672c\u9898\u5df2\u88ab\u7ba1\u7406\u5458\u505c\u7528：\u8bbf\u95ee\u9898\u76ee\u9875\u53ea\u663e\u793a\u201c\u9898\u76ee\u5f53\u524d\u4e0d\u53ef\u7528\u201d，
\n\u9898\u9762\u4e0e\u6d4b\u8bd5\u6570\u636e\u5747\u4e0d\u53ef\u89c1\u3002\u4e0b\u65b9\u4ee3\u7801\u4ec5\u4f9b\u53c2\u8003，\u65e0\u6cd5\u9a8c\u8bc1\u662f\u5426 AC\u3002<\/p>\n

\u601d\u8def：\u9898\u76ee\u5df2\u88ab\u7ba1\u7406\u5458\u505c\u7528（\u9875\u9762\u63d0\u793a\u300c\u9898\u76ee\u5f53\u524d\u4e0d\u53ef\u7528\u300d），\u9898\u9762\u4e0e\u6d4b\u8bd5\u6570\u636e\u5747\u4e0d\u53ef\u89c1\u3002<\/p>\n

\u590d\u6742\u5ea6：\u2014<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1095 \u8f6f\u4ef6\u5b66\u9662OJ<\/span>
\n\/\/ \u9898\u9762\u7f3a\u5931：oj\/raw\/1095.html \u662f HUSTOJ \u7684 "\u9898\u76ee\u5f53\u524d\u4e0d\u53ef\u7528" \u9875\u9762，<\/span>
\n\/\/ statements\/1095.md \u53ea\u6709\u6807\u9898，\u6ca1\u6709\u9898\u76ee\u63cf\u8ff0\/\u8f93\u5165\/\u8f93\u51fa\/\u6837\u4f8b，\u65e0\u6cd5\u636e\u6b64\u5199\u51fa\u6b63\u786e\u89e3\u6cd5\u3002<\/span>
\n\/\/ \u5360\u4f4d\u6587\u4ef6，\u7b49\u5f85\u9898\u9762\u8865\u9f50\u540e\u518d\u5b9e\u73b0\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1096 \u76f8\u540c\u6570\u4e2a\u6570<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1096 \u76f8\u540c\u6570\u4e2a\u6570<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\u5e8f\u5217\u4e2d\u4e0e\u6307\u5b9a\u6570\u5b57\u76f8\u540c\u7684\u6570\u7684\u4e2a\u6570\u3002
\n\u603b\u65f6\u95f4\u9650\u5236: 1000 ms \u5185\u5b58\u9650\u5236: 65536 kB\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u5305\u542b\u4e09\u884c：
\n\u7b2c\u4e00\u884c\u4e3aN，\u8868\u793a\u6574\u6570\u5e8f\u5217\u7684\u957f\u5ea6（N \u2264 100）；
\n\u7b2c\u4e8c\u884c\u4e3aN\u4e2a\u6574\u6570，\u6574\u6570\u4e4b\u95f4\u4ee5\u7a7a\u683c\u5206\u9694；
\n\u7b2c\u4e09\u884c\u5305\u542b\u4e00\u4e2a\u6574\u6570，\u4e3a\u6307\u5b9a\u7684\u6574\u6570m\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u4e3aN\u4e2a\u6570\u4e2d\u4e0em\u76f8\u540c\u7684\u6570\u7684\u4e2a\u6570\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

3
\n2 3 2
\n2<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

2<\/p>\n

\u601d\u8def：\u9010\u4e2a\u6bd4\u8f83，\u7edf\u8ba1\u4e0e\u7ed9\u5b9a\u503c\u76f8\u540c\u7684\u5143\u7d20\u4e2a\u6570\u3002<\/p>\n

\u590d\u6742\u5ea6：O(n)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1096 \u76f8\u540c\u6570\u4e2a\u6570<\/span>
\n\/\/ \u8bfb\u5165 N \u4e2a\u6570，\u7edf\u8ba1\u7b49\u4e8e m \u7684\u4e2a\u6570<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n int<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n vector<<\/span>int<\/span>><\/span> a<\/span>(<\/span>n)<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span> scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>
\n int<\/span> m;<\/span>
\n scanf<\/span>(<\/span>"%d"<\/span>,<\/span> &<\/span>m)<\/span>;<\/span>
\n int<\/span> cnt =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> n;<\/span> i++<\/span>)<\/span>
\n if<\/span> (<\/span>a[<\/span>i]<\/span> ==<\/span> m)<\/span> cnt++<\/span>;<\/span>
\n printf<\/span>(<\/span>"%d\\\\n"<\/span>,<\/span> cnt)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1097 \u51b0\u96f9\u731c\u60f3<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1097 \u51b0\u96f9\u731c\u60f3<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u7ed9\u51fa\u4e00\u4e2a\u6b63\u6574\u6570n，\u7136\u540e\u5bf9\u8fd9\u4e2a\u6570\u5b57\u4e00\u76f4\u8fdb\u884c\u4e0b\u9762\u7684\u64cd\u4f5c：\u5982\u679c\u8fd9\u4e2a\u6570\u5b57\u662f\u5947\u6570，\u90a3\u4e48\u5c06\u5176\u4e583\u518d\u52a01，\u5426\u5219\u9664\u4ee52\u3002\u7ecf\u8fc7\u82e5\u5e72\u6b21\u5faa\u73af\u540e，\u6700\u7ec8\u90fd\u4f1a\u56de\u52301\u3002\u7ecf\u8fc7\u9a8c\u8bc1，\u5f88\u5927\u7684\u6570\u5b57（7\u00d71011）\u90fd\u53ef\u4ee5\u6309\u7167\u8fd9\u6837\u7684\u65b9\u5f0f\u53d8\u62101，\u6240\u4ee5\u88ab\u79f0\u4e3a\u201c\u51b0\u96f9\u731c\u60f3\u201d\u3002\u4f8b\u5982\u5f53n\u662f20，\u53d8\u5316\u7684\u8fc7\u7a0b\u662f20\u219210\u21925\u219216\u21928\u21924\u21922\u21921\u3002\u6839\u636e\u7ed9\u5b9a\u7684\u6570\u5b57，\u9a8c\u8bc1\u8fd9\u4e2a\u731c\u60f3，\u5e76\u4ece\u6700\u540e\u76841 \u5f00\u59cb，\u5012\u5e8f\u8f93\u51fa\u6574\u4e2a\u53d8\u5316\u5e8f\u5217\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u82e5\u5e72\u4e2a\u7531\u7a7a\u683c\u9694\u5f00\u7684\u6b63\u6574\u6570，\u8868\u793a\u4ece\u6700\u540e\u76841\u5f00\u59cb\u5012\u5e8f\u7684\u53d8\u5316\u6570\u5217\u3002<\/p>\n

\u63d0\u793a<\/h4>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

20<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

1 2 4 8 16 5 10 20<\/p>\n

\u601d\u8def：\u51b0\u96f9\u731c\u60f3：\u5947\u6570 3n+1\u3001\u5076\u6570 n\/2，\u8bb0\u5f55\u5e8f\u5217\u540e\u5012\u5e8f\u8f93\u51fa\u76f4\u5230 1\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u6b65\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1097 \u51b0\u96f9\u731c\u60f3<\/span>
\n\/\/ \u8bb0\u5f55\u53d8\u5316\u5e8f\u5217（\u542b\u9996\u9879 n \u4e0e\u6700\u540e\u7684 1），\u518d\u5012\u5e8f\u8f93\u51fa<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n vector<<\/span>long<\/span> long<\/span>><\/span> v;<\/span>
\n v.<\/span>push_back<\/span>(<\/span>n)<\/span>;<\/span>
\n while<\/span> (<\/span>n !=<\/span> 1<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>n %<\/span> 2<\/span> ==<\/span> 1<\/span>)<\/span>
\n n =<\/span> n *<\/span> 3<\/span> +<\/span> 1<\/span>;<\/span>
\n else<\/span>
\n n =<\/span> n \/<\/span> 2<\/span>;<\/span>
\n v.<\/span>push_back<\/span>(<\/span>n)<\/span>;<\/span>
\n }<\/span>
\n \/\/ \u5012\u5e8f\u8f93\u51fa：1 2 4 8 16 5 10 20，\u6570\u4e4b\u95f4\u4e00\u4e2a\u7a7a\u683c，\u672b\u5c3e\u6362\u884c<\/span>
\n for<\/span> (<\/span>int<\/span> i =<\/span> (<\/span>int<\/span>)<\/span>v.<\/span>size<\/span>(<\/span>)<\/span> –<\/span> 1<\/span>;<\/span> i >=<\/span> 0<\/span>;<\/span> i—<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>i !=<\/span> (<\/span>int<\/span>)<\/span>v.<\/span>size<\/span>(<\/span>)<\/span> –<\/span> 1<\/span>)<\/span> printf<\/span>(<\/span>" "<\/span>)<\/span>;<\/span>
\n printf<\/span>(<\/span>"%lld"<\/span>,<\/span> v[<\/span>i]<\/span>)<\/span>;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"\\\\n"<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1098 \u5361\u7247\u6e38\u620f<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1098 \u5361\u7247\u6e38\u620f<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 128 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u5c0f\u660e\u6709\u5f88\u591a\u6570\u5b57\u5361\u7247，\u6bcf\u5f20\u5361\u7247\u4e0a\u90fd\u662f09\u4e2d\u7684\u4e00\u4e2a\u6570\u5b57\u3002\u5c0f\u660e\u51c6\u5907\u7528\u8fd9\u4e9b\u5361\u7247\u6765\u62fc\u4e00\u4e9b\u6570，\u4ed6\u60f3\u4ece1\u5f00\u59cb\u62fc\u51fa\u6b63\u6574\u6570，\u6bcf\u62fc\u4e00\u4e2a，\u5c31\u4fdd\u5b58\u8d77\u6765，\u5361\u7247\u5c31\u4e0d\u80fd\u7528\u6765\u62fc\u5176\u5b83\u6570\u4e86\u3002\u5c0f\u660e\u60f3\u77e5\u9053\u81ea\u5df1\u80fd\u4ece1\u62fc\u5230\u591a\u5c11\u3002\u4f8b\u5982，\u5f53\u5c0f\u660e\u670930\u5f20\u5361\u7247，\u5176\u4e2d0<\/sub>9\u54043\u5f20，\u5219\u53ef\u4ee5\u62fc\u51fa1\u523010，\u4f46\u662f\u62fc11\u65f6\u5361\u72471\u5df2\u7ecf\u53ea\u6709\u4e00\u5f20\u4e86，\u4e0d\u591f\u62fc\u51fa11\u3002\u73b0\u5728\u5c0f\u660e\u624b\u91cc\u67090\u52309\u7684\u5361\u7247\u5404n\u5f20，\u8bf7\u95ee\u5c0f\u660e\u53ef\u4ee5\u4ece1\u62fc\u5230\u591a\u5c11？<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u5c0f\u660e\u53ef\u4ee5\u4ece1\u62fc\u5230\u7684\u6700\u5927\u6570\u503c\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

2021<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

3181<\/p>\n

\u601d\u8def：\u9010\u4e2a\u6570\u7edf\u8ba1\u5404\u6570\u5b57\u7684\u5361\u7247\u9700\u6c42，\u9700\u6c42\u8d85\u8fc7 30 \u5f20\u5e93\u5b58\u5373\u505c；\u6ce8\u610f 11 \u8fd9\u79cd\u91cd\u590d\u6570\u5b57\u8981\u4e00\u6b21\u6263\u4e24\u5f20 1\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u7b54\u6848\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1098 \u5361\u7247\u6e38\u620f<\/span>
\n\/\/ 0~9 \u5404 n \u5f20，\u4ece 1 \u5f00\u59cb\u8fde\u7eed\u62fc\u6570，\u80fd\u62fc\u51fa\u6765\u5c31\u4fdd\u5b58\u4e0b\u6765（\u5361\u7247\u88ab\u6d88\u8017），<\/span>
\n\/\/ \u76f4\u5230\u67d0\u4e2a\u6570\u62fc\u4e0d\u51fa\u4e3a\u6b62，\u7b54\u6848\u5c31\u662f\u80fd\u62fc\u5230\u7684\u6700\u5927\u6574\u6570\u3002<\/span>
\n\/\/ \u6ce8\u610f：\u68c0\u67e5\u65f6\u8981\u628a\u8be5\u6570\u91cc\u6bcf\u4e2a\u6570\u5b57\u7684\u201c\u51fa\u73b0\u6b21\u6570\u201d\u4e00\u8d77\u6263\u51cf（\u4f8b\u5982 11 \u9700\u8981\u4e24\u5f20 1），<\/span>
\n\/\/ \u6240\u4ee5\u5148\u7528 need[] \u7edf\u8ba1\u5404\u4f4d\u6570\u5b57\u7684\u9700\u6c42\u91cf，\u518d\u7edf\u4e00\u5224\u65ad\u4e0e\u6263\u51cf\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> n;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>n)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span><\/p>\n

long<\/span> long<\/span> cnt[<\/span>10<\/span>]<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> d =<\/span> 0<\/span>;<\/span> d <<\/span> 10<\/span>;<\/span> d++<\/span>)<\/span> cnt[<\/span>d]<\/span> =<\/span> n;<\/span><\/p>\n

long<\/span> long<\/span> ans =<\/span> 0<\/span>;<\/span>
\n for<\/span> (<\/span>long<\/span> long<\/span> x =<\/span> 1<\/span>;<\/span>;<\/span> x++<\/span>)<\/span> {<\/span>
\n long<\/span> long<\/span> need[<\/span>10<\/span>]<\/span> =<\/span> {<\/span>0<\/span>}<\/span>;<\/span>
\n long<\/span> long<\/span> t =<\/span> x;<\/span>
\n while<\/span> (<\/span>t ><\/span> 0<\/span>)<\/span> {<\/span>
\n need[<\/span>t %<\/span> 10<\/span>]<\/span>++<\/span>;<\/span>
\n t \/=<\/span> 10<\/span>;<\/span>
\n }<\/span>
\n bool<\/span> ok =<\/span> true<\/span>;<\/span>
\n for<\/span> (<\/span>int<\/span> d =<\/span> 0<\/span>;<\/span> d <<\/span> 10<\/span>;<\/span> d++<\/span>)<\/span>
\n if<\/span> (<\/span>need[<\/span>d]<\/span> ><\/span> cnt[<\/span>d]<\/span>)<\/span> {<\/span> ok =<\/span> false<\/span>;<\/span> break<\/span>;<\/span> }<\/span>
\n if<\/span> (<\/span>!<\/span>ok)<\/span> break<\/span>;<\/span> \/\/ \u8fd9\u4e2a\u6570\u62fc\u4e0d\u51fa\u6765，\u505c\u6b62<\/span>
\n for<\/span> (<\/span>int<\/span> d =<\/span> 0<\/span>;<\/span> d <<\/span> 10<\/span>;<\/span> d++<\/span>)<\/span> cnt[<\/span>d]<\/span> -=<\/span> need[<\/span>d]<\/span>;<\/span>
\n ans =<\/span> x;<\/span>
\n }<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> ans)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n

1099 \u6574\u6570\u4f4d\u5e8f<\/h3>\n

\u9898\u9762<\/b><\/p>\n

1099 \u6574\u6570\u4f4d\u5e8f<\/h3>\n

\u65f6\u95f4\u9650\u5236 1.000 sec ／ \u5185\u5b58\u9650\u5236 64 MiB<\/p>\n

\u9898\u76ee\u63cf\u8ff0<\/h4>\n

\u4e0b\u9762\u7684\u56fe\u5f62\u662f\u8457\u540d\u7684\u6768\u8f89\u4e09\u89d2\u5f62\u3002
\n\u5982\u679c\u6309\u4ece\u4e0a\u5230\u4e0b\u3001\u4ece\u5de6\u5230\u53f3\u7684\u987a\u5e8f\u628a\u6240\u6709\u6570\u6392\u6210\u4e00\u5217，\u53ef\u4ee5\u5f97\u5230\u5982\u4e0b\u6570\u5217：
\n1，1，1，1，2，1，1，3，3，1，1，4，6，4，1，\u2026
\n\u7ed9\u5b9a\u4e00\u4e2a\u6b63\u6574\u6570N，\u8bf7\u4f60\u8f93\u51fa\u6570\u5217\u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0N\u662f\u5728\u7b2c\u51e0\u4e2a\u6570？
\n\u603b\u65f6\u95f4\u9650\u5236: 1000 ms \u5185\u5b58\u9650\u5236: 65536 kB\u3002<\/p>\n

\u8f93\u5165<\/h4>\n

\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570N（N <= 5000）\u3002<\/p>\n

\u8f93\u51fa<\/h4>\n

\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\u4ee3\u8868\u7b54\u6848\u3002<\/p>\n

\u6765\u6e90\/\u5206\u7c7b<\/h4>\n

\u6837\u4f8b\u8f93\u5165<\/h4>\n

6<\/p>\n

\u6837\u4f8b\u8f93\u51fa<\/h4>\n

13<\/p>\n

\u601d\u8def：\u6574\u6570\u4f4d\u5e8f：\u4ece\u6700\u9ad8\u4f4d\u5230\u6700\u4f4e\u4f4d\u9010\u4f4d\u8f93\u51fa\u5404\u4f4d\u6570\u5b57\u3002<\/p>\n

\u590d\u6742\u5ea6：O(\u4f4d\u6570)<\/p>\n

\u53c2\u8003\u4ee3\u7801：<\/p>\n

\/\/ 1099 \u6574\u6570\u4f4d\u5e8f<\/span>
\n\/\/ \u6768\u8f89\u4e09\u89d2\u6309\u4ece\u4e0a\u5230\u4e0b\u3001\u4ece\u5de6\u5230\u53f3\u62c9\u76f4\u6210\u6570\u5217：<\/span>
\n\/\/ 1 | 1 1 | 1 2 1 | 1 3 3 1 | 1 4 6 4 1 | …<\/span>
\n\/\/ \u7b2c i \u884c（\u4ece 0 \u8ba1）\u6709 i+1 \u4e2a\u6570，\u884c\u5185\u7b2c j \u4e2a（\u4ece 0 \u8ba1）\u7684\u503c\u4e3a C(i,j)，<\/span>
\n\/\/ \u800c\u8be5\u884c\u7b2c 1 \u4e2a\u6570\u5728\u6570\u5217\u4e2d\u7684\u5e8f\u53f7\u4e3a i*(i+1)\/2 + 1，\u6240\u4ee5<\/span>
\n\/\/ pos(i,j) = i*(i+1)\/2 + j + 1<\/span>
\n\/\/ \u6821\u9a8c：C(4,2)=6 -> 10+2+1=13（\u4e0e\u6837\u4f8b\u4e00\u81f4）；C(2,1)=2 -> 3+1+1=5；<\/span>
\n\/\/ C(8,4)=70 -> 36+4+1=41；C(5,2)=10 -> 15+2+1=18\u3002<\/span>
\n\/\/ \u5229\u7528\u5bf9\u79f0\u6027 C(i,j)=C(i,i-j)，\u53ea\u9700\u8003\u8651 j <= i\/2 \u7684\u5217\u3002<\/span>
\n\/\/ \u56fa\u5b9a j \u65f6 C(i,j) \u5173\u4e8e i \u5355\u8c03\u9012\u589e，\u9010\u5217\u627e\u7b2c\u4e00\u6b21\u7b49\u4e8e N \u7684\u4f4d\u7f6e\u5373\u53ef，<\/span>
\n\/\/ j \u4ece 1 \u5f00\u59cb\u679a\u4e3e，\u76f4\u5230\u8be5\u5217\u6700\u5c0f\u503c C(2j,j) \u5df2\u7ecf\u5927\u4e8e N \u4e3a\u6b62<\/span>
\n\/\/ （N<=5000 \u65f6\u53ea\u9700\u67e5\u5230 j=6，\u56e0\u4e3a C(12,6)=924\u3001C(14,7)=3432\u3001C(16,8)=12870>5000）\u3002<\/span>
\n#<\/span>include<\/span> <bits\/stdc++.h><\/span><\/span>
\nusing<\/span> namespace<\/span> std;<\/span><\/p>\n

typedef<\/span> long<\/span> long<\/span> ll;<\/span><\/p>\n

ll solve<\/span>(<\/span>ll N)<\/span> {<\/span>
\n if<\/span> (<\/span>N ==<\/span> 1<\/span>)<\/span> return<\/span> 1<\/span>;<\/span> \/\/ \u7b2c 0 \u884c\u7b2c 0 \u4e2a，\u6570\u5217\u4e2d\u7684\u7b2c 1 \u4e2a\u6570<\/span><\/p>\n

\/\/ N \u5fc5\u7136\u51fa\u73b0\u5728\u7b2c N \u884c（C(N,1)=C(N,N-1)=N，\u4f4d\u4e8e\u884c\u5185\u4e0b\u6807 1 \u5904），\u4f5c\u4e3a\u521d\u59cb\u4e0a\u754c<\/span>
\n ll best =<\/span> N *<\/span> (<\/span>N +<\/span> 1<\/span>)<\/span> \/<\/span> 2<\/span> +<\/span> 2<\/span>;<\/span><\/p>\n

for<\/span> (<\/span>ll j =<\/span> 1<\/span>;<\/span> j <=<\/span> 12<\/span>;<\/span> j++<\/span>)<\/span> {<\/span>
\n ll c =<\/span> 1<\/span>;<\/span> \/\/ C(j,j) = 1，\u4ece i = j \u5f00\u59cb\u679a\u4e3e<\/span>
\n for<\/span> (<\/span>ll i =<\/span> j;<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>c ==<\/span> N)<\/span> {<\/span>
\n ll pos =<\/span> i *<\/span> (<\/span>i +<\/span> 1<\/span>)<\/span> \/<\/span> 2<\/span> +<\/span> j +<\/span> 1<\/span>;<\/span> \/\/ C(i,j) \u5728\u6570\u5217\u4e2d\u7684\u5e8f\u53f7<\/span>
\n if<\/span> (<\/span>pos <<\/span> best)<\/span> best =<\/span> pos;<\/span>
\n break<\/span>;<\/span> \/\/ \u8be5\u5217\u5355\u8c03\u9012\u589e，\u7b2c\u4e00\u4e2a\u76f8\u7b49\u7684\u4f4d\u7f6e\u5c31\u662f\u672c\u5217\u6700\u4f18<\/span>
\n }<\/span>
\n if<\/span> (<\/span>c ><\/span> N)<\/span> break<\/span>;<\/span> \/\/ \u540e\u9762\u53ea\u4f1a\u66f4\u5927，\u672c\u5217\u65e0\u89e3<\/span>
\n \/\/ \u9012\u63a8 C(i+1,j) = C(i,j) * (i+1) \/ (i+1-j)<\/span>
\n ll num =<\/span> c *<\/span> (<\/span>i +<\/span> 1<\/span>)<\/span>,<\/span> den =<\/span> i +<\/span> 1<\/span> –<\/span> j;<\/span>
\n if<\/span> (<\/span>num %<\/span> den !=<\/span> 0<\/span>)<\/span> break<\/span>;<\/span> \/\/ \u7406\u8bba\u4e0a\u4e0d\u4f1a\u53d1\u751f，\u4fdd\u9669\u5904\u7406<\/span>
\n ll nxt =<\/span> num \/<\/span> den;<\/span>
\n if<\/span> (<\/span>nxt ><\/span> N)<\/span> break<\/span>;<\/span> \/\/ \u5df2\u8d85\u8fc7 N，\u672c\u5217\u4e0d\u4f1a\u518d\u6709\u7b49\u4e8e N \u7684\u503c<\/span>
\n c =<\/span> nxt;<\/span>
\n }<\/span>
\n \/\/ \u7b2c j \u5217\u7684\u6700\u5c0f\u503c\u662f C(2j,j)（\u8be5\u5217\u5173\u4e8e i \u5bf9\u79f0，\u6b64\u5904\u53d6\u5230\u6700\u5c0f\u503c）；<\/span>
\n \/\/ \u82e5\u5b83\u5df2\u7ecf\u5927\u4e8e N，\u5219\u66f4\u5927\u7684 j \u7684\u5217\u6700\u5c0f\u503c\u66f4\u5927，\u53ef\u4ee5\u5b89\u5168\u505c\u6b62<\/span>
\n ll mid =<\/span> 1<\/span>;<\/span>
\n bool<\/span> tooBig =<\/span> false<\/span>;<\/span>
\n for<\/span> (<\/span>ll t =<\/span> 1<\/span>;<\/span> t <=<\/span> j;<\/span> t++<\/span>)<\/span> {<\/span>
\n mid =<\/span> mid *<\/span> (<\/span>j +<\/span> t)<\/span> \/<\/span> t;<\/span>
\n if<\/span> (<\/span>mid ><\/span> N)<\/span> {<\/span> tooBig =<\/span> true<\/span>;<\/span> break<\/span>;<\/span> }<\/span>
\n }<\/span>
\n if<\/span> (<\/span>tooBig)<\/span> break<\/span>;<\/span>
\n }<\/span>
\n return<\/span> best;<\/span>
\n}<\/span><\/p>\n

int<\/span> main<\/span>(<\/span>)<\/span> {<\/span>
\n ll N;<\/span>
\n if<\/span> (<\/span>scanf<\/span>(<\/span>"%lld"<\/span>,<\/span> &<\/span>N)<\/span> !=<\/span> 1<\/span>)<\/span> return<\/span> 0<\/span>;<\/span>
\n printf<\/span>(<\/span>"%lld\\\\n"<\/span>,<\/span> solve<\/span>(<\/span>N)<\/span>)<\/span>;<\/span>
\n return<\/span> 0<\/span>;<\/span>
\n}<\/span><\/p>\n

\n","protected":false},"excerpt":{"rendered":"

\u6cb3\u5357\u5de5\u7a0b\u5b66\u9662\u8f6f\u4ef6\u5b66\u9662 OJ \u9898\u89e3（\u7b2c 2 \u7bc7 \/ \u5171 4 \u7bc7）：\u9898\u53f7 1050\u20131099\u9898\u5e93：http:\/\/oj.software.haue.edu.cn\/ \u3000\u8bed\u8a00：C（g -stdc14 -O2）
\n\u8986\u76d6\u9898\u53f7：1050\u20131099（\u672c\u7bc7 50 \u9898）\u3000\u5185\u5bb9：\u7b2c4\u7ae0 \u5faa\u73af\u7ed3\u6784
\n\u5168\u5957\u5171 4 \u7bc7：1000\u20131049 &#<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11653,55,174,190],"topic":[],"class_list":["post-111649","post","type-post","status-publish","format-standard","hentry","category-server","tag-11653","tag-c","tag-190"],"yoast_head":"\nHAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099 - \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\/111649.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"\u6cb3\u5357\u5de5\u7a0b\u5b66\u9662\u8f6f\u4ef6\u5b66\u9662 OJ \u9898\u89e3（\u7b2c 2 \u7bc7 \/ \u5171 4 \u7bc7）：\u9898\u53f7 1050\u20131099\u9898\u5e93：http:\/\/oj.software.haue.edu.cn\/ \u3000\u8bed\u8a00：C（g -stdc14 -O2） \u8986\u76d6\u9898\u53f7：1050\u20131099（\u672c\u7bc7 50 \u9898）\u3000\u5185\u5bb9：\u7b2c4\u7ae0 \u5faa\u73af\u7ed3\u6784 \u5168\u5957\u5171 4 \u7bc7：1000\u20131049 &#\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/111649.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2026-10-01T05:24:57+00:00\" \/>\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=\"32 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/111649.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/111649.html\",\"name\":\"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2026-10-01T05:24:57+00:00\",\"dateModified\":\"2026-10-01T05:24:57+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/111649.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/111649.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/111649.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099\"}]},{\"@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":"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099 - \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\/111649.html","og_locale":"zh_CN","og_type":"article","og_title":"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"\u6cb3\u5357\u5de5\u7a0b\u5b66\u9662\u8f6f\u4ef6\u5b66\u9662 OJ \u9898\u89e3（\u7b2c 2 \u7bc7 \/ \u5171 4 \u7bc7）：\u9898\u53f7 1050\u20131099\u9898\u5e93：http:\/\/oj.software.haue.edu.cn\/ \u3000\u8bed\u8a00：C（g -stdc14 -O2） \u8986\u76d6\u9898\u53f7：1050\u20131099（\u672c\u7bc7 50 \u9898）\u3000\u5185\u5bb9：\u7b2c4\u7ae0 \u5faa\u73af\u7ed3\u6784 \u5168\u5957\u5171 4 \u7bc7：1000\u20131049 &#","og_url":"https:\/\/www.wsisp.com\/helps\/111649.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2026-10-01T05:24:57+00:00","author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"32 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/111649.html","url":"https:\/\/www.wsisp.com\/helps\/111649.html","name":"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2026-10-01T05:24:57+00:00","dateModified":"2026-10-01T05:24:57+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/111649.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/111649.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/111649.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"HAUE\u8f6f\u4ef6\u5b66\u9662OJ\u9898\u89e3\u6c47\u603b_\u7b2c2\u7bc7_1050-1099"}]},{"@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\/111649","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=111649"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/111649\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=111649"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=111649"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=111649"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=111649"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}