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