Cod sursa(job #2424697)
| Utilizator | Data | 23 mai 2019 18:08:58 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
unsigned long long int a, b, t;
int impartire(int a, int b)
{
if(!b)
return a;
return impartire(b, a%b);
}
void Euclid()
{
fin >> t;
for(int i = 1; i <= t; i++)
{
fin >> a >> b;
fout << impartire(a, b) << '\n';
}
}
int main()
{
Euclid();
return 0;
}
