Cod sursa(job #2934836)
Utilizator | Data | 6 noiembrie 2022 11:41:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
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 gcd (int a, int b)
{
if (b==0)
{
return a;
}
return gcd (b,a%b);
}
int main ()
{
int n, a, b;
fin>>n;
for (int i=0; i<n; i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<'\n';
}
return 0;
}