Cod sursa(job #1205408)
| Utilizator | Data | 6 iulie 2014 14:02:39 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
long long cmmdc(long long a, long long b){
long long c;
while (b){
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
FILE *in, *out;
in = fopen("euclid2.in", "r");
out = fopen("euclid2.out", "w");
long long a, b, n;
fscanf(in, "%lld", &n);
for (int i = 0; i < n; i++){
fscanf(in, "%lld %lld", &a, &b);
fprintf(out, "%lld\n", cmmdc(a, b));
}
return 0;
}
