Cod sursa(job #881231)
Utilizator | Data | 17 februarie 2013 20:18:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,OK,d,nr;
int main()
{ f>>n;
nr=0;
for(i=2;i<=n;i++)
for(d=2;d<=i;d++)
OK=1;
if(n%d==0) OK=0;
if(OK==1) nr++;
g<<nr<<"\n";
g.close ();
return 0;
}