Cod sursa(job #960253)
Utilizator | Data | 10 iunie 2013 02:40:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int cmmdc (int a, int b)
{
return (b == 0) ? a : cmmdc (b, a%b);
}
int main()
{
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int n, a, b;
fin >> n;
while (fin >> a >> b)
fout << cmmdc (a, b) << '\n';
fout.close();
return EXIT_SUCCESS;
}