Cod sursa(job #894374)
Utilizator | Data | 26 februarie 2013 20:56:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int main()
{ int n=0,i,t=0,k,v[500000]={0};
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{k=2;
t++;
while(i*k<=n)
{v[i*k]=1;
k++;
}
}
fout<<t;
return 0;
}