Cod sursa(job #2201156)
Utilizator | Data | 3 mai 2018 19:10:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a,int b)
{
if(a==0) return b;
if(b==0) return a;
if(a!=0 && b!=0)
return euclid(b,a%b);
}
int main()
{
int a,b,n;
f>>n;
for(int i=1;i<=n;i++)
{f>>a>>b;
g<<euclid(a,b)<<endl;
}
return 0;
}