Cod sursa(job #1528935)
Utilizator | Data | 20 noiembrie 2015 11:27:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <cmath>
using namespace std;
bool prim(int n)
{
int i,s=0;
if (n==1)
return 0;
else
{
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0)
s++;
}
if(s==0)
return 1;
else
return 0;
}
}
int main()
{
bool b[2000000];
int n,i,a=0;
cin>>n;
for(i=2;i<=n;i++)
{
if(prim(i)==1)
a++;
}
cout<<a;
return 0;
}