摘要：FAlternate TaskInput:Standard InputOutput:Standard OutputLittle Hasan loves to play number games with his friends. One day they were playing a game where one of them will speak out a positive number and the others have to tell the sum of its factors. The first one to say it correctly wins. After a w 阅读全文

摘要：Problem JGCD Extreme (II)Input:Standard InputOutput:Standard OutputGiven the value of N, you will have to find the value of G. The definition of G is given below:HereGCD(i,j) means the greatest common divisor of integeriand integer j.For those who have trouble understanding summation notation, the m 阅读全文

摘要：Bit MagicTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1383Accepted Submission(s): 398Problem DescriptionYesterday, my teacher taught me about bit operators: and (&), or (|), xor (^). I generated a number table a[N], and wrote a program to ca 阅读全文

摘要：Yukari's BirthdayTime Limit: 12000/6000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1993Accepted Submission(s): 404Problem DescriptionToday is Yukari's n-th birthday. Ran and Chen hold a celebration party for her. Now comes the most important part, birthday 阅读全文

摘要：The Little Girl who Picks MushroomsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1070Accepted Submission(s): 346Problem DescriptionIt's yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. Sh 阅读全文

摘要：Shoemaker's ProblemShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ithjob, it is known the integer Ti(1#include#include#include#include#include#include#include#include#include#include#include//ios_base::sync_with_stdio(fal 阅读全文

摘要：Sum of divisorsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2461Accepted Submission(s): 889Problem Descriptionmmm is learning division, she's so proud of herself that she can figure out the sum of all the divisors of numbers no larger than 1 阅读全文

摘要：MahjongTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3110Accepted Submission(s): 620Problem DescriptionJapanese Mahjong is a four-player game. The game needs four people to sit around a desk and play with a set of Mahjong tiles. A set of Mahjong 阅读全文

摘要：DressingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1925Accepted Submission(s): 831Problem DescriptionWangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K different combinations of dressing.One day he wears h 阅读全文

摘要：Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 945Accepted Submission(s): 646Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文

摘要：Crazy TankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3578Accepted Submission(s): 637Problem DescriptionCrazy Tank was a famous game about ten years ago. Every child liked it. Time flies, children grow up, but the memory of happy childhood will 阅读全文

摘要：CandyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1159Accepted Submission(s): 508Special JudgeProblem DescriptionLazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies 阅读全文

摘要：G -Tug of WarTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem F: Tug of WarA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team o 阅读全文

摘要：A -InterpreterTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem G: InterpreterA certain computer has 10 registers and 1000 words of RAM. Each register or RAM location holds a 3-digit integer between 0 and 999. Instructions are encoded 阅读全文

摘要：The ? 1 ? 2 ? ... ? n = k problemThe problemGiven the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k? 1 ? 2 ? ... ? n = kFor example: to obtaink = 12, the expression to be used will be:- 1 + 2 + 3 + 4 + 5 + 6 - 7 = 12with 阅读全文

摘要：Tug of WarTime Limit:3000MSMemory Limit:65536KTotal Submissions:8085Accepted:2174DescriptionA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two team 阅读全文

摘要：Problem A: FrecklesIn an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through.Consider Dick's back to be a plane with frec 阅读全文

摘要：Dividing coinsIt's commonly known that the Dutch have invented copper-wire. Two Dutch men were fighting over a nickel, which was made of copper. They were both so eager to get it and the fighting was so fierce, they stretched the coin to great length and thus created copper-wire.Not commonly kno 阅读全文

摘要：484. KolaTime limit per test: 0.5 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardOne day Vasya decided to buy a bottle of his favourite Kola in the old vending machine. But he forgot that there was a Halloween that day, so evil forces had made an inner structure of the vending 阅读全文

摘要：C. Vasya and Robottime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya hasnitems lying in a line. The items are consecutively numbered by numbers from1tonin such a way that the leftmost item has number1, the rightmost item has numbern. Each item 阅读全文

摘要：Yet Another Multiple ProblemTime Limit: 40000/20000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2004Accepted Submission(s): 482Problem DescriptionThere are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is high 阅读全文

摘要：1963. KiteTime limit: 1.0 secondMemory limit: 64 MBVova bought a kite construction kit in a market in Guangzhou. The next day the weather was good and he decided to make the kite and fly it. Manufacturing instructions, of course, were only in Chinese, so Vova decided that he can do without it. After 阅读全文

摘要：1966. Cycling RoadsTime limit: 1.0 secondMemory limit: 64 MBWhen Vova was in Shenzhen, he rented a bike and spent most of the time cycling around the city. Vova was approaching one of the city parks when he noticed the park plan hanging opposite the central entrance. The plan had several marble stat 阅读全文

摘要：StoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 347Accepted Submission(s): 271Problem DescriptionTang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Jiang will alternatively 阅读全文

摘要：郑厂长系列故事——逃离迷宫Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1062Accepted Submission(s): 546Problem Description 郑厂长没变 还是那个假厂长真码农 改变的是业余爱好 他现在不研究象棋，改玩游戏了！ 最近，郑厂长爱上了逃离迷宫这个游戏，他日日夜夜的玩，就是想达到自己的目标：1000万，因为这个数字和他在腾讯的年收入一样多。 不过，在他跑到9999999时，游戏屏幕上突然... 阅读全文

摘要：威威猫系列故事——过生日Time Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1075Accepted Submission(s): 295Problem Description 2月29号是威威猫的生日，由于这个日子非常特殊，4年才一次，所以生日这天许多朋友都前往威威猫家祝贺他的生日。 大家给威威猫买了一个非常大非常大的蛋糕，蛋糕的形状是一个有n条边的凸多边形，可是威威猫的审美观有一点奇怪，他只喜欢有m条边的蛋糕，所以他要伙伴们把这个蛋糕切p次，然.. 阅读全文

摘要：An Easy TaskTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11906Accepted Submission(s): 7509Problem DescriptionIgnatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?Given a positive integers Y 阅读全文

摘要：You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5956Accepted Submission(s): 2865Problem DescriptionMany geometry（几何）problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this fina 阅读全文

摘要：Girls' DayTime Limit:1000MSMemory Limit:10000KTotal Submissions:3145Accepted:640DescriptionOn Girls' Day (Haven't heard about it? Well, you may ask the author for details...), we boys get together with girls in the class. On the occasion, every boy will make a wish for girls. Boys want t 阅读全文