HDU 5536 Chip Factory(字典树)

最新推荐文章于 2019-10-10 17:41:14 发布

hahahahhahello

最新推荐文章于 2019-10-10 17:41:14 发布

阅读量224

点赞数

分类专栏： ACM-数据结构文章标签：字典树

本文链接：https://blog.csdn.net/gyh0730/article/details/82918069

版权

该问题描述了一个CPU芯片工厂的经理John如何计算每日生产的芯片的校验和。每个芯片有一个唯一的序列号，校验和是通过选取三个不同的芯片，计算它们序列号之和的异或值的最大值。输入包含芯片的数量和每个芯片的序列号，输出是计算得到的校验和。题目提示解决这类问题时要考虑异或运算的性质，并给出了一些样例输入和输出。

摘要由CSDN通过智能技术生成

Chip Factory

Time Limit: 18000/9000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 5258 Accepted Submission(s): 2358

Problem Description

John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces n chips today, the i-th chip produced this day has a serial number si.

At the end of the day, he packages all the chips produced this day, and send it to wholesalers. More specially, he writes a checksum number on the package, this checksum is defined as below:

maxi,j,k(si+sj)⊕sk

which