{
  "type": "code_options",
  "author": "csdn.net",
  "source": "solution.md",
  "exercise_id": "3576db7f962d40d09401af1997fa4566",
  "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成",
  "title": "找质数",
  "desc": [
    {
      "content": "\n找出大于200的最小的质数",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "java"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "java"
      }
    ],
    [
      {
        "content": "",
        "language": "java"
      }
    ],
    [
      {
        "content": "",
        "language": "java"
      }
    ]
  ],
  "template": {
    "content": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\nclass Ideone {\n\tpublic static void main(String[] args) throws java.lang.Exception {\n\t\tint n = 201;\n\t\twhile (true) {\n\t\t\tboolean b = true;\n\t\t\tfor (int i = 2; i < n / 2; i++) {\n\t\t\t\tif (n % i == 0)\n\t\t\t\t\tb = false;\n\t\t\t}\n\t\t\tif (b)\n\t\t\t\tbreak;\n\t\t\tn++;\n\t\t}\n\t\tSystem.out.println(n);\n\t}\n}",
    "language": "java"
  },
  "node_id": "dailycode-60a6ce1c2d794a2bbe410465d3a02887",
  "license": "csdn.net",
  "created_at": 1637894160,
  "topic_link": "https://bbs.csdn.net/topics/600469980"
}