Cod sursa(job #1954938)
| Utilizator | Data | 5 aprilie 2017 18:57:42 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long int t, a, b;
int cmmdc(int a, int b)
{
if(b==0)return a;
else return cmmdc(b,a%b);
}
int main()
{ freeopen("eucli2.in","r",stdin);
freeopen("euclid2.out","w",stdout);
scanf("%d",&t);
for(int i=1; i<=t; i++)
{
scanf("%lld %lld",&a, &b);
printf("%d",cmmdc(a,b));
}
return 0;
}
