{"id":26,"date":"2024-03-29T13:41:45","date_gmt":"2024-03-29T05:41:45","guid":{"rendered":"http:\/\/www.shifengzhi.asia\/?p=26"},"modified":"2024-04-11T16:05:28","modified_gmt":"2024-04-11T08:05:28","slug":"%e8%93%9d%e6%a1%a5%e6%9d%af%e5%8e%86%e5%b1%8a%e7%9c%81%e8%b5%9b%ef%bc%886%e5%88%b014%e5%b1%8a%ef%bc%89","status":"publish","type":"post","link":"https:\/\/boki.shifengzhi.top\/?p=26","title":{"rendered":"\u84dd\u6865\u676f\u5386\u5c4a\u7701\u8d5b\u771f\u9898\u9898\u89e3\uff086\u523014\u5c4a\uff09"},"content":{"rendered":"

\u7b2c\u516d\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef614)<\/a><\/h3>\n
    \n
  1. \n

    \u9694\u884c\u53d8\u8272<\/p>\n

    Excel \u8868\u7684\u683c\u5b50\u5f88\u591a\uff0c\u4e3a\u4e86\u907f\u514d\u628a\u67d0\u884c\u7684\u6570\u636e\u548c\u76f8\u90bb\u884c\u6df7\u6dc6\uff0c\u53ef\u4ee5\u91c7\u7528\u9694\u884c\u53d8\u8272\u7684\u6837\u5f0f\u5c0f\u660e\u8bbe\u8ba1\u7684\u6837\u5f0f\u4e3a:\u7b2c 1\u884c\u84dd\u8272\uff0c\u7b2c 2 \u884c\u767d\u8272\uff0c\u7b2c 3 \u884c\u84dd\u8272\uff0c\u7b2c 4\u884c\u767d\u8272\uff0c....\u73b0\u5728\u5c0f\u660e\u60f3\u77e5\u9053\uff0c\u4ece\u7b2c 21 \u884c\u5230\u7b2c 50 \u884c\u4e00\u5171\u5305\u542b\u4e86\u591a\u5c11\u4e2a\u84dd\u8272\u7684\u884c.<\/p>\n

    \u7b54\u6848\uff1a15<\/strong><\/p>\n<\/li>\n

  2. \n

    \u7acb\u65b9\u5c3e\u4e0d\u53d8<\/p>\n

    \u6709\u4e9b\u6570\u5b57\u7684\u7acb\u65b9\u7684\u672b\u5c3e\u6b63\u597d\u662f\u8be5\u6570\u5b57\u672c\u8eab.
    \n\u6bd4\u5982: 1,4,5,6,9,24,25,....
    \n\u8bf7\u4f60\u8ba1\u7b97\u4e00\u4e0b\uff0c\u5728 10000 \u4ee5\u5185\u7684\u6570\u5b57\u4e2d (\u6307\u8be5\u6570\u5b57\uff0c\u5e76\u975e\u5b83\u7acb\u65b9\u540e\u7684\u6570\u503c)\uff0c\u7b26\u5408\u8fd9\u4e2a\u7279\u5f81\u7684\u6b63\u6574\u6570\u4e00\u5171\u6709\u591a\u5c11\u4e2a.<\/p>\n

    public class LiFangWeiBuBian {\n   public static void main(String[] args) {\n       int count = 0;\n       for(long i=1;i <10000;i++){\n           String str = i*i*i + \"\";\n           String si = i + \"\";\n           if(str.endsWith(si)){\n               count++;\n           }\n       }\n       System.out.println(count);\n   }\n}<\/code><\/pre>\n
    \u7b54\u6848\uff1a36<\/strong><\/p>\n<\/li>\n
  3. \n
    \u65e0\u7a77\u5206\u6570<\/p>\n
    \u65e0\u7a77\u7684\u5206\u6570\uff0c\u6709\u65f6\u4f1a\u8d8b\u5411\u4e8e\u56fa\u5b9a\u7684\u6570\u5b57.\u8bf7\u8ba1\u7b97\u56fe\u6240\u793a\u7684\u65e0\u7a77\u5206\u6570\uff0c\u8981\u6c42\u56db\u820d\u4e94\u5165\uff0c\u7cbe\u786e\u5230\u5c0f\u6570\u70b9\u540e 5 \u4f4d\uff0c\u5c0f\u6570\u4f4d\u4e0d\u8db3\u7684\u88650.<\/p>\n
    <\/div><\/p>\n
    public class WuQiongFenShu {\n   public static void main(String[] args) {\n       double i = 1000;\n       double sum = i + 2;\n       for(;i >= 0;i--) sum = i + (i + 1) \/ sum;\n       System.out.printf(\"%.5f\",sum);\n   }\n}<\/code><\/pre>\n
    \u7b54\u6848\uff1a0.58198<\/strong><\/p>\n<\/li>\n
  4. \n
    \u5faa\u73af\u8282\u957f\u5ea6<\/p>\n
    \u4e24\u4e2a\u6574\u6570\u505a\u9664\u6cd5\uff0c\u6709\u65f6\u4f1a\u4ea7\u751f\u5faa\u73af\u5c0f\u6570\uff0c\u5176\u5faa\u73af\u90e8\u5206\u79f0\u4e3a: \u5faa\u73af\u8282\u6bd4\u5982\uff0c11\/13=6=>0.846153846153..... \u5176\u5faa\u73af\u8282\u4e3a[846153] \u5171\u6709 6 \u4f4d\u4e0b\u9762\u7684\u65b9\u6cd5\uff0c\u53ef\u4ee5\u6c42\u51fa\u5faa\u73af\u8282\u7684\u957f\u5ea6.
    \n\u8bf7\u4ed4\u7ec6\u9605\u8bfb\u4ee3\u7801\uff0c\u5e76\u586b\u5199\u5212\u7ebf\u90e8\u5206\u7f3a\u5c11\u7684\u4ee3\u7801.<\/p>\n
    public static int f(int n,int m){\n   n = n % m;\n   Vector v = new Vector();\n   for(;;){\n       v.add(n);\n       n *= 10;\n       n = n % m;\n       if(n == 0) return 0;\n       if(v.indexOf(n) >= 0) return v.size() - v.indexOf(n);\n   }\n}<\/code><\/pre>\n
    \u7b54\u6848\uff1areturn v.size() - v.indexOf(n);<\/code><\/p>\n<\/li>\n
  5. \n
    \u683c\u5b50\u4e2d\u8f93\u51fa<\/p>\n
    stringInGrid \u65b9\u6cd5\u4f1a\u5728\u4e00\u4e2a\u6307\u5b9a\u5927\u5c0f\u7684\u683c\u5b50\u4e2d\u6253\u5370\u6307\u5b9a\u7684\u5b57\u7b26\u4e32\u8981\u6c42\u5b57\u7b26\u4e32\u5728\u6c34\u5e73\u3001\u5782\u76f4\u4e24\u4e2a\u65b9\u5411\u4e0a\u90fd\u5c45\u4e2d\u3002\u5982\u679c\u5b57\u7b26\u4e32\u592a\u957f\uff0c\u5c31\u622a\u65ad.\u5982\u679c\u4e0d\u80fd\u6070\u597d\u5c45\u4e2d\uff0c\u53ef\u4ee5\u7a0d\u7a0d\u504f\u5de6\u6216\u8005\u504f\u4e0a\u4e00\u70b9\u3002
    \n\u4e0b\u9762\u7684\u7a0b\u5e8f\u5b9e\u73b0\u8fd9\u4e2a\u903b\u8f91\uff0c\u8bf7\u586b\u5199\u5212\u7ebf\u90e8\u5206\u7f3a\u5c11\u7684\u4ee3\u7801.<\/p>\n
    \"\"<\/div><\/p>\n
    public static void stringInGrid(int width, int height, String s) {\n   if (s.length() > width - 2) s = s.substring(0, width - 2);\n   System.out.print(\"+\");\n   for (int i = 0; i < width - 2; i++) System.out.print(\"-\");\n   System.out.println(\"+\");\n   for (int k = 1; k < (height - 1) \/ 2; k++) {\n       System.out.print(\"|\");\n       for (int i = 0; i < width - 2; i++) System.out.print(\" \");\n       System.out.println(\"|\");\n   }\n   System.out.print(\"|\");\n   String ff = \"%\" + ((width - 2 - s.length()) \/ 2) + \"s%s%\" + ((width - 1 - s.length()) \/ 2) + \"s\";\n   System.out.print(String.format(ff, \"\", s, \"\"));\n   System.out.println(\"|\");\n   for (int k = (height - 1) \/ 2 + 1; k < height - 1; k++) {\n       System.out.print(\"|\");\n       for (int i = 0; i < width - 2; i++) System.out.print(\" \");\n       System.out.println(\"|\");\n   }\n   System.out.print(\"+\");\n   for (int i = 0; i < width - 2; i++) System.out.print(\"-\");\n   System.out.println(\"+\");\n}<\/code><\/pre>\n
    \u7b54\u6848\uff1a"%" + ((width - 2 - s.length()) \/ 2) + "s%s%" + ((width - 1 - s.length()) \/ 2) + "s";<\/code><\/p>\n<\/li>\n
  6. \n
    \u5947\u5999\u7684\u6570\u5b57<\/p>\n
    \u5c0f\u660e\u53d1\u73b0\u4e86\u4e00\u4e2a\u5947\u5999\u7684\u6570\u5b57.\u5b83\u7684\u5e73\u65b9\u548c\u7acb\u65b9\u6b63\u597d\u628a 0~9 \u7684 10 \u4e2a\u6570\u5b57\u6bcf\u4e2a\u7528\u4e14\u53ea\u7528\u4e86\u4e00\u6b21\u4f60\u80fd\u731c\u51fa\u8fd9\u4e2a\u6570\u5b57\u662f\u591a\u5c11\u5417?
    \n\u8bf7\u586b\u5199\u8be5\u6570\u5b57\uff0c\u4e0d\u8981\u586b\u5199\u4efb\u4f55\u591a\u4f59\u7684\u5185\u5bb9.<\/p>\n
    public class QiMiaoDeShuZi {\npublic static void main(String[] args) {\n    char[]  nums = {'0','1','2','3','4','5','6','7','8','9'};\n    for(int i = 30;;i++) {\n        char[] num = (i*i + \"\" + i*i*i).toCharArray();\n        Arrays.sort(num);\n        if(i == 100) break;\n        if(Arrays.equals(nums, num)) {\n            System.out.println(i);\n            break;\n        }\n    }\n}\n}<\/code><\/pre>\n
    \u7b54\u6848\uff1a69<\/strong><\/p>\n<\/li>\n
  7. \n
    \u52a0\u6cd5\u53d8\u4e58\u6cd5<\/p>\n
    \u6211\u4eec\u90fd\u77e5\u9053: 1+2+3+ ... + 49 = 1225
    \n\u73b0\u5728\u8981\u6c42\u4f60\u628a\u5176\u4e2d\u4e24\u4e2a\u4e0d\u76f8\u90bb\u7684\u52a0\u53f7\u53d8\u6210\u4e58\u53f7\uff0c\u4f7f\u5f97\u7ed3\u679c\u4e3a 2015
    \n\u6bd4\u5982:
    \n1+2+3+...+1011+12+...+27<\/em>28+29+...+49 = 2015\u5c31\u662f\u7b26\u5408\u8981\u6c42\u7684\u7b54\u6848\u3002
    \n\u8bf7\u4f60\u5bfb\u627e\u53e6\u5916\u4e00\u4e2a\u53ef\u80fd\u7684\u7b54\u6848\uff0c\u5e76\u628a\u4f4d\u7f6e\u9760\u524d\u7684\u90a3\u4e2a\u4e58\u53f7\u5de6\u8fb9\u7684\u6570\u5b57\u63d0\u4ea4(\u5bf9\u4e8e\u793a\u4f8b\uff0c\u5c31\u662f\u63d0\u4ea4 10).
    \n\u6ce8\u610f: \u9700\u8981\u4f60\u63d0\u4ea4\u7684\u662f\u4e00\u4e2a\u6574\u6570\uff0c\u4e0d\u8981\u586b\u5199\u4efb\u4f55\u591a\u4f59\u7684\u5185\u5bb9.<\/p>\n
    public class JiaFaBianChengFa {\npublic static void main(String[] args) {\n      int num = 2015 - 1225;\n      for(int i = 2;i<50;i++){\n          for(int j = i+2;j<50;j++){\n              if(i*(i-1)+j*(j-1)-(i+i-1+j+j-1)==num){\n                  if((i-1)!= 10){\n                      System.out.println(i-1);\n                      break;\n                  }\n              }\n          }\n      }\n  }\n}<\/code><\/pre>\n
    \u7b54\u6848\uff1a16<\/strong><\/p>\n<\/li>\n
  8. \n
    \u79fb\u52a8\u8ddd\u79bb<\/p>\n
    X \u661f\u7403\u5c45\u6c11\u5c0f\u533a\u7684\u697c\u623f\u5168\u662f\u4e00\u6837\u7684\uff0c\u5e76\u4e14\u6309\u77e9\u9635\u6837\u5f0f\u6392\u5217\u3002\u5176\u697c\u623f\u7684\u7f16\u53f7\u4e3a 1,2,3..\u5f53\u6392\u6ee1\u4e00\u884c\u65f6\uff0c\u4ece\u4e0b\u4e00\u884c\u76f8\u90bb\u7684\u697c\u5f80\u53cd\u65b9\u5411\u6392\u53f7.\u6bd4\u5982: \u5f53\u5c0f\u533a\u6392\u53f7\u5bbd\u5ea6\u4e3a 6 \u65f6\uff0c\u5f00\u59cb\u60c5\u5f62\u5982\u4e0b:
    \n1  2  3  4  5  6
    \n12 11 10 9 8 7
    \n13 14 15 .....
    \n\u6211\u4eec\u7684\u95ee\u9898\u662f:\u5df2\u77e5\u4e86\u4e24\u4e2a\u697c\u53f7 m \u548c n\uff0c\u9700\u8981\u6c42\u51fa\u5b83\u4eec\u4e4b\u95f4\u7684\u6700\u77ed\u79fb\u52a8\u8ddd\u79bb(\u4e0d\u80fd\u659c\u7ebf\u65b9\u5411
    \n\u8f93\u4eba\u4e3a3 \u4e2a\u6574\u6570 w m n\uff0c\u7a7a\u683c\u5206\u5f00\uff0c\u90fd\u57281\u5230 10000 \u8303\u56f4\u5185\u8981\u6c42\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a m n \u4e24\u697c\u95f4\u6700\u77ed\u79fb\u52a8\u8ddd\u79bb\u3002<\/p>\n
    public class YiDongJvLi {\npublic static void main(String[] args) {\n    System.out.println(\"\u8bf7\u8f93\u5165\uff1a\");\n    Scanner input = new Scanner(System.in);\n    int length = input.nextInt();\n    int one = input.nextInt();\n    int two = input.nextInt();\n\n    int ox = one \/ length;\n    int oy = one % length;\n    int tx = two \/ length;\n    int ty = two % length;\n\n    if (one % length == 0) {\n      oy = length;\n    } else {\n      ox = ox + 1;\n    }\n    if (two % length == 0) {\n      ty = length;\n    } else {\n      tx = tx + 1;\n    }\n    if (ox % 2 == 0) {\n      oy = length - oy + 1;\n    }\n    if (tx % 2 == 0) {\n      ty = length - ty + 1;\n    }\n    System.out.println(Math.abs(ox - tx) + Math.abs(oy - ty));\n  }\n}<\/code><\/pre>\n<\/li>\n
  9. \n
    \u6253\u5370\u5927X<\/p>\n
    \u5c0f\u660e\u5e0c\u671b\u7528\u661f\u53f7\u62fc\u51d1\uff0c\u6253\u5370\u51fa\u4e00\u4e2a\u5927 X\uff0c\u4ed6\u8981\u6c42\u80fd\u591f\u63a7\u5236\u7b14\u753b\u7684\u5bbd\u5ea6\u548c\u6574\u4e2a\u5b57\u7684\u9ad8\u5ea6.
    \n\u4e3a\u4e86\u4fbf\u4e8e\u6bd4\u5bf9\u7a7a\u683c\uff0c\u6240\u6709\u7684\u7a7a\u767d\u4f4d\u7f6e\u90fd\u4ee5\u53e5\u70b9\u7b26\u6765\u4ee3\u66ff\u3002
    \n\u8981\u6c42\u8f93\u5165\u4e24\u4e2a\u6574\u6570 m n\uff0c\u8868\u793a\u7b14\u7684\u5bbd\u5ea6\uff0cX \u7684\u9ad8\u5ea6\u3002\u7528\u7a7a\u683c\u5206\u5f00(0<m<n,3<n<1000\uff0c\u4fdd\u8bc1\u662f\u5947\u6570)
    \n\u8981\u6c42\u8f93\u51fa\u4e00\u4e2a\u5927 X<\/p>\n
    public class DaYinDaX {\npublic static void main(String[] args) {\n    Scanner sc=new Scanner(System.in);\n    \/\/\u63a5\u6536\u9ad8\u5ea6\u548c\u5bbd\u5ea6\n    int n=sc.nextInt();\n    int m=sc.nextInt();\n    sc.close();\n    \/\/\u521d\u59cb\u5316\u4e8c\u7ef4\u6570\u7ec4\n    char[][] ch=new char[n][n+m-1];\n    for(int i=0;in-2-i;j--)\n        {\n            \/\/\u7a7a\u683c\u4e0d\u9700\u8981\u5904\u7406\uff0c\u5904\u7406*\u53f7\n            ch[i][j]='*';\n        }\n    }\n\n    for(int i=0;i<\/pre>\n
    \u5907\u6ce8\uff1a\u8fd0\u884c\u65f6\u8f93\u5165 X \u7684\u9ad8\u548c\u5bbd\uff0c\u548c\u7b2c\u4e5d\u5c4a\u7b2c\u516d\u9898\u4e00\u6837<\/p>\n<\/li>\n
  10. \n
    \u5792\u9ab0\u5b50<\/p>\n
    \u8d4c\u5723 atm \u665a\u5e74\u8ff7\u604b\u4e0a\u4e86\u6563\u5b50\uff0c\u5c31\u662f\u628a\u6563\u5b50\u4e00\u4e2a\u5792\u5728\u53e6\u4e00\u4e2a\u4e0a\u8fb9\uff0c\u4e0d\u80fd\u6b6a\u6b6a\u626d\u626d\uff0c\u8981\u5792\u6210\u65b9\u67f1\u4f53\u3002
    \n\u7ecf\u8fc7\u957f\u671f\u89c2\u5bdf\uff0catm \u53d1\u73b0\u4e86\u7a33\u5b9a\u9ab0\u5b50\u7684\u5965\u79d8:\u6709\u4e9b\u6570\u5b57\u7684\u9762\u8d34\u7740\u4f1a\u4e92\u76f8\u6392\u65a5!\u6211\u4eec\u5148\u6765\u89c4\u8303\u4e00\u4e0b\u6563\u5b50: 1 \u7684\u5bf9\u9762\u662f 4\uff0c2 \u7684\u5bf9\u9762\u662f 5\uff0c3 \u7684\u5bf9\u9762\u662f 6.\u5047\u8bbe\u6709 m \u7ec4\u4e92\u65a5\u73b0\u8c61\uff0c\u6bcf\u7ec4\u4e2d\u7684\u90a3\u4e24\u4e2a\u6570\u5b57\u7684\u9762\u7d27\u8d34\u5728\u4e00\u8d77\uff0c\u9ab0\u5b50\u5c31\u4e0d\u80fd\u7a33\u5b9a\u7684\u5792\u8d77\u6765atm \u60f3\u8ba1\u7b97\u4e00\u4e0b\u6709\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u53ef\u80fd\u7684\u5792\u9ab0\u5b50\u65b9\u5f0f\u3002\u4e24\u79cd\u5792\u6563\u5b50\u65b9\u5f0f\u76f8\u540c\uff0c\u5f53\u4e14\u4ec5\u5f53\u8fd9\u4e24\u79cd\u65b9\u5f0f\u4e2d\u5bf9\u5e94\u9ad8\u5ea6\u7684\u9ab0\u5b50\u7684\u5bf9\u5e94\u6570\u5b57\u7684\u671d\u5411\u90fd\u76f8\u540c.\u7531\u4e8e\u65b9\u6848\u6570\u53ef\u80fd\u8fc7\u591a\uff0c\u8bf7\u8f93\u51fa\u6a21 10^9 + 7 \u7684\u7ed3\u679c<\/p>\n
    public class LeiTouZi {\nstatic final int mod=1000000000+7;\n\n    static long mypow(int x,int y) {\n        long res=1;\n        for(int i=1;i<=y;i++) {\n            res*=x;\n        }\n        return res;\n    }\n\n    public static void main(String[] args) {\n        Scanner reader=new Scanner(System.in);\n        \/\/n\u4e2a\u9ab0\u5b50\n        int n=reader.nextInt();\n\n        int m=reader.nextInt();\n        \/\/\u5bf9\u7acb\u9762\n        int [] op=new int[] {0,4,5,6,1,2,3};\n\n        \/\/m\u7ec4\u4e92\u65a5\u5bf9\n        boolean [][] confilct=new boolean[7][7];\n        for(int i=0;i<\/pre>\n
    \u5907\u6ce8\uff1a\u540c\u4e0a\u9898\uff0c\u8fd0\u884c\u65f6\u5148\u8f93\u5165\uff0c\u8be6\u89c1\u9898\u76ee\u6d4b\u8bd5\u7528\u4f8b\u3002\uff08\u592a\u96be\u4e86\uff0c\u5efa\u8bae\u653e\u5f03\u8df3\u8fc7\uff09<\/p>\n
    \u9898\u76ee\u94fe\u63a5\uff1ahttps:\/\/www.lanqiao.cn\/courses\/2786\/learning\/?id=67114&compatibility=false<\/a> \uff08\u9700\u8981\u767b\u5f55\uff09<\/p>\n<\/li>\n<\/ol>\n
    \n
    \u7b2c\u4e03\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef641)<\/a><\/h3>\n
      \n
    1. \n
      \u6709\u5956\u731c\u8c1c<\/p>\n
      \u5c0f\u660e\u5f88\u559c\u6b22\u731c\u8c1c\u8bed\u3002\u6700\u8fd1\uff0c\u4ed6\u88ab\u9080\u8bf7\u53c2\u52a0\u4e86 X \u661f\u7403\u7684\u731c\u8c1c\u6d3b\u52a8
      \n\u6bcf\u4f4d\u9009\u624b\u5f00\u59cb\u7684\u65f6\u5019\u90fd\u88ab\u53d1\u7ed9 777 \u4e2a\u7535\u5b50\u5e01\u89c4\u5219\u662f:\u731c\u5bf9\u4e86\uff0c\u624b\u91cc\u7684\u7535\u5b50\u5e01\u6570\u76ee\u7ffb\u500d,\u731c\u9519\u4e86\uff0c\u6263\u9664 555 \u4e2a\u7535\u5b50\u5e01\uff0c\u6263\u5b8c\u4e3a\u6b62.
      \n\u5c0f\u660e\u4e00\u5171\u731c\u4e86 15 \u6761\u8c1c\u8bed.\u6218\u679c\u4e3a: VXVXVXVXVXVXVVX\u5176\u4e2dv \u8868\u793a\u731c\u5bf9\u4e86\uff0cx \u8868\u793a\u731c\u9519\u4e86.
      \n\u8bf7\u4f60\u8ba1\u7b97\u4e00\u4e0b\uff0c\u5c0f\u660e\u6700\u540e\u624b\u91cc\u7684\u7535\u5b50\u5e01\u6570\u76ee\u662f\u591a\u5c11<\/p>\n
      public class YouJiangCaiMi {\npublic static void main(String[] args){\n       String s = \"vxvxvxvxvxvxvvx\";\n       long m = 777;\n\n       for(int i = 0;i<\/pre>\n
      \u7b54\u6848\uff1a58497<\/strong><\/p>\n<\/li>\n
    2. \n
      \u7164\u7403\u6570\u76ee<\/p>\n
      \u6709\u4e00\u5806\u7164\u7403\uff0c\u5806\u6210\u4e09\u89d2\u68f1\u5f62\u3002\u5177\u4f53:
      \n\u7b2c\u4e00\u5c42\u653e 1 \u4e2a\uff0c
      \n\u7b2c\u4e8c\u5c42 3 \u4e2a(\u6392\u5217\u6210\u4e09\u89d2\u5f62),
      \n\u7b2c\u4e09\u5c42 6 \u4e2a (\u6392\u5217\u6210\u4e09\u89d2\u5f62),\u7b2c\u56db\u5c42 10 \u4e2a (\u6392\u5217\u6210\u4e09\u89d2\u5f62),
      \n\u5982\u679c\u4e00\u5171\u6709 100 \u5c42\uff0c\u5171\u6709\u591a\u5c11\u4e2a\u7164\u7403?<\/p>\n
      public class MeiQiuShuMu {\npublic static void main(String[] args) {\n       int i, n = 0, s = 0;\/\/s\u8868\u793a\u603b\u6570\uff0cn\u8868\u793a\u6bcf\u4e00\u5c42\u7684\u6570\u76ee\uff0ci\u8868\u793a\u5c42\u6570\n       for (i = 1; i <= 100; i++) {\n           n += i;\n           s += n;\n       }\n       System.out.println(s);\n   }\n}<\/code><\/pre>\n
      \u7b54\u6848\uff1a171700<\/strong><\/p>\n<\/li>\n
    3. \n
      \u5e73\u65b9\u602a\u5708<\/p>\n
      \u5982\u679c\u628a\u4e00\u4e2a\u6b63\u6574\u6570\u7684\u6bcf\u4e00\u4f4d\u90fd\u5e73\u65b9\u540e\u518d\u6c42\u548c\uff0c\u5f97\u5230\u4e00\u4e2a\u65b0\u7684\u6b63\u6574\u6570\u5bf9\u65b0\u4ea7\u751f\u7684\u6b63\u6574\u6570\u518d\u505a\u540c\u6837\u7684\u5904\u7406.
      \n\u5982\u6b64\u4e00\u6765\uff0c\u4f60\u4f1a\u53d1\u73b0\uff0c\u4e0d\u7ba1\u5f00\u59cb\u53d6\u7684\u662f\u4ec0\u4e48\u6570\u5b57\u6700\u7ec8\u5982\u679c\u4e0d\u662f\u843d\u5165 1\uff0c\u5c31\u662f\u843d\u5165\u540c\u4e00\u4e2a\u5faa\u73af\u5708.
      \n\u8bf7\u5199\u51fa\u8fd9\u4e2a\u5faa\u73af\u5708\u4e2d\u6700\u5927\u7684\u90a3\u4e2a\u6570\u5b57.<\/p>\n
      public class PingFangGuaiQuan {\npublic static void main(String[] args) {\n    int n=56;\n    int max=0;\n    int a=0;\n    int num=0;\n    for(int i=1;i<200;i++) {\n        a=0;\n        while(n>0) {            \n            num=n%10;\n            a+=num*num;\n            n=n\/10;\n        }\n        n=a;\n        if(a>max)max=a;\n    }\n    System.out.println(max);\n}\n}<\/code><\/pre>\n
      \u7b54\u6848\uff1a145<\/strong><\/p>\n<\/li>\n
    4. \n
      \u9ab0\u5b50\u6e38\u620f<\/p>\n
      \u6211\u4eec\u6765\u73a9\u4e00\u4e2a\u6e38\u620f\u540c\u65f6\u63b7\u51fa 3 \u4e2a\u666e\u901a\u9ab0\u5b50 (6 \u4e2a\u9762\u4e0a\u7684\u6570\u5b57\u5206\u522b\u662f 1~6).\u5982\u679c\u5176\u4e2d\u4e00\u4e2a\u6700\u5b50\u4e0a\u7684\u6570\u5b57\u7b49\u4e8e\u53e6\u5916\u4e24\u4e2a\u7684\u548c\uff0c\u4f60\u5c31\u8d62\u4e86\u3002
      \n\u4e0b\u9762\u7684\u7a0b\u5e8f\u8ba1\u7b97\u51fa\u4f60\u80fd\u83b7\u80dc\u7684\u7cbe\u786e\u6982\u7387 (\u4ee5\u65e2\u7ea6\u5206\u6570\u8868\u793a)<\/p>\n
      public class TouZiYouXi {\npublic static void main(String[] args) {\n    int n = 0;\n    for(int i=0; i<6; i++)\n    for(int j=0; j<6; j++)\n    for(int k=0; k<6; k++){\n        if(i==j+k+1||j==i+k+1||k==j+i+1) n++;   \/\/\u586b\u7a7a\u4f4d\u7f6e\n    }\n    int m = gcd(n,6*6*6);\n    System.out.println(n\/m + \"\/\" + 6*6*6\/m);\n}\npublic static int gcd(int a, int b)\n{\n    if(b==0) return a;\n    return gcd(b,a%b);\n}\n}<\/code><\/pre>\n
      \u7b54\u6848\uff1ai==j+k+1||j==i+k+1||k==j+i+1<\/code><\/p>\n<\/li>\n
    5. \n
      \u5206\u5c0f\u7ec4<\/p>\n
      9 \u540d\u8fd0\u52a8\u5458\u53c2\u52a0\u6bd4\u8d5b\uff0c\u9700\u8981\u5206 3 \u7ec4\u8fdb\u884c\u9884\u8d5b\u6709\u54ea\u4e9b\u5206\u7ec4\u7684\u65b9\u6848\u5462?
      \n\u6211\u4eec\u6807\u8bb0\u8fd0\u52a8\u5458\u4e3a A,B,C....I\u4e0b\u9762\u7684\u7a0b\u5e8f\u5217\u51fa\u4e86\u6240\u6709\u7684\u5206\u7ec4\u65b9\u6cd5\u3002<\/p>\n
      public class FenXiaoZu {\npublic static String remain(int[] a)\n{\n    String s = \"\";\n    for(int i=0; i<\/pre>\n
      \u7b54\u6848\uff1as+" "+(char)(i+'A')+(char)(j+'A')+(char)(k+'A')+" "+remain(a)<\/code><\/p>\n<\/li>\n
    6. \n
      \u51d1\u7b97\u5f0f<\/p>\n
      \"\"<\/div><\/p>\n
      \u8fd9\u4e2a\u7b97\u5f0f\u4e2d A~I \u4ee3\u8868 1~9 \u7684\u6570\u5b57\uff0c\u4e0d\u540c\u7684\u5b57\u6bcd\u4ee3\u8868\u4e0d\u540c\u7684\u6570\u5b57
      \n\u6bd4\u5982:
      \n6+8\/3+952\/714 \u5c31\u662f\u4e00\u79cd\u89e3\u6cd55+3\/1+972\/486 \u662f\u53e6\u4e00\u79cd\u89e3\u6cd5
      \n\u8fd9\u4e2a\u7b97\u5f0f\u4e00\u5171\u6709\u591a\u5c11\u79cd\u89e3\u6cd5?<\/p>\n
      public class CouSuanShi {\nstatic boolean k[]=new boolean[10];  \/\/\u5224\u65ad\u8fd9\u4e2a\u6570\u6709\u6ca1\u6709\u88ab\u53d6\u8fc7\n static int g[]=new int[10];\/\/\u5b58\u653e9\u4e2a\u6570\n static int count=0;\n public static void main(String args[])\n {\n      ff(1);\n      System.out.println(count);\n }\n public static void ff(int m)\n {\n     if(m==10){\n        if(check())count++;\n     }\n     for(int i=1;i<=9;i++)\n     {\n         if(k[i]==false)\n         {\n             k[i]=true;    \/\/\u56de\u6eaf\u6cd5\n             g[m]=i;\n             ff(m+1);\n             k[i]=false;\n         }\n     }\n }\n public static boolean check()  \/\/\u68c0\u9a8c\u662f\u4e0d\u662f\u4e3a10\n {\n     double q=g[1];\n     double w=g[2]*1.00\/g[3];\n     double e=(g[4]*100+g[5]*10+g[6])*1.00\/(g[7]*100+g[8]*10+g[9]);\n     if(q+w+e==10.00)return true;\n     else return false;\n }\n}<\/code><\/pre>\n
      \u7b54\u6848\uff1a29<\/strong><\/p>\n<\/li>\n
    7. \n
      \u51b0\u96f9\u6570<\/p>\n
      \u4efb\u610f\u7ed9\u5b9a\u4e00\u4e2a\u6b63\u6574\u6570 N
      \n\u5982\u679c\u662f\u5076\u6570\uff0c\u6267\u884c: N\/2
      \n\u5982\u679c\u662f\u5947\u6570\uff0c\u6267\u884c: N* 3 + 1
      \n\u751f\u6210\u7684\u65b0\u7684\u6570\u5b57\u518d\u6267\u884c\u540c\u6837\u7684\u52a8\u4f5c\uff0c\u5faa\u73af\u5f80\u590d.
      \n\u901a\u8fc7\u89c2\u5bdf\u53d1\u73b0\uff0c\u8fd9\u4e2a\u6570\u5b57\u4f1a\u4e00\u4f1a\u513f\u4e0a\u5347\u5230\u5f88\u9ad8\u4e00\u4f1a\u513f\u53c8\u964d\u843d\u4e0b\u6765\uff0c\u5c31\u8fd9\u6837\u8d77\u8d77\u843d\u843d\u7684\uff0c\u4f46\u6700\u7ec8\u5fc5\u4f1a\u843d\u5230\u201c1"\u8fd9\u6709\u70b9\u50cf\u5c0f\u51b0\u96f9\u7c92\u5b50\u5728\u51b0\u96f9\u4e91\u4e2d\u7ffb\u6eda\u589e\u957f\u7684\u6837\u5b50
      \n\u6bd4\u5982N=9
      \n9,28,14,7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1\u53ef\u4ee5\u770b\u5230\uff0cN=9 \u7684\u65f6\u5019\uff0c\u8fd9\u4e2a\u201c\u5c0f\u51b0\u96f9\u201d\u6700\u9ad8\u51b2\u5230\u4e86 52 \u8fd9\u4e2a\u9ad8\u5ea6<\/p>\n
      public class BingBaoShu {\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    long N = sc.nextLong(); long max = 0;\n    long[] arr = new long[1000001];\n    for(int i = 1; i <= N; i += 2) {\n        long temp = i;\n        while(temp != 1) {\n            if(temp <= 1E6 && arr[(int) temp] != 0)\n                break;\n            if((temp & 1) == 1) {\n                temp = (temp * 3) + 1;\n                max = Math.max(temp, max);\n            }else {\n                temp \/= 2;\n            }\n\n            if(temp == 1)\n                arr[i] = max;\n        }\n    }\n    System.out.println(max);\n\n    sc.close();\n}\n}<\/code><\/pre>\n
      \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1a\u8f93\u5165\uff1a10\uff0c\u8f93\u51fa\uff1a52\uff1bcase 2\uff1a\u8f93\u5165\uff1a100\uff0c\u8f93\u51fa\uff1a9232<\/p>\n<\/li>\n
    8. \n
      \u56db\u5e73\u65b9\u548c<\/p>\n
      \u56db\u5e73\u65b9\u548c\u5b9a\u7406\uff0c\u53c8\u79f0\u4e3a\u62c9\u683c\u6717\u65e5\u5b9a\u7406:\u6bcf\u4e2a\u6b63\u6574\u6570\u90fd\u53ef\u4ee5\u8868\u793a\u4e3a\u81f3\u591a 4 \u4e2a\u6b63\u6574\u6570\u7684\u5e73\u65b9\u548c\u5982\u679c\u628a 0 \u5305\u62ec\u8fdb\u53bb\uff0c\u5c31\u6b63\u597d\u53ef\u4ee5\u8868\u793a\u4e3a 4 \u4e2a\u6570\u7684\u5e73\u65b9\u548c
      \n\u6bd4\u5982:
      \n5 = 0^2 + 0^2 + 12 + 2^2
      \n7 = 1^2 + 1^2 + 12 + 2^2
      \n(^\u7b26\u53f7\u8868\u793a\u4e58\u65b9\u7684\u610f\u601d)
      \n\u5bf9\u4e8e\u4e00\u4e2a\u7ed9\u5b9a\u7684\u6b63\u6574\u6570\uff0c\u53ef\u80fd\u5b58\u5728\u591a\u79cd\u5e73\u65b9\u548c\u7684\u8868\u793a\u6cd5.\u8981\u6c42\u4f60\u5bf9 4 \u4e2a\u6570\u6392\u5e8f:
      \n0<= a <= b<= c <= d
      \n\u5e76\u5bf9\u6240\u6709\u7684\u53ef\u80fd\u8868\u793a\u6cd5\u6309 a,b,c,d \u4e3a\u8054\u5408\u4e3b\u952e\u5347\u5e8f\u6392\u5217\uff0c\u6700\u540e\u8f93\u51fa\u7b2c\u4e00\u4e2a\u8868\u793a\u6cd5
      \n\u7a0b\u5e8f\u8f93\u4eba\u4e3a\u4e00\u4e2a\u6b63\u6574\u6570 N(N<5000000)\u8981\u6c42\u8f93\u51fa 4 \u4e2a\u975e\u8d1f\u6574\u6570\uff0c\u6309\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u4e2d\u95f4\u7528\u7a7a\u683c\u5206\u5f00<\/p>\n
      public class SiPingFangHe {\n\/\/\u5b58\u653e \u56db\u5e73\u65b9\u548c\u7684\u6570\u5b57\npublic static int[] tmp = new int[4];\n\/\/\u627e\u5230\u7b2c\u4e00\u4e2a\u540e,\u6807\u8bc6\u4e00\u4e0b\npublic static boolean flg;\npublic static void main(String[] args) {    \n    Scanner sc = new Scanner(System.in);\n    \/\/\u5faa\u73af\u8f93\u5165\n    while(sc.hasNextInt()) {\n        int input = sc.nextInt();\n        \/\/\u6c42\u51fa\u5b83\u7684 \u7b97\u672f\u5e73\u65b9\u6839\n        int n = (int) Math.sqrt(input);\n        \/\/\u7531\u4e8e flg \u662f\u4e2a\u9759\u6001\u6210\u5458\u53d8\u91cf,\u6240\u4ee5\u5728\u8fd9\u91cc\u521d\u59cb\u5316\u4e0b\n        flg = false;\n        \/\/\u5f00\u59cb \u9012\u5f52\u5bfb\u627e \u6570\u5b57\n        dfs(0,input,n);\n        System.out.println(tmp[0]+\" \"+tmp[1]+\" \"+tmp[2]+\" \"+tmp[3]);\n    }   \n}\n\nprivate static void dfs(int depth, int input, int n) {\n    \/\/\u627e\u5230\u4e86 4 \u4e2a\u6570\n    if(depth == 4) {\n        \/\/\u68c0\u67e5 \u56db\u5e73\u65b9 \u548c \u662f\u4e0d\u662f \u7b49\u4e8e input\n        if(check(input)) {\n            \/\/\u6392\u5347\u5e8f\n            Arrays.sort(tmp);\n            \/\/\u6807\u8bb0\u4e0b\n            flg = true;\n        }\n        return;\n    }\n    \/\/\u5982\u679c\u6709\u4e00\u6b21\u9012\u5f52\u8fdb\u6765\u6807\u8bb0\u662f true,\u8868\u793a\u5df2\u7ecf\u627e\u5230\u4e86,\u76f4\u63a5\u8fd4\u56de\n    if(flg == true) {\n        return;\n    }\n    \/\/\u5faa\u73af\u5c1d\u8bd5 0 - n \u7684\u6570\u5b57\n    for(int i = 0; i <= n; i++) {\n        \/\/\u5224\u65ad\u627e\u5230\u7b2c\u4e00\u7ec4\u6ca1\u6709\n        if(flg == true) {\n            return;\n        }else {\n            \/\/\u5c06\u8fd9\u4e2a\u6570\u5b57 \u653e\u5230 tmp \u4e2d\u53bb\n            tmp[depth] = i;\n            \/\/\u9012\u5f52\u5bfb\u627e\u4e0b\u4e00\u4e2a\u6570\u5b57\n            dfs(depth+1,input,n);\n        }\n    }\n}\n\nprivate static boolean check(int input) {\n    int ret = (int) (Math.pow(tmp[0], 2)+Math.pow(tmp[1], 2)+Math.pow(tmp[2], 2)+Math.pow(tmp[3], 2));\n    if(ret == input) {\n        return true;\n    }\n    return false;\n}\n}<\/code><\/pre>\n
      \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1a\u8f93\u5165\uff1a5\uff0c\u8f93\u51fa\uff1a0 0 1 2\uff1bcase 2\uff1a\u8f93\u5165\uff1a12\uff0c\u8f93\u51fa\uff1a0 2 2 2\uff1bcase 3\uff1a\u8f93\u5165\uff1a773535\uff0c\u8f93\u51fa\uff1a1 1 267 838<\/p>\n<\/li>\n
    9. \n
      \u5bc6\u7801\u8131\u843d<\/p>\n
      X \u661f\u7403\u7684\u8003\u53e4\u5b66\u5bb6\u53d1\u73b0\u4e86\u4e00\u6279\u53e4\u4ee3\u7559\u4e0b\u6765\u7684\u5bc6\u7801.
      \n\u8fd9\u4e9b\u5bc6\u7801\u662f\u7531 A\u3001B\u3001C\u3001D \u56db\u79cd\u690d\u7269\u7684\u79cd\u5b50\u4e32\u6210\u7684\u5e8f\u5217\u3002
      \n\u4ed4\u7ec6\u5206\u6790\u53d1\u73b0\uff0c\u8fd9\u4e9b\u5bc6\u7801\u4e32\u5f53\u521d\u5e94\u8be5\u662f\u524d\u540e\u5bf9\u79f0\u7684 (\u4e5f\u5c31\u662f\u6211\u4eec\u8bf4\u7684\u955c\u50cf\u4e32).
      \n\u7531\u4e8e\u5e74\u4ee3\u4e45\u8fdc\uff0c\u5176\u4e2d\u8bb8\u591a\u79cd\u5b50\u8131\u843d\u4e86\uff0c\u56e0\u800c\u53ef\u80fd\u4f1a\u5931\u53bb\u955c\u50cf\u7684\u7279\u5f81.
      \n\u4f60\u7684\u4efb\u52a1\u662f:
      \n\u7ed9\u5b9a\u4e00\u4e2a\u73b0\u5728\u770b\u5230\u7684\u5bc6\u7801\u4e32\uff0c\u8ba1\u7b97\u4e00\u4e0b\u4ece\u5f53\u521d\u7684\u72b6\u6001\uff0c\u5b83\u8981\u81f3\u5c11\u8131\u843d\u591a\u5c11\u4e2a\u79cd\u5b50\uff0c\u624d\u53ef\u80fd\u4f1a\u53d8\u6210\u73b0\u5728\u7684\u6837\u5b50.
      \n\u8f93\u4eba\u4e00\u884c\uff0c\u8868\u793a\u73b0\u5728\u770b\u5230\u7684\u5bc6\u7801\u4e32 (\u957f\u5ea6\u4e0d\u5927\u4e8e 1000)\u8981\u6c42\u8f93\u51fa\u4e00\u4e2a\u6b63\u6574\u6570\uff0c\u8868\u793a\u81f3\u5c11\u8131\u843d\u4e86\u591a\u5c11\u4e2a\u79cd\u5b50\u3002<\/p>\n
      public class MiMaTuoLuo {\nstatic int min=0,num=0;\n   static String inputstr;\npublic static void main(String[] args) {\n    Scanner scanner=new Scanner(System.in);\n    inputstr=scanner.next();\n    min=inputstr.length();\n    fcode(0, min-1, 0);\n    System.out.println(min);\n}\npublic static  void fcode(int left,int right,int num){\n    if (left>=right) {\n        min=min<\/pre>\n
      \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1a\u8f93\u5165\uff1aABCBA\uff0c\u8f93\u51fa\uff1a0\uff1bcase 2\uff1a\u8f93\u5165\uff1aABDCDCBABC\uff0c\u8f93\u51fa\uff1a3<\/p>\n<\/li>\n<\/ol>\n
      \n
      \u7b2c\u516b\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef659)<\/a><\/h3>\n
        \n
      1. \n
        \u8d2d\u7269\u5355<\/p>\n
        \u5c0f\u660e\u521a\u521a\u627e\u5230\u5de5\u4f5c\uff0c\u8001\u677f\u4eba\u5f88\u597d\uff0c\u53ea\u662f\u8001\u677f\u592b\u4eba\u5f88\u7231\u8d2d\u7269\u3002\u8001\u677f\u5fd9\u7684\u65f6\u5019\u7ecf\u5e38\u8ba9\u5c0f\u660e\u5e2e\u5fd9\u5230\u5546\u573a\u4ee3\u4e3a\u8d2d\u7269\u3002\u5c0f\u660e\u5f88\u538c\u70e6\uff0c\u4f46\u53c8\u4e0d\u597d\u63a8\u8f9e.
        \n\u8fd9\u4e0d\uff0cXX \u5927\u4fc3\u9500\u53c8\u6765\u4e86! \u8001\u677f\u592b\u4eba\u5f00\u51fa\u4e86\u957f\u957f\u7684\u8d2d\u7269\u5355\uff0c\u90fd\u662f\u6709\u6253\u6298\u4f18\u60e0\u7684.\u5c0f\u660e\u4e5f\u6709\u4e2a\u602a\u7656\uff0c\u4e0d\u5230\u4e07\u4e0d\u5f97\u5df2\uff0c\u4ece\u4e0d\u5237\u5361\uff0c\u76f4\u63a5\u73b0\u91d1\u641e\u5b9a\u3002\u73b0\u5728\u5c0f\u660e\u5f88\u5fc3\u70e6\uff0c\u8bf7\u4f60\u5e2e\u4ed6\u8ba1\u7b97\u4e00\u4e0b\uff0c\u9700\u8981\u4ece\u53d6\u6b3e\u673a\u4e0a\u53d6\u591a\u5c11\u73b0\u91d1\uff0c\u624d\u80fd\u641e\u5b9a\u8fd9\u6b21\u8d2d\u7269
        \n\u53d6\u6b3e\u673a\u53ea\u80fd\u63d0\u4f9b 100 \u5143\u9762\u989d\u7684\u7eb8\u5e01\u3002\u5c0f\u660e\u60f3\u5c3d\u53ef\u80fd\u5c11\u53d6\u4e9b\u73b0\u91d1\uff0c\u591f\u7528\u5c31\u884c\u4e86.
        \n\u4f60\u7684\u4efb\u52a1\u662f\u8ba1\u7b97\u51fa\uff0c\u5c0f\u660e\u6700\u5c11\u9700\u8981\u53d6\u591a\u5c11\u73b0\u91d1.<\/p>\n
        \u4ee5\u4e0b\u662f\u8ba9\u4eba\u5934\u75bc\u7684\u8d2d\u7269\u5355\uff0c\u4e3a\u4e86\u4fdd\u62a4\u9690\u79c1\uff0c\u7269\u54c1\u540d\u79f0\u88ab\u9690\u85cf\u4e86<\/p>\n
        <\/div>
        <\/div><\/p>\n
        \u9700\u8981\u8bf4\u660e\u7684\u662f\uff0c88 \u6298\u6307\u7684\u662f\u6309\u6807\u4ef7\u7684 88%\u8ba1\u7b97\uff0c\u800c 8 \u6298\u662f\u6309 80%\u8ba1\u7b97\uff0c\u4f59\u8005\u7c7b\u63a8\u7279\u522b\u5730\uff0c\u534a\u4ef7\u662f\u6309 50%\u8ba1\u7b97.
        \n\u8bf7\u63d0\u4ea4\u5c0f\u660e\u8981\u4ece\u53d6\u6b3e\u673a\u4e0a\u63d0\u53d6\u7684\u91d1\u989d\uff0c\u5355\u4f4d\u662f\u5143.\u7b54\u6848\u662f\u4e00\u4e2a\u6574\u6570\uff0c\u7c7b\u4f3c 4300 \u7684\u6837\u5b50\uff0c\u7ed3\u5c3e\u5fc5\u7136\u662f 00\uff0c\u4e0d\u8981\u586b\u5199\u4efb\u4f55\u591a\u4f59\u7684\u5185\u5bb9<\/p>\n
        public class GouWuDan {\n   public static void main(String[] args) {\n       double ans = 180.90 * 88 + 10.25 * 65 + 56.14 * 90 + 104.65 * 90 + 100.30 * 88 + 297.15 * 50 + 26.75 * 65 + 130.62 * 50 + 240.28 * 58 + 270.62 * 80 + 115.87 * 88 + 247.34 * 95 + 73.21 * 90 + 101.00 * 50 + 79.54 * 50 + 278.44 * 70 + 199.26 * 50 + 12.97 * 90 + 166.30 * 78 + 125.50 * 58 + 84.98 * 90 + 113.35 * 68 + 166.57 * 50 + 42.56 * 90 + 81.90 * 95 + 131.78 * 80 + 255.89 * 78 + 109.17 * 90 + 146.69 * 68 + 139.33 * 65 + 141.16 * 78 + 154.74 * 80 + 59.42 * 80 + 85.44 * 68 + 293.70 * 88 + 261.79 * 65 + 11.30 * 88 + 268.27 * 58 + 128.29 * 88 + 251.03 * 80 + 208.39 * 75 + 128.88 * 75 + 62.06 * 90 + 225.87 * 75 + 12.89 * 75 + 34.28 * 75 + 62.16 * 58 + 129.12 * 50 + 218.37 * 50 + 289.69 * 80; \n    System.out.printf(\"%.2f\",ans\/100);\n}\n}<\/code><\/pre>\n
        \u7b54\u6848\uff1a5200<\/strong>          (\u8fd0\u884c\u7ed3\u679c\uff1a5136.86)<\/p>\n<\/li>\n
      2. \n
        \u7eb8\u724c\u4e09\u89d2\u5f62<\/p>\n
        A,2,3,4,5,6,7,8,9 \u5171 9 \u5f20\u7eb8\u724c\u6392\u6210\u4e00\u4e2a\u6b63\u4e09\u89d2\u5f62(A \u6309 1\u8ba1\u7b97)\u8981\u6c42\u6bcf\u4e2a\u8fb9\u7684\u548c\u76f8\u7b49\u4e0b\u56fe\u5c31\u662f\u4e00\u79cd\u6392\u6cd5 (\u5982\u6709\u5bf9\u9f50\u95ee\u9898\uff0c\u53c2\u770b p1.png).<\/p>\n
        <\/div><\/p>\n
        \u8fd9\u6837\u7684\u6392\u6cd5\u53ef\u80fd\u4f1a\u6709\u5f88\u591a.
        \n\u5982\u679c\u8003\u8651\u65cb\u8f6c\u3001\u955c\u50cf\u540e\u76f8\u540c\u7684\u7b97\u540c\u4e00\u79cd\uff0c\u4e00\u5171\u6709\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u6392\u6cd5\u5462?
        \n\u8bf7\u4f60\u8ba1\u7b97\u5e76\u63d0\u4ea4\u8be5\u6570\u5b57.<\/p>\n
        public class ZhiPaiSanJiaoXing {\nstatic int v[]=new int[10];\nstatic int arr[]=new int[10];\nstatic int sum=0;\npublic static void main(String[] args) {\n    f(1);\n    System.out.println(sum\/6);\n}\nprivate static void f(int k) {\n    if(k>9) {\n        if(check()) {\n            sum++;\n        }\n        return;\n    }\n    for(int i=1;i<=9;i++) {\n        if(v[i]==0) {\n            v[i]=1;\n            arr[k]=i;\n            f(k+1);\n            v[i]=0;\n        }\n    }\n\n}\nprivate static boolean check() {\n    int a=arr[1]+arr[2]+arr[3]+arr[4];\n    int b=arr[4]+arr[5]+arr[6]+arr[7];\n    int c=arr[7]+arr[8]+arr[9]+arr[1];\n    if(a==b&&a==c) {\n        return true;\n    }else {\n        return false;\n    }\n}\n}<\/code><\/pre>\n
        \u7b54\u6848\uff1a144<\/strong><\/p>\n<\/li>\n
      3. \n
        \u627f\u538b\u8ba1\u7b97<\/p>\n
        X \u661f\u7403\u7684\u9ad8\u79d1\u6280\u5b9e\u9a8c\u5ba4\u4e2d\u6574\u9f50\u5730\u5806\u653e\u7740\u67d0\u6279\u73cd\u8d35\u91d1\u5c5e\u539f\u6599
        \n\u6bcf\u5757\u91d1\u5c5e\u539f\u6599\u7684\u5916\u5f62\u3001\u5c3a\u5bf8\u5b8c\u5168\u4e00\u81f4\uff0c\u4f46\u91cd\u91cf\u4e0d\u540c.\u91d1\u5c5e\u6750\u6599\u88ab\u4e25\u683c\u5730\u5806\u653e\u6210\u91d1\u5b57\u5854\u5f62<\/p>\n
        <\/div><\/p>\n
        \u5176\u4e2d\u7684\u6570\u5b57\u4ee3\u8868\u91d1\u5c5e\u5757\u7684\u91cd\u91cf (\u8ba1\u91cf\u5355\u4f4d\u8f83\u5927)\u3002
        \n\u6700\u4e0b\u4e00\u5c42\u7684 X \u4ee3\u8868 30 \u53f0\u6781\u9ad8\u7cbe\u5ea6\u7684\u7535\u5b50\u79e4\u3002
        \n\u5047\u8bbe\u6bcf\u5757\u539f\u6599\u7684\u91cd\u91cf\u90fd\u5341\u5206\u7cbe\u786e\u5730\u5e73\u5747\u843d\u5728\u4e0b\u65b9\u7684\u4e24\u4e2a\u91d1\u5c5e\u5757\u4e0a,\u6700\u540e\uff0c\u6240\u6709\u7684\u91d1\u5c5e\u5757\u7684\u91cd\u91cf\u90fd\u4e25\u683c\u7cbe\u786e\u5730\u5e73\u5206\u843d\u5728\u6700\u5e95\u5c42\u7684\u7535\u5b50\u79e4\u4e0a.\u7535\u5b50\u79e4\u7684\u8ba1\u91cf\u5355\u4f4d\u5f88\u5c0f\uff0c\u6240\u4ee5\u663e\u793a\u7684\u6570\u5b57\u5f88\u5927.
        \n\u5de5\u4f5c\u4eba\u5458\u53d1\u73b0\uff0c\u5176\u4e2d\u8bfb\u6570\u6700\u5c0f\u7684\u7535\u5b50\u79e4\u7684\u793a\u6570\u4e3a: 2086458231
        \n\u8bf7\u4f60\u63a8\u7b97\u51fa: \u8bfb\u6570\u6700\u5927\u7684\u7535\u5b50\u7684\u793a\u6570\u4e3a\u591a\u5c11?<\/p>\n
        public class ChengYaJiSuan {\npublic static void main(String[] args) {\n    Scanner s=new Scanner(System.in);\n    double arr[][]=new double[30][30];\n    for(int i=0;i<29;i++){\n        for(int j=0;j<=i;j++){\n            arr[i][j]=s.nextInt();\n        }\n    }\n    for(int i=1;i<30;i++){\n        for(int j=0;j<=i;j++){\n            if(j==0)\n                arr[i][j]+=arr[i-1][j]*1.0\/2;\n            else arr[i][j]+=arr[i-1][j]*1.0\/2+arr[i-1][j-1]*1.0\/2;;\n        }\n    }\n    Arrays.sort(arr[29]);\n    System.out.println(2086458231\/arr[29][0]*arr[29][29]);\n}\n}<\/code><\/pre>\n
        \u7b54\u6848\uff1a72665192664           (\u8fd0\u884c\u7ed3\u679c\uff1a7.2665192664E10)<\/p>\n
        \u5907\u6ce8\uff1a\u8fd0\u884c\u65f6\u9700\u8981\u628a\u9898\u76ee\u7684\u91d1\u5b57\u5854\u6570\u5b57\u90e8\u5206\u8f93\u5165<\/p>\n<\/li>\n
      4. \n
        \u9b54\u65b9\u72b6\u6001<\/p>\n
        \u4e8c\u9636\u9b54\u65b9\u5c31\u662f\u53ea\u6709 2 \u5c42\u7684\u9b54\u65b9\uff0c\u53ea\u7531 8 \u4e2a\u5c0f\u5757\u7ec4\u6210\u5982\u56fe pl.png \u6240\u793a
        \n\u5c0f\u660e\u5f88\u6dd8\u6c14\uff0c\u4ed6\u53ea\u559c\u6b22 3 \u79cd\u989c\u8272\uff0c\u6240\u6709\u628a\u5bb6\u91cc\u7684\u4e8c\u9636\u9b54\u65b9\u91cd\u65b0\u6d82\u4e86\u989c\u8272\uff0c\u5982\u4e0b:<\/p>\n
        \u524d\u9762:\u6a59\u8272   \u53f3\u9762:\u7eff\u8272   \u4e0a\u9762:\u9ec4\u8272   \u5de6\u9762:\u7eff\u8272   \u4e0b\u9762: \u6a59\u8272   \u540e\u9762:\u9ec4\u8272
        \n\u8bf7\u4f60\u8ba1\u7b97\u4e00\u4e0b\uff0c\u8fd9\u6837\u7684\u9b54\u65b9\u88ab\u6253\u4e71\u540e\uff0c\u4e00\u5171\u6709\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u72b6\u6001
        \n\u5982\u679c\u4e24\u4e2a\u72b6\u6001\u7ecf\u8fc7\u9b54\u65b9\u7684\u6574\u4f53\u65cb\u8f6c\u540e\uff0c\u5404\u4e2a\u9762\u7684\u989c\u8272\u90fd\u4e00\u81f4\uff0c\u5219\u8ba4\u4e3a\u662f\u540c\u4e00\u72b6\u6001.<\/p>\n
        <\/div><\/p>\n
        public class MoFangZhuangTai {\nstatic int count;\nstatic List list=new ArrayList<>();\npublic static void main(String[] args)\n{\n    String string=\"11112233\";\n    f(string.toCharArray(),0);\n    System.out.println(count);\n}\n\nprivate static void f(char[] charArray, int i)\n{\n    if (i==8)\n    {\n        String string=new String(charArray);\n        String string2=reverse(string);\n        if (list.contains(string)||list.contains(string2))\n        {\n            return;\n        }\n        count++;\n        System.out.println(string);\n        list.add(string);\n    }\n\n    for (int j = i; j < charArray.length; j++)\n    {\n        char old=charArray[i];\n        charArray[i]=charArray[j];\n        charArray[j]=old;\n\n        f(charArray, i+1);\n\n        old=charArray[i];\n        charArray[i]=charArray[j];\n        charArray[j]=old;\n    }\n}\n\nprivate static String reverse(String string)\n{\n    String string2=\"\";\n    for (int i = 0; i < string.length(); i++)\n    {\n        string2=string.charAt(i)+string2;\n    }\n    return string2;\n}\n}<\/code><\/pre>\n
        \u7b54\u6848\uff1a216<\/strong><\/p>\n<\/li>\n
      5. \n
        \u53d6\u6570\u4f4d<\/p>\n
        \u6c42 1 \u4e2a\u6574\u6570\u7684\u7b2c k \u4f4d\u6570\u5b57\u6709\u5f88\u591a\u79cd\u65b9\u6cd5<\/p>\n
        \u4ee5\u4e0b\u7684\u65b9\u6cd5\u5c31\u662f\u4e00\u79cd\u3002<\/p>\n
        \u5bf9\u4e8e\u9898\u76ee\u4e2d\u7684\u6d4b\u8bd5\u6570\u636e\uff0c\u5e94\u8be5\u6253\u5370 5.<\/p>\n
        public class Main {\nstatic int len(int x){\n       if(x<10) return 1;\n       return len(x\/10)+1;\n   }\n\n   \/\/ \u53d6x\u7684\u7b2ck\u4f4d\u6570\u5b57\n   static int f(int x, int k){\n       if(len(x)-k==0) return x%10;\n       return f(x\/10,k);  \/\/\u586b\u7a7a\n   }\n\n   public static void main(String[] args)\n   {\n       int x = 23513;\n       \/\/System.out.println(len(x));\n       System.out.println(f(x,3));\n   }\n}<\/code><\/pre>\n
        \u7b54\u6848\uff1af(x\/10,k)<\/code><\/p>\n<\/li>\n
      6. \n
        \u6700\u5927\u516c\u5171\u5b50\u4e32<\/p>\n
        \u6700\u5927\u516c\u5171\u5b50\u4e32\u957f\u5ea6\u95ee\u9898\u5c31\u662f:
        \n\u6c42\u4e24\u4e2a\u4e32\u7684\u6240\u6709\u5b50\u4e32\u4e2d\u80fd\u591f\u5339\u914d\u4e0a\u7684\u6700\u5927\u957f\u5ea6\u662f\u591a\u5c11
        \n\u6bd4\u5982:"abcdkkk\u201d\u548c"baabedadabc"\u53ef\u4ee5\u627e\u5230\u7684\u6700\u957f\u7684\u516c\u5171\u5b50\u4e32\u662f"abcd",\u6240\u4ee5\u6700\u5927\u516c\u5171\u5b50\u4e32\u957f\u5ea6\u4e3a 4.
        \n\u4e0b\u9762\u7684\u7a0b\u5e8f\u662f\u91c7\u7528\u77e9\u9635\u6cd5\u8fdb\u884c\u6c42\u89e3\u7684\uff0c\u8fd9\u5bf9\u4e32\u7684\u89c4\u6a21\u4e0d\u5927\u7684\u60c5\u51b5\u8fd8\u662f\u6bd4\u8f83\u6709\u6548\u7684\u89e3\u6cd5.
        \n\u8bf7\u5206\u6790\u8be5\u89e3\u6cd5\u7684\u601d\u8def\uff0c\u5e76\u8865\u5168\u5212\u7ebf\u90e8\u5206\u7f3a\u5931\u7684\u4ee3\u7801<\/p>\n
        public class ZuiDaGongGongZiChuan {\nstatic int f(String s1, String s2)\n{\n    char[] c1 = s1.toCharArray();\/\/abcdkkk\n    char[] c2 = s2.toCharArray();\/\/baabcdadabc\n    \/\/\u4e8c\u7ef4\u6570\u7ec4a\u8981\u591a\u51fa1\u5217\uff0c\u56e0\u4e3a\u4e0b\u9762\u7684\u5faa\u73af\uff0c\u5982\u679c\u4e24\u4e2a\u6570\u76f8\u7b49\uff0c\u5219\u628a\u6570\u52a0\u5230\u540e\u4e00\u4e2a\n    int[][] a = new int[c1.length+1][c2.length+1];\n\n    int max = 0;\n    for(int i=1; i max) \/\/\u4ece\u8fd9\u91cca[i][j]\u7684\u5224\u65ad\uff0c\u53ef\u4ee5\u63a8\u51fa\u4e0a\u4e00\u884c\u7684\u4ee3\u7801\n                    max = a[i][j];\n            }\n        }\n    }\n\n    return max;\n}\n\npublic static void main(String[] args){\n    int n = f(\"abcdkkk\", \"baabcdadabc\");\n    System.out.println(n);\n}\n}<\/code><\/pre>\n
        \u7b54\u6848\uff1aa[i-1][j-1]+1<\/code><\/p>\n<\/li>\n
      7. \n
        \u65e5\u671f\u95ee\u9898<\/p>\n
        \u5c0f\u660e\u6b63\u5728\u6574\u7406\u4e00\u6279\u5386\u53f2\u6587\u732e,\u8fd9\u4e9b\u5386\u53f2\u6587\u732e\u4e2d\u51fa\u73b0\u4e86\u5f88\u591a\u65e5\u671f\u3002\u5c0f\u660e\u77e5\u9053\u8fd9\u4e9b\u65e5\u671f\u90fd\u5728 1960\u5e74 1 \u6708 1 \u65e5\u81f3 2059 \u5e74 12 \u6708 31 \u65e5\u3002\u4ee4\u5c0f\u660e\u5934\u75bc\u7684\u662f\uff0c\u8fd9\u4e9b\u65e5\u671f\u91c7\u7528\u7684\u683c\u5f0f\u975e\u5e38\u4e0d\u7edf\u4e00\uff0c\u6709\u91c7\u7528\u5e74\/\u6708\/\u65e5\u7684\uff0c\u6709\u91c7\u7528\u6708\/\u65e5\/\u5e74\u7684\uff0c\u8fd8\u6709\u91c7\u7528\u65e5\/\u6708\/\u5e74\u7684\u3002\u66f4\u52a0\u9ebb\u70e6\u7684\u662f\uff0c\u5e74\u4efd\u4e5f\u90fd\u7701\u7565\u4e86\u524d\u4e24\u4f4d\uff0c\u4f7f\u5f97\u6587\u732e\u4e0a\u7684\u4e00\u4e2a\u65e5\u671f\uff0c\u5b58\u5728\u5f88\u591a\u53ef\u80fd\u7684\u65e5\u671f\u4e0e\u5176\u5bf9\u5e94.
        \n\u6bd4\u5982 02\/03\/04\uff0c\u53ef\u80fd\u662f 2002 \u5e74 03 \u6708 04 \u65e5\u30012004 \u5e74 02 \u6708 03 \u65e5\u6216 2004 \u5e74 03 \u6708 02 \u65e5
        \n\u7ed9\u51fa\u4e00\u4e2a\u6587\u732e\u4e0a\u7684\u65e5\u671f\uff0c\u4f60\u80fd\u5e2e\u52a9\u5c0f\u660e\u5224\u65ad\u6709\u54ea\u4e9b\u53ef\u80fd\u7684\u65e5\u671f\u5bf9\u5176\u5bf9\u5e94\u5417?<\/p>\n
        public class RiQiWenTi {\n   static int[] m = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n   static List list = new ArrayList<>();    \/\/ list\n   static TreeSet set = new TreeSet<>();    \/\/ set \u4f1a\u53bb\u91cd\uff0c\u5e76\u81ea\u52a8\u6392\u597d\u5e8f\n\n   \/\/ \u5224\u65ad\u95f0\u5e74\n   static int judge(int year) {\n       if (year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) return 1;\n       return 0;\n   }\n\n   \/\/ \u83b7\u53d6\u6bcf\u4e2a\u6708\u7684\u5929\u6570\n   static int getDays(int year, int month) {\n       if (month == 2) return 28 + judge(year);\n       return m[month];\n   }\n\n   static void func(int year, int month, int day) {\n       if (year <= 59)\n           year = year + 2000;\n       else\n           year = year + 1900;\n       if (month <= 12 && month >= 1 && getDays(year, month) >= day && day > 0) {\n           if (month < 10 && day < 10)\n               set.add(Integer.parseInt(\"\" + year + \"0\" + month + \"0\" + day));\n           else if (month < 10)\n               set.add(Integer.parseInt(\"\" + year + \"0\" + month + day));\n           else if (day < 10)\n               set.add(Integer.parseInt(\"\" + year + month + \"0\" + day));\n           else\n               set.add(Integer.parseInt(\"\" + year + month + day));\n       }\n   }\n   public static void main(String[] args) {\n       Scanner scanner = new Scanner(System.in);\n       String str;\n       str = scanner.next();\n       int a, b, c;\n       String[] s = str.split(\"\/\");\n       a = Integer.parseInt(s[0]);\n       b = Integer.parseInt(s[1]);\n       c = Integer.parseInt(s[2]);\n       \/\/ AA\/BB\/CC  CC\/AA\/BB  CC\/BB\/AA\n       func(a, b, c);\n       func(c, a, b);\n       func(c, b, a);\n       list.addAll(set);\n       for (int i = 0; i < list.size(); i++) {\n           String result = \"\" + list.get(i);\n           System.out.println(result.substring(0, 4) + \"-\" + result.substring(4, 6) + \"-\" + result.substring(6, 8));\n       }\n   }\n}<\/code><\/pre>\n
        \u6d4b\u8bd5\u7528\u4f8b\uff1a\u8f93\u5165\uff1a02\/03\/04\uff0c\u8f93\u51fa\uff1a2002-03-04\\n2004-02-03\\n2004-03-02<\/p>\n<\/li>\n
      8. \n
        \u5305\u5b50\u51d1\u6570<\/p>\n
        \u5c0f\u660e\u51e0\u4e4e\u6bcf\u5929\u65e9\u6668\u90fd\u4f1a\u5728\u4e00\u5bb6\u5305\u5b50\u94fa\u5403\u65e9\u9910\u3002\u4ed6\u53d1\u73b0\u8fd9\u5bb6\u5305\u5b50\u94fa\u6709 N \u79cd\u84b8\u7b3c\uff0c\u5176\u4e2d\u7b2ci\u79cd\u84b8\u7b3c\u6070\u597d\u80fd\u653e Ai \u4e2a\u5305\u5b50\u3002\u6bcf\u79cd\u6155\u7b3c\u90fd\u6709\u975e\u5e38\u591a\u7b3c\uff0c\u53ef\u4ee5\u8ba4\u4e3a\u662f\u65e0\u9650\u7b3c.
        \n\u6bcf\u5f53\u6709\u987e\u5ba2\u60f3\u4e70 X \u4e2a\u5305\u5b50\uff0c\u5b9e\u5305\u5b50\u7684\u5927\u53d4\u5c31\u4f1a\u8fc5\u901f\u9009\u51fa\u82e5\u5e72\u7b3c\u5305\u5b50\u6765\uff0c\u4f7f\u5f97\u8fd9\u82e5\u5e72\u7b3c\u4e2d\u6070\u597d\u4e00\u5171\u6709X\u4e2a\u5305\u5b50\uff0c\u6bd4\u5982\u4e00\u5171\u67093 \u79cd\u84b8\u7b3c\uff0c\u5206\u522b\u80fd\u653e3\u30014\u548c5 \u4e2a\u5305\u5b50\u5f53\u987e\u5ba2\u60f3\u4e70 11 \u4e2a\u5305\u5b50\u65f6\uff0c\u5927\u53d4\u5c31\u4f1a\u9009 2 \u7b3c 3 \u4e2a\u7684\u518d\u52a01 \u7b3c  \u4e2a\u7684(\u4e5f\u53ef\u80fd\u9009\u51fa 1\u7b3c 3 \u4e2a\u7684\u518d\u52a02 \u7b3c4 \u4e2a\u7684)
        \n\u5f53\u7136\u6709\u65f6\u5305\u5b50\u5927\u53d4\u65e0\u8bba\u5982\u4f55\u4e5f\u51d1\u4e0d\u51fa\u987e\u5ba2\u60f3\u4e70\u7684\u6570\u91cf\u3002\u6bd4\u5982\u4e00\u5171\u6709 3 \u79cd\u84b8\u7b3c\uff0c\u5206\u522b\u80fd\u653e 4.
        \n5 \u548c 6 \u4e2a\u5305\u5b50\u3002\u800c\u987e\u5ba2\u60f3\u4e70 7\u4e2a\u5305\u5b50\u65f6\uff0c\u5927\u53d4\u5c31\u51d1\u4e0d\u51fa\u6765\u4e86.
        \n\u5c0f\u660e\u60f3\u77e5\u9053\u4e00\u5171\u6709\u591a\u5c11\u79cd\u6570\u76ee\u662f\u5305\u5b50\u5927\u53d4\u51d1\u4e0d\u51fa\u6765\u7684\u3002<\/p>\n
        public class BaoZiCouShu {\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    int a[] = new int[101];\n\n    for (int i = 1; i <= n; i++)\n        a[i] = sc.nextInt();\n    int yueshu = a[1];\n    for (int i = 2; i <= n; i++) {\n        yueshu = yue(yueshu, a[i]);\n    }\n    if (yueshu != 1) {\n        System.out.println(\"INF\");\n    } else {\n        boolean dp[] = new boolean[10010];\n        dp[0] = true;\n        for (int i = 1; i <= n; i++) {\n            for (int j = 0; j + a[i] <= 10000; j++) {\n                if (dp[j]) {\n                    dp[j + a[i]] = true;\n                }\n            }\n        }\n        int sum = 0;\n        for (int i = 0; i <= 10000; i++)\n            if (dp[i] == false)\n                sum++;\n        System.out.println(sum);\n    }\n}\n\nprivate static int yue(int x, int y) {\n    if (y == 0)\n        return x;\n    else\n        return yue(y, x % y);\n}\n}<\/code><\/pre>\n
        \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1a\u8f93\u5165\uff1a2 4 5\uff0c\u8f93\u51fa\uff1a6\uff1bcase 2\uff1a\u8f93\u5165\uff1a2 4 6\uff0c\u8f93\u51fa\uff1aINF<\/p>\n<\/li>\n
      9. \n
        \u5206\u5de7\u514b\u529b<\/p>\n
        \u513f\u7ae5\u8282\u90a3\u5929\u6709 K \u4f4d\u5c0f\u670b\u53cb\u5230\u5c0f\u660e\u5bb6\u505a\u5ba2\u3002\u5c0f\u660e\u62ff\u51fa\u4e86\u73cd\u85cf\u7684\u5de7\u514b\u529b\u62db\u5f85\u5c0f\u670b\u53cb\u4eec.\u5c0f\u660e\u4e00\u5171\u6709 N \u5757\u5de7\u514b\u529b\uff0c\u5176\u4e2d\u7b2c i\u5757\u662f Hix Wi \u7684\u65b9\u683c\u7ec4\u6210\u7684\u957f\u65b9\u5f62
        \n\u4e3a\u4e86\u516c\u5e73\u8d77\u89c1\uff0c\u5c0f\u660e\u9700\u8981\u4ece\u8fd9 N \u5757\u5de7\u514b\u529b\u4e2d\u5207\u51fa K \u5757\u5de7\u514b\u529b\u5206\u7ed9\u5c0f\u670b\u53cb\u4eec\u3002\u5207\u51fa\u7684\u5de7\u514b\u529b\u9700\u8981\u6ee1\u8db3:
        \n1.\u5f62\u72b6\u662f\u6b63\u65b9\u5f62\uff0c\u8fb9\u957f\u662f\u6574\u6570
        \n2.\u5927\u5c0f\u76f8\u540c
        \n\u4f8b\u5982\u4e00\u5757 6x5 \u7684\u5de7\u514b\u529b\u53ef\u4ee5\u5207\u51fa 6 \u5757 2x2 \u7684\u5de7\u514b\u529b\u6216\u8005 2 \u5757 3x3 \u7684\u5de7\u514b\u529b
        \n\u5f53\u7136\u5c0f\u670b\u53cb\u4eec\u90fd\u5e0c\u671b\u5f97\u5230\u7684\u5de7\u514b\u529b\u5c3d\u53ef\u80fd\u5927\uff0c\u4f60\u80fd\u5e2e\u5c0f Hi \u8ba1\u7b97\u51fa\u6700\u5927\u7684\u8fb9\u957f\u662f\u591a\u5c11\u4e48?<\/p>\n
        public class FenQiaoKeLi {\nstatic int n , k;\/\/n\u5757\u5de7\u514b\u529b\uff0ck\u4e2a\u5c0f\u670b\u53cb\n   static int[] w=new int[100001];\/\/\u8bb0\u5f55\u6bcf\u5757\u5de7\u514b\u529b\u7684\u5bbd\uff0c\u4ee5\u6700\u5927\u6570\u636e\u5f00\u8f9f\u7a7a\u95f4\n   static int[] h=new int[100001];\/\/\u8bb0\u5f55\u6bcf\u4e00\u5757\u5de7\u514b\u529b\u7684\u9ad8\uff0c\u4ee5\u6700\u5927\u6570\u636e\u5f00\u8f9f\u7a7a\u95f4\n   static int N = 100001;\/\/\u6700\u5927\u6570\u636e\n   \/\/\u5224\u65ad\u548c\u662f\u5426\u6ee1\u8db3k\u4e2a\u5c0f\u670b\u53cb\u5206\n   public static int getsum(int u){\/\/\u53c2\u6570u\u5c31\u662f\u6240\u9009\u7684\u8fb9\u957f\n       int sum = 0;\n       for(int i = 0 ; i=k){\/\/\u5224\u65ad\u4ee5\u6b64\u4e2d\u4f4d\u6570\u4e3a\u8fb9\u957f\u8fdb\u884c\u5207\u5272\u65f6\uff0c\u6bcf\u5757\u5de7\u514b\u529b\u7684\u5207\u5272\u4e2a\u6570\u662f\u5426\u80fd\u591fk\u4e2a\u5c0f\u670b\u53cb\u5206\n               left=mid;\/\/\u82e5\u80fd\u591fk\u4e2a\u5c0f\u670b\u53cb\u5206\uff0c\u5c06\u5de6\u7aef\u70b9\u7b49\u4e8e\u4e2d\u95f4\u503c\u8fdb\u884c\u4e0b\u4e00\u6b21\u66f4\u65b0\uff08mid = (left + right + 1)\/2\uff09\u4e2d\u95f4\u503c\uff0c\u76f4\u5230\u627e\u5230\u8fb9\u957f\u6700\u5927\u7684\u4e34\u754c\u503c\n           }else{\n               right = mid-1;\/\/\u82e5\u4e0d\u80fd\u591fk\u4e2a\u5c0f\u670b\u53cb\u5206\uff0c\u5219\u6240\u9009\u8fb9\u957f\u8fc7\u5927\uff0c\u53f3\u7aef\u70b9\u8981\u5411\u5de6\u79fb\uff0c\u76f4\u5230\u627e\u5230\u6ee1\u8db3\u7684\u6700\u5927\u8fb9\u957f\n           }\n\n       }\n       System.out.println(left);\n   }\n}<\/code><\/pre>\n
        \u6d4b\u8bd5\u7528\u4f8b\uff1a\u8f93\u5165\uff1a2 10 6 5 5 6\uff0c\u8f93\u51fa\uff1a2<\/p>\n<\/li>\n
      10. \n
        k\u500d\u533a\u95f4<\/p>\n
        \u7ed9\u5b9a\u4e00\u4e2a\u957f\u5ea6\u4e3a N \u7684\u6570\u5217,A1,A2,... AN,\u5982\u679c\u5176\u4e2d\u4e00\u6bb5\u8fde\u7eed\u7684\u5b50\u5e8f\u5217 Ai, Ai+,.. Aj<=j)\u4e4b\u548c\u662f K \u7684\u500d\u6570\uff0c\u6211\u4eec\u5c31\u79f0\u8fd9\u4e2a\u533a\u95f4[i,]\u662f K \u500d\u533a\u95f4
        \n\u4f60\u80fd\u6c42\u51fa\u6570\u5217\u4e2d\u603b\u5171\u6709\u591a\u5c11\u4e2a K \u500d\u533a\u95f4\u5417?<\/p>\n
        public static void main(String[] args) {\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt(), k = sc.nextInt();\nlong ans = 0;\nint[] sum = new int[n + 1];\nint[] count = new int[100000];\nfor (int i = 1; i <= n; i++)\n    sum[i] = (sum[i - 1] + sc.nextInt()) % k;\ncount[0] = 1;\nfor (int i = 1; i <= n; i++)\n    ans += count[sum[i]]++;\nSystem.out.println(ans);\n}<\/code><\/pre>\n
        \u6d4b\u8bd5\u7528\u4f8b\uff1a\u8f93\u5165\uff1a5 2 1 2 3 4 5\uff0c\u8f93\u51fa\uff1a6<\/p>\n<\/li>\n<\/ol>\n
        \n
        \u7b2c\u4e5d\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef679)<\/a><\/h3>\n
          \n
        1. \n
          \u54ea\u5929\u8fd4\u56de<\/p>\n
          \u5c0f\u660e\u88ab\u4e0d\u660e\u52bf\u529b\u52ab\u6301\uff0e\u540e\u88ab\u6254\u5230x\u661f\u7ad9\u518d\u65e0\u95ee\u6d25.\u5c0f\u660e\u5f97\u77e5\u6bcf\u5929\u90fd\u6709\u98de\u8239\u98de\u5f80\u5730\u7403\uff0c\u4f46\u9700\u8981108\u5143\u7684\u8239\u7968\uff0c\u800c\u4ed6\u5374\u8eab\u65e0\u5206\u6587.
          \n\u4ed6\u51b3\u5b9a\u5728x\u661f\u6218\u6253\u5de5\uff0e\u597d\u5fc3\u7684\u8001\u677f\u7b54\u5e94\u5305\u98df\u5bbf\uff0c\u7b2c1\u5929\u7ed9\u4ed6\u2160\u5143\u94b1.\u5e76\u4e14\uff0c\u4ee5\u540e\u7684\u6bcf\u4e00\u5929\u90fd\u6bd4\u524d\u4e00\u5929\u591a2\u5143\u94b1\uff0c\u76f4\u5230\u4ed6\u6709\u8db3\u591f\u7684\u94b1\u4e70\u7968.\u8bf7\u8ba1\u7b97\u4e00\u4e0b\uff0c\u5c0f\u660e\u5728\u7b2c\u51e0\u5929\u5c31\u80fd\u51d1\u591f108\u5143\uff0c\u8fd4\u56de\u5730\u7403.<\/p>\n
          public class NaTianFanHui {\npublic static void main(String[] args) {\n       int i = 1, num = 1, sum = 1;\n       while (sum < 108) {\n           sum += num += 2;\n           i++;\n       }\n       System.out.print(i);\n   }\n}<\/code><\/pre>\n
          \u7b54\u6848\uff1a11<\/strong><\/p>\n<\/li>\n
        2. \n
          \u7334\u5b50\u5206\u9999\u8549<\/p>\n
          5\u53ea\u7334\u5b50\u662f\u597d\u670b\u53cb\uff0c\u5728\u6d77\u8fb9\u7684\u6930\u5b50\u6811\u4e0a\u7761\u7740\u4e86.\u8fd9\u671f\u95f4\uff0c\u6709\u5546\u8239\u628a\u4e00\u5927\u5806\u9999\u8549\u5fd8\u8bb0\u5728\u6c99\u6ee9\u4e0a\u79bb\u53bb.
          \n\u7b2c1\u53ea\u7334\u5b50\u9192\u6765,\u628a\u9999\u8549\u5747\u5206\u62105\u5806,\u8fd8\u5269\u4e0b1\u4e2a,\u5c31\u5403\u6389\u5e76\u628a\u81ea\u5df1\u7684\u4e00\u4efd\u85cf\u8d77\u6765\u7ee7\u7eed\u7761\u89c9.\u7b2c\u2489\u53ea\u7334\u5b50\u9192\u6765\uff0c\u91cd\u65b0\u628a\u9999\u8549\u5747\u5206\u62105\u5806\uff0c\u8fd8\u5269\u4e0b2\u4e2a\uff0c\u5c31\u5403\u6389\u5e76\u628a\u81ea\u5df1\u7684\u4e00\u4efd\u85cf\u8d77\u6765\u7ee7\u7eed\u7761\u89c9.
          \n\u7b2c3\u53ea\u7334\u5b50\u9192\u6765\uff0c\u91cd\u65b0\u628a\u9999\u8549\u5747\u5206\u62105\u5806\uff0c\u8fd8\u5269\u4e0b3\u4e2a\uff0c\u5c31\u5403\u6389\u5e76\u628a\u81ea\u5df1\u7684\u4e00\u4efd\u85cf\u8d77\u6765\u7ee7\u7eed\u7761\u89c9.
          \n\u7b2c4\u53ea\u7334\u5b50\u9192\u6765\uff0c\u91cd\u65b0\u628a\u9999\u8549\u5747\u5206\u62105\u5806\uff0c\u8fd8\u5269\u4e0b4\u4e2a\uff0c\u5c31\u5403\u6389\u5e76\u628a\u81ea\u5df1\u7684\u4e00\u4efd\u85cf\u8d77\u6765\u7ee7\u7eed\u7761\u89c9\uff0e
          \n\u7b2c5\u53ea\u7334\u5b50\u9192\u6765\uff0c\u91cd\u65b0\u628a\u9999\u8549\u5747\u5206\u62105\u5806\uff0c\u54c8\u54c8\uff0c\u6b63\u597d\u4e0d\u5269!
          \n\u8bf7\u8ba1\u7b97\u4e00\u5f00\u59cb\u6700\u5c11\u6709\u591a\u5c11\u4e2a\u9999\u8549.<\/p>\n
          public class HouZiFenXiangJiao {\npublic static void main(String[] args) {\n       int i, n;\n       for (i = n = 1; true; n = ++i) {\n           if (n % 5 != 1) continue;\n           n = n \/ 5 * 4;\n           if (n % 5 != 2) continue;\n           n = n \/ 5 * 4;\n           if (n % 5 != 3) continue;\n           n = n \/ 5 * 4;\n           if (n % 5 != 4) continue;\n           n = n \/ 5 * 4;\n           if (n > 0 && n % 5 == 0) break;\n       }\n       System.out.print(i);\n   }\n}<\/code><\/pre>\n
          \u7b54\u6848\uff1a3141<\/strong><\/p>\n<\/li>\n
        3. \n
          \u5b57\u6bcd\u9635\u5217<\/p>\n
          \u4ed4\u7ec6\u5bfb\u627e\uff0c\u4f1a\u53d1\u73b0:\u5728\u4e0b\u9762\u76848x8\u7684\u65b9\u9635\u4e2d\uff0c\u9690\u85cf\u7740\u5b57\u6bcd\u5e8f\u5217: "LANQIAO".<\/p>\n
          <\/div><\/p>\n
          \u6211\u4eec\u7ea6\u5b9a:\u5e8f\u5217\u53ef\u4ee5\u6c34\u5e73\uff0c\u5782\u76f4\uff0c\u6216\u8005\u662f\u659c\u5411;\u5e76\u4e14\u8d70\u5411\u4e0d\u9650\uff08\u5b9e\u9645\u4e0a\u5c31\u662f\u6709\u4e00\u51718\u79cd\u65b9\u5411).\u4e0a\u56fe\u4e2d\u4e00\u5171\u67094\u4e2a\u6ee1\u8db3\u8981\u6c42\u7684\u4e32.
          \n\u4e0b\u9762\u6709\u4e00\u4e2a\u66f4\u5927\u7684(100x100)\u7684\u5b57\u6bcd\u65b9\u9635.\u4f60\u80fd\u7b97\u51fa\u5176\u4e2d\u9690\u85cf\u4e86\u591a\u5c11\u4e2a\u201cLANQIAO\u201d\u5417?<\/p>\n
          <\/div><\/p>\n
          public class ZiMuZhenLie {\npublic static void main(String[] args) {\n\n       \/\/\u5b9a\u4e49\u4e00\u4e2a100\u00d7100\u7684\u5b57\u6bcd\u77e9\u9635\n       char[][] data=new char[100][100];\n       \/\/\u5b9a\u4e49\u4e00\u4e2a\u65b9\u5411\u6570\u7ec4,8\u4e2a\u65b9\u5411\n       int [][]next=new int[][]{{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};\n       Scanner sc=new Scanner(System.in);\n       for (int i = 0; i <100 ; i++) {\n           data[i]=sc.next().toCharArray();\n       }\n       sc.close();\n\n       char[] fn=new char[]{'L','A','N','Q','I','A','O'};\n       for (int i = 0; i <100 ; i++) {\n           for (int j = 0; j <100 ; j++) {\n               if (data[i][j]=='L')\n               {\n                    dfs(1,i,j,data,next,fn);\n               }\n           }\n       }\n       System.out.println(count);\n\n   }\n   static  int count=0;\n   \/\/\u5206\u522b\u5bf98\u4e2a\u65b9\u5411\u8fdb\u884c\u5bfb\u627e\u6ee1\u8db3\u6761\u4ef6\u7684\u5b57\u4e32\n   public static  void dfs(int step,int i,int j,char [][]data,int [][]next,char[] fn)\n   {\n\n       int tx;\n       int ty;\n       tx=i;\n       ty=j;\n        \/\/\u987a\u65f6\u9488\u65b9\u5411\n       \/\/\u9996\u5148\u5411\u4e0a,\u518d\u5411\u53f3\u4e0a.....\n       for (int k = 0; k <8 ; k++) {\n           while(step!=7)\n           {\n               tx=tx+next[k][0];\n               ty=ty+next[k][1];\n               if (tx<0||ty<0||tx>=data.length||ty>= data[0].length)\n               {\n                   break;\n               }\n               if (data[tx][ty]==fn[step])\n               {\n                   step++;\n               }\n               else{\n                   break;\n               }\n               if (step==7)\n               {\n                   count++;\n               }\n           }\n           \/\/\u8fd9\u91cc\u6ce8\u610f\u6bcf\u4e2a\u65b9\u5411\u5c1d\u8bd5\u540e\u8981\u521d\u59cb\u5316\u539f\u70b9\u4f4d\u7f6e\u4ee5\u53ca\u6b65\u6570\n           tx=i;\n           ty=j;\n           step=1;\n       }\n   }\n}<\/code><\/pre>\n
          \u7b54\u6848\uff1a41<\/strong><\/p>\n
          \u5907\u6ce8\uff1a\u8fd0\u884c\u65f6\u628a\u56fe\u4e2d\u5b57\u6bcd\u9635\u5217\u8f93\u5165<\/p>\n<\/li>\n
        4. \n
          \u7b2c\u51e0\u4e2a\u5e78\u8fd0\u6570<\/p>\n
          \u5230x\u661f\u7403\u65c5\u884c\u7684\u6e38\u5ba2\u90fd\u88ab\u53d1\u7ed9\u4e00\u4e2a\u6574\u6570\uff0c\u4f5c\u4e3a\u6e38\u5ba2\u7f16\u53f7.x\u661f\u7684\u56fd\u738b\u6709\u4e2a\u602a\u7656\uff0c\u4ed6\u53ea\u559c\u6b22\u6570\u5b573,5\u548c7.
          \n\u56fd\u738b\u89c4\u5b9a\uff0c\u6e38\u5ba2\u7684\u7f16\u53f7\u5982\u679c\u53ea\u542b\u6709\u56e0\u5b50:3,5,7,\u5c31\u53ef\u4ee5\u83b7\u5f97\u4e00\u4efd\u5956\u54c1.
          \n\u6211\u4eec\u6765\u770b\u524d10\u4e2a\u5e78\u8fd0\u6570\u5b57\u662f:
          \n3 5 79 15 21 25 27 3545
          \n\u56e0\u800c\u7b2c11\u4e2a\u5e78\u8fd0\u6570\u5b57\u662f:49
          \n\u5c0f\u660e\u9886\u5230\u4e86\u4e00\u4e2a\u5e78\u8fd0\u6570\u5b5759084709587505\uff0c\u4ed6\u53bb\u9886\u5956\u7684\u65f6\u5019\uff0c\u4eba\u5bb6\u8981\u6c42\u4ed6\u51c6\u786e\u5730\u8bf4\u51fa\u8fd9\u662f\u7b2c\u51e0\u4e2a\u5e78\u8fd0\u6570\u5b57\uff0c\u5426\u5219\u9886\u4e0d\u5230\u5956\u54c1.
          \n\u8bf7\u4f60\u5e2e\u5c0f\u660e\u8ba1\u7b97\u4e00\u4e0b\uff0c59084709587505\u662f\u7b2c\u51e0\u4e2a\u5e78\u8fd0\u6570\u5b57.<\/p>\n
          public class DiJiGeXingYunShu {\npublic static void main(String[] args) {\n       long n = 59084709587505L, cnt = 0;\n       for (long a = 1; a <= n; a *= 3)\n           for (long b = 1; b <= n; b *= 5)\n               for (long c = 1; c <= n; c *= 7)\n                   if (a * b * c <= n && a * b * c > 0) cnt++;\n       System.out.print(cnt - 1);\n   }\n}<\/code><\/pre>\n
          \u7b54\u6848\uff1a1905<\/strong><\/p>\n<\/li>\n
        5. \n
          \u4e66\u53f7\u9a8c\u8bc1<\/p>\n
          2004\u5e74\u8d77\uff0c\u56fd\u9645ISBN\u4e2d\u5fc3\u51fa\u7248\u4e86\u300a13\u4f4d\u56fd\u9645\u6807\u51c6\u4e66\u53f7\u6307\u5357\u300b.\u539f\u670910\u4f4d\u4e66\u53f7\u524d\u52a0978\u4f5c\u4e3a\u5546\u54c1\u5206\u7c7b\u6807\u8bc6;\u6821\u9a8c\u89c4\u5219\u4e5f\u6539\u53d8.\u6821\u9a8c\u4f4d\u7684\u52a0\u6743\u7b97\u6cd5\u4e0e10\u4f4d.ISBN\u7684\u7b97\u6cd5\u4e0d\u540c\uff0c\u5177\u4f53\u7b97\u6cd5\u662f:
          \n\u75281\u5206\u522b\u4e58ISBN\u7684\u524d12\u4f4d\u4e2d\u7684\u5947\u6570\u4f4d(\u4ece\u5de6\u8fb9\u5f00\u59cb\u6570\u8d77)\uff0c\u75283\u4e58\u4ee5\u5076\u6570\u4f4d\uff0c\u4e58\u79ef\u4e4b\u548c\u4ee510\u4e3a\u6a21,10\u4e0e\u6a21\u503c\u7684\u5dee\u503c\u518d\u5bf910\u53d6\u6a21(\u5373\u53d6\u4e2a\u4f4d\u7684\u6570\u5b57\uff09\u5373\u53ef\u5f97\u5230\u6821\u9a8c\u4f4d\u7684\u503c\uff0c\u5176\u503c\u8303\u56f4\u5e94\u8be5\u4e3a0~9.<\/p>\n
          public class ShuHaoYanZheng {\nstatic boolean f(String s){\n       int k=1;\n       int sum = 0;\n       for(int i=0; i12) break; \n       }\n\n       return s.charAt(s.length()-1)-'0' == (10-sum % 10)%10;\n   }\n\n   public static void main(String[] args){\n       System.out.println(f(\"978-7-301-04815-3\"));\n       System.out.println(f(\"978-7-115-38821-6\"));\n   }\n}<\/code><\/pre>\n
          \u7b54\u6848\uff1a(c - '0') * (1 == (k & 1)? 1: 3)<\/code><\/p>\n<\/li>\n
        6. \n
          \u6253\u5370\u5927X<\/p>\n
          \u5982\u4e0b\u7684\u7a0b\u5e8f\u76ee\u7684\u662f\u5728\u63a7\u5236\u53f0\u6253\u5370\u8f93\u51fa\u5927X.\u53ef\u4ee5\u63a7\u5236\u4e24\u4e2a\u53c2\u6570:\u56fe\u5f62\u7684\u9ad8\u5ea6\uff0c\u4ee5\u53ca\u7b14\u5bbd.
          \n\u7528\u7a0b\u5e8f\u4e2d\u7684\u6d4b\u8bd5\u6570\u636e\u8f93\u51fa\u6548\u679c:
          \n(\u5982\u679c\u663e\u793a\u6709\u95ee\u9898\uff0c\u53ef\u4ee5\u53c2\u770bp1.png)<\/p>\n
          <\/div><\/p>\n
          static void f(int h, int w){\n       System.out.println(String.format(\"\u9ad8\u5ea6=%d, \u7b14\u5bbd=%d\",h,w));\n       int a1 = 0;\n       int a2 = h - 1;\n\n       for(int k=0; k<\/pre>\n
          \u7b54\u6848\uff1awhile (p++ < q) System.out.print("*")<\/code><\/p>\n
          \u5907\u6ce8\uff1a\u548c\u7b2c\u516d\u5c4a\u7b2c\u4e5d\u9898\u4e00\u6837<\/p>\n<\/li>\n
        7. \n
          \u7f29\u4f4d\u6c42\u548c<\/p>\n
          \u5728\u7535\u5b50\u8ba1\u7b97\u673a\u666e\u53ca\u4ee5\u524d\uff0c\u4eba\u4eec\u7ecf\u5e38\u7528\u4e00\u4e2a\u7c97\u7565\u7684\u65b9\u6cd5\u6765\u9a8c\u7b97\u56db\u5219\u8fd0\u7b97\u662f\u5426\u6b63\u786e.\u6bd4\u5982:248* 15= 3720
          \n\u628a\u4e58\u6570\u548c\u88ab\u4e58\u6570\u5206\u522b\u9010\u4f4d\u6c42\u548c\uff0c\u5982\u679c\u662f\u591a\u4f4d\u6570\u518d\u9010\u4f4d\u6c42\u548c\uff0c\u76f4\u5230\u662f1\u4f4d\u6570\uff0c\u5f97<\/p>\n
          2\uff0b4+8= 14 ==> 1\uff0b4= 5;
          \n1\uff0b5=6
          \n5  6
          \n\u800c\u7ed3\u679c\u9010\u4f4d\u6c42\u548c\u4e3a3
          \n5<\/em>6 \u7684\u7ed3\u679c\u9010\u4f4d\u6c42\u548c\u4e0e3\u7b26\u5408\uff0c\u8bf4\u660e\u6b63\u786e\u7684\u53ef\u80fd\u6027\u5f88\u5927!!(\u4e0d\u80fd\u6392\u9664\u9519\u8bef)
          \n\u8bf7\u4f60\u5199\u4e00\u4e2a\u8ba1\u7b97\u673a\u7a0b\u5e8f\uff0c\u5bf9\u7ed9\u5b9a\u7684\u5b57\u7b26\u4e32\u9010\u4f4d\u6c42\u548c:
          \n\u8f93\u5165\u4e3a\u4e00\u4e2a\u7531\u6570\u5b57\u7ec4\u6210\u7684\u4e32\uff0c\u8868\u793an\u4f4d\u6570(n<1000);\u8f93\u51fa\u4e3a\u4e00\u4f4d\u6570\uff0c\u8868\u793a\u53cd\u590d\u9010\u4f4d\u6c42\u548c\u7684\u7ed3\u679c.<\/p>\n
          public class SuoWeiQiuHe {\npublic static void main(String[] args) throws IOException {\n       byte[] buff = new byte[1024];\n       int len = System.in.read(buff);\n       int[] a = new int[len];\n       for (int i = 0; i < len; i++)\n           a[i] = byteToValue(buff[i]);\n       while (len > 1) {\n           for (int i = 1; i < len; i++) a[0] += a[i];\n           for (int i = 0, pre = a[0]; pre != 0; len = ++i) {\n               a[i] = pre % 10;\n               pre \/= 10;\n           }\n       }\n       System.out.print(a[0]);\n   }\n\n   static int byteToValue(byte n) { return n > '0' && n < '9'? n & 0xf: 0;\n   }\n}<\/code><\/pre>\n
          \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1aInput\uff1a35379\uff0cOutput\uff1a9\uff1bcase 2\uff1aInput\uff1a7583676109608471656473500295825\uff0cOutput\uff1a1<\/p>\n<\/li>\n
        8. \n
          \u7b49\u8170\u4e09\u89d2\u5f62<\/p>\n
          \u672c\u9898\u76ee\u8981\u6c42\u4f60\u5728\u63a7\u5236\u53f0\u8f93\u51fa\u4e00\u4e2a\u7531\u6570\u5b57\u7ec4\u6210\u7684\u7b49\u8170\u4e09\u89d2\u5f62.\u5177\u4f53\u7684\u6b65\u9aa4\u662f:
          \n1.\u5148\u75281,2,3\uff0c...\u7684\u81ea\u7136\u6570\u62fc\u4e00\u4e2a\u8db3\u591f\u957f\u7684\u4e32
          \n2.\u7528\u8fd9\u4e2a\u4e32\u586b\u5145\u4e09\u89d2\u5f62\u7684\u4e09\u6761\u8fb9\uff0e\u4ece\u4e0a\u65b9\u9876\u70b9\u5f00\u59cb\uff0c\u9006\u65f6\u9488\u586b\u5145.\u6bd4\u5982\uff0c\u5f53\u4e09\u89d2\u5f62\u9ad8\u5ea6\u662f8\u65f6:<\/p>\n
          <\/div><\/p>\n
          \u8f93\u5165\uff0c\u4e00\u4e2a\u6b63\u6574\u6570n(3<n<300),\u8868\u793a\u4e09\u89d2\u5f62\u7684\u9ad8\u5ea6\u8f93\u51fa\uff0c\u7528\u6570\u5b57\u586b\u5145\u7684\u7b49\u8170\u4e09\u89d2\u5f62.
          \n\u4e3a\u4e86\u4fbf\u4e8e\u6d4b\u8bc4\uff0c\u6211\u4eec\u8981\u6c42\u7a7a\u683c\u4e00\u5f8b\u7528"."\u4ee3\u66ff.<\/p>\n
          public class DengYaoSanJiaoXing {\npublic static void main(String[] args) {\n       Scanner sc=new Scanner(System.in);\n       int n=sc.nextInt();\n       \/\/\u8ba1\u7b97\u7b49\u8170\u4e09\u89d2\u5f62\u603b\u5171\u9700\u8981\u591a\u5c11\u6570\u5b57\n       int sum=4*n-4;\n       \/\/int sum = 1 + (n - 1) * 2 + (2 * n - 3);\n       String str=\"\";\n       for (int i = 1; str.length() < sum; i++) {\n           str=str+String.valueOf(i);\n       }\n       char[] ch = str.substring(0, sum).toCharArray();\n\n       \/\/\u6253\u5370\u7b2c\u4e00\u884c\n       for (int i = 0; i < n-1; i++) {\n           System.out.print(\".\");\n       }\n       System.out.println(1);\n\n       \/\/\u6253\u53702\u5230n-1\u884c\n       for (int i = 1; i < n-1; i++) {\n\n           for (int j = 0; j < n-i-1; j++) {\n               System.out.print(\".\");\n           }\n\n           System.out.print(ch[i]);\n\n           for (int j = 0; j < i*2-1; j++) {\n               System.out.print(\".\");\n           }\n           System.out.println(ch[sum-i]);\n\n       }\n\n       \/\/\u6253\u5370\u6700\u540e\u4e00\u884c4*n-4-(n-2)=3*n-2\n       for (int i = n-1; i < 3*n-2; i++) {\n           System.out.print(ch[i]);\n       }\n\n   }\n}<\/code><\/pre>\n
          \u6d4b\u8bd5\u7528\u4f8b\uff1a\u89c1\u771f\u9898\u6587\u6863\uff1ahttps:\/\/www.lanqiao.cn\/courses\/2786\/learning\/?id=67812&compatibility=false<\/a> (\u9700\u8981\u767b\u5f55)<\/p>\n<\/li>\n
        9. \n
          \u5c0f\u670b\u53cb\u5d07\u62dc\u5708<\/p>\n
          \u73ed\u91ccN\u4e2a\u5c0f\u670b\u53cb\uff0c\u6bcf\u4e2a\u4eba\u90fd\u6709\u81ea\u5df1\u6700\u5d07\u62dc\u7684\u4e00\u4e2a\u5c0f\u670b\u53cb\uff08\u4e5f\u53ef\u4ee5\u662f\u81ea\u5df1).\u5728\u4e00\u4e2a\u6e38\u620f\u4e2d\uff0c\u9700\u8981\u5c0f\u670b\u53cb\u5750\u4e00\u4e2a\u5708\uff0c
          \n\u6bcf\u4e2a\u5c0f\u670b\u53cb\u90fd\u6709\u81ea\u5df1\u6700\u5d07\u62dc\u7684\u5c0f\u670b\u53cb\u5728\u4ed6\u7684\u53f3\u624b\u8fb9.\u6c42\u6ee1\u8db3\u6761\u4ef6\u7684\u5708\u6700\u5927\u591a\u5c11\u4eba?
          \n\u5c0f\u670b\u53cb\u7f16\u53f7\u4e3a1,2,3,..N
          \n\u8f93\u5165\u7b2c\u4e00\u884c\uff0c\u4e00\u4e2a\u6574\u6570N(3<N<100000)\u63a5\u4e0b\u6765\u4e00\u884cN\u4e2a\u6574\u6570\uff0c\u7531\u7a7a\u683c\u5206\u5f00.<\/p>\n
          \u8981\u6c42\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u6ee1\u8db3\u6761\u4ef6\u7684\u6700\u5927\u5708\u7684\u4eba\u6570.<\/p>\n
          \u89e3\u91ca:
          \n\u5982\u56fep1.png\u6240\u793a\uff0c\u5d07\u62dc\u5173\u7cfb\u7528\u7bad\u5934\u8868\u793a\uff0c\u7ea2\u8272\u8868\u793a\u4e0d\u5728\u5708\u4e2d.\u663e\u7136\uff0c\u6700\u5927\u5708\u662f[2453]\u6784\u6210\u7684\u5708<\/p>\n
          <\/div><\/p>\n
          public class XiaoPengYouChongBaiQuan {\nstatic int n,now,next,max,len;\/\/\u4e2a\u6570\uff0c\u5f53\u524d\u8d77\u70b9\uff0c\u5f53\u524d\u4e0b\u4e00\u4e2a\u70b9\uff0c\u6700\u957f\u6b65\u6570\uff0c\u8bb0\u5f55\u957f\u5ea6\nstatic int flag[];\/\/\u8bb0\u5f55\u662f\u5426\u88ab\u904d\u5386\u8fc7\u4e00\u904d\nstatic int p[];\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    n = sc.nextInt();\n    p = new int[n+1];\n    flag = new int[n+1];\n    for(int i = 1;i<=n;i++){\n        p[i] = sc.nextInt();\n    }\n    for(int i =1;i<=n;i++){\n        now = i;\/\/\u5f53\u524d\u8d77\u70b9\u662fi\n        len = 0;\/\/\u6b65\u6570\u4e3a0\n        dfs(p[i]);\/\/\u4f20\u5165\u5f53\u524d\u8d77\u70b9\u7684\u4e0b\u4e00\u4e2a\u6307\u5411\n    }\n    System.out.println(max +1);\/\/\u56e0\u4e3a\u662f\u5148\u5224\u65ad\u540elen++\uff0c\u6240\u4ee5\u5c11\u52a0\u4e00\u4e2a1\n}\nprivate static void dfs(int num) {\n    len ++;\/\/\u6ca1\u627e\u4e00\u6b21\u6b65\u6570\u52a0\u4e00\n       next = p[num];\/\/\u4e0b\u4e00\u4e2a\u7684\u6307\u5411\n    if(now == next){\/\/\u5982\u679c\u4e0b\u4e00\u4e2a\u6307\u5411\u4e0e\u521d\u59cb\u503c\u76f8\u7b49\uff0c\u8bf4\u660e\u662f\u4e2a\u5708\n        max = Math.max(max,len);\/\/\u8bb0\u5f55\u6700\u5927\u6b65\u6570\n        return;\n    }\n    \/\/\u5f53\u524d\u7684\u4e0b\u4e00\u4e2a\u6307\u5411\n    if(pd(next)){\/\/\u5224\u65ad\u4e0b\u4e00\u4e2a\u662f\u5426\u4e0b\u6807\u8d8a\u754c\uff0c\u662f\u5426\u5df2\u7ecf\u88ab\u904d\u5386\u8fc7\n        flag[next] = 1;\n        dfs(next);\n    }else{\n        len = 0;\n        Arrays.fill(flag,0);\/\/\u6062\u590d\n        return;\n    }\n}\nprivate static boolean pd(int i) {\n    if(i<0 || i>=n){\n        return false;\n    }\n    if(flag[i] == 1){\/\/\u5df2\u7ecf\u88ab\u904d\u5386\u8fc7\u4e14\u4e0d\u6ee1\u8db3check\u8bf4\u660e\u9677\u5165\u4e86\u6b7b\u5faa\u73af\uff0c\u8fd4\u56defalse\n        return false;\n    }\n    return true;\n}\n}<\/code><\/pre>\n
          \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1aI\uff1a9\\n3 4 2 5 3 8 4 6 9\uff0cO\uff1a4\uff1bcase 2\uff1aI\uff1a30\\n22 28 16 6 27 21 30 1 29 10 9 14 24 11 7 2 8 5 26 4 12 3 25 18 20 19 23 17 13 15\uff0cO\uff1a16<\/p>\n<\/li>\n
        10. \n
          \u8010\u6454\u6307\u6570<\/p>\n
          x\u661f\u7403\u7684\u5c45\u6c11\u813e\u6c14\u4e0d\u592a\u597d\uff0c\u4f46\u597d\u5728\u4ed6\u4eec\u751f\u6c14\u7684\u65f6\u5019\u552f\u4e00\u7684\u5f02\u5e38\u4e3e\u52a8\u662f:\u6454\u624b\u673a.
          \n\u5404\u5927\u5382\u5546\u4e5f\u5c31\u7eb7\u7eb7\u63a8\u51fa\u5404\u79cd\u8010\u6454\u578b\u624b\u673a.x\u661f\u7403\u7684\u8d28\u76d1\u5c40\u89c4\u5b9a\u4e86\u624b\u673a\u5fc5\u987b\u7ecf\u8fc7\u8010\u6454\u6d4b\u8bd5\uff0c\u5e76\u4e14\u8bc4\u5b9a\u51fa\u4e00\u4e2a\u8010\u6454\u6307\u6570\u6765\uff0c\u4e4b\u540e\u624d\u5141\u8bb8\u4e0a\u5e02\u6d41\u901a.
          \nx\u661f\u7403\u6709\u5f88\u591a\u9ad8\u8038\u5165\u4e91\u7684\u9ad8\u5854\uff0c\u521a\u597d\u53ef\u4ee5\u7528\u6765\u505a\u8010\u6454\u6d4b\u8bd5\uff0e\u5854\u7684\u6bcf\u4e00\u5c42\u9ad8\u5ea6\u90fd\u662f\u4e00\u6837\u7684\uff0c\u4e0e\u5730\u7403\u4e0a\u7a0d\u6709\u4e0d\u540c\u7684\u662f\uff0c\u4ed6\u4eec\u7684\u7b2c\u4e00\u5c42\u4e0d\u662f\u5730\u9762\uff0c\u800c\u662f\u76f8\u5f53\u4e8e\u6211\u4eec\u76842\u697c\uff0e
          \n\u5982\u679c\u624b\u673a\u4ece\u7b2c7\u5c42\u6254\u4e0b\u53bb\u6ca1\u6454\u574f\uff0c\u4f46\u7b2c8\u5c42\u6454\u574f\u4e86\uff0c\u5219\u624b\u673a\u8010\u6454\u6307\u6570=7.\u7279\u522b\u5730,\u5982\u679c\u624b\u673a\u4ece\u7b2c1\u5c42\u6254\u4e0b\u53bb\u5c31\u574f\u4e86\uff0c\u5219\u8010\u6454\u6307\u6570=0.
          \n\u5982\u679c\u5230\u4e86\u5854\u7684\u6700\u9ad8\u5c42\u7b2cn\u5c42\u6254\u6ca1\u6454\u574f\uff0c\u5219\u8010\u6454\u6307\u6570=n
          \n\u4e3a\u4e86\u51cf\u5c11\u6d4b\u8bd5\u6b21\u6570\uff0c\u4ece\u6bcf\u4e2a\u5382\u5bb6\u62bd\u68373\u90e8\u624b\u673a\u53c2\u52a0\u6d4b\u8bd5.
          \n\u5982\u679c\u5df2\u77e5\u4e86\u6d4b\u8bd5\u5854\u7684\u9ad8\u5ea6\uff0c\u5e76\u4e14\u91c7\u7528\u6700\u4f73\u7b56\u7565\uff0c\u5728\u6700\u574f\u7684\u8fd0\u6c14\u4e0b\u6700\u591a\u9700\u8981\u6d4b\u8bd5\u591a\u5c11\u6b21\u624d\u80fd\u786e\u5b9a\u624b\u673a\u7684\u8010\u6454\u6307\u6570\u5462?
          \n\u8f93\u5165\u6570\u636e\uff0c\u4e00\u4e2a\u6574\u6570n (3<n<10000),\u8868\u793a\u6d4b\u8bd5\u5854\u7684\u9ad8\u5ea6.\u8f93\u51fa\u4e00\u4e2a\u6574\u6570\uff0c\u8868\u793a\u6700\u591a\u6d4b\u8bd5\u591a\u5c11\u6b21.<\/p>\n
          public class NaiShuaiZhiShu {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int[] x = new int[1000];\n        int sum = 1;\n        for (int i = 0; sum < n; i++) {\n            sum = i + sum;\n            x[i] = sum;\n        }\n        sum = 1;\n        int k = 0;\n        for (int i = 0; sum < n; i++) {\n            sum = x[i] + sum;\n            k++;\n        }\n        System.out.println(k);\n    }\n}<\/code><\/pre>\n
          \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1aI\uff1a3\uff0cO\uff1a2\uff1bcase 2\uff1aI\uff1a7\uff0cO\uff1a3<\/p>\n<\/li>\n<\/ol>\n
          \n
          \u7b2c\u5341\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef686)<\/a><\/h3>\n
            \n
          1. \n
            \u6c42\u548c<\/p>\n
            \u5c0f\u660e\u5bf9\u6570\u4f4d\u4e2d\u542b\u67092\u30010\u30011\u30019\u7684\u6570\u5b57\u5f88\u611f\u5174\u8da3\uff0c\u57281\u523040\u4e2d\u8fd9\u6837\u7684\u6570\u5305\u62ec1\u30012\u30019\u300110\u81f332\u300139\u548c 40\uff0c\u517128\u4e2a\uff0c\u4ed6\u4eec\u7684\u548c\u662f574\u3002
            \n\u8bf7\u95ee\uff0c\u57281\u52302019\u4e2d\uff0c\u6240\u6709\u8fd9\u6837\u7684\u6570\u7684\u548c\u662f\u591a\u5c11?<\/p>\n
            public class QiuHe {\npublic static void main(String[] args) {\n    Scanner input = new Scanner(System.in);\n    int n = input.nextInt();\n    long sum = 0;\n    for (int i = 1; i <= n; i++) {\n        String temp = i + \"\";\n        if (temp.contains(\"2\") || temp.contains(\"0\") || temp.contains(\"1\") || temp.contains(\"9\"))\n            sum += i;\n    }\n    System.out.println(sum);\n}\n}<\/code><\/pre>\n
            \u7b54\u6848\uff1a1905111<\/strong><\/p>\n
            \u5907\u6ce8\uff1a\u8fd0\u884c\u65f6\u8f93\u51652019<\/p>\n<\/li>\n
          2. \n
            \u77e9\u5f62\u5207\u5272<\/p>\n
            \u5c0f\u660e\u6709\u4e00\u4e9b\u77e9\u5f62\u7684\u6750\u6599\uff0c\u4ed6\u8981\u4ece\u8fd9\u4e9b\u77e9\u5f62\u6750\u6599\u4e2d\u5207\u5272\u51fa\u4e00\u4e9b\u6b63\u65b9\u5f62\u3002\u5f53\u4ed6\u9762\u5bf9\u4e00\u5757\u77e9\u5f62\u6750\u6599\u65f6\uff0c\u4ed6\u603b\u662f\u4ece\u4e2d\u95f4\u5207\u5272\u4e00\u5200\uff0c\u5207\u51fa\u4e00\u5757\u6700\u5927\u7684\u6b63\u65b9\u5f62\uff0c\u5269\u4e0b\u4e00\u5757\u77e9\u5f62\uff0c\u7136\u540e\u518d\u5207\u5272\u5269\u4e0b\u7684\u77e9\u5f62\u6750\u6599\uff0c\u76f4\u5230\u5168\u90e8\u5207\u4e3a\u6b63\u65b9\u5f62\u4e3a\u6b62\u3002
            \n\u4f8b\u5982\uff0c\u5bf9\u4e8e\u4e00\u5757\u4e24\u8fb9\u5206\u522b\u4e3a5\u548c3\u7684\u6750\u6599\uff08\u8bb0\u4e3a5\u00d73)\uff0c\u5c0f\u660e\u4f1a\u4f9d\u6b21\u5207\u51fa3\u00d73\u30012\u00d72\u30011\u00d71\u30011\u00d71\u51714\u4e2a\u6b63\u65b9\u5f62\u3002
            \n\u73b0\u5728\u5c0f\u660e\u6709\u4e00\u5757\u77e9\u5f62\u7684\u6750\u6599\uff0c\u4e24\u8fb9\u957f\u5206\u522b\u662f2019\u548c 324\u3002\u8bf7\u95ee\u5c0f\u660e\u6700\u7ec8\u4f1a\u5207\u51fa\u591a\u5c11\u4e2a\u6b63\u65b9\u5f62?<\/p>\n
            public class JvXingQieGe {\npublic static void main(String[] args) {\n       int leng=2019;\n       int wide=324;\n       int ans=0; \/\/\u7b54\u6848\n       while(leng>=1&&wide>=1){\n        \/\/\u627e\u5176\u4e2d\u7684\u6700\u5c0f\u503c\u4f5c\u4e3a\u6b63\u65b9\u5f62\u7684\u8fb9\u957f\n           if(leng>wide){\n               leng-=wide;\n           }\n           else{\n               wide-=leng;\n           }\n           ans++;\n       }\n       System.out.println(ans);\n   }\n}<\/code><\/pre>\n
            \u7b54\u6848\uff1a21<\/strong><\/p>\n<\/li>\n
          3. \n
            \u4e0d\u540c\u5b50\u4e32<\/p>\n
            \u4e00\u4e2a\u5b57\u7b26\u4e32\u7684\u975e\u7a7a\u5b50\u4e32\u662f\u6307\u5b57\u7b26\u4e32\u4e2d\u957f\u5ea6\u81f3\u5c11\u4e3a1\u7684\u8fde\u7eed\u7684\u4e00\u6bb5\u5b57\u7b26\u7ec4\u6210\u7684\u4e32\u3002\u4f8b\u5982\uff0c\u5b57\u7b26\u4e32aaab\u6709\u975e\u7a7a\u5b50\u4e32a,b\uff0c aa\uff0cab\uff0caaa\uff0caab,aaab\uff0c\u4e00\u51717\u4e2a\u3002\u6ce8\u610f\u5728\u8ba1\u7b97\u65f6\uff0c\u53ea\u7b97\u672c\u8d28\u4e0d\u540c\u7684\u4e32\u7684\u4e2a\u6570\u3002
            \n\u8bf7\u95ee\uff0c\u5b57\u7b26\u4e320100110001010001\u6709\u591a\u5c11\u4e2a\u4e0d\u540c\u7684\u975e\u7a7a\u5b50\u4e32?<\/p>\n
            public class BuTongZiChuan {\npublic static void main(String[] args) {\n    String arr = \"0100110001010001\";\n    Set set = new HashSet();\n    for (int i = 0; i < arr.length(); i++) {\n        \/\/ \u4ee5i\u4e3a\u5f00\u5934\u7684\u6240\u6709\u53ef\u80fd\u7ed3\u679c\u6240\u4ee5j\u5fc5\u987b\u5927\u4e8ei\n        for (int j = i + 1; j <= arr.length(); j++) {\n            \/\/ \u867d\u7136substring \u4e0b\u6807i~j\u7684\u65f6\u5019\u662f\u4e0d\u5305\u542bj\u7684\n            \/\/ \u6bcf\u4e2a\u6570\u5b57\u5f00\u5934\u672c\u8eab\u4e5f\u662f\u4e2a\u975e\u7a7a\u5b50\u4e32\uff0c\u4e5f\u7b26\u5408\u9898\u610f\n            \/\/ \u6240\u4ee5\u4e0d\u9700\u8981\u53d8\u6210substring(i,j+1)\n            \/\/ \u7531\u4e8e\u9700\u8981\u5305\u542b\u5230\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\u6240\u4ee5j\u6700\u5927\u503c\u4e3aarr,length();\n            String temp = arr.substring(i, j);\n            set.add(temp);\n        }\n    }\n    System.out.println(set.size());\n}\n}<\/code><\/pre>\n
            \u7b54\u6848\uff1a100<\/strong><\/p>\n<\/li>\n
          4. \n
            \u8d28\u6570<\/p>\n
            \u6211\u4eec\u77e5\u9053\u7b2c\u4e00\u4e2a\u8d28\u6570\u662f2\u3001\u7b2c\u4e8c\u4e2a\u8d28\u6570\u662f3\u3001\u7b2c\u4e09\u4e2a\u8d28\u6570\u662f5\u2026\u2026\u8bf7\u4f60\u8ba1\u7b97\u7b2c2019\u4e2a\u8d28\u6570\u662f\u591a\u5c11?<\/p>\n
            public class ZhiShu {\npublic static void main(String[] args) {\n       int ans=0;\n       int res=0;\/\/\u4e0b\u9762res++\uff0c\u5c31\u76f4\u63a5\u4ece1\u5f00\u59cb\u4e86\u6539\n       while (ans<=2019){\n           res++;\n           if(check(res)){\n               ans++;\n           }\n       }\n       System.out.println(res);\n   }\n   public static boolean check(int nums){\n       int flag=0;\n       for(int i=2;i<\/pre>\n
            \u7b54\u6848\uff1a17569<\/strong><\/p>\n<\/li>\n
          5. \n
            \u6700\u5927\u964d\u96e8\u91cf<\/p>\n
            \u7531\u4e8e\u6c99\u4e4b\u56fd\u957f\u5e74\u5e72\u65f1\uff0c\u6cd5\u5e08\u5c0f\u660e\u51c6\u5907\u65bd\u5c55\u81ea\u5df1\u7684\u4e00\u4e2a\u795e\u79d8\u6cd5\u672f\u6765\u6c42\u96e8\u3002\u8fd9\u4e2a\u6cd5\u672f\u9700\u8981\u7528\u5230\u4ed6\u624b\u4e2d\u768449\u5f20\u6cd5\u672f\u7b26\uff0c\u4e0a\u9762\u5206\u522b\u5199\u77401\u81f349\u8fd949\u4e2a\u6570\u5b57\u3002\u6cd5\u672f\u4e00\u5171\u6301\u7eed7\u5468\uff0c\u6bcf\u5929\u5c0f\u660e\u90fd\u8981\u4f7f\u7528\u4e00\u5f20\u6cd5\u672f\u7b26\uff0c\u6cd5\u672f\u7b26\u4e0d\u80fd\u91cd\u590d\u4f7f\u7528\u3002
            \n\u6bcf\u5468\uff0c\u5c0f\u660e\u65bd\u5c55\u6cd5\u672f\u4ea7\u751f\u7684\u80fd\u91cf\u4e3a\u8fd9\u54687\u5f20\u6cd5\u672f\u7b26\u4e0a\u6570\u5b57\u7684\u4e2d\u4f4d\u6570\u3002\u6cd5\u672f\u65bd\u5c55\u5b8c7\u5468\u540e\uff0c\u6c42\u96e8\u5c06\u83b7\u5f97\u6210\u529f\uff0c\u964d\u96e8\u91cf\u4e3a7\u5468\u80fd\u91cf\u7684\u4e2d\u4f4d\u6570\u3002
            \n\u7531\u4e8e\u5e72\u65f1\u592a\u4e45\uff0c\u5c0f\u660e\u5e0c\u671b\u8fd9\u6b21\u6c42\u96e8\u7684\u964d\u96e8\u91cf\u5c3d\u53ef\u80fd\u5927\uff0c\u8bf7\u5927\u6700\u5927\u503c\u662f\u591a\u5c11?<\/p>\n
            \u89e3\u7b54\uff1a49 - 15 = 34<\/strong>\uff1b\u7eaf\u6570\u5b66\u89e3\u7b97\uff0c\u53ef\u4ee5\u767e\u5ea6\uff0c\u63a8\u8350\u4e24\u7bc7\u6587\u7ae0\uff1a1. \u7b2c\u5341\u5c4a\u84dd\u6865\u676f\u7701\u8d5b A\u7ec4 C\u6700\u5927\u964d\u96e8\u91cf(\u601d\u7ef4)_\u84dd\u6865\u676f \u6700\u5927\u964d\u96e8-CSDN\u535a\u5ba2<\/a> 2. java\u84dd\u6865\u676fB\u7ec4\u6700\u5927\u964d\u96e8\u91cf_java\u5b9e\u73b0\u6700\u5927\u964d\u96e8\u91cf-CSDN\u535a\u5ba2<\/a><\/p>\n
            \u7b54\u6848\uff1a34<\/strong><\/p>\n<\/li>\n
          6. \n
            \u65cb\u8f6c<\/p>\n
            \u56fe\u7247\u65cb\u8f6c\u662f\u5bf9\u56fe\u7247\u6700\u7b80\u5355\u7684\u5904\u7406\u65b9\u5f0f\u4e4b\u4e00\uff0c\u5728\u672c\u9898\u4e2d\uff0c\u4f60\u9700\u8981\u5bf9\u56fe\u7247\u987a\u65f6\u9488\u65cb\u8f6c90\u5ea6\u3002
            \n\u6211\u4eec\u7528\u4e00\u4e2anxm\u7684\u4e8c\u7ef4\u6570\u7ec4\u6765\u8868\u793a\u4e00\u4e2a\u56fe\u7247\uff0c\u4f8b\u5982\u4e0b\u9762\u7ed9\u51fa\u4e00\u4e2a3\u00d74 \u7684\u56fe\u7247\u7684\u4f8b\u5b50:<\/p>\n
            <\/div><\/p>\n
            \u8fd9\u4e2a\u56fe\u7247\u987a\u65f6\u9488\u65cb\u8f6c90\u5ea6\u540e\u7684\u56fe\u7247\u5982\u4e0b:
            <\/div><\/p>\n
            \u7ed9\u5b9a\u521d\u59cb\u56fe\u7247\uff0c\u8bf7\u8ba1\u7b97\u65cb\u8f6c\u540e\u7684\u56fe\u7247\u3002<\/p>\n
            public class XuanZhuan {\npublic static void main(String[] args) {\n       Scanner input=new Scanner(System.in);\n       int n=input.nextInt();\n       int m=input.nextInt();\n       int resx=0;\n       int resy=0;\n       \/\/\u6700\u540e\u8f93\u51fa\u6570\u7ec4\u7684\u884c\u548c\u5217\n       resx=m;\n       resy=n;\n       System.out.println(resx+\" \"+resy);\n       int [][]arr=new int[n+1][m+1];\n\n       int [][]temparr=new int[resx+1][resy+1];\n       for(int i=1;i<=n;i++){\n           for(int j=1;j<=m;j++){\n               arr[i][j]=input.nextInt();\n           }\n       }\n       for(int i=1;i<=n;i++){\n           for(int j=1;j<=m;j++){\n               temparr[j][resy-i+1]=arr[i][j];\n           }\n       }\n       for(int i=1;i<=resx;i++){\n           for(int j=1;j<=resy;j++){\n               System.out.print(temparr[i][j]+\" \");\n           }\n           System.out.println();\n       }\n\n   }\n}<\/code><\/pre>\n
            \u5907\u6ce8\uff1a\u8fd0\u884c\u65f6\u5148\u8f93\u5165\u884c\u6570\u548c\u5217\u6570\uff0c\u518d\u8f93\u5165\u77e9\u9635<\/p>\n<\/li>\n
          7. \n
            \u5916\u5356\u5e97\u4f18\u5148\u7ea7<\/p>\n
            \u201c\u9971\u4e86\u4e48\u201d\u5916\u5356\u7cfb\u7edf\u4e2d\u7ef4\u62a4\u7740N\u5bb6\u5916\u5356\u5e97\uff0c\u7f16\u53f71~\uff5eN\u3002\u6bcf\u5bb6\u5916\u5356\u5e97\u90fd\u6709\u4e00\u4e2a\u4f18\u5148\u7ea7\uff0c\u521d\u59cb\u65f6(0\u65f6\u523b)\u4f18\u5148\u7ea7\u90fd\u4e3a0\u3002
            \n\u6bcf\u7ecf\u8fc71\u4e2a\u65f6\u95f4\u5355\u4f4d\uff0c\u5982\u679c\u5916\u5356\u5e97\u6ca1\u6709\u8ba2\u5355\uff0c\u5219\u4f18\u5148\u7ea7\u4f1a\u51cf\u5c111\uff0c\u6700\u4f4e\u51cf\u52300;\u800c\u5982\u679c\u5916\u5356\u5e97\u6709\u8ba2\u5355\uff0c\u5219\u4f18\u5148\u7ea7\u4e0d\u51cf\u53cd\u52a0\uff0c\u6bcf\u6709\u4e00\u5355\u4f18\u5148\u7ea7\u52a02\u3002
            \n\u5982\u679c\u67d0\u5bb6\u5916\u5356\u5e97\u67d0\u65f6\u523b\u4f18\u5148\u7ea7\u5927\u4e8e5\uff0c\u5219\u4f1a\u88ab\u7cfb\u7edf\u52a0\u5165\u4f18\u5148\u7f13\u5b58\u4e2d;\u5982\u679c\u4f18\u5148\u7ea7\u5c0f\u4e8e\u7b49\u4e8e3\uff0c\u5219\u4f1a\u88ab\u6e05\u9664\u51fa\u4f18\u5148\u7f13\u5b58\u3002
            \n\u7ed9\u5b9aT\u65f6\u523b\u4ee5\u5185\u7684M\u6761\u8ba2\u5355\u4fe1\u606f\uff0c\u8bf7\u4f60\u8ba1\u7b97T\u65f6\u523b\u65f6\u6709\u591a\u5c11\u5916\u5356\u5e97\u5728\u4f18\u5148\u7f13\u5b58\u4e2d\u3002<\/p>\n
            public class WaiMaiDianYouXianJi {\nstatic class My implements Comparable {\n       int t, id;\n       My(int t, int id) {\n           this.t = t;\n           this.id = id;\n       }\n       @Override\n       public int compareTo(My m) {\n           if (t == m.t) {\n               if (id > m.id) {\n                   return 1;\n               } else if (id < m.id) {\n                   return -1;\n               }\n               return 0;\n           }\n           return t > m.t ? 1 : -1;\n       }\n   }\n   private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n   private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\n\n   private static final int N = 100010;\n   private static int[] scores = new int[N]; \/\/\u7b2ci\u4e2a\u5e97\u4f18\u5148\u7ea7\n   private static int[] last = new int[N]; \/\/ \u7b2ci\u4e2a\u5e97\u4e0a\u4e00\u4e2a\u6709\u8ba2\u5355\u7684\u65f6\u523bt = last[id]\n   private static boolean[] st = new boolean[N];  \/\/\u662f\u5426\u5728\u4f18\u5148\u961f\u5217\n   private static My[] orders = new My[N]; \/\/\u7ed3\u6784\u4f53\u6570\u7ec4\n\n   public static void main(String[] args) throws IOException {\n       \/\/\u8f93\u5165\u6570\u636e\n       String[] ss = br.readLine().split(\" \");\n       int n = Integer.parseInt(ss[0]);\n       int m = Integer.parseInt(ss[1]);\n       int T = Integer.parseInt(ss[2]);\n       for (int i = 0; i < m; i++) {\n           ss = br.readLine().split(\" \");\n           int t = Integer.parseInt(ss[0]);\n           int id = Integer.parseInt(ss[1]);\n           orders[i] = new My(t, id);\n       }\n       \/\/ \u6392\u5e8f\n       Arrays.sort(orders, 0, m);\n       \/\/\u5faa\u73af\u904d\u5386\n       for (int i = 0; i < m;) {\n           int j = i;\n           while (j < m && orders[i].t == orders[j].t && orders[i].id == orders[j].id) \n               j++;               \n           \/\/\u5faa\u73af\u662f\u4e3a\u4e86\u627e\u5230\u76f8\u540c\u7684\u8ba2\u5355\uff0ccnt\u8868\u793a\u76f8\u540c\u7684\u6570\u91cf\n           int id = orders[i].id, t = orders[i].t, cnt = j - i;\n           i = j;\n\n           scores[id] -= t - last[id] - 1; \/\/\u4e2d\u95f4\u6ca1\u6709\u8ba2\u5355\u7684\u6570\u91cf\n           if (scores[id] < 0) scores[id] = 0;\n           if (scores[id] <= 3) st[id] = false;\n           \/\/\u4e0a\u9762\u662f\u5904\u7406t\u65f6\u523b\u4e4b\u524d\u7684\u51cf\uff0c \u4e0b\u9762\u5904\u7406t\u65f6\u523b\u7684\u52a0\n           scores[id] += cnt*2;\n           if (scores[id] > 5) st[id] = true;\n\n           last[id] = t;\n\n       }\n       \/\/\u6700\u540e\u4e00\u4e2a\u8ba2\u5355t\u65f6\u523b\u5230\u7ed3\u5c3eT\u90a3\u6bb5\u8ddd\u79bb\uff0c\u9700\u8981\u624b\u52a8\u8ba1\u7b97\n       for(int i = 1; i <= n; i++){\n           if(last[i] < T){\n               scores[i] -= T - last[i];\n               if (scores[i] <= 3) st[i] = false;\n           }\n       }\n       \/\/\u8ba1\u7b97\u6700\u7ec8\u7b54\u6848\n       int res = 0;\n       for (int i = 1; i <= n; i++) {\n           if (st[i])\n               res++;\n       }\n       bw.write(res + \"\\n\");\n       bw.close();\n       br.close();\n   }\n}<\/code><\/pre>\n
            \u6d4b\u8bd5\u7528\u4f8b\uff1a\u89c1\u771f\u9898\u6587\u6863\uff1ahttps:\/\/www.lanqiao.cn\/courses\/2786\/learning\/?id=70877&compatibility=false<\/a><\/p>\n
            \u5907\u6ce8\uff1a\u6bd4\u8f83\u96be\uff0c\u5efa\u8bae\u653e\u5f03\u8df3\u8fc7<\/p>\n<\/li>\n
          8. \n
            \u4eba\u7269\u76f8\u5173\u6027\u5206\u6790<\/p>\n
            \u5c0f\u660e\u6b63\u5728\u5206\u6790\u4e00\u672c\u5c0f\u8bf4\u4e2d\u7684\u4eba\u7269\u76f8\u5173\u6027\u3002\u4ed6\u60f3\u77e5\u9053\u5728\u5c0f\u8bf4\u4e2dAlice\u548c Bob\u6709\u591a\u5c11\u6b21\u540c\u65f6\u51fa\u73b0\u3002
            \n\u66f4\u51c6\u786e\u7684\u8bf4\uff0c\u5c0f\u660e\u5b9a\u4e49Alice \u548c Bob\u201c\u540c\u65f6\u51fa\u73b0\u201d\u7684\u610f\u601d\u662f:\u5728\u5c0f\u8bf4\u6587\u672c\u4e2dAlice\u548c Bob \u4e4b\u95f4\u4e0d\u8d85\u8fc7K\u4e2a\u5b57\u7b26\u3002
            \n\u4f8b\u5982\u4ee5\u4e0b\u6587\u672c:
            \nThis is a story about Alice and Bob.Alice wants to send a private message to Bob.
            \n\u5047\u8bbeK = 20\uff0c\u5219Alice\u548c Bob\u540c\u65f6\u51fa\u73b0\u4e862\u6b21\uff0c\u5206\u522b\u662f\u201dAlice and Bob\u201d\u548c\u201dBob. Alice\u201d\u3002\u524d\u8005Alice\u548c Bob\u4e4b\u95f4\u67095\u4e2a\u5b57\u7b26\uff0c\u540e\u8005\u67092\u4e2a\u5b57\u7b26\u3002
            \n\u6ce8\u610f:<\/p>\n
              \n
            1. Alice\u548c Bob\u662f\u5927\u5c0f\u5199\u654f\u611f\u7684\uff0calice\u6216bob \u7b49\u5e76\u4e0d\u8ba1\u7b97\u5728\u5185\u3002<\/li>\n
            2. Alice \u548c Bob \u5e94\u4e3a\u5355\u72ec\u7684\u5355\u8bcd\uff0c\u524d\u540e\u53ef\u4ee5\u6709\u6807\u70b9\u7b26\u53f7\u548c\u7a7a\u683c\uff0c\u4f46\u662f\u4e0d\u80fd\u6709\u5b57\u6bcd\u3002\u4f8b\u5982Bobbi \u4e9a\u4e0d\u7b97\u51fa\u73b0\u4e86Bob\u3002<\/li>\n<\/ol>\n
              public class RenWuXiangGuanXingFenXi {\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    int k = sc.nextInt();\n    \/\/ \u6362\u884c\u95ee\u9898.\u53c2\u8003https:\/\/blog.csdn.net\/zxfly6\/article\/details\/80514903\n    sc.nextLine();\n    String str = sc.nextLine();\n    \/\/ \u56e0\u4e3a\u7b26\u53f7\u4e3a\u4e24\u4e2a\u5b57\u7b26\u6240\u4ee5\u628a\u7b26\u53f7\u66ff\u6362\u4e3a\u4efb\u610f\u4e24\u4e2a\u5b57\u7b26\u4ee5\u4fbf\u4e8estr\u901a\u8fc7split\u65b9\u6cd5\u5206\u5272\u4e3a\u6570\u7ec4\n    str = str.replaceAll(\"\\\\.\", \" ab \");\n    \/\/ \u4ee5\u7a7a\u683c\u548c.\u628a\u53e5\u5b50\u5206\u5272\u6210\u6570\u7ec4\n    String[] strs = str.split(\"\\\\s+\");\n    \/\/ \u8bb0\u5f55\u5173\u8054\u6b21\u6570\n    int count = 0;\n    \/\/ \u7d2f\u52a0Alice\u540ek\u5b57\u7b26Bob\u51fa\u73b0\u7684\u6b21\u6570\n    for (int i = 0; i < strs.length; i++) {\n        \/\/ \u7528\u4e8e\u8bb0\u5f55\u95f4\u9694\u5b57\u7b26\n        int chars = 0;\n        if (strs[i].equals(\"Alice\")) {\n            \/\/ \u68c0\u7d22\u6b64\u5b57\u7b26\u4e32\u540e\u7684\u5355\u8bcd\n            for (int j = i + 1; j < strs.length; j++) {\n                if (strs[j].equals(\"Bob\") && chars <= k) {\n                    \/\/ \u8bb0\u5f55\n                    count++;\n                } else {\n                    chars = chars + (j - i) + 1 + strs[j].length();\n                }\n            }\n        }\n    }\n    \/\/\/\/ \u7d2f\u52a0Bob\u540ek\u5b57\u7b26Alice\u51fa\u73b0\u7684\u6b21\u6570\n    for (int i = 0; i < strs.length; i++) {\n        \/\/ \u7528\u4e8e\u8bb0\u5f55\u95f4\u9694\u5b57\u7b26\n        int chars = 0;\n        if (strs[i].equals(\"Bob\")) {\n            for (int j = i + 1; j < strs.length; j++) {\n                if (strs[j].equals(\"Alice\") && chars <= k) {\n                    count++;\n                } else {\n                    chars = chars + (j - i) + 1 + strs[j].length();\n                }\n            }\n        }\n    }\n    System.out.println(count);\n}\n}<\/code><\/pre>\n
              \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a20\\nThis is a story about Alice and Bob.Alice wants to send a private message to Bob. \uff0cO\uff1a2<\/p>\n
              \u5907\u6ce8\uff1a\u540c\u4e0a\u9898<\/p>\n<\/li>\n
            3. \n
              \u7b49\u5dee\u6570\u5217<\/p>\n
              \u6570\u5b66\u8001\u5e08\u7ed9\u5c0f\u660e\u51fa\u4e86\u4e00\u9053\u7b49\u5dee\u6570\u5217\u6c42\u548c\u7684\u9898\u76ee\u3002\u4f46\u662f\u7c97\u5fc3\u7684\u5c0f\u660e\u5fd8\u8bb0\u4e86\u4e00\u90e8\u5206\u7684\u6570\u5217\uff0c\u53ea\u8bb0\u5f97\u5176\u4e2dN\u4e2a\u6574\u6570\u3002
              \n\u73b0\u5728\u7ed9\u51fa\u8fd9\u2163\u4e2a\u6574\u6570\uff0c\u5c0f\u660e\u60f3\u77e5\u9053\u5305\u542b\u8fd9N\u4e2a\u6574\u6570\u7684\u6700\u77ed\u7684\u7b49\u5dee\u6570\u5217\u6709\u51e0\u9879?<\/p>\n
              public class DengChaShuLie {\npublic static void main(String[] args) {\n    Scanner input = new Scanner(System.in);\n    int N = input.nextInt();\n    int arr[] = new int[N + 1];\n    for (int i = 0; i < N; i++) {\n        arr[i] = input.nextInt();\n    }\n    Arrays.sort(arr);\n    int Max = arr[N];\n    int Min = arr[1];\n    int d = 0;\n    int cha[] = new int[N];\n    int index = 0;\n    \/\/ \u627e\u6bcf\u4e2a\u6570\u4e0e\u7b2c\u4e00\u4f4d\u7684\u516c\u5dee\n    for (int i = 2; i <= N; i++) {\n        cha[index++] = arr[i] - Min;\n    }\n    \/\/ \u627e\u6700\u5927\u516c\u5dee\n    for (int i = 0; i < index; i++) {\n        \/\/ int temp= gcd(cha[i-1],cha[i]);\n        d = gcd(cha[i], d);\n    }\n    \/\/ \u516c\u5dee\u4e3a0\u7684\u65f6\u5019\u539f\u6570\u7ec4\u5c31\u662f\u6700\u5c0f\u7b49\u5dee\u6570\u5217\n    if (d == 0)\n        System.out.println(N);\n    else\n        System.out.println((Max - Min) \/ d + 1);\n\n}\n\npublic static int gcd(int a, int b) {\n    if (b == 0)\n        return a;\n    else {\n        return gcd(b, a % b);\n    }\n}\n}<\/code><\/pre>\n
              \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5\\n2 6 4 10 20 \uff0cO\uff1a10<\/p>\n<\/li>\n
            4. \n
              \u626b\u5730\u673a\u5668\u4eba<\/p>\n
              \u5c0f\u660e\u516c\u53f8\u7684\u529e\u516c\u533a\u6709\u4e00\u6761\u957f\u957f\u7684\u8d70\u5eca\uff0c\u7531N\u4e2a\u65b9\u683c\u533a\u57df\u7ec4\u6210\uff0c\u5982\u4e0b\u56fe\u6240\u793a\u3002<\/p>\n
              <\/div><\/p>\n
              \u8d70\u5eca\u5185\u90e8\u7f72\u4e86K\u53f0\u626b\u5730\u673a\u5668\u4eba\uff0c\u5176\u4e2d\u7b2ci\u53f0\u5728\u7b2cA;\u4e2a\u65b9\u683c\u533a\u57df\u4e2d\u3002
              \n\u5df2\u77e5\u626b\u5730\u673a\u5668\u4eba\u6bcf\u5206\u949f\u53ef\u4ee5\u79fb\u52a8\u5230\u5de6\u53f3\u76f8\u90bb\u7684\u65b9\u683c\u4e2d\uff0c\u5e76\u5c06\u8be5\u533a\u57df\u6e05\u626b\u5e72\u51c0\u3002
              \n\u8bf7\u4f60\u7f16\u5199\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u8ba1\u7b97\u6bcf\u53f0\u673a\u5668\u4eba\u7684\u6e05\u626b\u8def\u7ebf\uff0c\u4f7f\u5f97
              \n1.\u5b83\u4eec\u6700\u7ec8\u90fd\u8fd4\u56de\u51fa\u53d1\u65b9\u683c\uff0c
              \n2.\u6bcf\u4e2a\u65b9\u683c\u533a\u57df\u90fd\u81f3\u5c11\u88ab\u6e05\u626b\u4e00\u904d\uff0c
              \n3.\u4ece\u673a\u5668\u4eba\u5f00\u59cb\u884c\u52a8\u5230\u6700\u540e\u4e00\u53f0\u673a\u5668\u4eba\u5f52\u4f4d\u82b1\u8d39\u7684\u65f6\u95f4\u6700\u5c11\u3002
              \n\u6ce8\u610f\u591a\u53f0\u673a\u5668\u4eba\u53ef\u4ee5\u540c\u65f6\u6e05\u626b\u540c\u4e00\u65b9\u5757\u533a\u57df\uff0c\u5b83\u4eec\u4e0d\u4f1a\u4e92\u76f8\u5f71\u54cd\u3002\u8f93\u51fa\u6700\u5c11\u82b1\u8d39\u7684\u65f6\u95f4\u3002
              \n\u5728\u4e0a\u56fe\u6240\u793a\u7684\u4f8b\u5b50\u4e2d\uff0c\u6700\u5c11\u82b1\u8d39\u65f6\u95f4\u662f6\u3002\u7b2c\u4e00\u53f0\u8def\u7ebf:2-1-2-3-4-3-2\uff0c\u6e05\u626b\u4e861\u30012\u30013\u30014\u53f7\u533a\u57df\u3002\u7b2c\u4e8c\u53f0\u8def\u7ebf5-6-7-6-5\uff0c\u6e05\u626b\u4e865\u30016\u30017\u3002\u7b2c\u4e09\u53f0\u8def\u7ebf10-9-8-9-10\uff0c\u6e05\u626b\u4e868\u30019\u548c 10\u3002<\/p>\n
              public class SaoDiJiQiRen {\n    static int N;\n    static int K;\n    static int[] a = new int[1000000];\n    static int[] b = new int[1000000];\n\n    public static void main(String[] args) {\n        int i, L;\n        Scanner sc = new Scanner(System.in);\n        N = sc.nextInt();\n        K = sc.nextInt();\n        for (i = 1; i <= K; i++) {\n            a[i] = sc.nextInt();\n            b[a[i]] = 1;\n        }\n        L = fun();\n        System.out.println(2 * (L - 1));\n\n    }\n\n    public static boolean check1(int first_L, int L) { \/\/ \u7b2c\u4e00\u4e2a\u533a\u95f4\u957f\u5ea6\u4e3a first_L\uff0c\u4e4b\u540e\u533a\u95f4\u957f\u5ea6\u90fd\u4e3a L\n        int i, j;\n        if (first_L + (K - 1) * L < N) {\/\/ \u7b2c\u4e00\u4e2a\u533a\u95f4\u518d\u52a0\u4e0a\uff0c\u5176\u4ed6\u7684\u673a\u5668\u4eba\u548c*\u8fd9\u6bb5\u7684\u957f\u5ea6\u662f\u4e0d\u662f\u80fd\u591f\u591f\u5230\u603b\u957f\n            return false;\n        }\n        i = 1; \/\/ \u7b2c i \u4e2a\u533a\u95f4\n        j = 1; \/\/ \u5f53\u524d\u67e5\u770b\u7684\u65b9\u683c\u4f4d\u7f6e\n        while (j <= N) {\n            if (b[j] == 1) { \/\/ \u7b2c i \u4e2a\u533a\u95f4\u5185\u6709\u673a\u5668\u4eba\n                j = first_L + (i - 1) * L + 1; \/\/ j \u6307\u5411\u4e0b\u4e00\u4e2a\u533a\u95f4\u8d77\u70b9\n                i++; \/\/ \u4e0b\u4e00\u4e2a\u533a\u95f4\n            } else {\n                j++;\/\/ \u4e00\u76f4\u68c0\u67e5\u4e0b\u4e00\u4e2a\u65b9\u683c\uff0c\u5982\u679c\u4e00\u76f4\u6ca1\u6709\u76f4\u5230first_L\u548cj\u76f8\u7b49\u540e\uff0c\u8868\u660e\u771f\u7684\u6ca1\u6709\u673a\u5668\u4eba\n                if (j == first_L + (i - 1) * L + 1 || j == N + 1) { \/\/ \u7b2c i \u4e2a\u533a\u95f4\u5185\u6ca1\u6709\u673a\u5668\u4eba\n                    return false; \/\/ \u56e0\u4e3aL\u662f\u4e0d\u65ad\u53d8\u5927\u7684\uff0cfirst\u4e5f\u4e00\u76f4\u53d8\u5927\uff0c\u6240\u4ee5\u68c0\u67e5\u4e00\u76f4\u518d\u5f80\u540e\u6269\u5c55\n                }\n            }\n        }\n        return true;\n    }\n\n    public static boolean check(int L) {\n        int first_L; \/\/ \u9996\u533a\u95f4\u7684\u957f\u5ea6(\u53d6\u503c\u8303\u56f4\uff1a1~L)\n        for (first_L = L; first_L > 0; first_L--) {\/\/ \u5012\u53d9\u662f\u56e0\u4e3a\uff0c\u7528\u5927\u533a\u95f4\u53ef\u4ee5\u51cf\u5c11\u673a\u5668\u4eba\u7684\u79fb\u52a8\n            if (check1(first_L, L)) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    public static int fun() {\n        int i, j, L;\n        for (L = N \/ K; L <= N; L++) {\/\/ \u5e73\u5747\u4e00\u4e0b\uff0c\n            if (check(L)) {\n                return L;\n            }\n        }\n        return L;\n    }\n}<\/code><\/pre>\n
              \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a10 3\\n5\\n2\\n10\uff0cO\uff1a6<\/p>\n
              \u5907\u6ce8\uff1a\u592a\u96be<\/p>\n<\/li>\n<\/ol>\n
              \n
              [\u7b2c\u5341\u4e00\u5c4a \u7701\u8d5b(7\u6708\u4efd\u573a)](2020\u5e74 \u7b2c11\u5c4a \u84dd\u6865\u676f Java C\u7ec4 \u7701\u8d5b\u771f\u9898\u8be6\u89e3\u53ca\u5c0f\u7ed3\u3010\u7b2c1\u573a\u7701\u8d5b 2020.7.5\u3011-CSDN\u535a\u5ba2<\/a> "\u7565\uff0c\u6ca1\u6709\u771f\u9898\u8bfe\u4ef6\u76f4\u63a5\u770b\u8fd9\u7bc7\u6587\u7ae0")<\/h3>\n
              \n
              \u7b2c\u5341\u4e00\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef6108)<\/a><\/h3>\n
                \n
              1. \n
                \u7ea6\u6570\u4e2a\u6570<\/p>\n
                \u5bf9\u4e8e\u4e00\u4e2a\u6574\u6570\uff0c\u80fd\u6574\u9664\u8fd9\u4e2a\u6574\u6570\u7684\u6570\u79f0\u4e3a\u8fd9\u4e2a\u6570\u7684\u7ea6\u6570\u3002\u4f8b\u5982: 1,2\uff0c3,6\u90fd\u662f6\u7684\u7ea6\u6570\u3002
                \n\u8bf7\u95ee78120\u6709\u591a\u5c11\u4e2a\u7ea6\u6570\u3002<\/p>\n
                public class YueShuGeShu {\npublic static void main(String[] args) {\n       int ans = 0;\n       for (int i = 1; i <= 78120; i++) {\n           if (78120 % i == 0) ans++;\n       }\n       System.out.println(ans);\n   }\n}<\/code><\/pre>\n
                \u7b54\u6848\uff1a96<\/strong><\/p>\n<\/li>\n
              2. \n
                \u5bfb\u627e2020<\/p>\n
                \u5c0f\u84dd\u6709\u4e00\u4e2a\u6570\u5b57\u77e9\u9635\uff0c\u91cc\u9762\u53ea\u5305\u542b\u6570\u5b57\u041e\u548c2\u3002\u5c0f\u84dd\u5f88\u559c\u6b222020\uff0c\u4ed6\u60f3\u627e\u5230\u8fd9\u4e2a\u6570\u5b57\u77e9\u9635\u4e2d\u6709\u591a\u5c11\u4e2a2020 \u3002
                \n\u5c0f\u84dd\u53ea\u5173\u6ce8\u4e09\u79cd\u6784\u62102020\u7684\u65b9\u5f0f:
                \n\u3002\u540c\u4e00\u884c\u91cc\u9762\u8fde\u7eed\u56db\u4e2a\u5b57\u7b26\u4ece\u5de6\u5230\u53f3\u6784\u62102020\u3002<\/p>\n
                \u3002\u540c\u4e00\u5217\u91cc\u9762\u8fde\u7eed\u56db\u4e2a\u5b57\u7b26\u4ece\u4e0a\u5230\u4e0b\u6784\u62102020\u3002
                \n\u3002\u5728\u4e00\u6761\u4ece\u5de6\u4e0a\u5230\u53f3\u4e0b\u7684\u659c\u7ebf\u4e0a\u8fde\u7eed\u56db\u4e2a\u5b57\u7b26\uff0c\u4ece\u5de6\u4e0a\u5230\u53f3\u4e0b\u6784\u62102020\u3002\u4f8b\u5982\uff0c\u5bf9\u4e8e\u4e0b\u9762\u7684\u77e9\u9635:<\/p>\n
                <\/div><\/p>\n
                \u4e00\u5171\u67095\u4e2a2020\u3002\u5176\u4e2d1\u4e2a\u662f\u5728\u540c\u4e00\u884c\u91cc\u7684\uff0c1\u4e2a\u662f\u5728\u540c\u4e00\u5217\u91cc\u7684\uff0c3\u4e2a\u662f\u659c\u7ebf\u4e0a\u7684\u3002
                \n\u5c0f\u84dd\u7684\u77e9\u9635\u6bd4\u4e0a\u9762\u7684\u77e9\u9635\u8981\u5927\uff0c\u7531\u4e8e\u592a\u5927\u4e86\uff0c\u4ed6\u53ea\u597d\u5c06\u8fd9\u4e2a\u77e9\u9635\u653e\u5728\u4e86\u4e00\u4e2a\u6587\u4ef6\u91cc\u9762\uff0c\u5728\u8bd5\u9898\u76ee\u5f55\u4e0b\u6709\u4e00\u4e2a\u6587\u4ef62020.txt\uff0c\u91cc\u9762\u7ed9\u51fa\u4e86\u5c0f\u84dd\u7684\u77e9\u9635\u3002
                \n\u8bf7\u5e2e\u52a9\u5c0f\u84dd\u786e\u5b9a\u5728\u4ed6\u7684\u77e9\u9635\u4e2d\u6709\u591a\u5c11\u4e2a2020\u3002<\/p>\n
                <\/div><\/p>\n
                public class XunZhao2020 {\nstatic int count = 0;\nstatic char[][] arr2 = new char[400][400];\nstatic char[] arr3 = { '2', '0', '2', '0' };\n\npublic static void main(String[] args) {\n    Scanner input = new Scanner(System.in);\n    String[] arr = new String[301];\n    for (int i = 0; i < 300; i++) {\n        arr[i] = input.next();\n    }\n    for (int i = 0; i < 300; i++) {\n        arr2[i] = arr[i].toCharArray();\n    }\n    for (int i = 0; i < 300; i++) {\n        for (int j = 0; j < 300; j++) {\n            if (arr2[i][j] == '2') {\n                dfs(i, j);\n            }\n        }\n    }\n    System.out.println(count);\n}\n\npublic static void dfs(int x, int y) {\n    int flag = 1;\/\/ \u7528\u6765\u5224\u65ad\u662f\u5426\u6ee1\u8db3\u6761\u4ef6\n    \/\/ \u627e\u4ece\u5de6\u5f80\u53f3\n    for (int i = 1; i <= 3; i++) {\n        \/\/ \u8d8a\u754c\u4e86\u5c31\u8bf4\u660e\u8fd9\u4e2a\u65b9\u5411\u80af\u5b9a\u4e0d\u884c\n        if (y + i < 0 || y + i >= 300) {\n            flag = 0;\n            break;\n        }\n        if (arr2[x][y + i] != arr3[i]) {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n        count++;\n    \/\/ \u6bcf\u5224\u65ad\u4e00\u6b21\u8981\u66f4\u65b0flag=1,\u4ee5\u514d\u5bf9\u4e0b\u4e00\u6b21\u5224\u65ad\u9020\u6210\u8bef\u89e3\n    flag = 1;\n    \/\/ \u4ece\u4e0a\u5230\u4e0b\n    for (int i = 1; i <= 3; i++) {\n        if (x + i < 0 || x + i >= 300) {\n            flag = 0;\n            break;\n        }\n        if (arr2[x + i][y] != arr3[i]) {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n        count++;\n    flag = 1;\n    \/\/ \u5de6\u4e0a\u5230\u53f3\u4e0b\n\n    for (int i = 1; i <= 3; i++) {\n        if ((y + i < 0 || y + i >= 300) || (x + i < 0 && x + i >= 300)) {\n            flag = 0;\n            break;\n        }\n        if (arr2[i + x][y + i] != arr3[i]) {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n        count++;\n}\n}<\/code><\/pre>\n
                \u7b54\u6848\uff1a16520<\/strong><\/p>\n
                \u5907\u6ce8\uff1a\u8fd0\u884c\u65f6\u8f93\u5165\u6587\u4ef6\u4e2d\u7684\u6570\u5217\u77e9\u9635(\u65e0\u6587\u4ef6\uff0c\u672a\u5b9e\u6d4b)<\/p>\n<\/li>\n
              3. \n
                \u8dd1\u6b65\u953b\u70bc<\/p>\n
                \u5c0f\u84dd\u6bcf\u5929\u90fd\u953b\u70bc\u8eab\u4f53\u3002
                \n\u6b63\u5e38\u60c5\u51b5\u4e0b\uff0c\u5c0f\u84dd\u6bcf\u5929\u8dd11\u5343\u7c73\u3002\u5982\u679c\u67d0\u5929\u662f\u5468\u4e00\u6216\u8005\u6708\u521d(1\u65e5)\uff0c\u4e3a\u4e86\u6fc0\u52b1\u81ea\u5df1\uff0c\u5c0f\u84dd\u8981\u8dd1\ufe56\u5343\u7c73\u3002\u5982\u679c\u540c\u65f6\u662f\u5468\u4e00\u6216\u6708\u521d\uff0c\u5c0f\u84dd\u4e5f\u662f\u8dd1\u2489\u5343\u7c73\u3002
                \n\u5c0f\u84dd\u8dd1\u6b65\u5df2\u7ecf\u575a\u6301\u4e86\u5f88\u957f\u65f6\u95f4\uff0c\u4ece2000\u5e741\u67081\u65e5\u5468\u516d\uff08\u542b\uff09\u52302020\u5e7410\u67081\u65e5\u5468\u56db\uff08\u542b)\u3002\u8bf7\u95ee\u8fd9\u6bb5\u65f6\u95f4\u5c0f\u84dd\u603b\u5171\u8dd1\u6b65\u591a\u5c11\u5343\u7c73?<\/p>\n
                static int[] week = { 6, 7, 1, 2, 3, 4, 5 };\/\/ \u4e00\u6708\u4e00\u53f7\u661f\u671f\u516d\uff0c\u4f9d\u6b21\u5f80\u540e\u63a8\nstatic int[] months = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };\n\npublic static void main(String[] args) {\n    int ans = 0;\n    int sumday = 0;\/\/ \u603b\u5929\u6570.\u7528\u6765\u5224\u65ad\u661f\u671f\u51e0\n    \/\/ \u5e74\n    for (int year = 2000; year <= 2020; year++) {\n\n        \/\/ \u5224\u65ad\u662f\u5426\u662f\u95f0\u5e74\n        if (!check(year)) {\n            \/\/ \u4e0d\u662f\u95f0\u5e74\u5c31\u6309\u6b63\u5e38\u7684\u6765\n            for (int month = 1; month <= 12; month++) {\n                for (int day = 1; day <= months[month]; day++) {\n                    if (day == 1 || week[sumday % 7] == 1)\n                        ans += 2;\n                    else\n                        ans++;\n                    sumday++;\n                }\n            }\n        }\n        \/\/ \u662f\u95f0\u5e74\n        else {\n            if (year == 2020) {\/\/ \u7279\u5224\u4e00\u4e0b2020\u5e74\u56e0\u4e3a\u4eca\u5e74\u5c3110\u4e2a\u6708\u8dd1\n                for (int month = 1; month <= 10; month++) {\n                    if (month == 10) {\n                        ans += 2;\n                        break;\n                    }\n                    if (month != 2 && month < 10) {\n                        for (int day = 1; day <= months[month]; day++) {\n                            if (day == 1 || week[sumday % 7] == 1)\n                                ans += 2;\n                            else\n                                ans++;\n                            sumday++;\n                        }\n                    } else if (month == 2) {\n                        for (int day = 1; day <= 29; day++) {\n                            if (day == 1 || week[sumday % 7] == 1)\n                                ans += 2;\n                            else\n                                ans++;\n                            sumday++;\n                        }\n                    }\n                }\n            } else {\n                for (int month = 1; month <= 12; month++) {\n                    if (month != 2) {\n                        for (int day = 1; day <= months[month]; day++) {\n                            if (day == 1 || week[sumday % 7] == 1)\n                                ans += 2;\n                            else\n                                ans++;\n                            sumday++;\n                        }\n                    } else {\n                        for (int day = 1; day <= 29; day++) {\n                            if (day == 1 || week[sumday % 7] == 1)\n                                ans += 2;\n                            else\n                                ans++;\n                            sumday++;\n                        }\n                    }\n                }\n\n            }\n\n        }\n\n    }\n    System.out.println(ans);\n}\n\nstatic boolean check(int year) {\n    if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0) {\n        return true;\n    } else\n        return false;\n}\n}<\/code><\/pre>\n
                \u7b54\u6848\uff1a8879<\/strong><\/p>\n<\/li>\n
              4. \n
                \u5e73\u9762\u5206\u5272<\/p>\n
                20\u4e2a\u5706\u548c20\u6761\u76f4\u7ebf\u6700\u591a\u80fd\u628a\u5e73\u9762\u5206\u6210\u591a\u5c11\u4e2a\u90e8\u5206?<\/p>\n
                public static void main(String[] args) {\n    int result = doFunction(20, 20);\n    System.out.println(result);\n}\n\nprivate static int doFunction(int m, int n) {\n    return m * (m - 1) + 1 + 2 * m * n + n * (n + 1) \/ 2;\n}\n}<\/code><\/pre>\n
                \u7b54\u6848\uff1a1391<\/strong><\/p>\n
                \u5907\u6ce8\uff1aSystem.out.println(20*20-20+2+2*20*20+20*(20+1)\/2-1);<\/code> \u4e00\u884c\u5c31\u53ef\u4ee5\u89e3\u7b97<\/p>\n<\/li>\n
              5. \n
                \u4e03\u6bb5\u7801<\/p>\n
                <\/div><\/p>\n
                \u4e0a\u56fe\u7ed9\u51fa\u4e86\u4e03\u6bb5\u7801\u6570\u7801\u7ba1\u7684\u4e00\u4e2a\u56fe\u793a\uff0c\u6570\u7801\u7ba1\u4e2d\u4e00\u5171\u67097\u6bb5\u53ef\u4ee5\u53d1\u5149\u7684\u4e8c\u6781\u7ba1\uff0c\u5206\u522b\u6807\u8bb0\u4e3aa, b, c, d, e,f\uff0c g.
                \n\u5c0f\u84dd\u8981\u9009\u62e9\u4e00\u90e8\u5206\u4e8c\u6781\u7ba1\uff08\u81f3\u5c11\u8981\u6709\u4e00\u4e2a\uff09\u53d1\u5149\u6765\u8868\u8fbe\u5b57\u7b26\u3002\u5728\u8bbe\u8ba1\u5b57\u7b26\u7684\u8868\u8fbe\u65f6\uff0c\u8981\u6c42\u6240\u6709\u53d1\u5149\u7684\u4e8c\u6781\u7ba1\u662f\u8fde\u6210\u4e00\u7247\u7684\u3002
                \n\u4f8b\u5982:b\u53d1\u5149\uff0c\u5176\u4ed6\u4e8c\u6781\u7ba1\u4e0d\u53d1\u5149\u53ef\u4ee5\u7528\u6765\u8868\u8fbe\u4e00\u79cd\u5b57\u7b26\u3002
                \n\u4f8b\u5982: c\u53d1\u5149\uff0c\u5176\u4ed6\u4e8c\u6781\u7ba1\u4e0d\u53d1\u5149\u53ef\u4ee5\u7528\u6765\u8868\u8fbe\u4e00\u79cd\u5b57\u7b26\u3002\u8fd9\u79cd\u65b9\u6848\u4e0e\u4e0a\u4e00\u884c\u7684\u65b9\u6848\u53ef\u4ee5\u7528\u6765\u8868\u793a\u4e0d\u540c\u7684\u5b57\u7b26\uff0c\u5c3d\u7ba1\u770b\u4e0a\u53bb\u6bd4\u8f83\u76f8\u4f3c\u3002
                \n\u4f8b\u5982: a, b, c, d,e\u53d1\u5149\uff0cf,g\u4e0d\u53d1\u5149\u53ef\u4ee5\u7528\u6765\u8868\u8fbe\u4e00\u79cd\u5b57\u7b26\u3002
                \n\u4f8b\u5982: b, f \u53d1\u5149\uff0c\u5176\u4ed6\u4e8c\u6781\u7ba1\u4e0d\u53d1\u5149\u5219\u4e0d\u80fd\u7528\u6765\u8868\u8fbe\u4e00\u79cd\u5b57\u7b26\uff0c\u56e0\u4e3a\u53d1\u5149\u7684\u4e8c\u6781\u7ba1\u6ca1\u6709\u8fde\u6210\u4e00\u7247\u3002
                \n\u8bf7\u95ee\uff0c\u5c0f\u84dd\u53ef\u4ee5\u7528\u4e03\u6bb5\u7801\u6570\u7801\u7ba1\u8868\u8fbe\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u5b57\u7b26?<\/p>\n
                public class QiDuanMa {\nstatic int counts=0;\nstatic Setset=new HashSet<>();\nstatic Map>map=new HashMap<>();\npublic static void main(String[] args) {\n    String str=\"abcdefg\";\n    \/\/\u521d\u59cb\u5316\n    ArrayListlist1=new ArrayList<>();\n    ArrayListlist2=new ArrayList<>();\n    ArrayListlist3=new ArrayList<>();\n    ArrayListlist4=new ArrayList<>();\n    ArrayListlist5=new ArrayList<>();\n    ArrayListlist6=new ArrayList<>();\n    ArrayListlist7=new ArrayList<>();\n    list1.add(\"b\");list1.add(\"f\");\n    list2.add(\"a\");list2.add(\"g\");list2.add(\"c\");\n    list3.add(\"b\");list3.add(\"g\");list3.add(\"d\");\n    list4.add(\"c\");list4.add(\"e\");\n    list5.add(\"f\");list5.add(\"g\");list5.add(\"d\");\n    list6.add(\"a\");list6.add(\"g\");list6.add(\"e\");\n    list7.add(\"f\");list7.add(\"e\");list7.add(\"b\");list7.add(\"c\");\n    map.put(\"a\", list1);\n    map.put(\"b\", list2);\n    map.put(\"c\", list3);\n    map.put(\"d\", list4);\n    map.put(\"e\", list5);\n    map.put(\"f\", list6);\n    map.put(\"g\", list7);\n\n    \/\/\u6c42\u5b57\u7b26\u4e32\u7684\u6240\u6709\u5b57\u4e32\n    find(\"\",str,0);\n\n    System.out.println(counts);\n}\nstatic void find(String temp,String str,int index) {\n    if(index==str.length()) {\n        \/\/\u6700\u540e\u5bf9\u5f97\u5230\u7684\u5b57\u4e32\u68c0\u67e5\u662f\u5426\u662f\u4e00\u4e2a\u8fde\u901a\u533a\u57df\n        if(bfsCheck(temp.toCharArray()))counts++;\n        return;\n    }\n    find(temp,str,index+1);\n    find(temp+=str.charAt(index),str,index+1);\n}\nstatic boolean bfsCheck(char[] strs) {\n    \/\/\u5148\u5bf9\u7b80\u5355\u60c5\u5f62\u76f4\u63a5\u5224\u65ad\n    if(strs.length==0)return false;\n    if(strs.length==1)return true;\n    if(strs.length==2) {\n        if(map.get(strs[0]+\"\").contains(strs[1]+\"\"))return true;\n        else return false;\n    }\n    LinkedList queue=new LinkedList<>();\n    int connect=1;\n    queue.add(strs[0]+\"\");\n    strs[0]='0';\n    while(!queue.isEmpty()) {\n        String str  = queue.poll();\n        ArrayList list = map.get(str);\n        for(int i=0;i<\/pre>\n
                \u7b54\u6848\uff1a80<\/strong><\/p>\n<\/li>\n
              6. \n
                \u6210\u7ee9\u7edf\u8ba1<\/p>\n
                \u5c0f\u84dd\u7ed9\u5b66\u751f\u4eec\u7ec4\u7ec7\u4e86\u4e00\u573a\u8003\u8bd5\uff0c\u5377\u9762\u603b\u5206\u4e3a100\u5206\uff0c\u6bcf\u4e2a\u5b66\u751f\u7684\u5f97\u5206\u90fd\u662f\u4e00\u4e2a0\u5230100\u7684\u6574\u6570\u3002
                \n\u5982\u679c\u5f97\u5206\u81f3\u5c11\u662f60 \u5206\uff0c\u5219\u79f0\u4e3a\u53ca\u683c\u3002\u5982\u679c\u5f97\u5206\u81f3\u5c11\u4e3a85\u5206\uff0c\u5219\u79f0\u4e3a\u4f18\u79c0\u3002\u8bf7\u8ba1\u7b97\u53ca\u683c\u7387\u548c\u4f18\u79c0\u7387\uff0c\u7528\u767e\u5206\u6570\u8868\u793a\uff0c\u767e\u5206\u53f7\u524d\u7684\u90e8\u5206\u56db\u820d\u4e94\u5165\u4fdd\u7559\u6574\u6570\u3002<\/p>\n
                public class ChengJiTongJi {\npublic static void main(String[] args) {\n    Scanner input = new Scanner(System.in);\n    int N = input.nextInt();\n    double[] arr = new double[N + 1];\n    double hege = 0;\n    double better = 0;\n    for (int i = 0; i < N; i++) {\n        arr[i] = input.nextDouble();\n        if (arr[i] >= 60)\n            hege++;\n        if (arr[i] >= 85)\n            better++;\n    }\n    System.out.println(Math.round((hege \/ N) * 100) + \"%\");\n    System.out.println(Math.round((better \/ N) * 100) + \"%\");\n}\n}<\/code><\/pre>\n
                \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a7\\n80\\n92\\n56\\n74\\n88\\n100\\n0 \uff0cO\uff1a71%\\n43%<\/p>\n<\/li>\n
              7. \n
                \u5355\u8bcd\u5206\u6790<\/p>\n
                \u5c0f\u84dd\u6b63\u5728\u5b66\u4e60\u4e00\u95e8\u795e\u5947\u7684\u8bed\u8a00\uff0c\u8fd9\u95e8\u8bed\u8a00\u4e2d\u7684\u5355\u8bcd\u90fd\u662f\u7531\u5c0f\u5199\u82f1\u6587\u5b57\u6bcd\u7ec4\u6210\uff0c\u6709\u4e9b\u5355\u8bcd\u5f88\u957f\uff0c\u8fdc\u8fdc\u8d85\u8fc7\u6b63\u5e38\u82f1\u6587\u5355\u8bcd\u7684\u957f\u5ea6\u3002\u5c0f\u84dd\u5b66\u4e86\u5f88\u957f\u65f6\u95f4\u4e5f\u8bb0\u4e0d\u4f4f\u4e00\u4e9b\u5355\u8bcd\uff0c\u4ed6\u51c6\u5907\u4e0d\u518d\u5b8c\u5168\u8bb0\u5fc6\u8fd9\u4e9b\u5355\u8bcd\uff0c\u800c\u662f\u6839\u636e\u5355\u8bcd\u4e2d\u54ea\u4e2a\u5b57\u6bcd\u51fa\u73b0\u5f97\u6700\u591a\u6765\u5206\u8fa8\u5355\u8bcd\u3002
                \n\u73b0\u5728\uff0c\u8bf7\u4f60\u5e2e\u52a9\u5c0f\u84dd\uff0c\u7ed9\u4e86\u4e00\u4e2a\u5355\u8bcd\u540e\uff0c\u5e2e\u52a9\u4ed6\u627e\u5230\u51fa\u73b0\u6700\u591a\u7684\u5b57\u6bcd\u548c\u8fd9\u4e2a\u5b57\u6bcd\u51fa\u73b0\u7684\u6b21\u6570\u3002<\/p>\n
                public class DanCiFenXi {\npublic static void main(String[] args) {\n       Scanner input=new Scanner(System.in);\n       String a=input.next();\n       char []arr=a.toCharArray();\n       int max=-1;\n       int  maxchar=' ';\n       int []count=new int[129];\n       for(int i=0;imax){\n               max=count[i];\n               maxchar=i;\n           }\n       }\n       System.out.println((char)(maxchar));\n       System.out.println(max);\n   }\n}<\/code><\/pre>\n
                \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1aI\uff1alanqiao \uff0cO\uff1aa\\n2 \uff1bcase 2\uff1alonglonglongistoolong \uff0cO\uff1ao\\n6<\/p>\n<\/li>\n
              8. \n
                \u6570\u5b57\u4e09\u89d2\u5f62<\/p>\n
                <\/div><\/p>\n
                \u4e0a\u56fe\u7ed9\u51fa\u4e86\u4e00\u4e2a\u6570\u5b57\u4e09\u89d2\u5f62\u3002\u4ece\u4e09\u89d2\u5f62\u7684\u9876\u90e8\u5230\u5e95\u90e8\u6709\u5f88\u591a\u6761\u4e0d\u540c\u7684\u8def\u5f84\u3002\u5bf9\u4e8e\u6bcf\u6761\u8def\u5f84\uff0c\u628a\u8def\u5f84\u4e0a\u9762\u7684\u6570\u52a0\u8d77\u6765\u53ef\u4ee5\u5f97\u5230\u4e00\u4e2a\u548c\uff0c\u4f60\u7684\u4efb\u52a1\u5c31\u662f\u627e\u5230\u6700\u5927\u7684\u548c\u3002
                \n\u8def\u5f84\u4e0a\u7684\u6bcf\u4e00\u6b65\u53ea\u80fd\u4ece\u4e00\u4e2a\u6570\u8d70\u5230\u4e0b\u4e00\u5c42\u548c\u5b83\u6700\u8fd1\u7684\u5de6\u8fb9\u7684\u90a3\u4e2a\u6570\u6216\u8005\u53f3\u8fb9\u7684\u90a3\u4e2a\u6570\u3002\u6b64\u5916\uff0c\u5411\u5de6\u4e0b\u8d70\u7684\u6b21\u6570\u4e0e\u5411\u53f3\u4e0b\u8d70\u7684\u6b21\u6570\u76f8\u5dee\u4e0d\u80fd\u8d85\u8fc71\u3002<\/p>\n
                public class ShuZiSanJiaoXing {\npublic static void main(String[] args) {\n    Scanner input = new Scanner(System.in);\n    int n = input.nextInt();\n    int[][] arr = new int[n + 1][n + 1];\n    int[][] dp = new int[n + 1][n + 1];\n    for (int i = 1; i <= n; i++) {\n        for (int j = 1; j <= i; j++) {\n            arr[i][j] = input.nextInt();\n        }\n    }\n    for (int i = 1; i <= n; i++) {\n        for (int j = 1; j <= i; j++) {\n            \/\/ \u6700\u91cc\u9762\u4e00\u5217\u53ea\u80fd\u4ece\u4e0a\u9762\u4e0b\u6765\n            if (j == 1) {\n                dp[i][j] = dp[i - 1][j] + arr[i][j];\n            }\n            \/\/ \u6bcf\u884c\u6700\u8fb9\u4e0a\u4e00\u5217\u53ea\u80fd\u4ece\u5de6\u4e0a\u89d2\u4e0b\u6765\n            else if (i == j) {\n                dp[i][j] = dp[i - 1][j - 1] + arr[i][j];\n            } else {\n                dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - 1]) + arr[i][j];\n            }\n        }\n    }\n    if (n % 2 != 0) {\n        System.out.println(dp[n][n \/ 2 + 1]);\n    } else {\n        System.out.println(Math.max(dp[n][n \/ 2 + 1], dp[n][n \/ 2]));\n    }\n}\n}<\/code><\/pre>\n
                \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5\\n7\\n3 8\\n8 1 0\\n2 7 4 4\\n4 5 2 6 5 \uff0cO\uff1a27<\/p>\n<\/li>\n
              9. \n
                \u4f5c\u7269\u6742\u4ea4<\/p>\n
                \u4f5c\u7269\u6742\u4ea4\u662f\u4f5c\u7269\u683d\u57f9\u4e2d\u91cd\u8981\u7684\u4e00\u6b65\u3002\u5df2\u77e5\u6709N\u79cd\u4f5c\u7269(\u7f16\u53f71\u81f3N )\uff0c\u7b2ci\u79cd\u4f5c\u7269\u4ece\u64ad\u79cd\u5230\u6210\u719f\u7684\u65f6\u95f4\u4e3aT\u3002\u4f5c\u7269\u4e4b\u95f4\u4e24\u4e24\u53ef\u4ee5\u8fdb\u884c\u6742\u4ea4\uff0c\u6742\u4ea4\u65f6\u95f4\u53d6\u4e24\u79cd\u4e2d\u65f6\u95f4\u8f83\u957f\u7684\u4e00\u65b9\u3002\u5982\u4f5c\u7269A\u79cd\u690d\u65f6\u95f4\u4e3a5\u5929\uff0c\u4f5c\u7269B\u79cd\u690d\u65f6\u95f4\u4e3a7\u5929,\u5219AB\u6742\u4ea4\u82b1\u8d39\u7684\u65f6\u95f4\u4e3a7\u5929\u3002\u4f5c\u7269\u6742\u4ea4\u4f1a\u4ea7\u751f\u56fa\u5b9a\u7684\u4f5c\u7269\uff0c\u65b0\u4ea7\u751f\u7684\u4f5c\u7269\u4ecd\u7136\u5c5e\u4e8eN\u79cd\u4f5c\u7269\u4e2d\u7684\u4e00\u79cd\u3002
                \n\u521d\u59cb\u65f6\uff0c\u62e5\u6709\u5176\u4e2dM\u79cd\u4f5c\u7269\u7684\u79cd\u5b50(\u6570\u91cf\u65e0\u9650\uff0c\u53ef\u4ee5\u652f\u6301\u591a\u6b21\u6742\u4ea4)\u3002\u540c\u65f6\u53ef\u4ee5\u8fdb\u884c\u591a\u4e2a\u6742\u4ea4\u8fc7\u7a0b\u3002\u6c42\u95ee\u5bf9\u4e8e\u7ed9\u5b9a\u7684\u76ee\u6807\u79cd\u5b50\uff0c\u6700\u5c11\u9700\u8981\u591a\u5c11\u5929\u80fd\u591f\u5f97\u5230\u3002
                \n\u5982\u5b58\u57284\u79cd\u4f5c\u7269ABCD\uff0c\u5404\u81ea\u7684\u6210\u719f\u65f6\u95f4\u4e3a5\u5929\u30017\u5929\u30013\u5929\u30018\u5929\u3002\u521d\u59cb\u62e5\u6709AB\u4e24\u79cd\u4f5c\u7269\u7684\u79cd\u5b50\uff0c\u76ee\u6807\u79cd\u5b50\u4e3aD\uff0c\u5df2\u77e5\u6742\u4ea4\u60c5\u51b5\u4e3aA\u00d7 B \u2192 C\uff0cA xC \u2192D\u3002\u5219\u6700\u77ed\u7684\u6742\u4ea4\u8fc7\u7a0b\u4e3a:
                \n\u7b2c1\u5929\u5230\u7b2c7\u5929(\u4f5c\u7269B\u7684\u65f6\u95f4)\uff0cAx B\u2192C\u3002\u7b2c8\u5929\u5230\u7b2c12\u5929(\u4f5c\u7269A \u7684\u65f6\u95f4)\uff0cA\u00d7C \u2192D\u3002\u82b1\u8d3912\u5929\u5f97\u5230\u4f5c\u7269D\u7684\u79cd\u5b50\u3002<\/p>\n
                public class ZuoWuZaJiao {\nstatic int n, m, k, t;\n\/\/ \u79cd\u690d\u65f6\u95f4\u3001\u521d\u59cb\u4f5c\u7269\u79cd\u7c7b\u3001\u6742\u4ea4\u6240\u9700\u7684\u65f6\u95f4\u3001\u690d\u7269\u662f\u5426\u5df2\u7ecf\u5408\u6210\u3001\u8bb0\u5f55\u5404\u7c7b\u7269\u79cd\u5408\u6210\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4\nstatic int[] time, staSeed, maxTime, visited, res;\nstatic int[][] hyb;\/\/ \u6742\u4ea4\u9014\u5f84\n\npublic static void main(String[] args) {\n    Scanner scan = new Scanner(System.in);\n\n    \/\/ \u7b2c\u4e00\u884c\u6570\u76ee\n    n = scan.nextInt();\/\/ \u4f5c\u7269\u79cd\u7c7b\n    m = scan.nextInt();\/\/ \u521d\u59cb\u4f5c\u7269\u79cd\u7c7b\n    k = scan.nextInt();\/\/ \u6742\u4ea4\u9014\u5f84\n    t = scan.nextInt();\/\/ \u76ee\u6807\u79cd\u5b50\n    res = new int[n + 1];\n    time = new int[n + 1];\n    for (int i = 1; i <= n; i++) {\n        time[i] = scan.nextInt();\n    }\n    staSeed = new int[m];\/\/ \u521d\u59cb\u4f5c\u7269\u79cd\u7c7b\n    maxTime = new int[k];\n    visited = new int[n + 1];\n    for (int i = 0; i < m; i++) {\n        staSeed[i] = scan.nextInt();\n        visited[staSeed[i]] = 1;\/\/ \u8bb0\u5f55\u521d\u59cb\u4f5c\u7269\u5df2\u5408\u6210\n    }\n    hyb = new int[k][3];\n    for (int i = 0; i < k; i++) {\n        hyb[i][0] = scan.nextInt();\n        hyb[i][1] = scan.nextInt();\n        hyb[i][2] = scan.nextInt();\n        maxTime[i] = Math.max(time[hyb[i][0]], time[hyb[i][1]]);\n    }\n\n    System.out.println(dfs(t));\n}\n\npublic static int dfs(int tar) {\/\/ kx\uff1a\n    if (visited[tar] == 0) {\/\/ \u672a\u5408\u6210\n        int min = Integer.MAX_VALUE;\n        \/\/ \u904d\u5386\u6742\u4ea4hyb\n        for (int i = 0; i < k; i++) {\n            if (hyb[i][2] == tar) {\n                min = Math.min(min, (maxTime[i] + Math.max(dfs(hyb[i][0]), dfs(hyb[i][1]))));\n            }\n        }\n        visited[tar] = 1;\n        res[tar] = min;\n        return min;\n    } else {\n        return res[tar];\n    }\n}\n}<\/code><\/pre>\n
                \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a6 2 4 6\\n5 3 4 6 4 9\\n1 2\\n1 2 3\\n1 3 4\\n2 3 5\\n4 5 6 \uff0cO\uff1a16<\/p>\n<\/li>\n
              10. \n
                \u5b50\u4e32\u5206\u503c<\/p>\n
                \u5bf9\u4e8e\u4e00\u4e2a\u5b57\u7b26\u4e32S\uff0c\u6211\u4eec\u5b9a\u4e49S\u7684\u5206\u503cf(S)\u4e3aS\u4e2d\u6070\u597d\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26\u4e2a\u6570\u3002\u4f8b\u5982f("aba") =1\uff0cf("abc") = 3, f("aaa") =0\u3002
                \n\u73b0\u5728\u7ed9\u5b9a\u4e00\u4e2a\u5b57\u7b26\u4e32S 0..n-1<\/a>\uff0c\u8bf7\u4f60\u8ba1\u7b97\u5bf9\u4e8e\u6240\u6709S\u7684\u975e\u7a7a\u5b50\u4e32 S[i..j](0 \u2264i\u2264 j<n)\uff0cf(S[i..j])\u7684\u548c\u662f\u591a\u5c11\u3002<\/p>\n
                public class ZiChuanFenZhi {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        String str = sc.next();\n        int len = str.length();\n        int right, left, sum = 0;\n\n        for (int i = 0; i < len; i++) {\n            for (right = i + 1; right < len; right++) {\n                if (str.charAt(right) == str.charAt(i)) {\n                    break;\n                }\n            }\n            for (left = i - 1; left >= 0; left--) {\n                if (str.charAt(left) == str.charAt(i)) {\n                    break;\n                }\n            }\n            sum += (i - left) * (right - i);\n        }\n        System.out.print(sum);\n        sc.close();\n    }\n}<\/code><\/pre>\n
                \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1aababc \uff0cO\uff1a21<\/p>\n<\/li>\n<\/ol>\n
                \n
                \u7b2c\u5341\u4e8c\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef6134)<\/a><\/h3>\n
                  \n
                1. \n
                  ASC<\/p>\n
                  \u5df2\u77e5\u5927\u5199\u5b57\u6bcd A \u7684 ASCII \u7801\u4e3a 65\uff0c\u8bf7\u95ee\u5927\u5199\u5b57\u6bcd L\u7684 ASCII \u7801\u662f\u591a\u5c11?<\/p>\n
                  \u7b54\u6848\uff1a76<\/strong><\/p>\n
                  \u5907\u6ce8\uff1a\u5c31\u586b\u6570\uff0c\u76f4\u63a5\u79d2\u4e86<\/p>\n<\/li>\n
                2. \n
                  \u7a7a\u95f4<\/p>\n
                  \u5c0f\u84dd\u51c6\u5907\u7528 256MB \u7684\u5185\u5b58\u7a7a\u95f4\u5f00\u4e00\u4e2a\u6570\u7ec4\uff0c\u6570\u7ec4\u7684\u6bcf\u4e2a\u5143\u7d20\u90fd\u662f 32 \u4f4d\u8fdb\u5236\u6574\u6570\uff0c\u5982\u679c\u4e0d\u8003\u8651\u7a0b\u5e8f\u5360\u7528\u7684\u7a7a\u95f4\u548c\u7ef4\u62a4\u5185\u5b58\u9700\u8981\u7684\u8f85\u52a9\u7a7a\u95f4\uff0c\u8bf7\u95ee256MB \u7684\u7a7a\u95f4\u53ef\u4ee5\u5b58\u50a8\u591a\u5c11\u4e2a 32 \u4f4d\u4e8c\u8fdb\u5236\u6574\u6570?<\/p>\n
                  public class KongJian {\npublic static void main(String[] args) {\n    System.out.print(256 >> 2 << 20);\n}\n}<\/code><\/pre>\n
                  \u7b54\u6848\uff1a67108864<\/strong><\/p>\n
                  \u5907\u6ce8\uff1a\u7eaf\u6570\u5b66\u8ba1\u7b97\u5c31\u79d2\u4e86\uff0c32\u4f4d\u5c31\u662f4B\uff0c256MB\u6362\u7b97\u6210B\u518d\u96644\uff0c$256*2^{20}\/4=2^{26}=$67108864<\/strong><\/p>\n<\/li>\n
                3. \n
                  \u5361\u7247<\/p>\n
                  \u5c0f\u84dd\u6709\u5f88\u591a\u6570\u5b57\u5361\u7247\uff0c\u6bcf\u5f20\u5361\u7247\u4e0a\u90fd\u662f\u6570\u5b57 0 \u5230 9\u3002
                  \n\u5c0f\u84dd\u51c6\u5907\u7528\u8fd9\u4e9b\u5361\u7247\u6765\u62fc\u4e00\u4e9b\u6570\uff0c\u4ed6\u60f3\u4ece 1 \u5f00\u59cb\u62fc\u51fa\u6b63\u6574\u6570\uff0c\u6bcf\u62fc\u4e00\u4e2a,\u5c31\u4fdd\u5b58\u8d77\u6765\uff0c\u5361\u7247\u5c31\u4e0d\u80fd\u7528\u6765\u62fc\u5176\u5b83\u6570\u4e86\u3002
                  \n\u5c0f\u84dd\u60f3\u77e5\u9053\u81ea\u5df1\u80fd\u4ece 1 \u62fc\u5230\u591a\u5c11\u3002
                  \n\u4f8b\u5982\uff0c\u5f53\u5c0f\u84dd\u6709 30 \u5f20\u5361\u7247\uff0c\u5176\u4e2d 0\u52309\u54043\u5f20\uff0c\u5219\u5c0f\u84dd\u53ef\u4ee5\u62fc\u51fa 1\u5230 10\u4f46\u662f\u62fc 11 \u65f6\u5361\u7247 1 \u5df2\u7ecf\u53ea\u6709\u4e00\u5f20\u4e86\uff0c\u4e0d\u591f\u62fc\u51fa 11\u3002
                  \n\u73b0\u5728\u5c0f\u84dd\u624b\u91cc\u6709 0 \u52309 \u7684\u5361\u7247\u5404 2021 \u5f20\uff0c\u5171 20210 \u5f20\uff0c\u8bf7\u95ee\u5c0f\u84dd\u53ef\u4ee5\u4ece 1\u62fc\u5230\u591a\u5c11?<\/p>\n
                  public class KaPian {\npublic static void main(String[] args) {\n    int sum=2021;\n    int a1=0;\n    for (int i = 1; i <= 20210; i++) {\n        a1=i;\n        while(a1>0) {\n            if(a1%10==1&&sum>0) {\n                sum--;    \n            }\n            a1\/=10;\n        }\n        if(sum==0) {\n            System.out.println(i);\n            break;\n        }\n    }\n}\n}<\/code><\/pre>\n
                  \u7b54\u6848\uff1a3181<\/strong><\/p>\n<\/li>\n
                4. \n
                  \u76f8\u4e58<\/p>\n
                  \u5c0f\u84dd\u53d1\u73b0\uff0c\u4ed6\u5c06 1 \u81f3 1000000007 \u4e4b\u95f4\u7684\u4e0d\u540c\u7684\u6570\u4e0e 2021 \u76f8\u4e58\u540e\u518d\u6c42\u9664\u4ee51000000007 \u7684\u4f59\u6570\uff0c\u4f1a\u5f97\u5230\u4e0d\u540c\u7684\u6570\u3002
                  \n\u5c0f\u84dd\u60f3\u77e5\u9053\uff0c\u80fd\u4e0d\u80fd\u5728 1 \u81f3 1000000007 \u4e4b\u95f4\u627e\u5230\u4e00\u4e2a\u6570\uff0c\u4e0e 2021 \u76f8\u4e58\u540e\u518d\u9664\u4ee5 1000000007 \u540e\u7684\u4f59\u6570\u4e3a 999999999\u3002\u5982\u679c\u5b58\u5728\uff0c\u8bf7\u5728\u7b54\u6848\u4e2d\u63d0\u4ea4\u8fd9\u4e2a\u6570:\u5982\u679c\u4e0d\u5b58\u5728\uff0c\u8bf7\u5728\u7b54\u6848\u4e2d\u63d0\u4ea4 0\u3002<\/p>\n
                  public class XiangCheng {\npublic static void main(String[] args) {\n    for(long i =1;i<=1000000007;i++) {\n        if(((i*2021)%1000000007)==999999999) {\n            System.out.println(i);\n            break;\n        }\n    }\n}\n}<\/code><\/pre>\n
                  \u7b54\u6848\uff1a17812964<\/strong><\/p>\n<\/li>\n
                5. \n
                  \u8def\u5f84<\/p>\n
                  \u5c0f\u84dd\u5b66\u4e60\u4e86\u6700\u77ed\u8def\u5f84\u4e4b\u540e\u7279\u522b\u9ad8\u5174\uff0c\u4ed6\u5b9a\u4e49\u4e86\u4e00\u4e2a\u7279\u522b\u7684\u56fe\uff0c\u5e0c\u671b\u627e\u5230\u56fe\u4e2d\u7684\u6700\u77ed\u8def\u5f84\u3002
                  \n\u5c0f\u84dd\u7684\u56fe\u7531 2021 \u4e2a\u7ed3\u70b9\u7ec4\u6210\uff0c\u4f9d\u6b21\u7f16\u53f7 1 \u81f3 2021\u3002
                  \n\u5bf9\u4e8e\u4e24\u4e2a\u4e0d\u540c\u7684\u7ed3\u70b9 a.b\uff0c\u5982\u679c a \u548c b\u7684\u5dee\u7684\u7edd\u5bf9\u503c\u5927\u4e8e 21\uff0c\u5219\u4e24\u4e2a\u7ed3\u70b9\u4e4b\u95f4\u6ca1\u6709\u8fb9\u76f8\u8fde:\u5982\u679c a \u548c b \u7684\u5dee\u7684\u7edd\u5bf9\u503c\u5c0f\u4e8e\u7b49\u4e8e 21\uff0c\u5219\u4e24\u4e2a\u70b9\u4e4b\u95f4\u6709\u4e00\u6761\u957f\u5ea6\u4e3a a \u548c b \u7684\u6700\u5c0f\u516c\u500d\u6570\u7684\u65e0\u5411\u8fb9\u76f8\u8fde\u3002
                  \n\u4f8b\u5982: \u7ed3\u70b9 1 \u548c\u7ed3\u70b9 23 \u4e4b\u95f4\u6ca1\u6709\u8fb9\u76f8\u8fde:\u7ed3\u70b9 3 \u548c\u7ed3\u70b9 24 \u4e4b\u95f4\u6709\u4e00\u6761\u65e0\u5411\u8fb9\uff0c\u957f\u5ea6\u4e3a 24: \u7ed3\u70b9 15 \u548c\u7ed3\u70b9 25 \u4e4b\u95f4\u6709\u4e00\u6761\u65e0\u5411\u8fb9\uff0c\u957f\u5ea6\u4e3a 75\u3002\u8bf7\u8ba1\u7b97\uff0c\u7ed3\u70b9 1 \u548c\u7ed3\u70b9 2021 \u4e4b\u95f4\u7684\u6700\u77ed\u8def\u5f84\u957f\u5ea6\u662f\u591a\u5c11\u3002<\/p>\n
                  public class LuJing {\npublic static void main(String[] args) {\n    int a = 21;\n    for (int i = 21; i + 21 < 2021; i += 21) {\n        a = a + i * (i + 21) \/ 21;\n    }\n    a = a + 2016 * 2021;\n    System.out.println(a);\n}\n\n}<\/code><\/pre>\n
                  \u7b54\u6848\uff1a10266837<\/strong><\/p>\n<\/li>\n
                6. \n
                  \u65f6\u95f4\u663e\u793a<\/p>\n
                  \u5c0f\u84dd\u8981\u548c\u670b\u53cb\u5408\u4f5c\u5f00\u53d1\u4e00\u4e2a\u65f6\u95f4\u663e\u793a\u7684\u7f51\u7ad9\u3002\u5728\u670d\u52a1\u5668\u4e0a\uff0c\u670b\u53cb\u5df2\u7ecf\u83b7\u53d6\u4e86\u5f53\u524d\u7684\u65f6\u95f4\uff0c\u7528\u4e00\u4e2a\u6574\u6570\u8868\u793a\uff0c\u503c\u4e3a\u4ece 1970 \u5e74 1 \u6708 1 \u65e5 00:00:00 \u5230\u5f53\u524d\u65f6\u523b\u7ecf\u8fc7\u7684\u6beb\u79d2\u6570\u3002
                  \n\u73b0\u5728\uff0c\u5c0f\u84dd\u8981\u5728\u5ba2\u6237\u7aef\u663e\u793a\u51fa\u8fd9\u4e2a\u65f6\u95f4\u3002\u5c0f\u84dd\u4e0d\u7528\u663e\u793a\u51fa\u5e74\u6708\u65e5\uff0c\u53ea\u9700\u8981\u663e\u793a\u51fa\u65f6\u5206\u79d2\u5373\u53ef\uff0c\u6beb\u79d2\u4e5f\u4e0d\u7528\u663e\u793a\uff0c\u76f4\u63a5\u820d\u53bb\u5373\u53ef\u3002
                  \n\u7ed9\u5b9a\u4e00\u4e2a\u7528\u6574\u6570\u8868\u793a\u7684\u65f6\u95f4\uff0c\u8bf7\u5c06\u8fd9\u4e2a\u65f6\u95f4\u5bf9\u5e94\u7684\u65f6\u5206\u79d2\u8f93\u51fa\u3002<\/p>\n
                  public class ShiJianXianShi {\npublic static void main(String[] args) {\n    Scanner scan = new Scanner(System.in);\n    long n = scan.nextLong();\n    n \/= 1000;\n    n %= (24 * 60 * 60);\n    long hours = n \/ 3600;\n    long minutes = n \/ 60 % 60;\n    long seconds = n % 60;\n    System.out.printf(\"%02d:%02d:%02d\", hours, minutes, seconds);\n    scan.close();\n}\n}<\/code><\/pre>\n
                  \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1aI\uff1a46800999 \uff0cO\uff1a13:00:00 \uff1bcase 2\uff1aI\uff1a1618708103123 \uff0cO\uff1a01:08:23<\/p>\n<\/li>\n
                7. \n
                  \u6700\u5c11\u781d\u7801<\/p>\n
                  \u4f60\u6709\u4e00\u67b6\u5929\u5e73\u3002\u73b0\u5728\u4f60\u8981\u8bbe\u8ba1\u4e00\u5957\u781d\u7801\uff0c\u4f7f\u5f97\u5229\u7528\u8fd9\u4e9b\u781d\u7801\u53ef\u4ee5\u79f0\u51fa\u4efb\u610f\u5c0f\u4e8e\u7b49\u4e8e N \u7684\u6b63\u6574\u6570\u91cd\u91cf\u3002
                  \n\u90a3\u4e48\u8fd9\u5957\u781d\u7801\u6700\u5c11\u9700\u8981\u5305\u542b\u591a\u5c11\u4e2a\u781d\u7801?
                  \n\u6ce8\u610f\u781d\u7801\u53ef\u4ee5\u653e\u5728\u5929\u5e73\u4e24\u8fb9\u3002<\/p>\n
                  public class ZuiShaoFaMa {\npublic static void main(String[] args) {\n    Scanner scan = new Scanner(System.in);\n    int n = scan.nextInt();\n    scan.close();\n    int number = 1;\/\/ \u781d\u7801\u6570\u91cf\uff0c\u9ed8\u8ba4\u5fc5\u987b\u6709\u781d\u78011\n    int count = 1;\/\/ \u781d\u7801\u91cd\u91cf1\uff0c\u781d\u7801\u6bcf\u6b21\u9012\u589e\u90fd\u662f*3\n    int scope = 1;\/\/ \u8303\u56f4\u4ece1\u5f00\u59cb\n    while (scope < n) {\n        count *= 3; \/\/ count\u6bcf\u6b21\u90fd\u662f*3\u500d\n        scope += count; \/\/ \u8303\u56f4\u6570\u91cf\u90fd\u662f\u52a0\u4e0a\u5f53\u524d\u7684\u781d\u7801\u91cd\u91cf\n        number++;\n    }\n    System.out.println(number);\n}\n}<\/code><\/pre>\n
                  \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a7 \uff0cO\uff1a3<\/p>\n<\/li>\n
                8. \n
                  \u6768\u8f89\u4e09\u89d2\u5f62<\/p>\n
                  <\/div><\/p>\n
                  \u5982\u679c\u6211\u4eec\u6309\u4ece\u4e0a\u5230\u4e0b\u3001\u4ece\u5de6\u5230\u53f3\u7684\u987a\u5e8f\u628a\u6240\u6709\u6570\u6392\u6210\u4e00\u5217\uff0c\u53ef\u4ee5\u5f97\u5230\u5982\u4e0b\u6570\u5217:
                  \n1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, ...
                  \n\u7ed9\u5b9a\u4e00\u4e2a\u6b63\u6574\u6570 N\uff0c\u8bf7\u4f60\u8f93\u51fa\u6570\u5217\u4e2d\u7b2c\u4e00\u6b21\u51fa\u73b0 N \u662f\u5728\u7b2c\u51e0\u4e2a\u6570?<\/p>\n
                  public class YangHuiSanJiaoXing {\nstatic long[] num = new long[44723];\n\npublic static void main(String[] args) {\n    Scanner scan = new Scanner(System.in);\n    long N = scan.nextLong();\n    if (N == 1) {\n        System.out.println(1);\n        return;\n    }\n    num[1] = 1L;\n    \/\/ dp\u8ba1\u7b97\n    for (int i = 2; i <= 44722; ++i) {\n        for (int j = i; j >= 1; --j) {\n            num[j] += num[j - 1];\n            if (num[j] == N) {\n                \/*\n                 * \u8fd9\u91cc\u5bb9\u6613\u51fa\u9519! \u56e0\u4e3a\u662f\u4e0b\u6807\u4ece\u5927\u5230\u5c0f\u7684dp,\u6768\u8f89\u4e09\u89d2\u662f\u5bf9\u79f0\u7684\uff0c\u5148\u6ee1\u8db3\u7684\u662f\u5bf9\u79f0\u8f74\u53f3\u8fb9\u7684\u6570 \u8fd9\u91cc\u7ed3\u679cres\u7684\u8ba1\u7b97\u9700\u8981\u505a\u4e00\u4e0b\u5bf9\u79f0\u5904\u7406\uff0c\u4e0d\u662fi*(i-1)\/2 +j\n                 * \u5b9e\u9645\u4e0a\u662f\u7b2ci\u884c\u7684\u7b2ci-j+1\u4e2a\u6570\u9996\u5148\u6ee1\u8db3\u76f8\u7b49\u6761\u4ef6\n                 *\/\n                long res = (((long) i * ((long) i - 1)) >> 1) + i - j + 1;\n                System.out.println(res);\n                return;\n            }\n        }\n    }\n    \/\/ \u6b64\u65f6\uff0cN\u4e00\u5b9a\u662f \u7b2cN+1\u884c\u7684\u7b2c\u4e8c\u4e2a\u6570\n    long res = ((N * (N + 1)) >> 1) + 2;\n    System.out.println(res);\n}\n}<\/code><\/pre>\n
                  \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a6\u3000\uff0cO\uff1a13<\/p>\n<\/li>\n
                9. \n
                  \u5de6\u5b69\u5b50\u53f3\u5144\u5f1f<\/p>\n
                  \u5bf9\u4e8e\u4e00\u68f5\u591a\u53c9\u6811\uff0c\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u201c\u5de6\u5b69\u5b50\u53f3\u5144\u5f1f\u201d\u8868\u793a\u6cd5\uff0c\u5c06\u5176\u8f6c\u5316\u6210\u4e00\u68f5\u4e8c\u53c9\u6811\u3002
                  \n\u5982\u679c\u6211\u4eec\u8ba4\u4e3a\u6bcf\u4e2a\u7ed3\u70b9\u7684\u5b50\u7ed3\u70b9\u662f\u65e0\u5e8f\u7684\uff0c\u90a3\u4e48\u5f97\u5230\u7684\u4e8c\u53c9\u6811\u53ef\u80fd\u4e0d\u552f\u4e00\u3002\u6362\u53e5\u8bdd\u8bf4\uff0c\u6bcf\u4e2a\u7ed3\u70b9\u53ef\u4ee5\u9009\u4efb\u610f\u5b50\u7ed3\u70b9\u4f5c\u4e3a\u5de6\u5b69\u5b50\uff0c\u5e76\u6309\u4efb\u610f\u987a\u5e8f\u8fde\u63a5\u53f3\u5144\u5f1f\u3002\u7ed9\u5b9a\u4e00\u68f5\u5305\u542b N \u4e2a\u7ed3\u70b9\u7684\u591a\u53c9\u6811\uff0c\u7ed3\u70b9\u4ece 1\u81f3 N \u7f16\u53f7\uff0c\u5176\u4e2d 1 \u53f7\u7ed3\u70b9\u662f\u6839\uff0c\u6bcf\u4e2a\u7ed3\u70b9\u7684\u7236\u7ed3\u70b9\u7684\u7f16\u53f7\u6bd4\u81ea\u5df1\u7684\u7f16\u53f7\u5c0f\u3002\u8bf7\u4f60\u8ba1\u7b97\u5176\u901a\u8fc7\u201c\u5de6\u5b69\u5b50\u53f3\u5144\u5f1f\u201d\u8868\u793a\u6cd5\u8f6c\u5316\u6210\u7684\u4e8c\u53c9\u6811\uff0c\u9ad8\u5ea6\u6700\u9ad8\u662f\u591a\u5c11\u3002\u6ce8: \u53ea\u6709\u6839\u7ed3\u70b9\u8fd9\u4e00\u4e2a\u7ed3\u70b9\u7684\u6811\u9ad8\u5ea6\u4e3a 0\u3002
                  \n\u4f8b\u5982\u5982\u4e0b\u7684\u591a\u53c9\u6811:<\/p>\n
                  <\/div><\/p>\n
                  \u53ef\u80fd\u6709\u4ee5\u4e0b 3 \u79cd(\u8fd9\u91cc\u53ea\u5217\u51fa 3 \u79cd\uff0c\u5e76\u4e0d\u662f\u5168\u90e8) \u4e0d\u540c\u7684\u201c\u5de6\u5b69\u5b50\u53f3\u5144\u5f1f\u8868\u793a:<\/p>\n
                  <\/div><\/p>\n
                  \u5176\u4e2d\u6700\u540e\u4e00\u79cd\u9ad8\u5ea6\u6700\u9ad8\uff0c\u4e3a 4\u3002<\/p>\n
                  public class ZuoHaiZiYouXiongDi {\nstatic Map> map = new HashMap<>();\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    for (int i = 2; i <= n; i++) {\n        int a = sc.nextInt();\n        \/\/ \u5224\u65ad\u4e00\u4e2a\u952e\u5728\u96c6\u5408\u91cc\u9762\u662f\u5426\u5b58\u5728\uff0c\u5982\u679c\u4e0d\u5b58\u5728\u5c31\u5c06\u8fd9\u4e2aa\u6dfb\u52a0\u5230\u96c6\u5408\u4e2d\n        map.putIfAbsent(a, new ArrayList<>());\n        map.get(a).add(i);\n    }\n    int max = dsf(1);\n    System.out.println(max);\n}\n\npublic static int dsf(int x) {\n    int sum = 0, max = 0;\n    if (!map.containsKey(x)) {\n        return 0;\n    } else {\n        List aa = map.get(x);\n        sum = aa.size();\n        for (Integer item : aa) {\n            max = Math.max(dsf(item), max);\n        }\n        return sum + max;\n    }\n}\n}<\/code><\/pre>\n
                  \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5\\n1\\n1\\n1\\n2 \uff0cO\uff1a4<\/p>\n<\/li>\n
                10. \n
                  \u53cc\u5411\u6392\u5e8f<\/p>\n
                  \u7ed9\u5b9a\u5e8f\u5217 $(a_1,a_2,...,a_n)=(1,2,...,n)$\uff0c\u5373$a_i=i$
                  \n\u5c0f\u84dd\u5c06\u5bf9\u8fd9\u4e2a\u5e8f\u5217\u8fdb\u884c m \u6b21\u64cd\u4f5c\uff0c\u6bcf\u6b21\u53ef\u80fd\u662f\u5c06 $a_1,a2,...,a<\/em>{qi}$\u964d\u5e8f\u6392\u5217\u6216\u8005\u5c06$a<\/em>{qi},a<\/em>{q_i+1},...,a_n$\u5347\u5e8f\u6392\u5217\u3002
                  \n\u8bf7\u6c42\u51fa\u64cd\u4f5c\u5b8c\u6210\u540e\u7684\u5e8f\u5217\u3002<\/p>\n
                  public class ShuangXiangPaiXv {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt(); \/\/ \u63a5\u6536n\u548cm\n        int m = sc.nextInt();\n        Integer[] nums = new Integer[n + 1];\n        for (int i = 1; i < n + 1; i++) { \/\/ \u521d\u59cb\u5316\u6240\u6709\u6570\u5b57\n            nums[i] = i;\n        }\n        for (int i = 0; i < m; i++) {\n            int p1 = sc.nextInt(), p2 = sc.nextInt();\n            if (p1 == 0) \/\/ \u82e5\u64cd\u4f5c\u662f0\uff0c\u5219\u5012\u5e8f\u6392\u5e8f\n                downSort(nums, p2 + 1);\n            if (p1 == 1) \/\/ \u82e5\u64cd\u4f5c\u662f1\uff0c\u5219\u5347\u5e8f\u6392\u5e8f\n                upSort(nums, p2);\n        }\n        for (int i = 1; i < n + 1; i++) {\n            System.out.print(nums[i] + \" \");\n        }\n    }\n\n    private static void upSort(Integer[] arr, int start) { \/\/ \u5347\u5e8f\u6392\u5e8f\u65b9\u6cd5\n        Arrays.sort(arr, start, arr.length);\n    }\n\n    private static void downSort(Integer[] arr, int end) { \/\/ \u964d\u5e8f\u6392\u5e8f\u65b9\u6cd5\n        Arrays.sort(arr, 1, end, Collections.reverseOrder());\n    }\n}<\/code><\/pre>\n
                  \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a3 3\\n0 3\\n1 2\\n0 2 \uff0cO\uff1a3 1 2<\/p>\n<\/li>\n<\/ol>\n
                  \n
                  \u7b2c\u5341\u4e09\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef6143)<\/a><\/h3>\n
                    \n
                  1. \n
                    \u6392\u5217\u5b57\u6bcd<\/p>\n
                    \u5c0f\u84dd\u8981\u628a\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u7684\u5b57\u6bcd\u6309\u5176\u5728\u5b57\u6bcd\u8868\u4e2d\u7684\u987a\u5e8f\u6392\u5217\u3002\u4f8b\u5982\uff0cLANQIAO \u6392\u5217\u540e\u4e3a AAILNOQ\u3002\u53c8\u5982\uff0cGOODGOODSTUDYDAYDAYUP \u6392\u5217\u540e\u4e3a AADDDDDGGOOOOPSTUUYYY
                    \n\u8bf7\u95ee\u5bf9\u4e8e\u4ee5\u4e0b\u5b57\u7b26\u4e32\uff0c\u6392\u5217\u4e4b\u540e\u5b57\u7b26\u4e32\u662f\u4ec0\u4e48?<\/p>\n
                    WHERETHEREISAWILLTHEREISAWAY<\/p>\n
                    public class PaiLieZiMu {\npublic static void main(String[] args) {                        java.util.Arrays.stream(\"WHERETHEREISAWILLTHEREISAWAY\".split(\"\")).sorted().forEach(System.out::print);\n}\n}<\/code><\/pre>\n
                    \u7b54\u6848\uff1aAAAEEEEEEHHHIIILLRRRSSTTWWWY<\/strong><\/p>\n<\/li>\n
                  2. \n
                    \u7279\u6b8a\u65f6\u95f4<\/p>\n
                    2022 \u5e74 2 \u6708 22 \u65e5 22:20 \u662f\u4e00\u4e2a\u5f88\u6709\u610f\u4e49\u7684\u65f6\u95f4\uff0c\u5e74\u4efd\u4e3a 2022\uff0c\u75313\u4e2a2\u548c 1\u4e2a0\u7ec4\u6210\uff0c\u5982\u679c\u5c06\u6708\u548c\u65e5\u5199\u6210 4 \u4f4d\uff0c\u4e3a 0222\uff0c\u4e5f\u662f\u75313\u4e2a2\u548c1\u4e2a0\u7ec4\u6210\uff0c\u5982\u679c\u5c06\u65f6\u95f4\u4e2d\u7684\u65f6\u548c\u5206\u5199\u6210 4 \u4f4d\uff0c\u8fd8\u662f\u7531 3 \u4e2a 2 \u548c 1\u4e2a0 \u7ec4\u6210
                    \n\u5c0f\u84dd\u5bf9\u8fd9\u6837\u7684\u65f6\u95f4\u5f88\u611f\u5174\u8da3\uff0c\u4ed6\u8fd8\u627e\u5230\u4e86\u5176\u5b83\u7c7b\u4f3c\u7684\u4f8b\u5b50\uff0c\u6bd4\u5982 111 \u5e74 10\u6708 11 \u65e5 01:11\uff0c2202 \u5e74 2 \u6708 22 \u65e5 22:02 \u7b49\u7b49\u3002
                    \n\u8bf7\u95ee\uff0c\u603b\u5171\u6709\u591a\u5c11\u4e2a\u65f6\u95f4\u662f\u8fd9\u79cd\u5e74\u4efd\u5199\u6210 4 \u4f4d\u3001\u6708\u65e5\u5199\u6210 4 \u4f4d\u3001\u65f6\u95f4\u5199\u62104 \u4f4d\u540e\u7531 3 \u4e2a\u4e00\u79cd\u6570\u5b57\u548c 1 \u4e2a\u53e6\u4e00\u79cd\u6570\u5b57\u7ec4\u6210\u3002\u6ce8\u610f 1111 \u5e74 11 \u6708 11 \u65e5 11:11\u4e0d\u7b97\uff0c\u56e0\u4e3a\u5b83\u91cc\u9762\u6ca1\u6709\u4e24\u79cd\u6570\u5b57\u3002<\/p>\n
                    public class TeShuShiJian {\npublic static void main(String[] args) {\n    DateTimeFormatter d1 = DateTimeFormatter.ofPattern(\"MMdd\");\n       DateTimeFormatter d2 = DateTimeFormatter.ofPattern(\"HHmm\");\n       LocalDateTime start = LocalDateTime.of(0000, 01, 01, 00, 00);\n       LocalDateTime end = LocalDateTime.of(0000, 12, 31, 23, 59);\n       int[] buff = new int[128];\n       int ans = 0;\n       for (; start.compareTo(end) <= 0; start = start.plusMinutes(1)) {\n           for (char i = '0'; i <= '9'; ++i) buff[i] = 0;\n           for (byte b : start.format(d1).getBytes()) ++buff[b];\n           boolean flag1 = true, flag3 = true;\n           for (char i = '0'; i <= '9'; ++i)\n               if (buff[i] == 1) flag1 = false;\n               else if (buff[i] == 3) flag3 = false;\n           if (flag1 || flag3) continue;\n           for (byte b : start.format(d2).getBytes()) --buff[b];\n           for (char i = '0'; i <= '9'; ++i)\n               if (buff[i] != 0) flag1 = true;\n           if (!flag1) ++ans;\n       }\n       System.out.println(4 * ans);\n}\n}<\/code><\/pre>\n
                    \u7b54\u6848\uff1a212<\/strong><\/p>\n<\/li>\n
                  3. \n
                    \u7eb8\u5f20\u5c3a\u5bf8<\/p>\n
                    \u5728 ISO \u56fd\u9645\u6807\u51c6\u4e2d\u5b9a\u4e49\u4e86 A0 \u7eb8\u5f20\u7684\u5927\u5c0f\u4e3a 1189m x 841mm\uff0c\u5c06 AO \u7eb8\u6cbf\u957f\u8fb9\u5bf9\u6298\u540e\u4e3a A1 \u7eb8\uff0c\u5927\u5c0f\u4e3a 841mm x 594mm\uff0c\u5728\u5bf9\u6298\u7684\u8fc7\u7a0b\u4e2d\u957f\u5ea6\u76f4\u63a5\u53d6\u4e0b\u6574 (\u5b9e\u9645\u88c1\u526a\u65f6\u53ef\u80fd\u6709\u635f\u8017)\u3002\u5c06 A1 \u7eb8\u6cbf\u957f\u8fb9\u5bf9\u6298\u540e\u4e3a A2 \u7eb8\uff0c\u4f9d\u6b64\u7c7b\u63a8\u3002\u8f93\u5165\u7eb8\u5f20\u7684\u540d\u79f0\uff0c\u8bf7\u8f93\u51fa\u7eb8\u5f20\u7684\u5927\u5c0f\u3002<\/p>\n
                    public class ZhiZhangChiCun {\npublic static void main(String[] args) {\n    \/\/ TODO Auto-generated method stub\n    Scanner sc = new Scanner(System.in);\n    \/\/ A0\u5c3a\u5bf8\n    int a = 1189;\n    int b = 841;\n    String c = sc.next();\n    sc.close();\n    for (int i = 0; i < c.charAt(1) - 48; i++) {\n        if (a >= b) {\n            a \/= 2;\n        } else {\n            b \/= 2;\n        }\n    }\n    if (a >= b) {\n        System.out.println(a);\n    }\n    System.out.println(b);\n    if (a < b) {\n        System.out.println(a);\n    }\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1acase 1\uff1aI\uff1aA0 \uff0cO\uff1a1189\\n841 \uff0ccase 2\uff1aI\uff1aA1 \uff0cO\uff1a841\\n594<\/p>\n<\/li>\n
                  4. \n
                    \u6c42\u548c<\/p>\n
                    \u7ed9\u5b9a n \u4e2a\u6574\u6570 $a_1,a_2,...,a_n$ \uff0c\u6c42\u5b83\u4eec\u4e24\u4e24\u76f8\u4e58\u518d\u76f8\u52a0\u7684\u548c\uff0c\u5373$S=a_1a_2+a_1<\/em>a_3+...+a_1a_n+a_2<\/em>a3+...+a<\/em>{n-2}a{n-1}+a<\/em>{n-2}<\/em>an+a<\/em>{n-1}*a_n$<\/p>\n
                    public class QiuHe {\npublic static void main(String[] args) {\n    \/\/ TODO Auto-generated method stub\n    Scanner sc = new Scanner(System.in);\n    int a = sc.nextInt();\n    int[] array = new int[a];\n    long count = 0;\n    for (int i = 0; i < array.length; i++) {\n        array[i] = sc.nextInt();\n    }\n    sc.close();\n    for (int i = 0; i < array.length; i++) {\n        for (int j = i + 1; j < array.length; j++) {\n            count += array[i] * array[j];\n        }\n    }\n    System.out.println(count);\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a4\\n1 3 6 9 \uff0cO\uff1a117<\/p>\n<\/li>\n
                  5. \n
                    \u77e9\u5f62\u62fc\u63a5<\/p>\n
                    \u5df2\u77e5 3 \u4e2a\u77e9\u5f62\u7684\u5927\u5c0f\u4f9d\u6b21\u662f $a_1b_1,a_2<\/em>b_2$ \u548c $a_3*b_3$\u3002\u7528\u8fd9 3 \u4e2a\u77e9\u5f62\u80fd\u62fc\u51fa\u7684\u6240\u6709\u591a\u8fb9\u5f62\u4e2d\uff0c\u8fb9\u6570\u6700\u5c11\u53ef\u4ee5\u662f\u591a\u5c11?
                    \n\u4f8b\u5982\u7528 3x2 \u7684\u77e9\u5f62(\u7528A \u8868\u793a)\u30014X1 \u7684\u77e9\u5f62(\u7528 B \u8868\u793a) \u548c2x4 \u7684\u77e9\u5f62 (\u7528 c \u8868\u793a) \u53ef\u4ee5\u62fc\u51fa\u5982\u4e0b 4 \u8fb9\u5f62\u3002<\/p>\n
                    <\/div><\/p>\n
                    \u4f8b\u5982\u7528 3x2 \u7684\u77e9\u5f62(\u7528 A \u8868\u793a)\u30013X1 \u7684\u77e9\u5f62(\u7528 B \u8868\u793a) \u548c 1X1\u7684\u77e5\u5f62(\u7528 c \u8868\u793a) \u53ef\u4ee5\u62fc\u51fa\u5982\u4e0b 6 \u8fb9\u5f62\u3002<\/p>\n
                    <\/div><\/p>\n
                    public class JvXingPinJie {\npublic static void main(String[] args) {\n    \/\/ TODO Auto-generated method stub\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    int[] b = new int[n];\n    for (int i = 0; i < n; i++) {\n        int[][] squares = new int[3][2];\n        for (int j = 0; j < 3; j++) {\n            squares[j][0] = sc.nextInt();\n            squares[j][1] = sc.nextInt();\n        }\n        boolean matchingSides = false;\n        for (int j = 0; j < 3; j++) {\n            for (int k = 0; k < 3; k++) {\n                if (j != k && (squares[j][0] == squares[k][0] || squares[j][0] == squares[k][1]\n                        || squares[j][1] == squares[k][0] || squares[j][1] == squares[k][1])) {\n                    matchingSides = true;\n                    break;\n                }\n            }\n            if (matchingSides) {\n                break;\n            }\n        }\n\n        b[i] = matchingSides ? 4 : 6;\n    }\n    sc.close();\n    for (int i = 0; i < n; i++) {\n        System.out.println(b[i]);\n    }\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a2\\n2 3 4 1 2 4\\n1 2 3 4 5 6 \uff0cO\uff1a4\\n6<\/p>\n<\/li>\n
                  6. \n
                    \u9009\u6570\u5f02\u6216<\/p>\n
                    \u7ed9\u5b9a\u4e00\u4e2a\u957f\u5ea6\u4e3a n \u7684\u6570\u5217 $A_1,A_2,...,A_n$ \u548c\u4e00\u4e2a\u975e\u8d1f\u6574\u6570 x\uff0c\u7ed9\u5b9a m \u6b21\u67e5\u8be2,\u6bcf\u6b21\u8be2\u95ee\u80fd\u5426\u4ece\u67d0\u4e2a\u533a\u95f4$[l,r]$\u4e2d\u9009\u62e9\u4e24\u4e2a\u6570\u4f7f\u5f97\u4ed6\u4eec\u7684\u5f02\u6216\u7b49\u4e8e x\u3002<\/p>\n
                    public class XuanShuYiHuo {\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    int m = sc.nextInt();\n    int x = sc.nextInt();\n    int a = 0;\n    int dep[] = new int[n + 1];\/\/ \u50a8\u5b58\u6570\u5217\u67d0\u4e2a\u4f4d\u7f6e\uff0c\u81f3\u5c11\u5b58\u5728\u4e00\u5bf9\u6570\u5f02\u6216\u7b49\u4e8ex\u7684\u6700\u5927\u5de6\u4e0b\u6807\u3002\n    int map[] = new int[1 << 20];\/\/ \u50a8\u5b58\u6570\u5217\u4e2d\u4efb\u610f\u4e00\u4e2a\u5143\u7d20\u7684\u4f4d\u7f6e\u3002\u5927\u5c0f\u4e3a2^20\n    for (int i = 1; i <= n; i++) {\n        a = sc.nextInt();\n        dep[i] = Math.max(dep[i - 1], map[a ^ x]);\/\/ \u6570\u5217\u524d\u4e00\u4e2a\u5143\u7d20\u4e5f\u53ef\u80fd\u6709\u6ee1\u8db3\u6761\u4ef6\u7684\u4e0b\u6807\uff0c\u53d6\u6700\u5927\u5373\u53ef\u3002\n        map[a] = i;\/\/ \u5199\u5728\u6700\u540e\u662f\u9632\u6b62\u6709a^a=x,\u7684\u53ef\u80fd\u51fa\u73b0\u3002\n        \/\/ \u5982\u679cmap[a^x]>a,\u7531\u4e8e\u8fd8\u6ca1\u6709\u8f93\u5165\u8fc7a^x,\u6240\u4ee5map[a^x]\u5b9e\u9645\u4e0a\u662f\u9ed8\u8ba4\u503c0\n    }\n    for (int j = 0; j < m; j++) {\n        int l = sc.nextInt();\n        int r = sc.nextInt();\n        System.out.println(dep[r] >= l ? \"yes\" : \"no\");\n    }\n    sc.close();\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a4 4 1\\n1 2 3 4\\n1 4\\n1 2\\n2 3\\n3 3 \uff0cO\uff1ayes no yes no<\/p>\n
                    \u5907\u6ce8\uff1a\u8f93\u5165\u65f6\u5c31\u4f1a\u8f93\u51fa\u5bf9\u5e94\u7ed3\u679c\uff0c\u7ee7\u7eed\u6309\u6837\u4f8b\u8f93\u5165\u81f3\u7a0b\u5e8f\u7ed3\u675f\u5373\u53ef<\/p>\n<\/li>\n
                  7. \n
                    GCD<\/p>\n
                    \u7ed9\u5b9a\u4e24\u4e2a\u4e0d\u540c\u7684\u6b63\u6574\u6570 a,b\uff0c\u6c42\u4e00\u4e2a\u6b63\u6574\u6570 k \u4f7f\u5f97 gcd(a + k,b + k) \u5c3d\u53ef\u80fd\u5927\uff0c\u5176\u4e2d gcd(a,b) \u8868\u793a a \u548c b \u7684\u6700\u5927\u516c\u7ea6\u6570\uff0c\u5982\u679c\u5b58\u5728\u591a\u4e2a k\uff0c\u8bf7\u8f93\u51fa\u6240\u6709\u6ee1\u8db3\u6761\u4ef6\u7684 k \u4e2d\u6700\u5c0f\u7684\u90a3\u4e2a\u3002<\/p>\n
                    public class GCD {\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    long a = sc.nextLong();\n    long b = sc.nextLong();\n    sc.close();\n    long max = Math.abs(a - b);\n    System.out.print(max - (a % max));\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5 7 \uff0cO\uff1a1<\/p>\n<\/li>\n
                  8. \n
                    \u9752\u86d9\u8fc7\u6cb3<\/p>\n
                    \u5c0f\u9752\u86d9\u4f4f\u5728\u4e00\u6761\u6cb3\u8fb9\uff0c\u5b83\u60f3\u5230\u6cb3\u5bf9\u5cb8\u7684\u5b66\u6821\u53bb\u5b66\u4e60\u3002\u5c0f\u9752\u86d9\u6253\u7b97\u7ecf\u8fc7\u6cb3\u91cc\u7684\u77f3\u5934\u8df3\u5230\u5bf9\u5cb8\u3002
                    \n\u6cb3\u91cc\u7684\u77f3\u5934\u6392\u6210\u4e86\u4e00\u6761\u76f4\u7ebf\uff0c\u5c0f\u9752\u86d9\u6bcf\u6b21\u8df3\u8dc3\u5fc5\u987b\u843d\u5728\u4e00\u5757\u77f3\u5934\u6216\u8005\u5cb8\u4e0a\u3002\u4e0d\u8fc7\uff0c\u6bcf\u5757\u77f3\u5934\u6709\u4e00\u4e2a\u9ad8\u5ea6\uff0c\u6bcf\u6b21\u5c0f\u9752\u86d9\u4ece\u4e00\u5757\u77f3\u5934\u8d77\u8df3\uff0c\u8fd9\u5757\u77f3\u5934\u7684\u9ad8\u5ea6\u5c31\u4f1a\u4e0b\u964d 1\uff0c\u5f53\u77f3\u5934\u7684\u9ad8\u5ea6\u4e0b\u964d\u5230 0 \u65f6\u5c0f\u9752\u86d9\u4e0d\u80fd\u518d\u8df3\u5230\u8fd9\u5757\u77f3\u5934\u4e0a(\u67d0\u6b21\u8df3\u8dc3\u540e\u4f7f\u77f3\u5934\u9ad8\u5ea6\u4e0b\u964d\u5230 0 \u662f\u5141\u8bb8\u7684)\u3002
                    \n\u5c0f\u9752\u86d9\u4e00\u5171\u9700\u8981\u53bb\u5b66\u6821\u4e0a  \u5929\u8bfe\uff0c\u6240\u4ee5\u5b83\u9700\u8981\u5f80\u8fd4 2x \u6b21\u3002\u5f53\u5c0f\u9752\u86d9\u5177\u6709\u4e2a\u8df3\u8dc3\u80fd\u529b y \u65f6\uff0c\u5b83\u80fd\u8df3\u4e0d\u8d85\u8fc7 y \u7684\u8ddd\u79bb\u3002
                    \n\u8bf7\u95ee\u5c0f\u9752\u86d9\u7684\u8df3\u8dc3\u80fd\u529b\u81f3\u5c11\u662f\u591a\u5c11\u624d\u80fd\u7528\u8fd9\u4e9b\u77f3\u5934\u4e0a\u5b8c x \u6b21\u8bfe<\/p>\n
                    public class QingWaGuoHe {\npublic static void main(String[] args) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    long x = sc.nextLong();\n    long[] arr = new long[n + 1];\n    for (int i = 1; i < n; i++) {\n        arr[i] = sc.nextLong() + arr[i - 1];\n    }\n    sc.close();\n    arr[n] = arr[n - 1] + 999999999999L;\n    int l = 0;\n    int sum = 0;\n    for (int i = 1; i <= n; i++) {\n        if (arr[i] - arr[l] >= 2L * x) {\n            sum = Math.max(sum, i - l);\n            l += 1;\n        }\n    }\n    System.out.println(sum);\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5 1\\n1 0 1 0 \uff0cO\uff1a4<\/p>\n<\/li>\n
                  9. \n
                    \u56e0\u6570\u5e73\u65b9\u548c<\/p>\n
                    \u8bb0f(x) \u4e3ax \u7684\u6240\u6709\u56e0\u6570\u7684\u5e73\u65b9\u7684\u548c\u3002\u4f8b\u5982: $f(12)=1^2+2^2+3^2+4^2+6^2+12^2$
                    \n\u5b9a\u4e49 $g(n)=\\sum_{i=1}^nf(i)$ \u3002\u7ed9\u5b9a n,\u6c42 g(n) \u9664\u4ee5 $10^9+7$ \u7684\u4f59\u6570<\/p>\n
                    public class YinShuPingFangHe {\npublic static void main(String[] args) {\n    final long N = 1000000007;\n    final long inv6 = 166666668;\n    Scanner sc = new Scanner(System.in);\n    long res = 0, temp = 0, sum = 0;\n    long n, l, r, k;\n    n = sc.nextInt();\n    sc.close();\n    for (long i = 1; i <= n; i = r + 1) {\n        l = i;\n        k = n \/ i;\n        r = n \/ (n \/ l);\n        temp = sum;\n        sum = r * (r + (long) 1) % N * ((long) 2 * r + 1) % N * inv6 % N;\n        res = (res + k * (sum - temp) + N) % N;\n    }\n\n    System.out.println(res);\n}\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a100000 \uff0cO\uff1a680584257<\/p>\n<\/li>\n
                  10. \n
                    \u6700\u957f\u4e0d\u4e0b\u964d\u5b50\u5e8f\u5217<\/p>\n
                    \u7ed9\u5b9a\u4e00\u4e2a\u957f\u5ea6\u4e3a N \u7684\u6574\u6570\u5e8f\u5217: $A_1,A_2,...,A_N$\u3002\u73b0\u5728\u4f60\u6709\u4e00\u6b21\u673a\u4f1a\uff0c\u5c06\u5176\u4e2d\u8fde\u7eed\u7684 K \u4e2a\u6570\u4fee\u6539\u6210\u4efb\u610f\u4e00\u4e2a\u76f8\u540c\u503c\u3002\u8bf7\u4f60\u8ba1\u7b97\u5982\u4f55\u4fee\u6539\u53ef\u4ee5\u4f7f\u4fee\u6539\u540e\u7684\u6570\u5217\u7684\u6700\u957f\u4e0d\u4e0b\u964d\u5b50\u5e8f\u5217\u6700\u957f\uff0c\u8bf7\u8f93\u51fa\u8fd9\u4e2a\u6700\u957f\u7684\u957f\u5ea6\u3002
                    \n\u6700\u957f\u4e0d\u4e0b\u964d\u5b50\u5e8f\u5217\u662f\u6307\u5e8f\u5217\u4e2d\u7684\u4e00\u4e2a\u5b50\u5e8f\u5217\uff0c\u5b50\u5e8f\u5217\u4e2d\u7684\u6bcf\u4e2a\u6570\u4e0d\u5c0f\u4e8e\u5728\u5b83\u4e4b\u524d\u7684\u6570\u3002<\/p>\n
                    public class ZuiChangBuXiaJiangZiXvLie {\n    static int n_max = 1000000;\n    static int[] arr = new int[n_max];\n    static boolean[] c = new boolean[n_max];\n    static long n, k;\n\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        n = sc.nextInt();\n        k = sc.nextInt();\n        c[0] = true;\n        for (int i = 0; i < n; i++) {\n            arr[i] = sc.nextInt();\n        }\n        sc.close();\n        for (int i = 1; i < n; i++) {\n            if (arr[i] < arr[i - 1]) {\n                c[i] = false;\n            } else {\n                c[i] = true;\n            }\n        }\n        int max = 0;\n        for (int i = 0; i < n; i++) {\n            if (k > 0) {\n                if (c[i]) {\n                    max++;\n                } else {\n                    k--;\n                    max++;\n                }\n            } else if (k == 0) {\n                if (c[i]) {\n                    max++;\n                } else {\n                    System.out.println(max);\n                    break;\n                }\n\n            }\n        }\n    }\n}<\/code><\/pre>\n
                    \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5 1\\n1 4 2 8 5 \uff0cO\uff1a4<\/p>\n<\/li>\n<\/ol>\n
                    \n
                    \u7b2c\u5341\u56db\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef6189)<\/a><\/h3>\n
                      \n
                    1. \n
                      \u6c42\u548c<\/p>\n
                      \u6c42 1 (\u542b) \u81f3 20230408 (\u542b)\u4e2d\u6bcf\u4e2a\u6570\u7684\u548c<\/p>\n
                      public class QiuHe {\npublic static void main(String[] args) {\n       System.out.println((long) (1 + 20230408) * (20230408 >>> 1));\n   }\n}<\/code><\/pre>\n
                      \u7b54\u6848\uff1a204634714038436<\/strong><\/p>\n<\/li>\n
                    2. \n
                      \u5206\u7cd6\u679c<\/p>\n
                      \u4e24\u79cd\u7cd6\u679c\u5206\u522b\u6709 9 \u4e2a\u548c 16 \u4e2a\uff0c\u8981\u5168\u90e8\u5206\u7ed9 7 \u4e2a\u5c0f\u670b\u53cb\uff0c\u6bcf\u4e2a\u5c0f\u670b\u53cb\u5f97\u5230\u7684\u7cd6\u679c\u603b\u6570\u6700\u5c11\u4e3a 2 \u4e2a\u6700\u591a\u4e3a 5 \u4e2a\uff0c\u95ee\u6709\u591a\u5c11\u79cd\u4e0d\u540c\u7684\u5206\u6cd5\u3002\u7cd6\u679c\u5fc5\u987b\u5168\u90e8\u5206
                      \n\u53ea\u8981\u6709\u5176\u4e2d\u4e00\u4e2a\u5c0f\u670b\u53cb\u5728\u4e24\u79cd\u65b9\u6848\u4e2d\u5206\u5230\u7684\u7cd6\u679c\u4e0d\u5b8c\u5168\u76f8\u540c\uff0c\u8fd9\u4e24\u79cd\u65b9\u6848\u5c31\u7b97\u4f5c\u4e0d\u540c\u7684\u65b9\u6848\u3002<\/p>\n
                      public class FenTangGuo {\npublic static void main(String[] args) {\n    dfs(1, 9, 16);\n    System.out.println(sum);\n}\n\nstatic int sum = 0;\n\nstatic void dfs(int x, int a, int b) {\n    if (x == 8) {\n        if (a == 0 && b == 0) {\n            \/\/ \u5982\u679c\u4e03\u4e2a\u4eba\u6070\u597d\u5206\u5b8c\u5219\u8ba1\u6570\u52a0\u4e00\n            sum++;\n        }\n        return;\n    }\n\n    for (int i = 0; i <= a; i++) {\n        for (int j = 0; j <= b; j++) {\n            if (i + j >= 2 && i + j <= 5) {\n                \/\/ \u53ea\u6709\u6ee1\u8db32-5\u7684\u6761\u4ef6\u624d\u53ef\u4ee5\n                dfs(x + 1, a - i, b - j);\n            }\n        }\n    }\n}\n}<\/code><\/pre>\n
                      \u7b54\u6848\uff1a5067671<\/strong><\/p>\n<\/li>\n
                    3. \n
                      \u4e09\u56fd\u6e38\u620f<\/p>\n
                      \u5c0f\u84dd\u6b63\u5728\u73a9\u4e00\u6b3e\u6e38\u620f\u3002\u6e38\u620f\u4e2d\u9b4f\u8700\u5434\u4e09\u4e2a\u56fd\u5bb6\u5404\u81ea\u62e5\u6709\u4e00\u5b9a\u6570\u91cf\u7684\u58eb\u5175x,yZ(\u4e00\u5f00\u59cb\u53ef\u4ee5\u8ba4\u4e3a\u90fd\u4e3a 0 )\u3002\u6e38\u620f\u6709 n \u4e2a\u53ef\u80fd\u4f1a\u53d1\u751f\u7684\u4e8b\u4ef6\uff0c\u6bcf\u4e2a\u4e8b\u4ef6\u4e4b\u95f4\u76f8\u4e92\u72ec\u7acb\u4e14\u6700\u591a\u53ea\u4f1a\u53d1\u751f\u4e00\u6b21\uff0c\u5f53\u7b2c i \u4e2a\u4e8b\u4ef6\u53d1\u751f\u65f6\u4f1a\u5206\u522b\u8ba9 x,yZ \u589e\u52a0Ai, Bi, Ci
                      \n\u5f53\u6e38\u620f\u7ed3\u675f\u65f6 (\u6240\u6709\u4e8b\u4ef6\u7684\u53d1\u751f\u4e0e\u5426\u5df2\u7ecf\u786e\u5b9a)\uff0c\u5982\u679c xyZ \u7684\u5176\u4e2d\u4e00\u4e2a\u5927\u4e8e\u53e6\u5916\u4e24\u4e2a\u4e4b\u548c\uff0c\u6211\u4eec\u8ba4\u4e3a\u5176\u83b7\u80dc\u3002\u4f8b\u5982\uff0c\u5f53 X >Y +Z \u65f6\uff0c\u6211\u4eec\u8ba4\u4e3a\u9b4f\u56fd\u83b7\u80dc\u3002\u5c0f\u84dd\u60f3\u77e5\u9053\u6e38\u620f\u7ed3\u675f\u65f6\u5982\u679c\u6709\u5176\u4e2d\u4e00\u4e2a\u56fd\u5bb6\u83b7\u80dc\uff0c\u6700\u591a\u53d1\u751f\u4e86\u591a\u5c11\u4e2a\u4e8b\u4ef6?\u5982\u679c\u4e0d\u5b58\u5728\u4efb\u4f55\u80fd\u8ba9\u67d0\u56fd\u83b7\u80dc\u7684\u60c5\u51b5\uff0c\u8bf7\u8f93\u51fa -1\u3002<\/p>\n
                      public class SanGuoYouXi {\nstatic BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\nstatic StreamTokenizer st = new StreamTokenizer(br);\nstatic PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));\n\npublic static void main(String[] args) throws Exception {\n    int n = nextInt();\n    int[] a = new int[n];\n    int[] b = new int[n];\n    int[] c = new int[n];\n    for (int i = 0; i < n; i++)\n        a[i] = nextInt();\n    for (int i = 0; i < n; i++)\n        b[i] = nextInt();\n    for (int i = 0; i < n; i++)\n        c[i] = nextInt();\n    for (int i = 0; i < n; i++) {\n        int x = a[i], y = b[i], z = c[i];\n        a[i] = x - y - z;\n        b[i] = y - z - x;\n        c[i] = z - x - y;\n    }\n    Arrays.sort(a);\n    Arrays.sort(b);\n    Arrays.sort(c);\n    int s = 0;\n    long sum = 0, ans = 0, count = 0;\n    for (int i = n - 1; i >= 0; i--) {\n        sum += a[i];\n        ans += b[i];\n        count += c[i];\n        if (sum > 0 || ans > 0 || count > 0)\n            s = n - i;\n    }\n    pw.println(s);\n    pw.flush();\n}\n\npublic static int nextInt() throws Exception {\n    st.nextToken();\n    return (int) st.nval;\n}\n\npublic static long nextLong() throws Exception {\n    st.nextToken();\n    return (long) st.nval;\n}\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a3 \\n 1 2 2\\n2 3 2\\n1 0 7 \uff0cO\uff1a2<\/p>\n<\/li>\n
                    4. \n
                      \u5e73\u5747<\/p>\n
                      \u6709\u4e00\u4e2a\u957f\u5ea6\u4e3a n \u7684\u6570\u7ec4 (n \u662f 10 \u7684\u500d\u6570)\uff0c\u6bcf\u4e2a\u6570  \u90fd\u662f\u533a\u95f4[0,9] \u4e2d\u7684\u6574\u6570\u3002\u5c0f\u660e\u53d1\u73b0\u6570\u7ec4\u91cc\u6bcf\u79cd\u6570\u51fa\u73b0\u7684\u6b21\u6570\u4e0d\u592a\u5e73\u5747\uff0c\u800c\u66f4\u6539\u7b2c i\u4e2a\u6570\u7684\u4ee3\u4ef7\u4e3ab;\uff0c\u4ed6\u60f3\u66f4\u6539\u82e5\u5e72\u4e2a\u6570\u7684\u503c\u4f7f\u5f97\u8fd9 10 \u79cd\u6570\u51fa\u73b0\u7684\u6b21\u6570\u76f8\u7b49(\u90fd\u7b49\u4e8e )\uff0c\u8bf7\u95ee\u4ee3\u4ef7\u548c\u6700\u5c11\u4e3a\u591a\u5c11\u3002<\/p>\n
                      public class PingJun {\nstatic BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\nstatic StreamTokenizer st = new StreamTokenizer(br);\nstatic PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));\n\npublic static void main(String[] args) throws Exception {\n    int n = nextInt();\n    int[][] f = new int[n][2];\n    int[] d = new int[10];\n    for (int i = 0; i < n; i++) {\n        f[i][0] = nextInt();\/\/ \u503c\n        f[i][1] = nextInt();\/\/ \u4ef7\n    }\n    Arrays.sort(f, ((a, b) -> {\n        if (a[0] != b[0])\n            return a[0] - b[0];\n        return a[1] - b[1];\n    }));\n    long sum = 0;\n    for (int i = n - 1; i >= 0; i--) {\n        d[f[i][0]]++;\n        if (d[f[i][0]] > n \/ 10)\n            sum += f[i][1];\n    }\n    pw.println(sum);\n    pw.flush();\n}\n\npublic static int nextInt() throws Exception {\n    st.nextToken();\n    return (int) st.nval;\n}\n\npublic static long nextLong() throws Exception {\n    st.nextToken();\n    return (long) st.nval;\n}\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a10\\n1 1\\n1 2\\n1 3\\n2 4\\n2 5\\n2 6\\n3 7\\n3 8\\n3 9\\n4 10 \uff0cO\uff1a27<\/p>\n<\/li>\n
                    5. \n
                      \u586b\u5145<\/p>\n
                      \u6709\u4e00\u4e2a\u957f\u5ea6\u4e3a n \u7684 01 \u4e32\uff0c\u5176\u4e2d\u6709\u4e00\u4e9b\u4f4d\u7f6e\u6807\u8bb0\u4e3a ?\uff0c\u8fd9\u4e9b\u4f4d\u7f6e\u4e0a\u53ef\u4ee5\u4efb\u610f\u586b\u5145 0 \u6216\u8005 1\uff0c\u8bf7\u95ee\u5982\u4f55\u586b\u5145\u8fd9\u4e9b\u4f4d\u7f6e\u4f7f\u5f97\u8fd9\u4e2a 01 \u4e32\u4e2d\u51fa\u73b0\u4e92\u4e0d\u91cd\u53e0\u7684 00 \u548c11 \u5b50\u4e32\u6700\u591a\uff0c\u8f93\u51fa\u5b50\u4e32\u4e2a\u6570\u3002<\/p>\n
                      public class TianChong {\nstatic BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\nstatic StreamTokenizer st = new StreamTokenizer(br);\nstatic PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));\n\npublic static void main(String[] args) throws Exception {\n    Scanner sc = new Scanner(System.in);\n    String ss = sc.nextLine();\n    boolean[] f = new boolean[ss.length() + 1];\n    int count = 0;\n    for (int i = 1; i < ss.length(); i++) {\n        if (ss.charAt(i) == '?') {\n            if (!f[i - 1]) {\n                count++;\n                f[i] = true;\n            } else if (i != ss.length() - 1) {\n                count++;\n                f[i + 1] = true;\n                i++;\n            }\n        } else if (ss.charAt(i) == ss.charAt(i - 1) && !f[i - 1] || ss.charAt(i - 1) == '?' && !f[i - 1]) {\n            count++;\n            f[i] = true;\n        }\n    }\n    pw.println(count);\n    pw.flush();\n}\n\npublic static int nextInt() throws Exception {\/\/ int\u578b\n    st.nextToken();\n    return (int) st.nval;\n}\n\npublic static long nextLong() throws Exception {\/\/ long\u578b\n    st.nextToken();\n    return (long) st.nval;\n}\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a1110?0 \uff0cO\uff1a2<\/p>\n<\/li>\n
                    6. \n
                      \u68cb\u76d8<\/p>\n
                      \u5c0f\u84dd\u62e5\u6709 n xn \u5927\u5c0f\u7684\u68cb\u76d8\uff0c\u4e00\u5f00\u59cb\u68cb\u76d8\u4e0a\u5168\u90fd\u662f\u767d\u5b50\u3002\u5c0f\u84dd\u8fdb\u884c\u4e86 m \u6b21\u64cd\u4f5c\uff0c\u6bcf\u6b21\u64cd\u4f5c\u4f1a\u5c06\u68cb\u76d8\u4e0a\u67d0\u4e2a\u8303\u56f4\u5185\u7684\u6240\u6709\u68cb\u5b50\u7684\u989c\u8272\u53d6\u53cd (\u4e5f\u5c31\u662f\u767d\u8272\u68cb\u5b50\u53d8\u4e3a\u9ed1\u8272\uff0c\u9ed1\u8272\u68cb\u5b50\u53d8\u4e3a\u767d\u8272)\u3002\u8bf7\u8f93\u51fa\u6240\u6709\u64cd\u4f5c\u505a\u5b8c\u540e\u68cb\u76d8\u4e0a\u6bcf\u4e2a\u68cb\u5b50\u7684\u989c\u8272<\/p>\n
                      public class QiPan {\nstatic BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\nstatic StreamTokenizer st = new StreamTokenizer(br);\nstatic PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));\n\npublic static void main(String[] args) throws Exception {\n    int n = nextInt();\n    int m = nextInt();\n    int[][] f = new int[n + 2][n + 2];\n    for (int i = 0; i < m; i++) {\n        int x1 = nextInt(), y1 = nextInt(), x2 = nextInt(), y2 = nextInt();\n        for (int j = x1; j <= x2; j++) {\n            f[j][y1]++;\n            f[j][y2 + 1]--;\n        }\n    }\n    for (int i = 1; i <= n; i++) {\n        for (int j = 1; j <= n; j++) {\n            f[i][j] += f[i][j - 1];\n            if (f[i][j] % 2 == 0)\n                pw.print(0 + \" \");\n            else\n                pw.print(1 + \" \");\n        }\n        pw.println();\n    }\n    pw.flush();\n}\n\npublic static int nextInt() throws Exception {\/\/ int\u578b\n    st.nextToken();\n    return (int) st.nval;\n}\n\npublic static long nextLong() throws Exception {\/\/ long\u578b\n    st.nextToken();\n    return (long) st.nval;\n}\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a3 3\\n1 1 2 2\\n2 2 3 3\\n1 1 3 3 \uff0cO\uff1a0 0 1 \\n0 1 0 \\n1 0 0 <\/p>\n<\/li>\n
                    7. \n
                      \u5b50\u77e9\u9635<\/p>\n
                      \u7ed9\u5b9a\u4e00\u4e2a nxm (n\u884c m\u5217)\u7684\u77e9\u9635\u3002
                      \n\u8bbe\u4e00\u4e2a\u77e9\u9635\u7684\u4ef7\u503c\u4e3a\u5176\u6240\u6709\u6570\u4e2d\u7684\u6700\u5927\u503c\u548c\u6700\u5c0f\u503c\u7684\u4e58\u79ef\u3002\u6c42\u7ed9\u5b9a\u77e9\u9635\u7684\u6240\u6709\u5927\u5c0f\u4e3a a x b (a \u884c b \u5217)\u7684\u5b50\u77e9\u9635\u7684\u4ef7\u503c\u7684\u548c\u3002
                      \n\u7b54\u6848\u53ef\u80fd\u5f88\u5927\uff0c\u4f60\u53ea\u9700\u8981\u8f93\u51fa\u7b54\u6848\u5bf9 998244353 \u53d6\u6a21\u540e\u7684\u7ed3\u679c<\/p>\n
                      public class ZiJvZhen {\npublic static void main(String[] args) {\n    int n = nextInt(), m = nextInt();\n       int a = nextInt(), b = nextInt();\n       long ans = 0;\n       for (int i = 1; i <= n; ++i)\n           for (int j = 1; j <= m; ++j)\n               matrix[i][j] = nextInt();\n       Deque maxq = new ArrayDeque();\n       Deque minq = new ArrayDeque();\n       for (int j = 1; j <= m; ++j) {\n           maxq.clear();\n           minq.clear();\n           for (int i = 1; i <= n; ++i) {\n               while (!maxq.isEmpty() && maxq.peekFirst() <= i - a) maxq.pollFirst();\n               while (!minq.isEmpty() && minq.peekFirst() <= i - a) minq.pollFirst();\n               while (!maxq.isEmpty() && matrix[i][j] >= matrix[maxq.peekLast()][j]) maxq.pollLast();\n               while (!minq.isEmpty() && matrix[i][j] <= matrix[minq.peekLast()][j]) minq.pollLast();\n               maxq.offerLast(i);\n               minq.offerLast(i);\n               max[i][j] = matrix[maxq.peekFirst()][j];\n               min[i][j] = matrix[minq.peekFirst()][j];\n           }\n       }\n       for (int i = 1; i <= n; ++i) {\n           maxq.clear();\n           minq.clear();\n           for (int j = 1; j <= m; ++j) {\n               while (!maxq.isEmpty() && maxq.peekFirst() <= j - b) maxq.pollFirst();\n               while (!minq.isEmpty() && minq.peekFirst() <= j - b) minq.pollFirst();\n               while (!maxq.isEmpty() && max[i][j] >= max[i][maxq.peekLast()]) maxq.pollLast();\n               while (!minq.isEmpty() && min[i][j] <= min[i][minq.peekLast()]) minq.pollLast();\n               maxq.offerLast(j);\n               minq.offerLast(j);\n               if (i >= a && j >= b)\n                   ans = (ans + (long) max[i][maxq.peekFirst()] * min[i][minq.peekFirst()]) % 998244353;\n           }\n       }\n       System.out.println(ans);\n}\n\n   static int[][] matrix = new int[1001][1001];\nstatic int[][] max = new int[1001][1001];\nstatic int[][] min = new int[1001][1001];\n\n   static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n\n   static int nextInt() {\n       try {\n           in.nextToken();\n       } catch (IOException e) {\n           e.printStackTrace();\n       }\n       return (int) in.nval;\n   }\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a2 3 1 2\\n1 2 3\\n4 5 6 \uff0cO\uff1a58<\/p>\n<\/li>\n
                    8. \n
                      \u516c\u56e0\u6570\u5339\u914d<\/p>\n
                      \u7ed9\u5b9a n \u4e2a\u6b63\u6574\u6570 A;\uff0c\u8bf7\u627e\u51fa\u4e24\u4e2a\u6570  \u4f7f\u5f97 i<j\u4e14 A;\u548c A\u5b58\u5728\u5927\u4e8e 1\u7684\u516c\u56e0\u6570\u3002
                      \n\u5982\u679c\u5b58\u5728\u591a\u7ec4 i;j\uff0c\u8bf7\u8f93\u51fa i\u6700\u5c0f\u7684\u90a3\u7ec4\u3002\u5982\u679c\u4ecd\u7136\u5b58\u5728\u591a\u7ec4 i.i\uff0c\u8bf7\u8f93\u51fa i\u6700\u5c0f\u7684\u6240\u6709\u65b9\u6848\u4e2d \u6700\u5c0f\u7684\u90a3\u7ec4\u3002<\/p>\n
                      public class GongYinShuPiPei {\nstatic BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\nstatic StreamTokenizer st = new StreamTokenizer(br);\nstatic PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));\n\npublic static void main(String[] args) throws Exception {\n    int n = nextInt();\n    Map map = new HashMap<>();\n    int min = 99999999, max = 0;\n    int r = min, l = 0;\n    for (int i = 0; i < n; i++) {\n        int a = nextInt();\n        int k = (int) (Math.sqrt(a) + 2);\n\n        for (int j = 2; j <= k; j++) {\n            if (a % j == 0 && a != j) {\n                if (map.get(j) == null)\n                    map.put(j, i + 1);\n                else {\n                    r = Math.min(r, map.get(j));\n                    l = i + 1;\n                }\n                if (map.get(a \/ j) == null)\n                    map.put(a \/ j, i + 1);\n                else {\n                    r = Math.min(r, map.get(a \/ j));\n                    l = i + 1;\n                }\n            }\n        }\n        if (map.get(a) == null)\n            map.put(a, i + 1);\n        else if (a != 1) {\n            r = Math.min(r, map.get(a));\n            l = i + 1;\n        }\n        if (r != min) {\n            min = r;\n            max = l;\n        }\n    }\n    pw.println(min + \" \" + max);\n    pw.flush();\n}\n\npublic static int nextInt() throws Exception {\/\/ int\u578b\n    st.nextToken();\n    return (int) st.nval;\n}\n\npublic static long nextLong() throws Exception {\/\/ long\u578b\n    st.nextToken();\n    return (long) st.nval;\n}\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a5\\n5 3 2 6 9 \uff0cO\uff1a2 4<\/p>\n<\/li>\n
                    9. \n
                      \u5f02\u6216\u548c\u4e4b\u5dee<\/p>\n
                      \u7ed9\u5b9a\u4e00\u4e2a\u542b\u6709 n \u4e2a\u5143\u7d20\u7684\u6570\u7ec4 A;\uff0c\u4f60\u53ef\u4ee5\u9009\u62e9\u4e24\u4e2a\u4e0d\u76f8\u4ea4\u7684\u5b50\u6bb5\u3002\u6c42\u51fa\u8fd9\u4e24\u4e2a\u5b50\u6bb5\u5185\u7684\u6570\u7684\u5f02\u6216\u548c\u7684\u5dee\u503c\u7684\u6700\u5927\u503c\u3002<\/p>\n
                      public class YiHuoHeZhiCha {\npublic static void main(String[] args) {\n    int n = nextInt(), ans = 0;\n    for (int i = 1; i <= n; ++i)\n        A[i] = nextInt();\n    Trie lt = new YiHuoHeZhiCha().new Trie(), rt = new YiHuoHeZhiCha().new Trie();\n    lmin[0] = rmin[n + 1] = 0x3f3f3f3f;\n    for (int i = 1, s = 0; i <= n; ++i) {\n        lt.insert(s);\n        s ^= A[i];\n        lmax[i] = Math.max(lmax[i - 1], lt.xorMax(s));\n        lmin[i] = Math.min(lmin[i - 1], lt.xorMin(s));\n    }\n    for (int i = n, s = 0; i >= 1; --i) {\n        rt.insert(s);\n        s ^= A[i];\n        rmax[i] = Math.max(rmax[i + 1], rt.xorMax(s));\n        rmin[i] = Math.min(rmin[i + 1], rt.xorMin(s));\n    }\n    for (int i = 1; i < n; ++i) {\n        ans = Math.max(ans, rmax[i + 1] - lmin[i]);\n        ans = Math.max(ans, lmax[i] - rmin[i + 1]);\n    }\n    System.out.println(ans);\n}\n\nstatic int[] A = new int[200001];\nstatic int[] lmax = new int[200002];\nstatic int[] lmin = new int[200002];\nstatic int[] rmax = new int[200002];\nstatic int[] rmin = new int[200002];\n\nclass Trie {\n    int high = 20;\n    Node root = new Node();\n    void insert(int x) {\n        Node cur = root;\n        for (int i = high; i >= 0; --i) {\n            int bit = (x >> i) & 1;\n            if (cur.ch[bit] == null)\n                cur.ch[bit] = new Node();\n            cur = cur.ch[bit];\n        }\n    }\n\n    int xorMax(int x) {\n        int max = 0;\n        Node cur = root;\n        for (int i = high; i >= 0; --i) {\n            int bit = (x >> i) & 1;\n            if (cur.ch[bit ^ 1] != null) {\n                cur = cur.ch[bit ^ 1];\n                max |= 1 << i;\n            } else {\n                cur = cur.ch[bit];\n            }\n        }\n        return max;\n    }\n\n    int xorMin(int x) {\n        int min = 0;\n        Node cur = root;\n        for (int i = high; i >= 0; --i) {\n            int bit = (x >> i) & 1;\n            if (cur.ch[bit] != null) {\n                cur = cur.ch[bit];\n            } else {\n                min |= 1 << i;\n                cur = cur.ch[bit ^ 1];\n            }\n        }\n        return min;\n    }\n\n    class Node {\n        Node[] ch = new Node[2];\n    }\n\n}\n\nstatic StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));\n\nstatic int nextInt() {\n    try {\n        in.nextToken();\n    } catch (IOException e) {\n        e.printStackTrace();\n    }\n    return (int) in.nval;\n}\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a6\\n1 2 4 9 2 7 ,O\uff1a14<\/p>\n<\/li>\n
                    10. \n
                      \u592a\u9633<\/p>\n
                      \u8fd9\u5929\uff0c\u5c0f\u84dd\u5728\u4e8c\u7ef4\u5750\u6807\u7cfb\u7684\u70b9 (X,Y) \u4e0a\u653e\u4e86\u4e00\u4e2a\u592a\u9633\uff0c\u770b\u505a\u70b9\u5149\u6e90\u3002\u4ed6\u62ff\u6765\u4e86 m \u6761\u7ebf\u6bb5\uff0c\u5c06\u5b83\u4eec\u5e73\u884c\u4e8e x \u8f74\u653e\u7f6e\u5728\u4e86\u5750\u6807\u7cfb\u4e2d\uff0c\u7b2ci \u6761\u7ebf\u6bb5\u7684\u5de6\u7aef\u70b9\u5728 x,y\uff0c\u957f\u5ea6\u4e3a\u98de\u3002\u7ebf\u6bb5\u4e4b\u95f4\u4e0d\u4f1a\u6709\u91cd\u5408\u6216\u90e8\u5206\u91cd\u5408\u7684\u60c5\u51b5(\u4f46\u53ef\u80fd\u51fa\u73b0\u7aef\u70b9\u76f8\u4ea4)\u3002\u5c0f\u84dd\u60f3\u77e5\u9053\u6709\u591a\u5c11\u6761\u7ebf\u6bb5\u80fd\u88ab\u592a\u9633\u7167\u4eae (\u4e00\u6761\u7ebf\u6bb5\u6709\u957f\u5ea6\u5927\u4e8e 0\u7684\u90e8\u5206\u88ab\u7167\u4eae\u5c31\u7b97)\u3002<\/p>\n
                      public class TaiYang {\n    static Scanner sc = new Scanner(System.in);\n    static int n = sc.nextInt();\n    static int X = sc.nextInt();\n    static int Y = sc.nextInt();\n\n    public static void main(String[] args) {\n        List list = new ArrayList<>();\n        for (int i = 0; i < n; i++) {\n            int x = sc.nextInt();\n            int y = sc.nextInt();\n            int l = sc.nextInt();\n            list.add(new Triple(x, y, l));\n        } \/\/ \u5c06\u6240\u6709x,y,l\u8bfb\u5165list\u4e2d\n        list.sort(new Comparator() {\n            @Override\n            public int compare(Triple l1, Triple l2) {\n                return -Integer.compare(l1.y, l2.y);\n            }\n        }); \/\/ \u4ee5y\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\n        double[] arr1 = new double[2 * n]; \/\/ \u4fdd\u6301\u4ee5y\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\u7684\u987a\u5e8f\u8fdb\u884c\u5728x\u8f74\u4e0a\u7684\u8986\u76d6\n        double[] arr2 = new double[2 * n]; \/\/ \u4ee5\u5728x\u8f74\u4e0a\u7684\u5750\u6807\u503c\u6392\u5e8f\uff0c\u65b9\u4fbf\u4e8c\u5206\u67e5\u627e\n        int i = -1;\n        for (Triple item : list) {\n            arr1[++i] = arr2[i] = y0x(item.x, item.y);\n            arr1[n + i] = arr2[n + i] = y0x(item.x + item.l, item.y);\n        }\n        Arrays.sort(arr2);\n        boolean[] tree = new boolean[1 << 19]; \/\/ \u5c06\u5df2\u8986\u76d6\u7684\u4f4d\u7f6e\u8fdb\u884c\u6807\u8bb0\n        boolean f = false;\n        int ans = 0;\n        for (int j = 0; j < n; j++) {\n            int l = Arrays.binarySearch(arr2, arr1[j]);\n            int r = Arrays.binarySearch(arr2, arr1[j + n]);\n            for (int k = l; k < r; k++) {\n                if (!tree[k]) {\n                    tree[k] = true;\n                    f = true;\n                }\n            }\n            if (f) {\n                ++ans;\n                f = false;\n            }\n        }\n        System.out.println(ans);\n    }\n\n    public static double y0x(int x, int y) {\n        if (x == X)\n            return x;\n        long a = (long) X * y;\n        long b = (long) Y * x;\n        return (b - a) \/ ((Y - y) * 1.0);\n    } \/\/ \u8fd4\u56de\u7aef\u70b9\u5728x\u8f74\u4e0a\u7684\u6295\u5f71\n}\n\nclass Triple {\n    int x, y, l;\n\n    public Triple(int x, int y, int l) {\n        this.x = x;\n        this.y = y;\n        this.l = l;\n    }\n}<\/code><\/pre>\n
                      \u6d4b\u8bd5\u7528\u4f8b\uff1aI\uff1a3 10 2000000\\n5 3 5\\n6 2 4\\n0 1 10 \uff0cO\uff1a2<\/p>\n<\/li>\n<\/ol>\n
                      \n
                      \u7d42\u308f\u308a<\/p>\n","protected":false},"excerpt":{"rendered":"
                      \u7b2c\u516d\u5c4a \u7701\u8d5b(\u771f\u9898\u8bfe\u4ef614) \u9694\u884c\u53d8\u8272 Excel \u8868\u7684\u683c\u5b50\u5f88\u591a\uff0c\u4e3a\u4e86\u907f\u514d\u628a\u67d0\u884c\u7684\u6570\u636e\u548c\u76f8\u90bb\u884c\u6df7\u6dc6\uff0c\u53ef\u4ee5\u91c7\u7528\u9694 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[13],"tags":[],"class_list":["post-26","post","type-post","status-publish","format-standard","hentry","category-13"],"_links":{"self":[{"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=\/wp\/v2\/posts\/26","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=26"}],"version-history":[{"count":2,"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=\/wp\/v2\/posts\/26\/revisions"}],"predecessor-version":[{"id":28,"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=\/wp\/v2\/posts\/26\/revisions\/28"}],"wp:attachment":[{"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=26"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=26"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/boki.shifengzhi.top\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=26"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}