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