Cod sursa(job #2543027)
| Utilizator | Data | 10 februarie 2020 19:44:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#define M 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int C[M];
int N;
void Ciur()
{
int i,j;
C[2]=1;
for(i=3 ; i<=N ; i+=2)
C[i]=1;
for(i=3 ; i*i<=N ; i+=2)
if(C[i])
for(j=3*i ; j<=N ; j+=2*i)
C[j]=0;
}
int Count()
{
int i,ct=1;
for(i=3;i<=N;i+=2)
if(C[i])
ct++;
return ct;
}
int main()
{
fin>>N;
Ciur();
fout<<Count();
return 0;
}
