Cod sursa(job #2410990)
| Utilizator | Data | 20 aprilie 2019 13:18:14 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
int T;
int a, b;
int cmmdc;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> T;
for(int i=1; i<=T; i++){
fin >> a >> b;
if(a == b){
cmmdc = a;
}
else if(a < b){
for(int j=a; j>=1; j--){
if(a % j == 0 && b % j == 0){
cmmdc = j;
break;
}
}
}
else{
for(int j=b; j>=1; j--){
if(a % j == 0 && b % j == 0){
cmmdc = j;
break;
}
}
}
fout << cmmdc << endl;
}
return 0;
}
