Cod sursa(job #264213)
| Utilizator |  Ilinca George Mihai 630r63 |
Data | 21 februarie 2009 19:24:41 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#define N 2000000000
int main()
{
long n,i,j,v[N]={0};
int a=0;
f>>n;
for(i=2;i<=n;i++) if(v[i]==0){ ++a; for(j=i*i;j<=n;j+=i) v[j]=1;}
g<<a;
f.close();
g.close();
return 0;}