Cod sursa(job #2140354)
Utilizator | Data | 23 februarie 2018 12:25:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
char w[1000];
int v[1000];
int main()
{
int n,i,x,y,r;
f>>n;
for(i=1;i<=n;i++)
{
f>>x>>y;
r=1;
while(r!=0)
{
if(x>y)
{
r=x%y;
x=r;
}
else
{
r=y%x;
y=r;
}
}
if(x<y)
g<<y<<endl;
else
g<<x<<endl;
}
return 0;
}