Cod sursa(job #2710887)
Utilizator | Data | 23 februarie 2021 12:24:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int T, a, b;
int GCD(int a, int b)
{
if(!b)
return a;
return GCD(b, a%b);
}
int main()
{
fin>>T;
for(int i=0; i<T-1; i++)
{
fin>>a>>b;
GCD(int a, int b);
fout<<a<<"\n";
}
fin.close();
fout.close();
return 0;
}