Cod sursa(job #2514680)
Utilizator | Dancu Mihai dancu_mihai13 | Data | 26 decembrie 2019 16:53:30 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
struct euclid {int a, b;} v[100000];
int cmmdc(int a, int b)
{
if(b == 0)
return a;
return cmmdc(b, a % b);
}
int main()
{
int T;
fin >> T;
for(int i = 0; i < T; i++)
{
fin >> v[i].a >> v[i].b;
fout << cmmdc(v[i].a, v[i].b) << endl;
}
fin.close();
fout.close();
return 0;
}