1441: Min

1441: Min

Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 320  Solved: 213
[Submit][Status][Discuss]

Description

给出n个数(A1...An)现求一组整数序列(X1...Xn)使得S=A1*X1+...An*Xn>0,且S的值最小

Input

第一行给出数字N,代表有N个数 下面一行给出N个数

Output

S的最小值

Sample Input

2
4059 -1782

Sample Output

99

HINT

 

Source

 

 

题解：今天才知道有个很神奇的东西叫做裴蜀定理= =

比如此题中（详见 百度百科——裴蜀定理）

 

/**************************************************************
    Problem: 1441
    User: HansBug
    Language: Pascal
    Result: Accepted
    Time:0 ms
    Memory:224 kb
****************************************************************/
 
var
   i,j,k,l,m,n:longint;
function gcd(x,y:longint):longint;
         var z:longint;
         begin
              x:=abs(x);y:=abs(y);
              while y<>0 do
                    begin
                         z:=x mod y;
                         x:=y;
                         y:=z;
                    end;
              exit(x);
         end;
begin
     readln(n);
     read(m);
     if n=1 then
        begin
             readln;
             writeln(m);
             readln;
             halt;
        end;
     for i:=2 to n do
         begin
              read(j);
              m:=gcd(m,j);
         end;
     readln;
     writeln(m);
     readln;
end.