Cod sursa(job #261142)
Utilizator | Data | 17 februarie 2009 21:41:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,k;
int prim(x){
int sw=0,j;
for(j=2;j<=x/2;j++)
if(x%j==0)
sw=1;
if (sw==0)
return sw;}
int main (){
f>>n;
if(n>2){
k++;
for(i=3;i<=n;i++)
if(prim(i)==0)
k++;}
g<<k<<"\n";
f.close();
g.close();
return 0;}