Cod sursa(job #2345508)
Utilizator | Data | 16 februarie 2019 13:55:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int t,a,b;
int gcd(int a, int b)
{
if (!b)
return a;
return gcd(b, a%b);
}
int main()
{
fi>>t;
for(int i=1; i<=t; i++)
{
fi>>a>>b;
fo<<gcd(a,b)<<endl;
}
}