Cod sursa(job #2729674)
| Utilizator | Data | 25 martie 2021 08:48:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define Nmax 2000005s
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
bool prim[2000000];
int contor;
void citire()
{
fin>>N;
prim[0] = 1;
prim[1] = 1;
for(int i=2; i * i <= N; i++)
{
if(prim[i] == 0)
{
for(int j= i * i; j<=N; j += i)
{
prim[j] = 1;
}
}
}
for(int i=2; i<=N; i++)
{
if(prim[i] == 0)
contor++;
}
fout<<contor<<"\n";
}
int main()
{
citire();
return 0;
}
