Cod sursa(job #1775130)
Utilizator | Data | 9 octombrie 2016 21:52:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int fr[2000000];
int main()
{ long long n;
fin>>n;int k=0;
long long i,j;
for(i=2;i<=n;++i)
if(fr[i]==0){k++;
fr[i]=1;
for(j=i*i;j<=n;j=j+i)
fr[j]=1;
}
fout<<k;
return 0;
}