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