HDU 6211-Pythagoras

题目链接

Pythagoras Time Limit: 4000/4000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 393    Accepted Submission(s): 206   Problem Description Given a list of integers a0,a1,a2,⋯,a2k−1 . Pythagoras triples over 109 are all solutions of x2+y2=z2 where x,y and z are constrained to be positive integers less than or equal to 109 . You are to compute the sum of ay mod 2k of triples (x,y,z) such that x<y<z and they are relatively prime, i.e., have no common divisor larger than 1 .     Input The first line is an integer T (1≤T≤3) indicating the total number of cases. For each test case the first line is the integer k (1≤k≤17) . The second line contains 2k integers corresponding to a0 to a2k−1 , where each ai satisfies 1≤ai≤255 .     Output For each case output the sum of ay mod 2k in a line.     Sample Input 3 2 0 0 0 1 2 1 0 0 0 2 1 1 1 1 Sample Output 39788763   79577506   159154994   Source 2017 ACM/ICPC Asia Regional Qingdao Online