Cod sursa(job #1692292)
Utilizator | Data | 20 aprilie 2016 17:01:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main() {
long long t,a,b,i;
f >> t;
f.close();
for ( i = 1; i <= t; i ++ ) {
f>>a>>b;
if (b > a)
swap(a,b);
a=a%b;
if (a == 0)
g<<b<<'\n';
else
g<<a<<'\n';
}
g.close();
return 0;
}