Cod sursa(job #1205804)
Utilizator | Data | 8 iulie 2014 10:46:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int n,d;
char ciur[2000005];
int main()
{
int i, j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i = 2; i<=n; ++i)
ciur[i] = 1;
for (i = 2; i<=n; ++i)
if (ciur[i])
{
d++;
for (j = i+i; j<=n; j += i)
ciur[j] = 0;
}
g<<d;
return 0;
}