Cod sursa(job #2627916)
Utilizator | Data | 13 iunie 2020 12:59:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
char marked[2000005];
int ans; //Nr de numere prime mai mici sau egale cu n
int main()
{
fin>>n;
for(int i=2;i<=n;i++) marked[i]=1;
for(int i=2;i<=n;i++)
{
if(marked[i])
{
ans++;
for(int j=i+i;j<=n;j+=i)
marked[j]=0;
}
}
fout<<ans;
return 0;
}