Cod sursa(job #1466953)
| Utilizator | Data | 1 august 2015 15:55:44 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int a,b,x;
int aux;
int cauta(int c,int d)
{ x=d;
if (c%d!=0) {x=c%d;
cauta(d,c%d);}
return x;
}
int main()
{ int t;
f>>t;
int c;
for(int i=0;i<t;i++)
{f>>a;
f>>b;
if(a>b) c= cauta(a,b);
else c= cauta(b,a);
g<<c<<" ";}
f.close();
g.close();
return 0;
}
