|
发表于 2009-10-31 01:15:06
|
显示全部楼层
IP:江苏扬州
我试了一个,不过好象有问题,帮忙看看。
#include <iostream> #include <math.h> using namespace std; int prime(int a) { int i,k,flag; k=(int)sqrt((double)a); for(i=2;i<=k;i++) if(a%i==0) {flag=0; break;} if(i>=k+1) flag=1; return flag; } int prime(int a,int b,int count) { if(a>b){ int temp=a;a=b;b=temp;} for(int i=a;i<=b;i++) if(prime(i)) count++; return count-2;} int main() { int a,b,count; cout<<"enter two numbers:"; cin>>a>>b; cout<<prime(a,b,count)<<endl; //cout<<"there are "<<prime(a,b,count)<<" primes from " //<<a<<" to "<<b<<endl; system("pause"); return 0; } |
|