{
  "type": "code_options",
  "author": "csdn.net",
  "source": "solution.md",
  "exercise_id": "64cdf149702648d08e72882e5a4b194e",
  "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成",
  "title": "最小公倍数",
  "desc": [
    {
      "content": "\n<p>从键盘输入两个正整数&#xff0c;求出它们的最小公倍数并输出所求结果。</p>",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "cpp"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ]
  ],
  "template": {
    "content": "#include<stdio.h>\nint main() {\n    int m,n,temp,i;\n    scanf(\"%d%d\",&m,&n);\n    if(m<n) \n    {\n        temp = m;\n        m = n;\n        n = temp;\n    }\n    for(i=m; i>0; i++)  \n        if(i%m==0 && i%n==0)\n        {\n            printf(\"%d 和 %d 的最小公倍数是: %d\\n\", m, n, i);\n            break;\n        }\n    return 0;\n}",
    "language": "cpp"
  },
  "node_id": "dailycode-00acbdbae41242b1ab11f3f2a18db473",
  "license": "csdn.net",
  "created_at": 1637894160,
  "topic_link": "https://bbs.csdn.net/topics/600470147"
}