Cod sursa(job #2655948)
Utilizator | Data | 6 octombrie 2020 11:11:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream gout("euclid2.out")
int A,B,T,v[100];
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
fin>>T;
for(int i=1;i<=T;i++)
{
fin>>A>>B;
v[i]=gcd(A,B);
}
for(int i=1;i<=T;i++)
{
gout<<v[i]<<endl;
}
return 0;
}