Cod sursa(job #562202)
Utilizator | Data | 22 martie 2011 16:51:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
int v[2000001];
int main()
{
int n,i,k=4;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2;i<=n;i+=2)
v[i]=1;
for (i=3;i<=n;i+=3)
v[i]=1;
for (i=5;i<=n;i+=5)
v[i]=1;
for (i=7;i<=n;i+=7)
v[i]=1;
for (i=2;i<=n;i++)
if (v[i]==0) k++;
g<<k;
return 0;
}