Cod sursa(job #2227635)
Utilizator | Data | 1 august 2018 11:35:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
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[1700000];
int main() {
fin>>n;
f[0]=1; f[1]=1;
for (i=2;i<=n;i++) {
if (f[i]==0) {
nr++;
for (j=2;j<=n/i;j++)
f[i*j]=1;
}
}
fout<<nr;
return 0;
}