Cod sursa(job #2927496)
| Utilizator | Data | 20 octombrie 2022 18:46:31 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
FILE *in = fopen("euclid2.in","r");
FILE *out = fopen("euclid2.out","w");
int euclid(int a,int b)
{
while(a)
{
if(a>b)
a-=b;
else
b-=a;
}
return a;
}
void readsolve()
{
int t;
fscanf(in,"%d",&t);
while(t)
{
int a,b;
fscanf(in,"%d %d",&a,&b);
fprintf(out,"%d %d\n",euclid(a,b));
t--;
}
}
int main()
{
readsolve();
}
