Cod sursa(job #1458933)
Utilizator | Data | 8 iulie 2015 19:51:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <cstdio>
using namespace std;
bool v[2000001];
int main()
{
long int a,i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int cnt=1;
cin >> a;
for(i=3;i<=a;i+=2)
{
if(v[i]==0) cnt++;
for(j=i+i+i;j<=a;j+=i<<1)
v[j]=1;
}
cout << cnt;
return 0;
}