sysu_strange的博客

DescriptionGiven positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be less than, equ

这是一道网络上流传的微软电面的真题，题目内容已经讲述在标题：在O(1)的内存上，找到这两个只出现奇数次的整数。解决的主要方法是使用异或运算，我们知道异或的性质有：1）a^a=0；2）0^b=b；因此，当数组中所有的数字都互相做异或的时候，那么最后得到的结果，其实就是这两个只出现奇数次的整数异或后的结果。我们假设这个结果为001001。首先因为这两个数肯定不相等，所以结果中总

Phone number   Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. 　 Let’s say the phone catalogue listed these numbers: 

1002. heap   实现一个小根堆用以做优先队列。给定如下数据类型的定义：class array {    private:    int elem[MAXN];    public:    int &operator[](int i) { return elem[i]; }};class heap {    private:

1001. Find the k-th smallest element   Given a sequence A=(a1,...,an), your job is to find the (k+1)-th smallest element of A.For example, A=(3, 2, 3, 4, 5) and k=1, then 3 is returned, sinc

1194. Message FloodConstraintsTime Limit: 1 secs, Memory Limit: 32 MB DescriptionWell, how do you feel about mobile phone? Your answer would probably be something like that “It’s so conven

1561. PRIMEConstraintsTime Limit: 1 secs, Memory Limit: 32 MB DescriptionA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. The first pr

1798. Alice and BobConstraintsTime Limit: 1 secs, Memory Limit: 32 MB DescriptionBob is very famous because he likes to play games. Today he puts a chessboard in the desktop, and plays a g

1765. 笨小猴ConstraintsTime Limit: 1 secs, Memory Limit: 32 MB Description笨小猴的词汇量很小，所以每次做英语选择题的时候都很头疼。但是他找到了一种方法，经试验证明，用这种方法去选择选项的时候选对的几率非常大！这种方法的具体描述如下：假设maxn是单词中出现次数最多的字母的出现次数，minn是单词中出现次

DescriptionIn the final exam, you are given n problems to solve, each one of which has an integer value indicating its difficulty, the larger, the harder. You need to find out which problem is the h

DescriptionMost bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached to one of the spokes on the front wheel so that it will line u

1753. 解码ConstraintsTime Limit: 1 secs, Memory Limit: 32 MB DescriptionZX是另一头04级的牛，他现在在UPen。他跟LLK经常通信，但他不喜欢直接把信息发给LLK，而是把信息通过一个规则转换后再发给LLK，这让LLK很郁闷。他的规则如下：如果字符x出现的n次，则将这几个连在一起的字符表示为xn，例如aaa->

1200. StickConstraintsTime Limit: 1 secs, Memory Limit: 32 MB Description Anthony has collected a large amount of sticks for manufacturing chopsticks. In order to simplify his job, he want

Description魔板由8个大小相同方块组成，分别用涂上不同颜色，用1到8的数字表示。其初始状态是1 2 3 48 7 6 5对魔板可进行三种基本操作：A操作（上下行互换）：8 7 6 51 2 3 4B操作（每次以行循环右移一个）：4 1 2 35 8 7 6C操作（中间四小块顺时针转一格）：1 7 2 48 6 3 5用上述三

DescriptionFakosh like playing the game "StarCraft".  However, he is not so good at this game that he can't beat the AI. For victory, he typed "show me the money" to cheat, and then he would get som