Cod sursa(job #2377448)
Utilizator | Data | 10 martie 2019 12:37:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 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;
f>>n;
for(int i=0;i<n;i++){
f>>ax;
f>>ay;
if(ax>ay){
a=ax;
}else a=ay;
r=1;
for(int j=2;j<=a;j++){
if(ax%j==0 && ay%j==0){
r=j;
}
}
g<<r<<endl;
}
g.close();
f.close();
return 0;
}