Cod sursa(job #609020)
| Utilizator | Data | 19 august 2011 05:17:33 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream.h>
typedef unsigned long tip;
tip euclid (tip a, tip b)
{
while (a != b)
{
if (a == 0) return b;
if (b == 0) return a;
if (a > b)
{
a=a%b;
}
else b=b%a;
}
return a;
}
int main ()
{
tip T, a, b, i;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
fin >> T;
for (i = 0; i < T; i++)
{
fin >> a >> b;
fout << euclid (a, b) <<"\n";
}
fin.close ();
fout.close ();
return 0;
}