Cod sursa(job #1106734)
| Utilizator | Data | 13 februarie 2014 09:09:04 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
int c;
while (b != 0)
{
c = a%b;
a = b;
b = c;
}
return a;
}
int main()
{
int n, i, a, b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> n;
for (i = 0; i < n; i++)
{
f >> a; f >> b;
if (a == 1 || b == 1 || a-b==1 || b-a==1)
g << 1;
else g << cmmdc(a, b);
g << endl;
}
}
