Cod sursa(job #2909943)
| Utilizator | Data | 17 iunie 2022 09:10:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
ifstream reader("ciur.in");
ofstream writer("ciur.out");
int n;
reader>>n;
bool v[n];
for(int i=0;i<n;++i) v[i]=false;
v[0]=true;
v[1]=true;
int u=sqrt(n);
for(int i=2;i<=u;++i)
{
if(v[i]==false)
{
for(int j=2;j<=n/i;++j)
v[i*j]=true;
}
}
int cnt=0;
for(int i=0;i<n;++i)
if(!v[i])
{
cnt++;
}
writer<<cnt;
return 0;
}
