Cod sursa(job #1747645)
Utilizator | Data | 25 august 2016 12:11:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int t;
int a, b;
fin >> t;
for(int i = 0; i < t; < i++){
fin >> a >> b;
while(a != b)
{
if( a > b)
a = a % b;
else b = b % a;
}
fout << a;
}
fin.close();
fout.close();
return 0;
}