Cod sursa(job #2293808)
Utilizator | Data | 1 decembrie 2018 16:46:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int euclid(int a, int b)
{
int r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
long long n,i,a,b;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a>>b;
fout<<euclid(a,b)<<endl;
}
}