POJ - 2785：4 Values whose Sum is 0

最新推荐文章于 2022-02-18 17:51:58 发布

wingrez

最新推荐文章于 2022-02-18 17:51:58 发布

阅读量326

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/81590749

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

给定四个整数列表A, B, C, D，找出所有(a, b, c, d)组合使得a + b + c + d = 0。输入包含列表大小n（最大4000）和n行各含四个整数。输出是和为0的四元组数量。例如，对于输入样例，输出应为5，因为存在5个这样的四元组使得它们的和为零。" 120968718,8659743,图论课后习题解析：从二维到高维超立方体,"['图论', '算法', '数学', '计算机科学', '证明']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

4 Values whose Sum is 0

来源：POJ

标签：

参考资料：

相似题目：

题目

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 ) ∈ A x B x C x D are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n .

输入

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 28 ) that belong respectively to A, B, C and D .

了解本专栏