Cod sursa(job #2227633)
Utilizator | Data | 1 august 2018 11:31:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i,j,n,nr,f[2000000];
int main() {
fin>>n;
f[0]=1; f[1]=1;
for (i=2;i<=n;i++) {
for (j=2*i;j<=n;j+=i) {
f[j]=1;
}
if (f[i]==0)
nr++;
}
fout<<nr;
return 0;
}