Cod sursa(job #2097825)
Utilizator | Data | 1 ianuarie 2018 18:14:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
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()
{
long long a,b,r,x;
fin>>x;
for(int i=1;i<=x;i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<endl;
}
return 0;
}