Cod sursa(job #877834)
| Utilizator | Data | 13 februarie 2013 11:57:01 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
// int gcd(int a, int b);
int main() {
int T;
int a, b;
fin >> T;
for (int i = 1; i <= T; ++i) {
fin >> a >> b;
while (a %= b ^= a ^= b ^= a);
fout << b << '\n';
}
return 0;
}
// int gcd(int a, int b) {
// while (a %= b ^= a ^= b ^= a);
// return b;
// }