Cod sursa(job #3298029)
Utilizator | Data | 26 mai 2025 12:39:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX=2e6;
int n,i,j,cnt;
bool ciur[MAX+5];
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
for (i=2; i*i<=n; i++)
if (!ciur[i])
for (j=i*i; j<=n; j=j+i)
ciur[j]=1;
for (i=1; i<=n; i++)
if (!ciur[i])
cnt++;
fout<<cnt;
return 0;
}