Cod sursa(job #2573421)
Utilizator | Data | 5 martie 2020 17:35:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ifstream out("euclid2.out");
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main()
{
int n,a,b;
in>>n;
for(int i=1;i<=n;i++){
in>>a>>b;
out<<cmmdc(a,b)<<"/n";
}
}