Cod sursa(job #1863689)
Utilizator | Data | 31 ianuarie 2017 09:26:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N=1000000001;
bool c[N];
int main()
{
int i,n,j,s=0;
fin>>n;
c[1]=true;
for(i=2; i*i<=n; i++)
{
if(!c[i])
{
for(j=i*i; j<=n; j+=i)
{
c[j]=true;
}
}
}
for(i=1; i<=n; i++)
{
if(c[i]==false)
{
s++;
}
}
fout<<s;
return 0;
}