Cod sursa(job #1734840)
Utilizator | Data | 28 iulie 2016 13:27:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{ int t,a,b,i;
f>>t;
for (i=1;i<=t;i++){
f>>a>>b;
if(max(a,b)%min(a,b)==0)
g<<min(a,b)<<endl;
else
g<<max(a,b)%min(a,b)<<endl;
}
return 0;
}