Cod sursa(job #2227681)
Utilizator | Data | 1 august 2018 15:05:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int cmmdc(int a, int b){
int r = 1;
while(r != 0){
r = a % b;
a = b;
b = r;
}
return a;
}
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int n, a, b;
fin >> n;
for(int i = 1; i <= n; ++i){
fin >> a >> b;
fout << cmmdc(a,b) << '\n';
}
return 0;
}