Code
#include <stdio.h>
#include <math.h>
int main()
{
int n,i;
scanf("%d",&n);
for(i=2; i<=(int)sqrt(n); i++)
{
if(n % i == 0)
break;
}
if(n == 1)
printf("This is not a prime.\n");
else if(i<=(int)sqrt(n))
printf("This is not a prime.\n");
else
printf("This is a prime.\n");
return 0;
}
反思:for循环练习,注意1需要单独判断,前期因为没判断1WA了……从2遍历到n的开方即可,可节省时间。