Cod sursa(job #2280751)
| Utilizator | Data | 11 noiembrie 2018 09:34:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a , int b){
int x , y;
x = a;
y = b;
while(x != y){
if(x > y)
x = x - y;
else
y = y - x;
}
return x;
}
int main(){
int T , i , a , b , z;
fin >> T;
for(i = 1; i <= T; i = i + 1){
fin >> a >> b;
z = cmmdc(a , b);
fout << z << "\n";
}
fout.close();
fin.close();
return 0;
}
