Cod sursa(job #1993413)
Utilizator | Data | 22 iunie 2017 21:54:26 | |
---|---|---|---|
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 cin("ciur.in");
ofstream cout("ciur.out");
bool sieve[2000005];
int main()
{
int cnt=1,n,i,j;
cin>>n;
sieve[0]=1;
sieve[1]=1;
for(i=4;i<=n;i+=2)
sieve[i]=1;
for(i=3;i<=n;i+=2)
{
if(sieve[i]==0)
{
cnt++;
for(j=i*2;j<=n;j+=i)
{
sieve[j]=1;
}
}
}
cout<<cnt;
return 0;
}