Cod sursa(job #1940353)
Utilizator | Data | 26 martie 2017 16:09:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int dividend, int divisor) {
if (!divisor)
return dividend;
else
gcd(divisor, (dividend%divisor));
}
int main()
{
int t;
int a, b;
f >> t;
for(int i=0;i<t;++i){
f >> a;
f >> b;
g<<gcd(a, b)<<'\n';
}
return 0;
}