Cod sursa(job #828821)
Utilizator | Data | 4 decembrie 2012 15:11:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
unsigned char a[2000009];
int main()
{
unsigned int m,y,i;
double n;
ifstream f1("ciur.in");
f1>>n;
f1.close();
m=n;
for (y=2;y<=n;y++)
if (!a[y])
for (i=y+y;i<=n;i+=y)
if (!a[i])
{a[i]=1;m--;}
ofstream f2("ciur.out");
f2<<m-1;
f2.close();
return 0;
}