Cod sursa(job #1816954)
Utilizator | Data | 27 noiembrie 2016 10:47:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool V[2000001]; int n,nr,i,j;
int main()
{fin>>n;
nr=0;
for(i=2;i<=n;i++)
if(V[i]==0){
nr++;
for(j=i+i;j<=n;j=j+i)
V[j]=1;
}
fout<<nr;
return 0;
}