Cod sursa(job #2867878)
Utilizator | Data | 10 martie 2022 16:45:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int gcd(int a,int b)
{
if (b==0)
return a;
return gcd(b,a%b);
}
int main()
{
int t,x,y;
f>>t;
for (;t;t--)
{
f>>x>>y;
g<<gcd(x,y)<<'\n';
}
return 0;
}