Cod sursa(job #2782586)
| Utilizator | Data | 12 octombrie 2021 19:05:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
fstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if(b == 0)
return a;
else
return cmmdc(b, a%b);
}
int main()
{
long long int t, j=1;
long long int a, b, vect[100001];
f>>t;
for(int i=1; i<=t; i++)
{
f>>a>>b;
vect[j] = cmmdc(a, b);
j++;
}
for(int k=1; k<j; k++)
g<<vect[k]<<endl;
return 0;
}
