Cod sursa(job #1893048)
Utilizator | Data | 25 februarie 2017 14:18:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a,b;
ll GCD(ll u, ll v) {
while ( v != 0) {
ll r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
fin>>n;
for (ll i=1;i<=n;i++)
{
fin>>a>>b;
fout<<GCD(a,b)<<'\n';
}
fin.close();
fout.close();
return 0;
}