Cod sursa(job #350196)
Utilizator | Porcescu Alexandru TFifes | Data | 22 septembrie 2009 23:42:47 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<iostream>
#include<fstream>
using namespace std;
unsigned long n,nr=0;
char prim[2000005];
int main ()
{
ifstream x("ciur.in");
unsigned long i,j;
ofstream y("ciur.out");
x>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
{
if(prim[i])
{
nr++;
for(j=i+1;j<=n;j+=i)
prim[j]=0;
}
}
y<<nr;
x.close();
y.close();
return 0;
}