2019 ICPC Asia Taipei-Hsinchu Regional E.The League of Sequence Designers
题目链接:Dashboard-2019-2020ICPCAsiaTaipei-HsinchuRegionalContest-Codeforces思路:构造成0,0,0....0,0,-y,x这样的数列。这样做可以找出最短的数列。此时,WA=x,AC=(x-y)*len,其中WA和AC分别是错误答案,正确答案,len是数组长度。那么就有AC=WA+k,那么就有:,看右边那个,枚举所有满足x+k整除l