Cod sursa(job #2568374)
Utilizator | Data | 3 martie 2020 22:20:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int a, b, n;
int GCD(int a, int b)
{
if(!b)
return a;
return GCD(b, a%b);
}
int main()
{
fin>>n;
while(n>0){
fin>>a;
fin>>b;
fout<<GCD(a,b)<<endl;
n--;
}
return 0;
}