Cod sursa(job #1106650)
Utilizator | Data | 12 februarie 2014 23:13:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include "stdafx.h"
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
while (a != b)
if (a>b)
a = a - b;
else b = b - a;
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;
g << cmmdc(a, b);
g << endl;
}
}