Cod sursa(job #2265866)
Utilizator | Data | 21 octombrie 2018 20:20:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,contor;
bool prim[2000005];
int main()
{
in>>n;
for(int k=2;k<=n;k++)
{
prim[k]++;
}
for(int i=2;i<=n;i++)
{
if(prim[i]==1)
{
contor++;
for(int j=2*i;j<=n;j=j+i)
{
prim[j]=0;
}
}
}
out<<contor;
return 0;
}