Cod sursa(job #579900)
Utilizator | Data | 12 aprilie 2011 16:05:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
using namespace std;
bool a[2800000];
int main()
{
int n, i, j;
short int nrp;
ifstream f("ciur.in");
ofstream h("ciur.out");
f>>n;
for (i=2; i<=n; i++)
if (a[i]==0)
{nrp=nrp+1;
j=i;
while (j<n)
{j=j+i;
a[j]=1;}}
h<<nrp<<'\n';
f.close();
h.close();
return 0;
}