Cod sursa(job #2672936)
| Utilizator | Data | 15 noiembrie 2020 15:08:55 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <vector>
#include <fstream>
std::ifstream infile("euclid2.in");
std::ofstream outfile("euclid2.out");
int max(int a, int b)
{
if (a > b)
return a;
return b;
}
void solve()
{
int a, b;
infile >> a >> b;
for (int i = max(a, b); i > 0; --i)
{
if (a % i == 0 && b % i == 0)
{
outfile << i << "\n";
break;
}
}
}
int main()
{
int t;
infile >> t;
while (t--)
solve();
}