Cod sursa(job #2255285)
Utilizator | Data | 6 octombrie 2018 17:49:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdafx.h>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.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;
}