Cod sursa(job #634240)
| Utilizator | Data | 15 noiembrie 2011 21:16:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define maxsize 2000000
char v[maxsize];
int n,nr;
void ciur()
{
int i, j;
//memset(v,0,sizeof(v)) ;
for (i = 2; i <= n; i++)
if (!v[i]) for (j = i + i; j <= n; j += i) v[j] = 1;
}
int main (void)
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
f.close();
ciur();
for(int i=2;i<=n;i++) if(!v[i]) nr++;
g<<nr;
g.close();
return 0;
}
