Cod sursa(job #793510)
| Utilizator |  Scharscher Erik erik95 |
Data | 3 octombrie 2012 13:36:38 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,nr=0,j;
short int p[2000000];
int main()
{f>>n;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
if(p[i]==1)
{nr++;
for(j=i+i;j<=n;j+=i)
p[j]=0;
}
g<<nr;
f.close();
g.close();
}