Cod sursa(job #2427696)
Utilizator | Data | 1 iunie 2019 17:56:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
std::ifstream fin("ciur.in");
std::ofstream fout("ciur.out");
int n;
bool v[2005000];
int main()
{
fin>>n;
int countt=n-1;
for(int i=2;i*i<=n;i++)
{
if(v[i])continue;
for(int j=i*i;j<=n;j+=i)
{
if(!v[j])
countt--;
v[j]=true;
}
}
fout<<countt;
}