Cod sursa(job #2964424)
Utilizator | Data | 12 ianuarie 2023 23:09:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#include <stdlib.h>
int gcd(int n, int m)
{
if (!m)//m==0
return n;
return gcd(m,n%m);
}
int main()
{
int N,a,b,P,T;
FILE *f=fopen("euclid2.in","r");
FILE *g=fopen("euclid2.out","w");
fscanf(f,"%d",&T);
while(T>0)
{
fscanf(f,"%d %d\n",&a,&b);
P=gcd(a,b);
fprintf(g,"%d",P);
fprintf(g,"\n");
// printf("%d %d\n",a,b);
T--;
}
return 0;
}