Cod sursa(job #2263109)
Utilizator | Data | 18 octombrie 2018 10:25:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int A(int a, int b)
{
if(!b)
return a;
return A(b,a%b);
}
int main()
{int n,a,b;
f>>n;
while(n--)
{
f>>a>>b;
g<<A(a,b)<<endl;
}
return 0;
}