1013. 数素数 (20)

题目：http://www.patest.cn/contests/pat-b-practise/1013

代码：

#include <stdio.h>#include <math.h>int main(){  int m,n,count=0;  int i=2,j=0;  int is_sushu(int);  int flag = 1;  scanf("%d %d",&m,&n);  while (1)  {    if (is_sushu(i)==1)    {      count ++;      if (count >= m)        {        j++;        if (j==10)        {          printf(" %d\n",i);          j = 0;          flag = 1;        }        else        {          if (flag==1)          {            printf("%d",i);            flag = 0;          }          else            printf(" %d",i);        }      }      if (count == n)        break;    }    i++;  }  return 0;}int is_sushu(int i){  int j;  int flag = 1;  for (j=2;j<=(int)sqrt(i*1.0);j++)  {    if (i%j==0)    {      flag = 0;      break;    }  }  return flag;}