Cod sursa(job #233029)
| Utilizator | Data | 16 decembrie 2008 19:15:57 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int Cmmdc(int a, int b);
int main()
{
int x, y, i, t;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> t;
for ( i = 0; i < t; i++)
{
fin >> x >> y;
fout << Cmmdc(x, y) << '\n';
}
fout.close();
fin.close();
return 0;
}
int Cmmdc(int a, int b)
{
if ( b == 0) return a;
int rest;
do
{
rest = a % b;
a = b;
b = rest;
} while( rest);
return a;
}
