TOJ 4116 GCD's magic

It's simple problem;

The work you should do is calculate the GCD from A1 to An;

The portal:http://acm.tju.edu.cn/toj/showp4116.html

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>

int gcd(int a1,int a2){
    int temp;
    while(a2){
        temp = a1 % a2;
        a1  = a2;
        a2 = temp;
    }
    return a1;
}

int f[100005];

void Deal_with(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",f+i);
        }
        int ans = f[0];
        for(int i=1;i<n;i++){
            ans = gcd(ans,f[i]);
        }
        printf("%d\n",ans);
    }
}

int main(void){
    //freopen("a.in","r",stdin);
    Deal_with();
    return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/NMfloat/article/details/46802953
上一篇TOJ 4110 A+B
下一篇TOJ 4118 IQ test
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭