Cod sursa(job #2730457)
| Utilizator | Data | 26 martie 2021 13:02:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long int cmmdc(long int num1, long int num2){
long int m = min(num1, num2);
long int M = max(num1, num2);
long int r = M%m;
while(true){
r = M%m;
M=m;
m=r;
if(r==0){
return M;
}
}
}
int main()
{
int n;
fin>>n;
for(long int j=0; j<n; j++){
long int a, b;
fin>>a>>b;
fout<<cmmdc(a, b)<<"\n";
}
}
