acm网络一赛 1231:rabbit Composite number【简单合数】

http://acm.mnnu.edu.cn/Problem/show/id/1231.htm

#include<stdio.h>int a[10005],imprim[1005];void makeimprime()//可能筛选法找素数还是不太适合太大的数组范围吧，到3000多的时候就炸了{int i,j;memset(a,0,sizeof(a));for(i=2;i<5002;i++){for(j=i+i;j<10004;j+=i) a[j]=1;}for(i=2,j=0;i<10000;i++){//printf("%d\n",i);if(a[i]) imprim[j++]=i;}}int main(){int i,m,n;makeimprime();printf("1\n");while(EOF!=scanf("%d%d",&m,&n)){for(i=m;i<=n;i++)printf("%d ",a[i-1]);printf("\n");}return 0;}#include<stdio.h>//acint main(){int i,k,j,s[10005],m,n;for(i=2,k=0;i<10005;i++){for(j=2;j*j<=i;j++){if(i%j==0){s[k]=i;k++;break;}}}while(EOF!=scanf("%d%d",&m,&n)){for(i=m;i<=n;i++)printf("%d ",s[i-1]);printf("\n");}return 0;}