Cod sursa(job #1983913)
| Utilizator |  Murzac Ion murzacion |
Data | 22 mai 2017 20:14:37 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long i, n, a, b, c;
int cmmd(long a, long b)
{
if (b == 0)
return a;
else
return cmmd(b,a%b);
}
int main()
{
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> a;
fin >> b;
fout << cmmd(a, b) << endl;
}
return 0;
}