Cod sursa(job #1846745)
Utilizator | Data | 13 ianuarie 2017 23:51:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, nrp=0;
char p[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;
for(int i=2;i<=n;i++)
p[i]='1';
for(int i=2;i<=n;i++){
if(p[i]=='1'){
nrp++;
for(int j=i+i;j<=n;j=j+i){
p[j]='0';
}
}
}
fout<<nrp;
fin.close();
fout.close();
return 0;
}