Cod sursa(job #2505625)
Utilizator | Data | 7 decembrie 2019 09:54:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | 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(a%b==0)
return b;
else
return gcd(b,b%a);
}
int main()
{
int n,a,b;
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<'\n';
}
return 0;
}