Cod sursa(job #2272899)
Utilizator | Data | 30 octombrie 2018 19:23:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
long long int cmmdc(long long int a,long long int b)
{
if(!a)
return b;
return cmmdc(a,b%a);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long long int t,a,b,i,v[100001];
fin>>t;
for(i=1;i<=t;i++)
{
fin>>a;
fin>>b;
v[i]=cmmdc(a,b);
}
for(i=1;i<=t;i++)
fout<<v[i]<<endl;
return 0;
}