Cod sursa(job #1988973)
Utilizator | Data | 5 iunie 2017 14:08:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int k=2e6+5;
bool prim[k];
int main()
{
int N, penis=0;
fin>>N;
for(int i=2; i<=N; i++)
prim[i]=1;
for(int i=2; i<=N; i++){
if(prim[i]==1){
penis++;
for(int j=i*2; j<=N; j+=i)
prim[j]=0;
}
}
fout<<penis;
}