Cod sursa(job #2447370)
Utilizator | Data | 13 august 2019 08:45:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int d, int i)
{
if(i==0) return d;
return gcd(i, d%i);
}
int k,a,b;
int main()
{
fin>>k;
while(k--)
{
fin>>a>>b;
fout<<gcd(a,b)<<"\n";
}
return 0;
}