Cod sursa(job #2418447)
Utilizator | Data | 5 mai 2019 00:48:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int gcd( int a, int b)
{
if(!b)return a;
else return gcd(b,a%b);
}
int main()
{
int n;
while( n)
{
int x, y;
fin >> x >>y;
fout << gcd(x,y) << "\n";
--n;
}
return 0;
}