Cod sursa(job #2919424)
Utilizator | Data | 17 august 2022 16:02:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T;
long long a,b;
int GCD(int a,int b)
{
if(b==0) return a;
return GCD(b,a%b);
}
int main()
{ fin>>T;
for(int i=1;i<=T;i++)
{
fin>>a>>b;
fout<<GCD(a,b)<<endl;
}
return 0;
}