Cod sursa(job #1929152)
Utilizator | Data | 17 martie 2017 10:25:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int t,i,X[100001],a,b;
int euclid(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
fi>>t;
for(i=1;i<=t;i++)
{
fi>>a>>b;
X[i]=euclid(a,b);
}
for(i=1;i<=t;i++)
fo<<X[i]<<'\n';
return 0;
}