Cod sursa(job #2477541)
| Utilizator | Data | 20 octombrie 2019 16:32:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t,a,b;
int gcd(int x,int y)
{
if(!y)
return x;
return gcd(x,x%y);
}
int main()
{
f>>T;
for(int i=1;i<=T;i++)
{
f>>a>>b;
f<<gcd(a,b)<<endl;
}
return 0;
}
