Cod sursa(job #1285077)
Utilizator | Data | 7 decembrie 2014 02:32:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in"); ofstream out ("euclid2.out");
int gcd(int a, int b)
{
int r = a%b;
while(r)
{
a = b;
b = r;
r = a%b;
}
return b;
}
int t,a,b;
int main()
{
in >> t;
while(t--)
{
in >> a >> b;
out << gcd(a,b) << '\n';
}
}