Cod sursa(job #633735)
| Utilizator | Data | 14 noiembrie 2011 17:57:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int n, cnt=0;
char prim[2000005];
int main()
{
int i, j;
ifstream fin;
ofstream fout;
fin.open("ciur.in");
fout.open("ciur.out");
fin>>n;
for (i = 2; i <= n; i++)
prim[i] = 1;
for (i = 2; i <= n; i++)
if (prim[i])
{
cnt++;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
fout<<cnt;
fout.close ();
fin.close();
return 0;
}
