Cod sursa(job #3123211)
| Utilizator | Data | 22 aprilie 2023 14:21:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool erath[2000005];
int main()
{
int n;
f>>n;
for(int div=2;div*div<=n;div++)
{
if(erath[div]==true)
{
continue;
}
for(int mul=div*2;mul<=n;mul+=div)
{
erath[mul]=1;
}
}
int cnt=0;
for(int i=2;i<=n;i++)
{
if(erath[i]!=1)
{
cnt++;
}
}
g<<cnt;
return 0;
}
