Cod sursa(job #250613)
Utilizator | Data | 31 ianuarie 2009 12:32:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream.h>
#include<fstream.h>
#include<math.h>
int main()
{
fstream f,g;
int n,sol,i,prim,j;
f.open("ciur.in",ios::in);
f>>n;
f.close();
sol=n;
for(i=2;i<=sqrt(n);i++)
{
prim=1;
for(j=2;j<i;j++)
if(i%j==0)
prim=0;
if(prim==1)
{
sol=sol-sol/i+1;
}
}
sol--;
g.open("ciur.out",ios::out);
g<<sol;
g.close();
return 0;
}