Cod sursa(job #2255275)
| Utilizator | Data | 6 octombrie 2018 17:41:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int cmmdc(int a,int b)
{
int rest;
while(b)
{
rest = a % b;
a = b;
b = rest;
}
return a;
}
int main()
{
int a,b,T;
f >> T;
for (int i = 1;i <= T;i++)
{
f >> a >> b;
g << cmmdc(a,b) << endl;
}
return 0;
}
