Cod sursa(job #2423283)
Utilizator | Data | 20 mai 2019 23:17:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, a, b;
int cmmdc(int a, int b)
{
if(b == 0) return a;
return cmmdc(b, a % b);
}
int main()
{
f >> n;
while(n--)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
}