Cod sursa(job #1521608)
Utilizator | Data | 10 noiembrie 2015 18:23:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(long long a,long long b)
{
if(a%b)
return cmmdc(b,a%b);
return b;
}
int main()
{
int n,i;
long long a,b;
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
cout<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}