Cod sursa(job #1774167)
Utilizator | Data | 8 octombrie 2016 17:18:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int fr[1000000],n;
int main()
{
fin>>n;int k=1;
for(int i=3;i<=n;i=i+2)
if(fr[i]==1){
for(int j=(long long)i*i;j<=n;j=j+i)
fr[j]=1;
}
for(int i=3;i<=n;i=i+2)
if(fr[i]==0) k++;
fout<<k;
return 0;
}