Cod sursa(job #1698575)
Utilizator | Data | 4 mai 2016 19:57:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
void euclid (unsigned m, unsigned n){
for(unsigned int r = m%n; r; m = n, n = r, r = m%n);
fout << n << '\n';
}
int main()
{
unsigned t;
fin >> t;
for (unsigned i=0; i <t; i++){
unsigned m , n;
fin >> m >> n;
euclid(m,n);
}
return 0;
}