其他

Time Limit: 2 Seconds      Memory Limit: 65536 KBGiven a positive integer n, print out the positions of all 1's in its binary representation. The position of the least significant bit is 0.Example The positions of 1's in the binary representation

Time Limit: 2 Seconds      Memory Limit: 65536 KBFor 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format of x and y. For example, f(2, 3)=1, f(0, 3)=2, f(5, 10)=4.Now given 2 sets of non-negative

中午登入到cnblogs才發現，部落格申請已經通過了，興匆匆的配置了一下樣式，現在看上去還算滿意，清清爽爽的，讓我感到舒服。在部落格園開部落格的人都是來分享技術的，我也不例外，所以部落格的地址都跟技術有關，malloc，哈哈，不錯吧，用語言向“部落格園”申請了這塊“記憶體空間”，暫時還沒有寫上“空間大小”，因為我也不知道我有那麼能寫，到底需要“多大的空間“，我也不是很清楚，希望不要”記憶體錯誤，分配失敗“啊，呵呵。我不是什麼”高手“，當然，”高手“的定義也是五花八門的，也是多種多樣各個方面的，如

　　念書的時候就羨慕別人上班的，因為讀書總是有作業，現在真的要體驗“上班族”的生活了，又要想念當初讀書的日子。　　讀書才是最輕鬆的，每天都是美好的一天，每天都會有新的氣象。其實在暑期實習的時候，我就已經發現了，所謂的上班，就是永遠重複的做無休止的相同的活兒。做技術的還好，但也是一天到晚做同樣的事情，看著辦公室裡那些整天沒有事情做的人們，真是羨慕。我在想，如果我們真的和這個部門在一個辦公室裡，那豈不是很鬱悶？我們軟體工程師，整天要忙個不停，但是卻看著他們優哉遊哉的！這天下，真的不是很公平。　　也許

Time Limit: 2 Seconds      Memory Limit: 65536 KBA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.One night, the jailer gets bored and decides to play a game.

Time Limit: 2 Seconds      Memory Limit: 65536 KB A group of n gamblers decide to play a game: At the beginning of the game each of them will cover up his wager on the table and the assitant must make sure that there are no two gamblers have put the

之前在解決一道演算法題的時候，應用到set，特意對這個stl的容器類做了一些瞭解。在我的印象中，set就是一個元素不重複的集合，而事實上也正是這樣的。無論從MSDN還是任何其它地方，都會告訴我們set的元素不可以重複。反之，只要元素不重複，就可以順利的放入到set中。看起來這實在是再清楚不過了，但是仔細想一想的話，就會發現，話說只要不重複的元素就可以被放入到一個set中，但是什麼樣的元素是不重複的元素呢？或者說，什麼樣的元素是互不相同的呢？對於內建資料類型，也就是傳說中的primary

Time Limit: 2 Seconds      Memory Limit: 65536 KBWhen a number is expressed in decimal, the kth digit represents a multiple of 10 k. (Digits are numbered from right to left, where the least significant digit is number 0.) For example,81307(10) = 8 *

Time Limit: 2 Seconds      Memory Limit: 65536 KBMathematics can be so easy when you have a computer. Consider the following example. You probably know that in a right-angled triangle, the length of the three sides a, b, c (where c is the longest

Daffodil numberTime Limit: 1 Second      Memory Limit: 32768 KBThe daffodil number is one of the famous interesting numbers in the mathematical world. A daffodil number is a three-digit number whose value is equal to the sum of cubes of each

Time Limit: 2 Seconds      Memory Limit: 65536 KBMs. Terry is a pre-school art teacher who likes to have her students work with clay. One of her assignments is to form a lump of clay into a block and then measure the dimensions of the block. However,

Time Limit: 10 Seconds      Memory Limit: 32768 KBIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you

Time Limit: 2 Seconds      Memory Limit: 65536 KBSoundex coding groups together words that appear to sound alike based on their spelling. For example, "can" and "khawn", "con" and "gone" would be equivalent under Soundex coding. Soundex coding

Time Limit: 2 Seconds      Memory Limit: 65536 KBTan Your Hide, Inc., owns several coin-operated tanning salons. Research has shown that if a customer arrives and there are no beds available, the customer will turn around and leave, thus costing the

Time Limit: 2 Seconds      Memory Limit: 65536 KBLittle Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. ``Look, I've built a wall!'', he tells his older sister Alice. ``Nah, you

Time Limit: 2 Seconds      Memory Limit: 65536 KBA sequence of n > 0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 1 through n-1. For instance,1 4 2 3is a jolly

Time Limit: 10 Seconds      Memory Limit: 32768 KBWe all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.Input SpecificationInput consists of

Time Limit: 2 Seconds      Memory Limit: 65536 KBGiven an positive integer A (1 <= A <= 100), output the lowest bit of A.For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.

Time Limit: 2 Seconds      Memory Limit: 65536 KBAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches.