Cod sursa(job #1565001)
Utilizator | Data | 10 ianuarie 2016 11:04:08 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t;
int euclid(int a,int b)
{
int r;
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
void citire()
{
int x,y;
fin>>t;
for(int i=1;i<=t;i++)
{
fin>>x>>y;
fout<<euclid(x,y)<<'\n';
}
}
int main()
{
citire();
return 0;
}