Cod sursa(job #2603663)
Utilizator | Data | 20 aprilie 2020 16:42:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long long a,b;
long long cmm(long long i, long long j){
if(j!=0) cmm(j,i%j);
else return i;
}
int main()
{ int t;
in>>t;
for(int i=0;i<t;i++){
in>>a>>b;
out<<cmm(a,b)<<'\n';
}
}