Cod sursa(job #655851)
Utilizator | Data | 3 ianuarie 2012 15:47:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,x;
char a[2000001];
int main(void)
{
int i, j;
f>>n;
for (i = 2; i <= n; ++i)
a[i] = 1;
for (i = 2; i <= n; ++i)
if (a[i])
{
++x;
for (j = i*2; j <= n; j += i)
a[j] = 0;
}
g<<x;
return 0;
}