seerc 2014 D – Frame (傻逼题)





bc #77 div 2 1001 ||hdu 5650 so easy (傻逼题)

題意:已知一个包含 nn 个元素的正整数集合 SS,设 f(S)f(S) 为集合 SS 中所有元素的异或(XOR)的结果。
如:S={1,2,3}, 则 f(S) = 0f(S)=0。

给出集合 SS,你需要计算 将所有 f(s)进行异或后的值, s⊆S.




uva 152 Tree’s a Crowd

题意:题意:给你一组三维空间中的点,每个点到其它点都有个距离,其中有个最小距离,如果这个最小距离小于10,就将对应的距离的点个数加1,最后输出距离为0,1,2…8,9的点的个数。(from 百度)


codeforces #322 div 2 A. Vasya the Hipster(纱布题)

A. Vasya the Hipster
time limit per test

1 second

memory limit per test

256 megabytes


standard input


standard output

One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and b blue socks.

According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.

Every day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn’t want to wash them.

Vasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he’s got.

Can you help him?


The single line of the input contains two positive integers a and b (1 ≤ a, b ≤ 100) — the number of red and blue socks that Vasya’s got.


Print two space-separated integers — the maximum number of days when Vasya can wear different socks and the number of days when he can wear the same socks until he either runs out of socks or cannot make a single pair from the socks he’s got.

Keep in mind that at the end of the day Vasya throws away the socks that he’s been wearing on that day.

Sample test(s)







In the first sample Vasya can first put on one pair of different socks, after that he has two red socks left to wear on the second day.


uva 489

In Hangman Judge,” you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as the classic game of hangman, and are given as follows:

  1. The contestant tries to solve to puzzle by guessing one letter at a time.
  2. Every time a guess is correct, all the characters in the word that match the guess will be turned over.” For example, if your guess is o” and the word is book”, then both o”s in the solution will be counted as solved.”
  3. Every time a wrong guess is made, a stroke will be added to the drawing of a hangman, which needs 7 strokes to complete. Each unique wrong guess only counts against the contestant once. 
  4. If the drawing of the hangman is completed before the contestant has successfully guessed all the characters of the word, the contestant loses.
  5. If the contestant has guessed all the characters of the word before the drawing is complete, the contestant wins the game.
  6. If the contestant does not guess enough letters to either win or lose, the contestant chickens out.

Your task as the Hangman Judge” is to determine, for each game, whether the contestant wins, loses, or fails to finish a game.



Your program will be given a series of inputs regarding the status of a game. All input will be in lower case. The first line of each section will contain a number to indicate which round of the game is being played; the next line will be the solution to the puzzle; the last line is a sequence of the guesses made by the contestant. A round number of -1 would indicate the end of all games (and input).



The output of your program is to indicate which round of the game the contestant is currently playing as well as the result of the game. There are three possible results:



Sample Input



Sample Output