Cod sursa(job #1496261)
Utilizator | Data | 4 octombrie 2015 17:41:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a,int b)
{
if (a == 0) return b;
return (b, a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
f>>n;
for (int i=0;i<n;i++)
{
f >> a >> b;
if (a>b) g<<euclid(a,b);
else g << euclid(b,a);
}
f.close();
g.close();
return 0;
}