9:{"metadata":[["$","title","0",{"children":"蓝桥杯基础练习分解质因数 | Debug客栈 | 柑橘 RSS 阅读器"}],["$","meta","1",{"name":"description","content":"订阅更新(RSS/Atom): 问题描述　\n\n求出区间[a,b]中所有整数的质因数分解。\n输入格式\n\n输入两个整数a，b。\n输出格式　\n\n每行输出一个数的分解，形如k=a1*a2*a3…(a1<=a2<=a3…，k也是从小到大的)(具体可看样例)\n样例输入\n\n3 10\n样例输出\n\n\n\n\n1\n2\n3\n4\n5\n6\n7\n8\n\n\n\n3=3\n4=2*2\n5=5\n6=2*3\n7=7\n8=2*2*2\n9=3*3\n10=2*5\n\n\n\n\n\n提示先筛出所有素数，然后再分解。\n\n数据规模和约定　　\n\n2<=a<=b<=10000\nC++算法\n\n\n\n\n 1\n 2\n 3\n 4\n 5\n 6\n 7\n 8\n 9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n\n\n\n#include\n#include\n#include\n#include\n#include \n#include \nusing namespace std;\nint factor(int n)\n{\n int i, j = (int)sqrt(n);\n if (n % 2 == 0) return 2;\n for (i = 3; i <= j; i++)\n if (n % i == 0) return i;\n return n;\n}\n\nint main()\n{\n int i, j, k, m, n;\n scanf(\"%d%d\", &m, &n);\n for (i = m; i <= n; i++)\n {\n j = factor(i);\n k = i / j;\n printf(\"%d=%d\", i, j);\n while (k > 1)\n {\n j = factor(k);\n k /= j;\n printf(\"*%d\", j);\n }\n printf(\"\\n\");\n }\n return 0;\n}\n\n\n\n\n\n关注微信公众号，第一时间获取最新内容，让我们一起变得更强！\n\nDebug客栈：订阅本站· 文章归档· 我的项目· 友情链接· 我的使用· 摄影展集· 我的主页"}],["$","meta","2",{"name":"keywords","content":":blog"}],["$","meta","3",{"name":"robots","content":"index, follow"}],["$","meta","4",{"property":"og:title","content":"蓝桥杯基础练习分解质因数"}],["$","meta","5",{"property":"og:description","content":"订阅更新(RSS/Atom): 问题描述　\n\n求出区间[a,b]中所有整数的质因数分解。\n输入格式\n\n输入两个整数a，b。\n输出格式　\n\n每行输出一个数的分解，形如k=a1*a2*a3…(a1<=a2<=a3…，k也是从小到大的)(具体可看样例)\n样例输入\n\n3 10\n样例输出\n\n\n\n\n1\n2\n3\n4\n5\n6\n7\n8\n\n\n\n3=3\n4=2*2\n5=5\n6=2*3\n7=7\n8=2*2*2\n9=3*3\n10=2*5\n\n\n\n\n\n提示先筛出所有素数，然后再分解。\n\n数据规模和约定　　\n\n2<=a<=b<=10000\nC++算法\n\n\n\n\n 1\n 2\n 3\n 4\n 5\n 6\n 7\n 8\n 9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n\n\n\n#include\n#include\n#include\n#include\n#include \n#include \nusing namespace std;\nint factor(int n)\n{\n int i, j = (int)sqrt(n);\n if (n % 2 == 0) return 2;\n for (i = 3; i <= j; i++)\n if (n % i == 0) return i;\n return n;\n}\n\nint main()\n{\n int i, j, k, m, n;\n scanf(\"%d%d\", &m, &n);\n for (i = m; i <= n; i++)\n {\n j = factor(i);\n k = i / j;\n printf(\"%d=%d\", i, j);\n while (k > 1)\n {\n j = factor(k);\n k /= j;\n printf(\"*%d\", j);\n }\n printf(\"\\n\");\n }\n return 0;\n}\n\n\n\n\n\n关注微信公众号，第一时间获取最新内容，让我们一起变得更强！\n\nDebug客栈：订阅本站· 文章归档· 我的项目· 友情链接· 我的使用· 摄影展集· 我的主页"}],["$","meta","6",{"property":"og:site_name","content":"Citrus"}],["$","meta","7",{"property":"og:type","content":"article"}],["$","meta","8",{"property":"article:published_time","content":"2019-01-20T13:36:43.000Z"}],["$","meta","9",{"name":"twitter:card","content":"summary_large_image"}],["$","meta","10",{"name":"twitter:title","content":"蓝桥杯基础练习分解质因数"}],["$","meta","11",{"name":"twitter:description","content":"订阅更新(RSS/Atom): 问题描述　\n\n求出区间[a,b]中所有整数的质因数分解。\n输入格式\n\n输入两个整数a，b。\n输出格式　\n\n每行输出一个数的分解，形如k=a1*a2*a3…(a1<=a2<=a3…，k也是从小到大的)(具体可看样例)\n样例输入\n\n3 10\n样例输出\n\n\n\n\n1\n2\n3\n4\n5\n6\n7\n8\n\n\n\n3=3\n4=2*2\n5=5\n6=2*3\n7=7\n8=2*2*2\n9=3*3\n10=2*5\n\n\n\n\n\n提示先筛出所有素数，然后再分解。\n\n数据规模和约定　　\n\n2<=a<=b<=10000\nC++算法\n\n\n\n\n 1\n 2\n 3\n 4\n 5\n 6\n 7\n 8\n 9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n\n\n\n#include\n#include\n#include\n#include\n#include \n#include \nusing namespace std;\nint factor(int n)\n{\n int i, j = (int)sqrt(n);\n if (n % 2 == 0) return 2;\n for (i = 3; i <= j; i++)\n if (n % i == 0) return i;\n return n;\n}\n\nint main()\n{\n int i, j, k, m, n;\n scanf(\"%d%d\", &m, &n);\n for (i = m; i <= n; i++)\n {\n j = factor(i);\n k = i / j;\n printf(\"%d=%d\", i, j);\n while (k > 1)\n {\n j = factor(k);\n k /= j;\n printf(\"*%d\", j);\n }\n printf(\"\\n\");\n }\n return 0;\n}\n\n\n\n\n\n关注微信公众号，第一时间获取最新内容，让我们一起变得更强！\n\nDebug客栈：订阅本站· 文章归档· 我的项目· 友情链接· 我的使用· 摄影展集· 我的主页"}],"$L17","$L18"],"error":null,"digest":"$undefined"}

蓝桥杯 基础练习 分解质因数

蓝桥杯基础练习分解质因数