Cod sursa(job #2426642)
Utilizator | Data | 28 mai 2019 22:33:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t, a, b;
int cmmdc (int a,int b)
{
int c;
while(b)
{
c = a%b;
a = b;
b = c;
}
return a;
}
int main()
{
f >> t;
for(int i = 1; i <= t; ++i)
{
f >> a >> b;
g << cmmdc(a, b) << '\n';
}
return 0;
}