Cod sursa(job #2566042)
Utilizator | Data | 2 martie 2020 18:30:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
int gcd(int a, int b)
{
int m;
while (b != 0)
{
m = b;
b = a % b;
a = m;
}
return a;
}
int main()
{
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int n, a, b;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
}