Cod sursa(job #300916)
| Utilizator |  Pop Carla alexys |
Data | 7 aprilie 2009 19:39:56 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,contor;
char p[20005];
int main()
{int i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++)
p[i]=1;
for(i=2; i<=n; i++)
if(p[i])
{contor++;
for(j=i+i; j<=n; j=j+i)
p[j]=0;
}
g<<contor<<endl;
system("pause");
return 0;
}
