Cod sursa(job #1872491)
Utilizator | Data | 8 februarie 2017 12:24:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b)
{
if(!b) return a;
return gcd(b, a%b);
}
int main()
{
int n, x, y;
f>>n;
for(int i = 1; i <= n; ++i)
{
f>>x>>y;
g<<gcd(x, y)<<'\n';
}
return 0;
}