Cod sursa(job #2415581)
Utilizator | Data | 26 aprilie 2019 12:00:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int t,a,b;
int gcd(int t1,int t2){
int r;
do{
r=t1%t2;
t1=t2;
t2=r;
} while(t2);
return t1;
}
int main()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
f>>t;
while(t--){
f>>a>>b;
g<<gcd(a,b)<<'\n';
}
f.close ();
g.close ();
return 0;
}