摘要： AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10288Accepted: 5556DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are convenientl 阅读全文

摘要： Invitation CardsTime Limit: 8000MSMemory Limit: 262144KTotal Submissions: 14556Accepted: 4710DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. T 阅读全文

摘要： CodeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 6093Accepted: 2865DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associated to a character sequ 阅读全文

摘要： ArbitrageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11008Accepted: 4629DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British po 阅读全文

摘要： Stockbroker GrapevineTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21124Accepted: 11474DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in th 阅读全文

摘要： FroggerTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17842Accepted: 5818DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunsc 阅读全文

摘要： //大数乘小数void mult(char c[],int m,char t[]){ char s[100]; int len=strlen(c); for(int i=0;i<len;i++) s[len-i-1]=c[i]-'0'; int flag,add=0; for(int i=0;i<len;i++) { int k=s[i]*m+add; if(k>=10) { s[i]=k%10; add=k/10; flag=1; ... 阅读全文

摘要： 昂贵的聘礼Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 27365Accepted: 7639Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。"探险家就跑到大祭司那里，向他要求皮袄或水晶球，大祭司要他用金币来换，或者替他弄来其他的东 阅读全文

摘要： WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20639Accepted: 7342DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BE 阅读全文