Cod sursa(job #1224517)
Utilizator | Data | 31 august 2014 11:53:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
int aux;
while (b != 0)
{
aux = a % b;
a = b;
b = aux;
}
return (a);
}
int main(void)
{
int i;
int n;
int a;
int b;
i = 1;
f >> n;
while (i <= n)
{
f >> a >> b;
g << euclid(a, b) << endl;
i++;
}
return (0);
}