Cod sursa(job #2437341)
Utilizator | Data | 9 iulie 2019 13:11:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream o("euclid2.out");
int n,M,K;
int CMMDC(int a,int b)
{
if(a==b)
return a;
else
{
if(a>b)
return CMMDC(a-b,b);
else
return CMMDC(a,b-a);
}
}
int main(){
f>>n;
for(int i=0;i<n;i++)
{
f>>M;
f>>K;
o<<CMMDC(M,K)<<"\n";
}
return 0;
}