Cod sursa(job #1284024)
Utilizator | Data | 6 decembrie 2014 10:29:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
//EUCLID
#include <fstream>
#define N 100000
using namespace std;
fstream in ("euclid2.in",ios::in);
fstream out ("euclid2.out",ios::out);
struct perechi
{
int x,y;
};
int main()
{
perechi v[N];
int T,r;
in>>T;
for (int i=0;i<T;i++)
{
in>>v[i].x>>v[i].y;
while (v[i].y!=0)
{
r=v[i].x%v[i].y,v[i].x=v[i].y,v[i].y=r;
}
out<<v[i].x<<'\n';
}
return 0;
}