Cod sursa(job #1855053)
Utilizator | Data | 23 ianuarie 2017 13:39:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim[2000000];
int main()
{
int n,d,i,cnt=0;
f>>n;
for(i=3;i<=n;++i)
{
if(i%2==0)
prim[i]=1;
if(prim[i]==0)
for(d=3;d*d<=n;d+=2)
if(n%d==0)
prim[i]=1;
if(prim[i]==0)
cnt++;
}
g<<cnt;
return 0;
}