Cod sursa(job #3003275)
Utilizator | Data | 15 martie 2023 17:14:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int cmmdc(int a,int b)///cel mai mare divizor comun
{
if(!b)
return a;
return cmmdc(b,a%b);
}
int main()
{int n,a,b;
f>>n;
for(int i=1;i<=n;i++){
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}