Cod sursa(job #2858311)
Utilizator | Data | 27 februarie 2022 12:51:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001];
int main()
{
int n, cnt=0;
in>>n;
for(int i=2; i*i<=n; i++)
if(ciur[i]==0)
for(int j=i; j*i<=n; j++)
ciur[i*j]=1;
for(int i=2; i<=n; i++)
if(ciur[i]==0)
cnt++;
out<<cnt;
return 0;
}