Cod sursa(job #1909003)
Utilizator | Data | 7 martie 2017 11:20:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a, int b)
{
do
{
int r = a%b;
a = b;
b = r;
}while(b);
return a;
}
int main()
{
int n,x,y;
in >> n;
for (int i = 1; i<=n; i++)
{
in >> x >> y;
out << cmmdc(x,y) << "\n";
}
}