摘要： Problem Description KazaQ wears socks everyday.At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts o 阅读全文

摘要： Problem Description The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cel 阅读全文

摘要： Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15 阅读全文

摘要： Problem Description An 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 阅读全文

摘要： Problem Description Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order 阅读全文

摘要： Problem Description One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 阅读全文

摘要： Problem Description Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! Input One N in one line, process to the end of file. Output For ea 阅读全文

摘要： Problem Description Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are 阅读全文

摘要： Problem Description A relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to help to ev 阅读全文

摘要： Problem Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are l 阅读全文

摘要： Problem Description A number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of ca 阅读全文

摘要： Problem Description Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of 阅读全文

摘要： Problem Description Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. 阅读全文

摘要： Problem Description "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, a 阅读全文

摘要： 排列(permutation) 用1,2,3，…，9组成3个三位数 abc, def, 和ghi,每个数字恰好使用一次，要求 abc:def:ghi = 1:2:3。输出所有解。提示：不必太动脑筋。 思路:设i从123到329，j=2*i,k=3*i。分解i,j,k的各个位数，用一个长度为9、下标从 阅读全文