Huawei Machine Test-Multiple number of greatest common divisor

Title: Seeking Greatest common divisor

Enter a set of positive integers (less than ), outputting its greatest common divisor.

Input: 121 33 44 11 1111

Output: one

Basic ideas:

Start with the first number, compare it to the second number, and then find the greatest common divisor of the greatest common divisor and the third number, and so on.

#include <stdlib.h> #include <stdio.h>int a[30];int gcd (int a,int b) {return b==0?a:gcd (b,a%b);} int main () {    freopen ("a.in", "R", stdin);    int n;    int i=-1;    while (~SCANF ("%d", &a[++i]))        ;    n=i;    int t;    for (int j=1;j<n;++j)    {        t=gcd (a[0],a[j]);        a[0]=t;    }    printf ("%d\n", t);    return 0;}

Huawei Machine Test-Multiple number of greatest common divisor