Cod sursa(job #2377457)
Utilizator | Data | 10 martie 2019 12:47:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b,ax,ay,r,c,t;
f>>n;
for(int i=0;i<n;i++){
f>>ax;
f>>ay;
if(ax>ay){
a=ax;
c=ay;
}else {
a=ay;
c=ax;
}
b=0;
while(b==0){
while(a>c){
a=a-c;
}
if(c%a==0){
r=a;
b=1;
}else{
t=a;
a=c;
c=a;
}
}
g<<r<<endl;
}
g.close();
f.close();
return 0;
}