Cod sursa(job #249475)
Utilizator | Data | 28 ianuarie 2009 16:03:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int main (){
int n,i,ok,ct;
double k;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>k;
ct=0;
for(n=2;n<k;n++){
ok=1;
for(i=2;i<=n/2;i++){
if(n%i==0)
ok=0;
}
if(ok==1)
ct=ct+1;
}
g<<ct;
f.close();
g.close();
return 0;
}