Cod sursa(job #2254071)
Utilizator | Data | 4 octombrie 2018 19:15:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out")
const int VM = 2000000;
bool c[VM];
int main()
{
int k, n, z=0;
in>>k;
for(int i=2;i*i<VM;i++){
if(!c[i]){
z++;
for(int j=i*i;j<VM;j+=i){
c[j]=true;
}
}
}
out<<z-1;
return 0;
}