Cod sursa(job #1983941)
Utilizator | Data | 22 mai 2017 22:28:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long long i, n, a, b, c;
int cmmd(long long a, long long b)
{
long long k;
while (b != 0)
{
k = b;
b = a % b;
a = k;
}
return a;
}
int main()
{
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> a;
fin >> b;
fout << cmmd(a, b) <<'/n';
}
return 0;
}