Cod sursa(job #3182203)
Utilizator | Data | 8 decembrie 2023 18:37:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
char ciur[2000005];
int main()
{
int n,cnt=0;
fin>>n;
for (int i=2; i<=n; i++)
ciur[i]=1;
for (int i=2; i<=n; i++)
{
if (ciur[i])
{
cnt++;
for (int j=i+i; j<=n; j+=i)
ciur[j]=0;
}
}
fout<<cnt;
return 0;
}