Pagini recente » Istoria paginii runda/concurs_000000 | Istoria paginii utilizator/santa-claus | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #1777579)
#include <fstream>
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int gcd(long long a,long long b)
{
if(!b) return a;
return gcd(b,a%b);
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
long long n;
long long a;
long long b;
ifstream myf;
myf.open("euclid2.in");
ofstream op;
op.open("euclid2.out");
myf >> n;
while (n)
{
myf >> a >> b;
int p = gcd(a,b);
op << p << "\n";
n--;
}
return 0;
}