Cod sursa(job #2504281)
Utilizator | Data | 4 decembrie 2019 19:25:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long gcd(long long a, long long b)
{
if(a==0)
return b;
else
return gcd(b%a,a);
}
int main()
{
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
long long x,y;
int t;
in>>t;
for(int i=0;i<t;i++)
{
in>>x>>y;
out<<gcd(x,y)<<"\n";
}
return 0;
}