Cod sursa(job #3140224)
| Utilizator | Data | 4 iulie 2023 19:52:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
long long t,n,m;
long long gcd(long long a,long long b)
{
if (b==0)return a;
else return gcd(b,a%b);
}
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main()
{
in >> t ;
while (t--)
{
in >> n >> m ;
out << gcd(n,m)<<"\n";
}
return 0;
}
