周练个人赛（hdoj 1795）（求素数问题）

     这道题理解题意有很大困难。其实就是求比原数大的最小素数

心得：

代码看似简单，但我却提交了数次，原因就是寻找素数的函数里不能从2找到本身（a<x），应该找到根号它（a<sqrt(X))，否则不是超时就是越界

    

六晚的BestCoder（有米！）

The least one Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 444    Accepted Submission(s): 158 Problem Description   In the RPG game “go back ice age”(I decide to develop the game after my undergraduate education), all heros have their own respected value, and the skill of killing monsters is defined as the following rule: one hero can kill the monstrers whose respected values are smaller then himself and the two respected values has none common factor but 1, so the skill is the same as the number of the monsters he can kill. Now each kind of value of the monsters come. And your hero have to kill at least M ones. To minimize the damage of the battle, you should dispatch a hero with minimal respected value. Which hero will you dispatch ? There are Q battles, in each battle, for i from 1 to Q, and your hero should kill Mi ones at least. You have all kind of heros with different respected values, and the values(heros’ and monsters’) are positive.   Input   The first line has one integer Q, then Q lines follow. In the Q lines there is an integer Mi, 0<Q<=1000000, 0<Mi<=10000.   Output   For each case, there are Q results, in each result, you should output the value of the hero you will dispatch to complete the task.   Sample Input 2 3 7   Sample Output 5 11

AC 码 <span style="font-size:14px;">#include<stdio.h> #include<cmath> int fun(int a) { for(int x=2;x<=sqrt(a);x++)//这一步x的分界很重要！！ if(a%x==0) return false; return true; } int main() { int i,n,j; int b; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&b); for(int j=b+1; ; j++) { if(fun (j)==1) { printf("%d\n",j); break; } } } return 0; }</span>