Cod sursa(job #847370)
Utilizator | Data | 3 ianuarie 2013 19:50:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <math.h>
#define maxN 2000000
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char ciur[maxN];
int main()
{
int n,i;
f>>n;
for(i=1;i<=n;i++)
ciur[i]=1;
int cont=1;
for(i=2;i<=n;i++)
{ cont++;
for(int j=i+i;j<=n;j+=i)
ciur[j]=0;
}
g<<cont;
return 0;
}