Cod sursa(job #1816967)
Utilizator | Data | 27 noiembrie 2016 10:57:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,nr,v[2000001],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;
}