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