Cod sursa(job #2325406)
Utilizator | Data | 22 ianuarie 2019 16:50:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd (int a, int b)
{
if (b == 0) return a;
return gcd(b, a%b);
}
int main()
{
ifstream fin("date.in");
ofstream fout("date.out");
int T, a, b;
fin >> T;
while (T > 0)
{
fin>>a>>b;
fout<<gcd(a,b)<<"\n";
T--;
}
fin.close();
fout.close();
return 0;
}