Cod sursa(job #2969313)
Utilizator | Data | 22 ianuarie 2023 20:57:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000005];
int ciur(int n)
{
int nr=0;
for(int i=2;i<=n;i++)
{
if(!a[i]){
nr++;
for(int j=i*i;j<=n;j+=i)
a[j]=1;
}
}
return nr;
}
int main()
{
int n;
fin>>n;
fout<<ciur(n);
return 0;
}