junior19的博客

[1597] Find MaxXorSum 时间限制: 2000 ms　内存限制: 65535 K 问题描述 Given n non-negative integers, you need to find two integers a and b that a xor b is maximum. xor is exclusive-or. 输入 Input starts w

Hat’s Words Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14599    Accepted Submission(s): 5214 Problem Description A hat’s word

Phone List Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19457    Accepted Submission(s): 6568 Problem Description Given a list o

Chip Factory Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 2699    Accepted Submission(s): 1197 Problem Description John is a

A. Fox And Names time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Fox Ciel is going to publish a paper on FO

 Zero and One are good friends who always have fun with each other. This time, they decide to do something on a tree which is a kind of graph that there is only one path from node to node. First, Zero...

Sheokand loves strings. Chef has NN strings S1,S2,…,SNS1,S2,…,SN which he wants to give to Sheokand; however, he doesn't want to give them away for free, so Sheokand must first correctly answer QQ que...

[编程题] 异或 时间限制：1秒 空间限制：32768K 给定整数m以及n各数字A1,A2,..An，将数列A中所有元素两两异或，共能得到n(n-1)/2个结果，请求出这些结果中大于m的有多少个。 输入描述: 第一行包含两个整数n,m. 第二行给出n个整数A1，A2，...，An。 数据范围 对于30%的数据，1 <= n, m <= 1000 对于100%的数据...