Cod sursa(job #2228290)
Utilizator | Data | 3 august 2018 11:23:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000010];
int n, i, j, nr=0;
int main(){
f>>n;
for(i=2; i<=n; i++)
v[i]=1;
for(i=2; i<=n; i++)
if(v[i])
for(j=2; i*j<=n; j++)
v[i*j]=0;
for(i=1; i<=n; i++)
if(v[i])
nr++;
g<<nr;
return 0;
}