Cod sursa(job #2514425)
Utilizator | Data | 25 decembrie 2019 19:15:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
//ifstream cin("euclid2.in");
//ofstream cout("euclid2.out");
int t,a[100000],b[100000],c;
int main(){
cin >> t;
for(int i=0;i<t;i++){
cin >>a[i];
cin >>b[i];
}
for(int i=0;i<t;i++){
while(b[i] !=0){
c=a[i]%b[i];
a[i]=b[i];
b[i]=c;
}
c=0;
}
for(int i=0;i<t;i++)cout << a[i]<<"\n";
}