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