Cod sursa(job #1509047)
Utilizator | Data | 23 octombrie 2015 14:08:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool taiat[2000001];
int main()
{
long N,i,k,ap;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>N;
for(i=2;i<=N;i++){
if(taiat[i]==0){
k=i;
while(k<N){
k=k+i;
taiat[k]=1;
}
}
}
ap=0;
for(i=2;i<=N;i++)
if(taiat[i]==0)ap++;
g<<ap;
}