Cod sursa(job #1747159)
| Utilizator | Data | 24 august 2016 16:20:50 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
/* Varianta scaderi repetate
int cmmdc(int a, int b)
{
if(a==b)return a;
if(a > b) return cmmdc(a-b, b);
else return cmmdc(a, b-a);
}
*/
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
int r = a%b;
if(r==0)return b;
return cmmdc(b,r);
}
int main()
{
int a, b, n;
f>>n;
for(int i = 0; i < n; i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
}
