Cod sursa(job #1851506)
Utilizator | Data | 19 ianuarie 2017 20:15:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
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");
bool a[2000000];
int main()
{ int ct,n,i,j;
fin>>n;
a[2]=true;
for(i=3;i<=n;i=i+2)a[i]=true;
for(i=3;i*i<=n;i++)
if(a[i]==true)
for(j=3*i;j<=n;j=j+2*i)a[j]=false;
ct=1;
for(i=3;i<=n;i=i+2)
if(a[i]==true)ct++;
fout <<ct<<"\n" ;
return 0;
}