Cod sursa(job #2801069)
Utilizator | Data | 14 noiembrie 2021 20:09:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
using namespace std;
FILE *fin,*fout;
int main ()
{
int a,n,b,k,k1=1;
fin=fopen("euclid2.in","r");
fout=fopen("euclid2.out","w");
fscanf(fin,"%d",&n);
while(n)
{fscanf(fin,"%d%d",&a,&b);
while(b)
{k=a%b;
a=b;
b=k;
}
fprintf(fout,"%d\n",a);n--;
}
return 0;
}