{"id":134,"date":"2026-04-07T16:16:02","date_gmt":"2026-04-07T08:16:02","guid":{"rendered":"https:\/\/geocommunity.vip\/?p=134"},"modified":"2026-04-08T10:44:32","modified_gmt":"2026-04-08T02:44:32","slug":"%e7%ac%ac%e5%8d%81%e4%ba%94%e5%b1%8a%e8%93%9d%e6%a1%a5%e6%9d%af%e5%a4%a7%e8%b5%9b%e8%bd%af%e4%bb%b6%e8%b5%9b%e7%9c%81%e8%b5%9bc-c-%e5%a4%a7%e5%ad%a6-b-%e7%bb%84","status":"publish","type":"post","link":"https:\/\/geocommunity.vip\/index.php\/2026\/04\/07\/%e7%ac%ac%e5%8d%81%e4%ba%94%e5%b1%8a%e8%93%9d%e6%a1%a5%e6%9d%af%e5%a4%a7%e8%b5%9b%e8%bd%af%e4%bb%b6%e8%b5%9b%e7%9c%81%e8%b5%9bc-c-%e5%a4%a7%e5%ad%a6-b-%e7%bb%84\/","title":{"rendered":"\u7b2c\u5341\u4e94\u5c4a\u84dd\u6865\u676f\u5927\u8d5b\u8f6f\u4ef6\u8d5b\u7701\u8d5bC\/C++ \u5927\u5b66 B \u7ec4"},"content":{"rendered":"\n

1\u3001\u63e1\u624b\u95ee\u9898<\/h3>\n\n\n\n

\uff081\uff09\u9898\u76ee\u63cf\u8ff0<\/p>\n\n\n\n

\u5c0f\u84dd\u7ec4\u7ec7\u4e86\u4e00\u573a\u7b97\u6cd5\u4ea4\u6d41\u4f1a\u8bae\uff0c\u603b\u5171\u6709 50 \u4eba\u53c2\u52a0\u4e86\u672c\u6b21\u4f1a\u8bae\u3002\u5728\u4f1a\u8bae\u4e0a\uff0c\u5927\u5bb6\u8fdb\u884c\u4e86\u63e1\u624b\u4ea4\u6d41\u3002\u6309\u7167\u60ef\u4f8b\u4ed6\u4eec\u6bcf\u4e2a\u4eba\u90fd\u8981\u4e0e\u9664\u81ea\u5df1\u4ee5\u5916\u7684\u5176\u4ed6\u6240\u6709\u4eba\u8fdb\u884c\u4e00\u6b21\u63e1\u624b (\u4e14\u4ec5\u6709\u4e00\u6b21)\u3002\u4f46\u6709 7 \u4e2a\u4eba\uff0c\u8fd9 7 \u4eba\u5f7c\u6b64\u4e4b\u95f4\u6ca1\u6709\u8fdb\u884c\u63e1\u624b (\u4f46\u8fd9 7 \u4eba\u4e0e\u9664\u8fd9 7 \u4eba\u4ee5\u5916\u7684\u6240\u6709\u4eba\u8fdb\u884c\u4e86\u63e1\u624b)\u3002\u8bf7\u95ee\u8fd9\u4e9b\u4eba\u4e4b\u95f4\u4e00\u5171\u8fdb\u884c\u4e86\u591a\u5c11\u6b21\u63e1\u624b?<\/p>\n\n\n\n

\u6ce8\u610f A<\/em> \u548c B<\/em> \u63e1\u624b\u7684\u540c\u65f6\u4e5f\u610f\u5473\u7740 B<\/em> \u548c A<\/em> \u63e1\u624b\u4e86\uff0c\u6240\u4ee5\u7b97\u4f5c\u662f\u4e00\u6b21\u63e1\u624b\u3002<\/p>\n\n\n\n

\uff082\uff09\u89e3\u9898\u601d\u8def\uff08\u6570\u5b66\u95ee\u9898\uff09<\/p>\n\n\n\n

\u6570\u5b66\u7ec4\u5408\u95ee\u9898<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n

\uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n

#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[])\n{\n  int total_counts = (50 * 49) \/ 2;\n  int no_counts = (7 * 6) \/ 2;\n  int ans = total_counts - no_counts;\n  printf(\"%d\", ans);\n  return 0;\n}<\/code><\/pre>\n\n\n\n
\uff084\uff09\u96be\u70b9\uff1a\u65e0<\/p>\n\n\n\n
2\u3001\u5c0f\u7403\u53cd\u5f39<\/h3>\n\n\n\n
\uff081\uff09\u9898\u76ee\u63cf\u8ff0<\/p>\n\n\n\n
\u6709\u4e00\u957f\u65b9\u5f62\uff0c\u957f\u4e3a 343720 \u5355\u4f4d\u957f\u5ea6\uff0c\u5bbd\u4e3a 233333 \u5355\u4f4d\u957f\u5ea6\u3002\u5728\u5176\u5185\u90e8\u5de6\u4e0a\u89d2\u9876\u70b9\u6709\u4e00\u5c0f\u7403 (\u65e0\u89c6\u5176\u4f53\u79ef)\uff0c\u5176\u521d\u901f\u5ea6\u5982\u56fe\u6240\u793a\u4e14\u4fdd\u6301\u8fd0\u52a8\u901f\u7387\u4e0d\u53d8\uff0c\u5206\u89e3\u5230\u957f\u5bbd\u4e24\u4e2a\u65b9\u5411\u4e0a\u7684\u901f\u7387\u4e4b\u6bd4\u4e3a d<\/em>x<\/em>:d<\/em>y<\/em>=15:17\u3002\u5c0f\u7403\u78b0\u5230\u957f\u65b9\u5f62\u7684\u8fb9\u6846\u65f6\u4f1a\u53d1\u751f\u53cd\u5f39\uff0c\u6bcf\u6b21\u53cd\u5f39\u7684\u5165\u5c04\u89d2\u4e0e\u53cd\u5c04\u89d2\u76f8\u7b49\uff0c\u56e0\u6b64\u5c0f\u7403\u4f1a\u6539\u53d8\u65b9\u5411\u4e14\u4fdd\u6301\u901f\u7387\u4e0d\u53d8\uff08\u5982\u679c\u5c0f\u7403\u521a\u597d\u5c04\u5411\u89d2\u843d\uff0c\u5219\u6309\u5165\u5c04\u65b9\u5411\u539f\u8def\u8fd4\u56de\uff09\u3002\u4ece\u5c0f\u7403\u51fa\u53d1\u5230\u5176\u7b2c\u4e00\u6b21\u56de\u5230\u5de6\u4e0a\u89d2\u9876\u70b9\u8fd9\u6bb5\u65f6\u95f4\u91cc\uff0c\u5c0f\u7403\u8fd0\u52a8\u7684\u8def\u7a0b\u4e3a\u591a\u5c11\u5355\u4f4d\u957f\u5ea6\uff1f\u7b54\u6848\u56db\u820d\u4e94\u5165\u4fdd\u7559\u4e24\u4f4d\u5c0f\u6570\u3002<\/p>\n\n\n\n
\"\"<\/figure>\n\n\n\n
\uff082\uff09\u89e3\u9898\u601d\u8def\uff08\u6570\u5b66\u95ee\u9898\uff09<\/p>\n\n\n\n
\"\"<\/figure>\n\n\n\n
\u4e3a\u4ec0\u4e48\u8981\u6c42\u6700\u5c0f\u7684n\u548cm\u5462\uff1f\u56e0\u4e3a\u9898\u76ee\u8981\u6c42\u4e86\u662f\u7b2c\u4e00\u6b21<\/strong>\u56de\u5230\u8d77\u70b9\u8d70\u8fc7\u7684\u8def\u7a0b\u3002<\/p>\n\n\n\n
\uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n
#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nlong long gcd(long long a, long long b) {\n    return b == 0 ? a : gcd(b, a % b);\n}<\/strong>\n\nint main(int argc, char *argv[])\n{\n  int x = gcd(3499995, 5843240);\n  long long n = 3499995 \/ x;\n  long long m = 5843240 \/ x;\n  double sx = 2.0 * n * 343720;\n  double sy = 2.0 * m * 233333;\n  double s = pow(sx * sx + sy * sy, 0.5);\n  \/\/ double s = sqrt(sx * sx + sy * sy);\n  printf(\"%.2f\", s);\n  return 0;\n}<\/code><\/pre>\n\n\n\n
\uff084\uff09\u96be\u70b9\uff1a\u6570\u5b66\u601d\u7ef4<\/p>\n\n\n\n
3\u3001\u597d\u6570<\/h3>\n\n\n\n
\uff081\uff09\u9898\u76ee\u63cf\u8ff0<\/p>\n\n\n\n
\u4e00\u4e2a\u6574\u6570\u5982\u679c\u6309\u4ece\u4f4e\u4f4d\u5230\u9ad8\u4f4d\u7684\u987a\u5e8f\uff0c\u5947\u6570\u4f4d (\u4e2a\u4f4d\u3001\u767e\u4f4d\u3001\u4e07\u4f4d \u22ef<\/mo><\/mrow><\/semantics><\/math>\u22ef ) \u4e0a\u7684\u6570\u5b57\u662f\u5947\u6570\uff0c\u5076\u6570\u4f4d (\u5341\u4f4d\u3001\u5343\u4f4d\u3001\u5341\u4e07\u4f4d \u22ef<\/mo><\/mrow><\/semantics><\/math>\u22ef ) \u4e0a\u7684\u6570\u5b57\u662f\u5076\u6570\uff0c\u6211\u4eec\u5c31\u79f0\u4e4b\u4e3a \u201c\u597d\u6570\u201d\u3002<\/p>\n\n\n\n
\u7ed9\u5b9a\u4e00\u4e2a\u6b63\u6574\u6570 N<\/em>\uff0c\u8bf7\u8ba1\u7b97\u4ece 1 \u5230 N<\/em> \u4e00\u5171\u6709\u591a\u5c11\u4e2a\u597d\u6570\u3002<\/p>\n\n\n\n
\uff082\uff09\u89e3\u9898\u601d\u8def\uff08\u6a21\u62df\uff09<\/p>\n\n\n\n
\u5148\u5199\u4e00\u4e2acheck\u51fd\u6570\u6765\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u4e0d\u662f\u597d\u6570\u3002<\/p>\n\n\n\n
\uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n
#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n\n\/\/ \u5224\u65ad\u4e00\u4e2a\u6570\u662f\u4e0d\u662f\u597d\u6570\nbool check(int n) {\n\n  int c_pos = 1;\n\n  while (n != 0) {\n\n    int c_num = n % 10;\n\n    if (c_pos % 2 == 1) {\n      if (c_num % 2 == 0) return false;\n    } else {\n      if (c_num % 2 == 1) return false;\n    }\n    \n    n = n \/ 10;\n    c_pos++;\n  }\n\n  return true;\n}\n\nint main(int argc, char *argv[])\n{\n  int N;\n  scanf(\"%d\", &N);\n\n  int ans = 0;\n  for (int n = 1; n <= N; n++) if (check(n)) ans++;\n\n  printf(\"%d\\0\", ans);\n  return 0;\n}<\/code><\/pre>\n\n\n\n
\uff084\uff09\u96be\u70b9\uff1acheck\u51fd\u6570\u4e66\u5199\u3002<\/p>\n\n\n\n
4\u3001R \u683c\u5f0f<\/h3>\n\n\n\n
\uff081\uff09\u9898\u76ee\u63cf\u8ff0<\/p>\n\n\n\n
\u5c0f\u84dd\u6700\u8fd1\u5728\u7814\u7a76\u4e00\u79cd\u6d6e\u70b9\u6570\u7684\u8868\u793a\u65b9\u6cd5\uff1aR \u683c\u5f0f\u3002\u5bf9\u4e8e\u4e00\u4e2a\u5927\u4e8e 0 \u7684\u6d6e\u70b9\u6570 d<\/em>\uff0c\u53ef\u4ee5\u7528 R \u683c\u5f0f\u7684\u6574\u6570\u6765\u8868\u793a\u3002\u7ed9\u5b9a\u4e00\u4e2a\u8f6c\u6362\u53c2\u6570 n<\/em>\uff0c\u5c06\u6d6e\u70b9\u6570\u8f6c\u6362\u4e3a R \u683c\u5f0f\u6574\u6570\u7684\u505a\u6cd5\u662f:<\/p>\n\n\n\n
    \n
  1. \u5c06\u6d6e\u70b9\u6570\u4e58\u4ee5 2n<\/em>\uff1b<\/li>\n\n\n\n
  2. \u56db\u820d\u4e94\u5165\u5230\u6700\u63a5\u8fd1\u7684\u6574\u6570\u3002<\/li>\n<\/ol>\n\n\n\n
    \uff082\uff09\u89e3\u9898\u601d\u8def\uff08\u6a21\u62df+\u6570\u7ec4\uff09<\/p>\n\n\n\n
    \u9ad8\u7cbe\u5ea6\u6a21\u677f\u95ee\u9898<\/p>\n\n\n\n
    \"\"<\/figure>\n\n\n\n
    \uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n
    #include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nint main(int argc, char *argv[])\n{\n  \/\/ 1 \u7528\u5b57\u7b26\u4e32\u6570\u7ec4\u5b58\u50a8\u8f93\u5165\u7684\u6d6e\u70b9\u6570\uff0c\u7136\u540e\u5012\u5e8f\u5b58\u5165b\u6570\u7ec4\uff0c\u7528k\u8bb0\u5f55\u5c0f\u6570\u4f4d\u7f6e\n  int n;\n  char m_s[1024];\n  scanf(\"%d %s\", &n, m_s);\n\n  int c = strlen(m_s);\n  int b[1500];\n  int k;\n  int c_s = 0;\n  for (int i = c - 1; i >= 0; i--) {\n    if (m_s[i] == '.') {\n      k = c_s;\n    } else {\n      b[c_s++] = m_s[i] - '0';\n    }\n  }\n  \/\/ 2 n\u6b21\u5faa\u73af\uff0c\u6bcf\u4e2a\u5faa\u73af*2\uff0c\u5bf9b\u6570\u7ec4\u4e0d\u65ad\u5904\u7406\n  while (n--) {\n    int t = 0; \/\/ t\u7528\u4e8e\u8bb0\u5f55\u6bcf\u4e00\u4f4d\u8fd0\u7b97\u4ea7\u751f\u7684\u8fdb\u4f4d\n    for (int i = 0; i < c_s; i++) {\n      int cur = b[i] * 2 + t;\n      b[i] = cur % 10;\n      t = cur \/ 10;\n    }\n    if (t > 0) {\n      b[c_s++] = t;\n    }\n  }\n\n  \/\/ 3 \u5bf9b\u6570\u7ec4\u8fdb\u884c\u56db\u820d\u4e94\u5165\n  if (b[k-1] >= 5) {\n    int carry = 1;\n    for (int i = k; i < c_s; i++) {\n      b[i] += carry;\n      if (b[i] <= 9) {\n        carry = 0;\n        break;\n      } else {\n        b[i] = 0;\n        carry = 1;\n      }\n    }\n    if (carry) {\n      b[c_s++] = carry;\n    }\n  }\n\n  \/\/ 4 \u6253\u5370\u8f93\u51fa\n  for (int i = c_s - 1; i >= k; i--) {\n    printf(\"%d\", b[i]);\n  }\n  printf(\"\\n\");\n  return 0;\n}<\/code><\/pre>\n\n\n\n
    \uff084\uff09\u96be\u70b9\uff1a\u601d\u7ef4+\u6570\u7ec4\u8fd0\u7b97\u3002<\/p>\n\n\n\n
    5\u3001\u5b9d\u77f3\u7ec4\u5408<\/h3>\n\n\n\n
    \uff081\uff09\u95ee\u9898\u63cf\u8ff0<\/p>\n\n\n\n
    \u5728\u4e00\u4e2a\u795e\u79d8\u7684\u68ee\u6797\u91cc\uff0c\u4f4f\u7740\u4e00\u4e2a\u5c0f\u7cbe\u7075\u540d\u53eb\u5c0f\u84dd\u3002\u6709\u4e00\u5929\uff0c\u4ed6\u5076\u7136\u53d1\u73b0\u4e86\u4e00\u4e2a\u9690\u85cf\u5728\u6811\u6d1e\u91cc\u7684\u5b9d\u85cf\uff0c\u91cc\u9762\u88c5\u6ee1\u4e86\u95ea\u70c1\u7740\u7f8e\u4e3d\u5149\u8292\u7684\u5b9d\u77f3\u3002\u8fd9\u4e9b\u5b9d\u77f3\u90fd\u6709\u7740\u4e0d\u540c\u7684\u989c\u8272\u548c\u5f62\u72b6\uff0c\u4f46\u6700\u5f15\u4eba\u6ce8\u76ee\u7684\u662f\u5b83\u4eec\u5404\u81ea\u72ec\u7279\u7684 \u201c\u95ea\u4eae\u5ea6\u201d \u5c5e\u6027\u3002\u6bcf\u9897\u5b9d\u77f3\u90fd\u6709\u4e00\u4e2a\u4e0e\u751f\u4ff1\u6765\u7684\u7279\u6b8a\u80fd\u529b\uff0c\u53ef\u4ee5\u53d1\u51fa\u4e0d\u540c\u5f3a\u5ea6\u7684\u95ea\u5149\u3002\u5c0f\u84dd\u5171\u627e\u5230\u4e86 N<\/em> \u679a\u5b9d\u77f3\uff0c\u7b2c i<\/em> \u679a\u5b9d\u77f3\u7684 \u201c\u95ea\u4eae\u5ea6\u201d \u5c5e\u6027\u503c\u4e3a H<\/em>i<\/em>\u200b\uff0c\u5c0f\u84dd\u5c06\u4f1a\u4ece\u8fd9 N<\/em> \u679a\u5b9d\u77f3\u4e2d\u9009\u51fa\u4e09\u679a\u8fdb\u884c\u7ec4\u5408\uff0c\u7ec4\u5408\u4e4b\u540e\u7684\u7cbe\u7f8e\u7a0b\u5ea6 S<\/em> \u53ef\u4ee5\u7528\u4ee5\u4e0b\u516c\u5f0f\u6765\u8861\u91cf\uff1a<\/p>\n\n\n\n
    S<\/mi>=<\/mo>H<\/mi>a<\/mi><\/msub>H<\/mi>b<\/mi><\/msub>H<\/mi>c<\/mi><\/msub>\u22c5<\/mo>LCM<\/mi>\u2061<\/mo>(<\/mo>H<\/mi>a<\/mi><\/msub>,<\/mo>H<\/mi>b<\/mi><\/msub>,<\/mo>H<\/mi>c<\/mi><\/msub><\/mrow>)<\/mo><\/mrow><\/mrow>LCM<\/mi>\u2061<\/mo>(<\/mo>H<\/mi>a<\/mi><\/msub>,<\/mo>H<\/mi>b<\/mi><\/msub><\/mrow>)<\/mo><\/mrow>\u22c5<\/mo>LCM<\/mi>\u2061<\/mo>(<\/mo>H<\/mi>a<\/mi><\/msub>,<\/mo>H<\/mi>c<\/mi><\/msub><\/mrow>)<\/mo><\/mrow>\u22c5<\/mo>LCM<\/mi>\u2061<\/mo>(<\/mo>H<\/mi>b<\/mi><\/msub>,<\/mo>H<\/mi>c<\/mi><\/msub><\/mrow>)<\/mo><\/mrow><\/mrow><\/mfrac><\/mrow><\/math><\/p>\n\n\n\n
    \u5176\u4e2d L<\/em>C<\/em>M<\/em> \u8868\u793a\u7684\u662f\u6700\u5c0f\u516c\u500d\u6570\u51fd\u6570\u3002<\/p>\n\n\n\n
    \u5c0f\u84dd\u60f3\u8981\u4f7f\u5f97\u4e09\u679a\u5b9d\u77f3\u7ec4\u5408\u540e\u7684\u7cbe\u7f8e\u7a0b\u5ea6 S<\/em> \u5c3d\u53ef\u80fd\u7684\u9ad8\uff0c\u8bf7\u4f60\u5e2e\u4ed6\u627e\u51fa\u7cbe\u7f8e\u7a0b\u5ea6\u6700\u9ad8\u7684\u65b9\u6848\u3002\u5982\u679c\u5b58\u5728\u591a\u4e2a\u65b9\u6848 S<\/em> \u503c\u76f8\u540c\uff0c\u4f18\u5148\u9009\u62e9\u6309\u7167 H<\/em> \u503c\u5347\u5e8f\u6392\u5217\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u65b9\u6848\u3002<\/p>\n\n\n\n
    \uff082\uff09\u89e3\u9898\u601d\u8def\uff08\u6570\u5b66\uff09<\/p>\n\n\n\n
    \"\"<\/figure>\n\n\n\n
    \uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n
    #include <stdio.h>\n\n#define MAXH 100005 \/\/ \u5b9a\u4e49\u4eae\u5ea6\u7684\u6700\u5927\u8303\u56f4\n\nint cnt[MAXH]; \/\/ \u8bb0\u5f55\u6bcf\u4e2a\u4eae\u5ea6\u503c\u51fa\u73b0\u7684\u6b21\u6570\nint res[3];\n\nint main() {\n    \/\/ 1 \u8f93\u5165\n    int n;\n    scanf(\"%d\", &n);\n\n    int max_h = 0;\n    for (int i = 0; i < n; i++) {\n        int h;\n        scanf(\"%d\", &h);\n        cnt[h]++; \/\/ \u653e\u5165\u6876\u4e2d\n        if (h > max_h) max_h = h;\n    }\n\n    \/\/ 2 \u679a\u4e3e\u6700\u5927\u516c\u7ea6\u6570\n    for (int g = max_h; g >= 1; g--) {\n        int f_c = 0;\n        \/\/ \u4ece\u5c0f\u5230\u5927\uff08\u4fdd\u8bc1\u4e86\u201c\u4f18\u5148\u9009\u62e9\u6309\u7167 H \u503c\u5347\u5e8f\u6392\u5217\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u65b9\u6848\u201d\uff09\n        for (int n = g; n <= max_h; n += g) {\n            for (int k = 0; k < cnt[n] && f_c < 3; k++) {\n                res[f_c++] = n;\n            }\n            if (f_c == 3) break;\n        }\n\n        if (f_c == 3) {\n            printf(\"%d %d %d\\n\", res[0], res[1], res[2]);\n            return 0;\n        }\n    }\n\n    return 0;\n}<\/code><\/pre>\n\n\n\n
    \uff084\uff09\u96be\u70b9\uff1a\u6570\u5b66\u3002<\/p>\n\n\n\n
    6\u3001\u6570\u5b57\u63a5\u9f99<\/h3>\n\n\n\n
    \uff081\uff09\u9898\u76ee\u63cf\u8ff0<\/p>\n\n\n\n
    \u5c0f\u84dd\u6700\u8fd1\u8ff7\u4e0a\u4e86\u4e00\u6b3e\u540d\u4e3a\u300a\u6570\u5b57\u63a5\u9f99\u300b\u7684\u8ff7\u5bab\u6e38\u620f\uff0c\u6e38\u620f\u5728\u4e00\u4e2a\u5927\u5c0f\u4e3a N<\/em>\u00d7N<\/em> \u7684\u683c\u5b50\u68cb\u76d8\u4e0a\u5c55\u5f00\uff0c\u5176\u4e2d\u6bcf\u4e00\u4e2a\u683c\u5b50\u5904\u90fd\u6709\u7740\u4e00\u4e2a 0\u2026K<\/em>\u22121 \u4e4b\u95f4\u7684\u6574\u6570\u3002\u6e38\u620f\u89c4\u5219\u5982\u4e0b\uff1a<\/p>\n\n\n\n
      \n
    1. \u4ece\u5de6\u4e0a\u89d2 (0,0) \u5904\u51fa\u53d1\uff0c\u76ee\u6807\u662f\u5230\u8fbe\u53f3\u4e0b\u89d2 (N<\/em>\u22121,N<\/em>\u22121) \u5904\u7684\u683c\u5b50\uff0c\u6bcf\u4e00\u6b65\u53ef\u4ee5\u9009\u62e9\u6cbf\u7740\u6c34\u5e73\/\u5782\u76f4\/\u5bf9\u89d2\u7ebf\u65b9\u5411\u79fb\u52a8\u5230\u4e0b\u4e00\u4e2a\u683c\u5b50\u3002<\/li>\n\n\n\n
    2. \u5bf9\u4e8e\u8def\u5f84\u7ecf\u8fc7\u7684\u68cb\u76d8\u683c\u5b50\uff0c\u6309\u7167\u7ecf\u8fc7\u7684\u683c\u5b50\u987a\u5e8f\uff0c\u4e0a\u9762\u7684\u6570\u5b57\u7ec4\u6210\u7684\u5e8f\u5217\u8981\u6ee1\u8db3\uff1a0,1,2,\u2026,K<\/em>\u22121,0,1,2,\u2026,K<\/em>\u22121,0,1,2\u2026 \u3002<\/li>\n\n\n\n
    3. \u9014\u4e2d\u9700\u8981\u5bf9\u68cb\u76d8\u4e0a\u7684\u6bcf\u4e2a\u683c\u5b50\u6070\u597d\u90fd\u7ecf\u8fc7\u4e00\u6b21\uff08\u4ec5\u4e00\u6b21\uff09\u3002<\/li>\n\n\n\n
    4. \u8def\u5f84\u4e2d\u4e0d\u53ef\u4ee5\u51fa\u73b0\u4ea4\u53c9\u7684\u7ebf\u8def\u3002\u4f8b\u5982\u4e4b\u524d\u6709\u4ece (0,0) \u79fb\u52a8\u5230 (1,1) \uff0c\u90a3\u4e48\u518d\u4ece (1,0) \u79fb\u52a8\u5230 (0,1) \u7ebf\u8def\u5c31\u4f1a\u4ea4\u53c9\u3002<\/li>\n<\/ol>\n\n\n\n
      \u4e3a\u4e86\u65b9\u4fbf\u8868\u793a\uff0c\u6211\u4eec\u5bf9\u53ef\u4ee5\u884c\u8fdb\u7684\u6240\u6709\u516b\u4e2a\u65b9\u5411\u8fdb\u884c\u4e86\u6570\u5b57\u7f16\u53f7\uff0c\u5982\u4e0b\u56fe 2 \u6240\u793a\uff1b\u56e0\u6b64\u884c\u8fdb\u8def\u5f84\u53ef\u4ee5\u7528\u4e00\u4e2a\u5305\u542b 0\u20267 \u4e4b\u95f4\u7684\u6570\u5b57\u5b57\u7b26\u4e32\u8868\u793a\uff0c\u5982\u4e0b\u56fe 1 \u662f\u4e00\u4e2a\u8ff7\u5bab\u793a\u4f8b\uff0c\u5b83\u6240\u5bf9\u5e94\u7684\u7b54\u6848\u5c31\u662f\uff1a41255214\u3002<\/p>\n\n\n\n
      \"\u56fe\u7247\u63cf\u8ff0\"\/<\/figure>\n\n\n\n
      \u73b0\u5728\u8bf7\u4f60\u5e2e\u5c0f\u84dd\u89c4\u5212\u51fa\u4e00\u6761\u884c\u8fdb\u8def\u5f84\u5e76\u5c06\u5176\u8f93\u51fa\u3002\u5982\u679c\u6709\u591a\u6761\u8def\u5f84\uff0c\u8f93\u51fa\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u90a3\u4e00\u4e2a\uff1b\u5982\u679c\u4e0d\u5b58\u5728\u4efb\u4f55\u4e00\u6761\u8def\u5f84\uff0c\u5219\u8f93\u51fa \u22121\u3002<\/p>\n\n\n\n
      \uff082\uff09\u89e3\u9898\u601d\u8def\uff08DFS\uff09<\/p>\n\n\n\n
      \u6761\u4ef61\u548c\u6761\u4ef63\u5171\u540c\u6784\u6210\u9012\u5f52\u51fa\u53e3\uff0c\u6761\u4ef62\u30014\u4e3a\u5224\u65ad\u6761\u4ef6\u3002\u5b57\u5178\u5e8f\u6700\u5c0f\uff1a\u4ece\u5c0f\u5230\u5927\u679a\u4e3e\u65b9\u5411\u3002<\/p>\n\n\n\n
      \u53e6\u5916\u7531\u4e8e\u662f\u4e00\u4e2apath\u6570\u7ec4\u5b58\u50a8\u7b54\u6848 \u6240\u4ee5\u627e\u5230\u7b2c\u4e00\u6761\u7b54\u6848\u540e \u7acb\u5373return\u6240\u6709dfs \u5426\u5219\u5c31\u4f1a\u8f93\u51fa\u6240\u6709\u7ed3\u679c<\/p>\n\n\n\n
      \uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n
      #include <stdio.h>\n#include <stdlib.h>\n\n#define MAX_N 10\n\nint N, K;\n\/\/ \u5168\u5c40\u53d8\u91cf\u5b9a\u4e49\u6570\u7ec4\u9ed8\u8ba4\u521d\u59cb\u5316\u4e3a0<\/strong>\nint flag = 0; \/\/ \u5224\u65ad\u662f\u5426\u627e\u5230\u7b54\u6848\nint grid[MAX_N][MAX_N]; \/\/ \u5b58\u50a8\u68cb\u76d8\nint visited[MAX_N][MAX_N]; \/\/ \u6807\u8bb0\u6570\u7ec4\n\nint path[MAX_N * MAX_N]; \/\/ \u7b54\u6848\u6570\u7ec4\n\nint line[MAX_N][MAX_N][MAX_N][MAX_N]; \/\/ \u8fde\u7ebf\u5224\u65ad\u6570\u7ec4\n\n\nint dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; \/\/ \u53cd\u5411\u6570\u7ec4 0:\u4e0a....\nint dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nint is_cross(int x, int y, int dir) {\n  if (dir == 1) return line[x-1][y][x][y+1];\n  if (dir == 3) return line[x+1][y][x][y+1];\n  if (dir == 5) return line[x+1][y][x][y-1];\n  if (dir == 7) return line[x-1][y][x][y-1];\n  return 0; \/\/ \u5782\u76f4\u548c\u6c34\u5e73\u7684\u60c5\u51b5\n}<\/strong>\n\nvoid dfs(int x, int y, int step) {\n\n  \/\/ \u9012\u5f52\u51fa\u53e3\n  if (step == N*N-1 && x == N-1 && y == N-1) {\n    flag = 1;\n    for (int i = 0; i < step; i++) printf(\"%d\", path[i]);\n    printf(\"\\n\");\n    return;\n  }\n\n  \/\/ \u904d\u5386\u65b9\u5411(\u4ece\u5c0f\u5230\u5927\u904d\u5386\uff0c\u6ee1\u8db3\u9898\u76ee\u5b57\u5178\u5e8f\u6700\u5c0f)\n  for (int i = 0; i < 8; i++) {\n    int nx = x + dx[i];\n    int ny = y + dy[i];\n\n    if (nx >= 0 && nx < N && ny >= 0 && ny < N && !visited[nx][ny] && grid[nx][ny] == (step + 1) % K \n    && !is_cross(x, y, i)) {\n      visited[nx][ny] = 1;\n      path[step] = i;\n      line[x][y][nx][ny] = 1; \n      line[nx][ny][x][y] = 1;\n\n      dfs(nx, ny, step + 1);\n      if (flag == 1) break; \/\/ \u5df2\u7ecf\u627e\u5230\u7b54\u6848\u4e86 \u5239\u8f66\uff01<\/strong>\n\n      \/\/ \u56de\u6eaf\n      visited[nx][ny] = 0;\n      path[step] = 0;\n      line[x][y][nx][ny] = 0;\n      line[nx][ny][x][y] = 0;\n    }\n  }\n}\n\nint main(int argc, char *argv[])\n{\n  \/\/ 1 \u8f93\u5165\n  scanf(\"%d %d\", &N, &K);\n\n  for (int i = 0; i < N; i++) {\n    for (int j = 0; j < N; j++) {\n      scanf(\"%d\", &grid[i][j]);\n    }\n  }\n\n  \/\/ 2 \u521d\u59cb\u5316\n  visited[0][0] = 1;\n  \/\/ 3 dfs\n  dfs(0, 0, 0);\n\n  if (flag == 0) {\n    printf(\"-1\\n\");\n  }\n  return 0;\n}<\/code><\/pre>\n\n\n\n
      \uff084\uff09\u96be\u70b9\uff1aDFS<\/p>\n\n\n\n
      7\u3001\u62d4\u6cb3<\/h3>\n\n\n\n
      \uff081\uff09\u9898\u76ee\u63cf\u8ff0<\/p>\n\n\n\n
      \u5c0f\u660e\u662f\u5b66\u6821\u91cc\u7684\u4e00\u540d\u8001\u5e08\uff0c\u4ed6\u5e26\u7684\u73ed\u7ea7\u5171\u6709 n<\/em> \u540d\u540c\u5b66\uff0c\u7b2c i<\/em> \u540d\u540c\u5b66\u529b\u91cf\u503c\u4e3a a<\/em>i<\/em>\u200b\u3002\u5728\u95f2\u6687\u4e4b\u4f59\uff0c\u5c0f\u660e\u51b3\u5b9a\u5728\u73ed\u7ea7\u91cc\u7ec4\u7ec7\u4e00\u573a\u62d4\u6cb3\u6bd4\u8d5b\u3002<\/p>\n\n\n\n
      \u4e3a\u4e86\u4fdd\u8bc1\u6bd4\u8d5b\u7684\u53cc\u65b9\u5b9e\u529b\u5c3d\u53ef\u80fd\u76f8\u8fd1\uff0c\u9700\u8981\u5728\u8fd9 n<\/mi><\/mrow><\/semantics><\/math>n<\/em> \u540d\u540c\u5b66\u4e2d\u6311\u9009\u51fa\u4e24\u4e2a\u961f\u4f0d\uff0c\u961f\u4f0d\u5185\u7684\u540c\u5b66\u7f16\u53f7\u8fde\u7eed\uff1a{a<\/em>l<\/em>1\u200b\u200b,a<\/em>l<\/em>1\u200b+1\u200b,\u2026,a<\/em>r<\/em>1\u200b\u22121\u200b,a<\/em>r<\/em>1\u200b\u200b} \u548c {a<\/em>l<\/em>2\u200b\u200b,a<\/em>l<\/em>2\u200b+1\u200b,\u2026,a<\/em>r<\/em>2\u200b\u22121\u200b,a<\/em>r<\/em>2\u200b\u200b}\uff0c\u5176\u4e2d l<\/em>1\u200b\u2264r<\/em>1\u200b<l<\/em>2\u200b\u2264r<\/em>2\u200b\u3002<\/p>\n\n\n\n
      \u4e24\u4e2a\u961f\u4f0d\u7684\u4eba\u6570\u4e0d\u5fc5\u76f8\u540c\uff0c\u4f46\u662f\u9700\u8981\u8ba9\u961f\u4f0d\u5185\u7684\u540c\u5b66\u4eec\u7684\u529b\u91cf\u503c\u4e4b\u548c\u5c3d\u53ef\u80fd\u76f8\u8fd1\u3002\u8bf7\u8ba1\u7b97\u51fa\u529b\u91cf\u503c\u4e4b\u548c\u5dee\u8ddd\u6700\u5c0f\u7684\u6311\u9009\u961f\u4f0d\u7684\u65b9\u5f0f\u3002<\/p>\n\n\n\n
      \uff082\uff09\u89e3\u9898\u601d\u8def\uff08\u524d\u7f00\u548c+\u53cc\u6307\u9488\uff0b\u8d2a\u5fc3 -> \u66b4\u529b\u6240\u6709\u60c5\u51b5\uff09<\/p>\n\n\n\n
      \u6700\u597d\u7406\u89e3\u7684\u4e00\u4e2a\u601d\u8def\u26f7\ufe0f\uff0c\u4e14\u4fdd\u8bc1\u6b63\u786e\uff1a<\/p>\n\n\n\n
      1\u3001\u5148\u8bf4\u601d\u8def\uff1a \u53cc\u5c42\u5faa\u73af\u4e0d\u65ad\u679a\u4e3el\uff0cr \u5176\u4e2dl\u662f\u5de6\u8fb9\u961f\u5217\u7684\u8d77\u70b9 r\u662f\u53f3\u8fb9\u961f\u5217\u7684\u7ec8\u70b9 \u5176\u4e2dr\u4ece\u4e3a\u5012\u5e8f\u679a\u4e3e \u5373\u521d\u59cb\u5316l\u4e3a0 r\u4e3an-1 \u7136\u540e\u6bcf\u4e00\u6b21\u53cc\u5c42\u5faa\u73af\u786e\u5b9al,r\u540e \u518d\u8fdb\u884cwhile\u53cc\u6307\u9488 \u5373\u4e0d\u65ad\u66f4\u65b0\u53cc\u6307\u9488\u5de6\u961f\u5217\u7684\u53f3\u8d77\u70b9i \u548c \u53f3\u961f\u5217\u7684\u5de6\u8d77\u70b9j \u5982\u679c\u5de6\u8fb9\u961f\u5217\u7684\u548c\u7b49\u4e8e\u53f3\u8fb9\u961f\u5217\u7684\u548c \u90a3\u4e48\u76f4\u63a5\u8f93\u51fa\u7b54\u68480 \u5982\u679c\u5de6\u8fb9\u961f\u5217\u7684\u548c\u5c0f\u4e8e\u53f3\u8fb9\u961f\u5217\u7684\u548c \u90a3\u4e48i++ \u76f8\u53cd j– \u76f4\u5230i==j \u7136\u540e\u8fdb\u884c\u4e0b\u4e00\u6b21\u53cc\u5c42\u5faa\u73af \u76f4\u5230l==r<\/p>\n\n\n\n
      2\u3001\u4e3a\u4ec0\u4e48\u8bf4\u4ed6\u4e00\u5b9a\u6b63\u786e\u5462\uff1f \u7b2c\u4e00\uff1a\u4fdd\u8bc1\u4e86\u5de6\u8fb9\u961f\u5217\u548c\u53f3\u8fb9\u961f\u5217\u7684\u8fde\u7eed\u6027 \u56e0\u4e3ai\u548cj\u5206\u522b\u90fd\u662f\u57fa\u4e8el\u548cr\u8fdb\u884c++\u6216\u8005–\u7684\uff0c\u4e00\u5b9a\u8fde\u7eed\u3002 \u7b2c\u4e8c\uff1a\u4fdd\u8bc1\u5de6\u8fb9\u961f\u5217\u5728\u53f3\u8fb9\u961f\u5217\u53f3\u8fb9 \u56e0\u4e3a\u5728\u53cc\u6307\u9488\u65f6 \u8fdb\u884c\u4e86i < j\u9650\u5236\u3002 \u7b2c\u4e09\uff1a\u4fdd\u8bc1\u4e86\u201c\u5de6\u8fb9\u961f\u5217\u548c\u53f3\u8fb9\u961f\u5217\u6709\u95f4\u9694\u7684\u60c5\u51b5\u201d \u56e0\u4e3a\u5982\u679c\u6ca1\u6709\u526a\u679d i\u548cj\u6700\u7ec8\u624d\u4f1a\u76f8\u9047 \u7b2c\u56db\uff1a\u4fdd\u8bc1\u4e86”\u5de6\u8fb9\u961f\u5217\u4e0d\u4e00\u5b9a\u4ece\u6240\u6709\u540c\u5b66\u7684\u8d77\u70b9\u5f00\u59cb \u53f3\u8fb9\u961f\u5217\u4e5f\u4e0d\u4e00\u5b9a\u4ece\u6240\u6709\u540c\u5b66\u7684\u7ec8\u70b9\u7ed3\u675f”\u7684\u60c5\u51b5\u3002\u56e0\u4e3al\u548cr\u662f\u4e0d\u65ad\u679a\u4e3e\u7684\uff0c\u904d\u5386\u4e86\u6240\u6709\u53ef\u80fd\u7684\u5de6\u961f\u5217\u8d77\u70b9\u548c\u53f3\u961f\u5217\u7ec8\u70b9\u7684\u60c5\u51b5\u3002<\/p>\n\n\n\n
      \u7b2c\u4e09\u6761\u548c\u7b2c\u56db\u6761\u5408\u5728\u4e00\u8d77\u5373\u679a\u4e3e\u4e86\u4e24\u79cd\u961f\u5217\u6240\u6709\u53ef\u80fd\u7684\u60c5\u51b5\u3002<\/strong> \u6240\u4ee5 \u552f\u4e00\u5c31\u662f\u590d\u6742\u5ea6\u95ee\u9898 \u4e24\u5c42for\u5faa\u73af\u662fO(n2) \u7136\u540e\u53cc\u6307\u9488\u662fO(n) \u5927\u6982\u662fO(n<\/strong>3) \u6ee1\u8db3\u9898\u76ee\u7684\u6570\u636e\u8303\u56f4<\/p>\n\n\n\n
      \uff083\uff09\u4ee3\u7801<\/p>\n\n\n\n
      #include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n\n    long long a[n + 1];\n    long long S[n + 1]; \n    S[0] = 0;\n\n    for (int k = 1; k <= n; k++) {\n        scanf(\"%lld\", &a[k]);\n        S[k] = S[k - 1] + a[k];\n    }\n\n    long long min_diff = -1; \n\n    \/\/ \u679a\u4e3e\u5de6\u533a\u95f4\u7684\u8d77\u70b9<\/strong>\n    for (int l = 1; l < n; l++) {\n      \/\/ \u679a\u4e3e\u53f3\u533a\u95f4\u7684\u7ec8\u70b9<\/strong>\n        for (int r = n; r >= l + 1; r--) {\n            \n            \/\/ \u8bbe\u7f6e\u5de6\u533a\u95f4\u7684\u7ec8\u70b9\u548c\u53f3\u533a\u95f4\u7684\u8d77\u70b9<\/strong>\n            int i = l;     \n            int j = r;     \n            \n            \/\/ \u5f00\u59cb\u8fdb\u884c\u53cc\u6307\u9488<\/strong>\n            while (i < j) {\n                long long sum_left = S[i] - S[l - 1];  \n                long long sum_right = S[r] - S[j - 1]; \n                \n                long long cur_diff = llabs(sum_left - sum_right);\n                \n                if (min_diff == -1 || cur_diff < min_diff) {\n                    min_diff = cur_diff;\n                }\n                \n                if (min_diff == 0) {\n                    printf(\"0\\n\");\n                    return 0;\n                }\n\n                if (sum_left < sum_right) {\n                    i++;\n                } else {\n                    j--;\n                }\n            }\n        }\n    }\n\n    printf(\"%lld\\n\", min_diff);\n    return 0;\n}<\/code><\/pre>\n\n\n\n
      \uff084\uff09\u96be\u70b9\uff1a\u65e0<\/p>\n\n\n\n
      \"\"<\/figure>\n","protected":false},"excerpt":{"rendered":"
      1\u3001\u63e1\u624b\u95ee\u9898 \uff081\uff09\u9898\u76ee\u63cf\u8ff0 \u5c0f\u84dd\u7ec4\u7ec7\u4e86\u4e00\u573a\u7b97\u6cd5\u4ea4 …<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7],"tags":[],"class_list":["post-134","post","type-post","status-publish","format-standard","hentry","category-7"],"_links":{"self":[{"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/posts\/134","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/comments?post=134"}],"version-history":[{"count":5,"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/posts\/134\/revisions"}],"predecessor-version":[{"id":148,"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/posts\/134\/revisions\/148"}],"wp:attachment":[{"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/media?parent=134"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/categories?post=134"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/geocommunity.vip\/index.php\/wp-json\/wp\/v2\/tags?post=134"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}