8.10-Day2T1最小值

题目大意

裴蜀定理

 

题解

很简单...

我这个蒟蒻都猜的出来...

就求所有数的最大公约数

但注意

要加绝对值

因为gcd里面不能传负数

 

#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
inline int read()
{
    int sum = ,p = ;
    char ch = getchar();
    while(ch < '' || ch > '')
    {
        if(ch == '-')
            p = -;
        ch = getchar();
    }
    while(ch >= '' && ch <= '')
    {
        (sum *= ) += ch - '';
        ch = getchar();
    }
    return sum * p;
}
 
ll gcd(ll a,ll b)
{
    if(b == )
        return a;
    else
        return gcd(b,a % b);
}
 
int main()
{
    freopen("min.in","r",stdin);
    freopen("min.out","w",stdout);
    int n = read();
    ll a = read(),b;
    a = abs(a);
    for(int i = ;i <= n;i++)
    {
        b = read();
        b = abs(b);
        a = gcd(a,b);
    }
    printf("%lld",a);
    return ;
}