Cod sursa(job #2874674)
Utilizator | Data | 19 martie 2022 21:28:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#define int long long
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int a,b,t;
int gcd(int a, int b){
while(a!=b)
if(a>b)
a -= b;
else
b -= a;
return a;
}
signed main(){
fin >> t;
for(int i=1;i<=t;++i)
{
fin >> a >> b;
fout << gcd(a,b) << '\n';
}
}