S_Black的专栏

T9Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2186    Accepted Submission(s): 828Problem DescriptionA while ago it was quite

Phone ListTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15502    Accepted Submission(s): 5206Problem DescriptionGiven a list o

统计难题Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 27105    Accepted Submission(s): 10884Problem DescriptionIgnatius最近遇到一个难题,老

What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 18200    Accepted Submission(s): 5911Problem Descriptio

Hat’s WordsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11664    Accepted Submission(s): 4160Problem DescriptionA hat’s word

Ancient PrinterTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1536    Accepted Submission(s): 755Problem DescriptionThe contes

RepositoryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3442    Accepted Submission(s): 1291Problem DescriptionWhen you go sho

Chip Factory题目链接 Chip Factory题目大意 说有一组数，你需要从其中选取3个数a b c，使得(a+b) xor c 达到最大。题解 建立一棵字典树，每个数用2进制表示插入树中，我们先枚举a跟b，将a跟b从字典树中删除，最后在字典树中查找a+b的“反码”（因为要使最后的异或结果最大）。如果有节点就继续查找，没有节点就走另一边。代码#include <iostream