Cod sursa(job #1691820)
Utilizator | Data | 19 aprilie 2016 15:07:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
int C;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
ifstream f("test.in");
ofstream g("test.out");
int T, a,b;
f>>T;
for(;T;--T){
f>> a >> b;
g<< gcd(a, b) << '\n';
}
g.close();
f.close();
return 0;
}