Cod sursa(job #1192373)
Utilizator | Data | 28 mai 2014 21:36:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
unsigned long long n,i,j,nr=1;
short v[1000001];
int main()
{
f>>n;
for(i=3;i<=n;i+=2) if(v[i/2]==0)
{
++nr;
v[i/2]=1;
for(j=i*i;j<=n;j+=i+i) v[j/2]=1;
}
g<<nr<<"\n";
f.close();
g.close();
return 0;
}