Cod sursa(job #887193)
| Utilizator | Data | 23 februarie 2013 16:38:29 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int n,q,p,k,pp,qq;
f>>n;
k=0;
for (p=1;p<=n;p++)
for (q=1;q<=n;q++)
{
pp=p;
qq=q;
while (pp!=qq)
{
if (pp>qq) pp=pp-qq;
else qq=qq-pp;
}
if (pp==1) k++;
}
g<<k;
f.close();
g.close();
return 0;
}
