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