Cod sursa(job #1851379)
| Utilizator | Data | 19 ianuarie 2017 17:48:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <iostream>
#define nmax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bool a[nmax];
int main()
{
int i,ct=0,j;
fin>>n;
fin.close();
a[2]=true;
for(i=3; i<=n; i=i+2) a[i]=true;
for(i=3; i*i<=n; i=i+2)
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++)
if(a[i]==true) ct++;
fout<<ct;
fout<<"\n";
fout.close();
return 0;
}
