Cod sursa(job #2776069)
Utilizator | Data | 18 septembrie 2021 15:57:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
int v[2000001];
int e[2000001];
int ciur(int N)
{
int ans=0;
e[0]=e[1]=1;
for (int i=2;i<=N;i++)
if (!e[i])
{
for (int j=i*2;j<=N;j+=i)
e[j]=1;
ans++;
}
return ans;
}
int main()
{
fin>>N;
fout<<ciur(N);
}