Cod sursa(job #2159417)
| Utilizator | Data | 10 martie 2018 22:14:16 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b){
while(b%a != 0){
b = (b%a)+a;
a = b-a;
b = b-a;
}
return a;
}
int main()
{
ifstream fin("euclid2.in");
ofstream ofs("euclid2.out");
int n;
fin >> n;
int a,b;
for(int i = 0; i < n; i++){
fin >> a >> b;
ofs << euclid(a,b) << endl;;
}
fin.close();
ofs.close();
return 0;
}
