水 on 111qqz's blog

seerc 2014 D - Frame (傻逼题)

Sat, 27 Aug 2016 06:52:38 +0000

题目链接

思路：注意xy-(x-2)*(y-2)=2x+2y-4，一定被2整除。因此siz为2的也是合法的。这个比较容易忘掉。

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

Sun, 27 Mar 2016 02:34:38 +0000

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

uva 152 Tree's a Crowd

Thu, 21 Jan 2016 06:33:22 +0000

题意：题意：给你一组三维空间中的点，每个点到其它点都有个距离，其中有个最小距离，如果这个最小距离小于10，就将对应的距离的点个数加１，最后输出距离为0,1,2…8,9的点的个数。（from 百度）老实说，上面这题意也讲的不明不白，其实这题非常水，就是对每个点进行判断，找出和其他点最短的距离，在下标为该距离的数组上+1,最后输出数组下标0-9的数。 trick：其实最小距离大于9的就不用存放了，只要开个大小10的数组。（不会概括。。。抄的别人的）

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

Mon, 28 Sep 2015 17:05:00 +0000

A. Vasya the Hipster

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

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.

uva 489

Mon, 28 Sep 2015 10:25:00 +0000

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: