杭电1795-The last one

The least one
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 445    Accepted Submission(s): 159




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

//杭电1795：The last one
// 题目大意：输入一个数 M，求大于M且离M最近的素数； 
//解题思路：
//首先要写一个函数用来判断素数 ，假设输入一个数 M ,令 J=M+1;从M+1开始依次经行素数判断，
//当从M+1找到第一个素数时就是要找的最接近M的最小素数；打印输出，用break跳出循环； 
#include<stdio.h>
#include<math.h>
int sushu(int x){
	int i,a;
	a=sqrt(x);
	for(i=2;i<=a;i++)
	{
		if(x%i==0)
		 return 0;
		
	}
	return 1;	
}
int main()
{
	int t,m,j;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&m);
		j=m+1;
		while(m--)
		{
			if(sushu(j))
			{
			 printf("%d\n",j);
			 break;
			}
			j++;
		}
	}
    return 0;	
}