Cod sursa(job #1791831)
Utilizator | Data | 29 octombrie 2016 19:23:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
int T, r;
int a[100001];
int b[100001];
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> T;
for (int i = 0; i < T; i++){
f >> a[i] >> b[i];
r = a[i] % b[i];
while(r){
a[i] = b[i];
b[i] = r;
r = a[i] % b[i];
}
g << b[i] << "\n";
}
return 0;
}