Cod sursa(job #2511712)
Utilizator | Data | 19 decembrie 2019 17:09:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n, a, b;
int main()
{
in >> n;
for(int i = 1; i <= n; ++ i)
{
in >> a >> b;
out << __gcd(a, b) << '\n';
}
return 0;
}