摘要：
杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 88914都属 阅读全文
摘要：
An integer is divisible by 3 if the sum of its digits is also divisible by 3. For example, 3702 is divisible by 3 and 12 (3+7+0+2) is also divisible b 阅读全文
摘要：
A string is called bad if it has 3 vowels in a row, or 5 consonants in a row, or both. A string is called good if it is not bad. You are given a strin 阅读全文
摘要：
You work in a company which organizes marriages. Marriages are not that easy to be made, so, the job is quite hard for you. The job gets more difficul 阅读全文
摘要：
A bit is a binary digit, taking a logical value of either 1 or 0 (also referred to as "true" or "false" respectively). And every decimal number has a 阅读全文
摘要：
You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively. Each pl 阅读全文
摘要：
You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold. Initially you are i 阅读全文
摘要：
Feuzem is an unemployed computer scientist who spends his days working at odd-jobs. While on the job he always manages to find algorithmic problems wi 阅读全文
摘要：
As you know that sometimes base conversion is a painful task. But still there are interesting facts in bases. For convenience let's assume that we are 阅读全文
摘要：
树的最大独立集：对于一颗n个结点的无根树，选出尽量多的结点，使得任何两个结点都不相邻。 题解：dp[ i ][ 0 ~ 1 ]表示以 i 为根结点的子树的最大独立集，0表示不选 i ，1表示选 i 。记 i 的儿子为son。 选 i 的话，其儿子可选可不选，即dp[ i ][ 1 ]+=min(dp 阅读全文