Cod sursa(job #2711529)
Utilizator | Data | 24 februarie 2021 12:16:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,nr;
bool b[2000005];
int main()
{
in>>n;
for(int i=3;i*i<=n;i+=2)
{
if(!b[i])
{
for(int j=i*3;j<=n;j+=2*i)
{
b[j]=1;
}
}
}
if(n==2){out<<1;return 0;}
for(int i=3;i<=n;i+=2)
{
if(b[i]==0)nr++;
}
out<<nr+1;
return 0;
}