Cod sursa(job #2652041)
Utilizator | Data | 24 septembrie 2020 09:13:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long long n,a,b;
long long gcd(long long a,long long b)
{
if(b==0) return a;
else return gcd(b,a%b);
}
int main()
{
in>>n;
while(n--)
{
in>>a>>b;
out<<gcd(a,b)<<'\n';
}
return 0;
}