素数判定
摘要:
#include<stdio.h>#include<math.h>int prime(int n){ int i; for(i=2;i<=sqrt(n);i++) { if(n%i==0) return 0; else if(i>sqrt(n)) return 1; }}int main( ){ int x,y,i; while(scanf("%d%d",&x,&y),x||y) { for(i=... 阅读全文
posted @ 2011-04-28 14:27 more think, more gains 阅读(142) 评论(0) 推荐(0)