Cod sursa(job #718792)
| Utilizator |  Vasilescu Ioan Cameleonul |
Data | 21 martie 2012 09:24:16 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
unsigned n,nr=0,i,j;
char v[2000000];
f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
g<<nr;
f.close();
g.close();
return 0;
}