Cod sursa(job #2164755)
Utilizator | Data | 13 martie 2018 09:39:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,K,k;
bool ok[2000001];
int main ()
{
f>>n;
for(i=2;i<=n;i++){
if(ok[i]==0){
K++;
for(k=2*i;k<=n;k=k+i){
ok[k]=1;
}
}
}
g<<K;
return 0;
}