Cod sursa(job #348806)
Utilizator | Data | 16 septembrie 2009 22:58:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream x("ciur.in");
ofstream y("ciur.out");
char prim[2000001];
unsigned short i,j,nr=0,n;
x>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
{
if(prim[i]!=0)
{
nr++;
for(j=i+1;j<=n;j+=i)
prim[j]=0;
}
}
y<<nr;
x.close();
y.close();
return 0;
}