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