Cod sursa(job #2447491)
Utilizator | Data | 13 august 2019 14:55:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
inline int cmmdc(int a, int b)
{
int r;
while(r)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n, x, y;
f>>n;
for(int i=0;i<n;i++)
{
f>>x>>y;
g<<cmmdc(x, y)<<'\n';
}
f.close();
g.close();
return 0;
}