Cod sursa(job #493313)
Utilizator | Data | 17 octombrie 2010 19:01:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
char a[2000001];
int main()
{
int i, n, t, b, c=0;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i=2; i<=n; i++){ t=i;
while (t<=n) {
b=i*t;
a[b]=1;
t++;
}
}
for (i=2; i<=n; i++)
{
if (a[i] == 0) c++;
}
fout<<c;
return 0;
}