Cod sursa(job #283845)
Utilizator | Data | 20 martie 2009 08:36:31 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream.h>
int a[100];
main()
{int n,p,q,r,aux1,aux2,contor=0;
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>n;
for(p=1;p<=n;p++)
{for(q=1;q<=n;q++)
{if(q==1&&p==1)
{ contor++;q++;}
aux1=q;aux2=p;
while(aux1!=aux2)
if(aux1>aux2)
aux1=aux1-aux2;
else
aux2=aux2-aux1;
if(aux1==1)
contor++;}
}
out<<contor<<'\n';
in.close();
out.close();
return 0;
}