Cod sursa(job #1235247)
Utilizator | Data | 29 septembrie 2014 09:48:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,i,r,a,b;
int divi(int a,int b,int x)
{
if(x==0) return b;
divi(b,x,a%b);
}
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>a>>b;
r=a%b;
g<<divi(a,b,r)<<'\n';
}
f.close();
g.close();
return 0;
}