Cod sursa(job #1587630)
Utilizator | Data | 2 februarie 2016 13:48:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int T, A, B;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
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;
fout<<gcd(A, B);
}
return 0;
}