Cod sursa(job #1862618)
Utilizator | Data | 30 ianuarie 2017 09:17:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool p[2000002];
int main()
{
int N;
fin>>N;
int i=2,j,n=0;
while(i*i<=N){
if(p[i]==0){
for(j=i*i;j<=N;j+=i){
p[j]=true;
}
}
i++;
}
p[0]=p[1]=true;
for(i=0;i<=N;i++){
if(!p[i]){
n++;
}
}
fout<<n;
return 0;
}