Cod sursa(job #1828208)
| Utilizator | Data | 12 decembrie 2016 22:08:40 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t;
long euclid(long a, long b)
{
int c;
if(a==0 || b==0)
return a+b;
else
{while(a!=b)
if(a>b)
a=a-b;
else
b=b-a;
return a;}
}
int main()
{
int a,b,i,sol;
fin>>t;
for(i=1;i<=t;i++)
{
fin>>a>>b;
sol=euclid(a,b);
fout<<sol<<"\n";
}
return 0;
}
