You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
#include<iostream>
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//<2F>Ľ<EFBFBD>, ȥ<><C8A5>ż<EFBFBD><C5BC><EFBFBD><EFBFBD><EFBFBD>ж<EFBFBD>
|
|
|
|
|
bool isPrime(int n)
|
|
|
|
|
{
|
|
|
|
|
if(n < 2) return false;
|
|
|
|
|
if(n == 2) return true;
|
|
|
|
|
if(n % 2 == 0) return false;
|
|
|
|
|
for(int i = 3; i < n; i += 2)
|
|
|
|
|
if(n%i == 0) return false;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
//ʱ<>临<EFBFBD>Ӷ<EFBFBD>O(n/2), <20>ٶ<EFBFBD><D9B6><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int main()
|
|
|
|
|
{
|
|
|
|
|
for(int i=0;i<100;i++)
|
|
|
|
|
{
|
|
|
|
|
if(isPrime(i))
|
|
|
|
|
{
|
|
|
|
|
cout<<i<<endl;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|