K - 4 Values whose Sum is 0(中途相遇法)-白红宇

K - 4 Values whose Sum is 0(中途相遇法)

阅读量：6948 次

发布时间：2019-06-27

本文共 2125 字，大约阅读时间需要 7 分钟。

K - 4 Values whose Sum is 0

Crawling in process... Crawling failed Time Limit:9000MS Memory Limit:0KB 64bit IO Format:%lld & %llu

Submit

Appoint description:System Crawler (2015-03-12)

Description

The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) $\in$ AxBxCxD are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n .

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

The first line of the input file contains the size of the lists n (this value can be as large as 4000). We then have n lines containing four integer values (with absolute value as large as 2²⁸ ) that belong respectively to A, B, C and D .

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

For each input file, your program has to write the number quadruplets whose sum is zero.

Sample Input

16-45 22 42 -16-41 -27 56 30-36 53 -37 77-36 30 -75 -4626 -38 -10 62-32 -54 -6 45

Sample Output

Sample Explanation: Indeed, the sum of the five following quadruplets is zero: (-45, -27, 42, 30), (26, 30, -10, -46), (-32, 22, 56, -46),(-32, 30, -75, 77), (-32, -54, 56, 30).

1 #include 
        
          2 #include 
         
           3 #include 
          
            4 #include 
           
             5 #include 
            
              6 #include 
             
               7 #include 
              
                8 #include 
               
                 9 #include 
                
                 10 #include 
                 
                  11 #include 
                  12 #include 
                   
                    13 #include 
                    
                     14 #include 
                     
                      15 #include 
                      
                       16 using namespace std;17 typedef long long LL;18 const int INF=0x5fffffff;19 const double EXP=1e-8;20 const int MS=4005;21 int A[MS],B[MS],C[MS],D[MS],n,sum[MS*MS];22 23 int main()24 {25 int T;26 scanf("%d",&T);27 while(T--)28 {29 scanf("%d",&n);30 for(int i=0;i

转载于:https://www.cnblogs.com/767355675hutaishi/p/4335778.html

你可能感兴趣的文章