新手:找出1~100中所有质数
找出1~100中所有质数
[解决办法]
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
bool Is = true;
for(int i = 2; i <= 100; i++, Is = true)
{
for(int j = 2; j <= sqrt(i); j++)
if(i%j == 0){Is = false; break;}
if(Is) cout < <i < < "\t ";
}
return 0;
}
[解决办法]
改的你的:
#include <iostream>
using namespace std;
int isPrime(int x)
{
int i;
if(x <2)return 0;
for(i=2;i <x;i++)
if(x%i==0)return 0;
return x;
}
int main()
{
int j;
for(j=2;j <=100;j++)
{
int data = isPrime(j);
if(data)
cout < <isPrime(j) < < " ";
}
return 0;
}