{
   "question_id": 7461173,
   "question_title": "n个素数的求和问题。",
   "question_content": "<p>给定n&#xff08;n≤100&#xff09;个正整数&#xff0c;所有正整数均≤1000000&#xff1b;求其中所有素数的和。\n例如给定序列&#xff1a; 2 3 4 5 6&#xff0c;素数和为&#xff1a;10\n给定序列&#xff1a; 3 4 5 6 7&#xff0c; 素数和为&#xff1a;15\n给定序列&#xff1a; 12 19 23 35 68 71&#xff0c; 素数和为&#xff1a; 113\n输入格式：\n输入为两行。第一行是一个正整数n&#xff0c;表示有多少个数据。第二行是n个正整数组成的序列。\n输出格式：\n输出一个正整数&#xff0c;是上述序列中所有素数之和。</p>",
   "difficulty": "简单",
   "answer_id": 53446246,
   "answer_content": "<pre>\n<code class=\"language-objectivec\">#include &lt;stdio.h&gt;\nint isprime( int n);\nint main()\n{\n    int i,n,m,s&#61;0;\n    scanf(&#34;%d&#34;, &amp;n);\n    for( i&#61;0; i&lt;n; i&#43;&#43; ) {\n        scanf(&#34;%d&#34;, &amp;m);\n        if(isprime(m)){\n            s&#43;&#61;m;\n        }\n    }\n    printf(&#34;%d&#34;, s);\n    return 0;\n}\nint isprime(int n)\n{\n    int i;\n    if(n&lt;&#61;1) return 0;\n    for(i&#61;2;i*i&lt;&#61;n;i&#43;&#43;)\n        if(n%i&#61;&#61;0) return 0;\n    return 1;\n}\n</code></pre>\n\n<p><img alt=\"\" height=\"61\" src=\"https://img-ask.csdnimg.cn/upload/1624791691130.png\" width=\"148\" /></p>\n",
   "tag_name": "c语言",
   "cpp": "#include <stdio.h>\nint isprime( int n);\nint main()\n{\n\tint i,n,m,s=0;\n\tscanf(\"%d\", &n);\n\tfor( i=0; i<n; i++ ) {\n\t\tscanf(\"%d\", &m);\n\t\tif(isprime(m)){\n\t\t\ts+=m;\n\t\t}\n\t}\n\tprintf(\"%d\", s);\n\treturn 0;\n}\nint isprime(int n)\n{\n\tint i;\n\tif(n<=1) return 0;\n\tfor(i=2;i*i<=n;i++)\n\t\tif(n%i==0) return 0;\n\treturn 1;\n}",
   "topic_link": "https://bbs.csdn.net/topics/600470160",
   "status": 1,
   "keywords": "算法高阶,数论算法,素数的测试,算法问题选编",
   "license": "csdn.net",
   "notebook": {
      "cpp": "https://codechina.csdn.net/csdn/csdn-daily-code/-/jupyter/master/data/notebook/answer/ipynb/cpp/57.ipynb?type=file"
   },
   "notebook_enable": 1
}