Cod sursa(job #1112832)
Utilizator | Data | 20 februarie 2014 06:26:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
#include <fstream>
using namespace std;
int main()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int T, a, b, tmp;
f >> T;
for (int i = 0; i < T; i++) {
f >> a >> b;
//if (b == 0) printf("%d\n", a);
if (a < b) { tmp = a; a = b; b = tmp; }
while (b)
{
tmp = a % b;
a = b;
b = tmp;
}
g << a << endl;
}
return 0;
}