Cod sursa(job #2313493)
Utilizator | Data | 6 ianuarie 2019 22:04:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, a, b, i;
f >> n;
for (i=1;i<=n;i++)
{
f >> a >> b;
g << gcd(a,b) << '\n';
}
return 0;
}