Cod sursa(job #1158937)
Utilizator | Data | 29 martie 2014 10:54:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int j,k,n,m,i,a[2000000];
int main()
{
fi>>n;
for(i=2;i<=n;i++)
a[i]=i;
for(i=2;i<=n;i++)
{
if(a[i])
{
k++;
for(m=a[i]*2;m<=n;m+=a[i])
a[m]=0;
}
}
fo<<k;
return 0;
}