Cod sursa(job #262251)
| Utilizator |  Andrei Tudora Dj_Andrei |
Data | 19 februarie 2009 10:36:07 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,k;
int prim(int x){
int j;
for(j=2;j<=x/2;j++)
if(x%j==0)
return 0;
return 1;}
int main (){
f>>n;
if(n>2){
k++;
for(i=3;i<=n;i++)
if(prim(i)==1)
k++;}
g<<k<<"\n";
f.close();
g.close();
return 0;} 