Cod sursa(job #2665795)
Utilizator | Data | 31 octombrie 2020 12:29:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,x,y;
int cmmdc(int a, int b) {
int rest = 1;
while (b!=0) {
rest = a%b;
a= b;
b = rest;
}
return a;
}
int main()
{
f >> n;
for (int i=1;i<=n;i++) {
f >> x >> y;
g << cmmdc(x,y)<<'\n';
}
return 0;
}