Cod sursa(job #1454300)
Utilizator | Data | 26 iunie 2015 00:26:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int x, int y)
{
int c;
while (y)
{
c = x % y;
x = y;
y = c;
}
}
int main()
{
long long a,b;
int n,i;
fstream f("euclid2.in", ios::in);
f >> n;
fstream g("euclid2.out", ios::out);
for (i = 0; i < n; i++)
{
f >> a >> b;
g << cmmdc(a,b) << endl;
}
f.close();
g.close();
}