Cod sursa(job #1430892)
| Utilizator | Data | 8 mai 2015 21:50:14 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
std::ifstream fin("euclid2.in");
std::ofstream fout("eculid2.out");
int T;
int euclid(int a, int b)
{
if(a == 0)
{
return b;
}
while(b != 0)
{
if(a > b){
a = a - b;
} else{
b = b - a;
}
}
return a;
}
int main()
{
fin >> T;
for(int i = 0; i < T; ++i)
{
int a,b;
fin >> a;
fin >> b;
fout << euclid(a,b)<<"\n";
}
fout.close();
fin.close();
return 0;
}
