摘要：Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:24372Accepted:13408DescriptionStockbrokers 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 the st 阅读全文

摘要：FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:22557Accepted:7339DescriptionFreddy 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' sunscreen 阅读全文

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

摘要：The dog taskTime Limit:1000MSMemory Limit:10000KTotal Submissions:2559Accepted:1038Special JudgeDescriptionHunter Bob often walks with his dog Ralph. Bob walks with a constant speed and his route is a polygonal line (possibly self-intersecting) whose vertices are specified by N pairs of integers (Xi 阅读全文

摘要：Air RaidTime Limit:1000MSMemory Limit:10000KTotal Submissions:6184Accepted:3703DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never 阅读全文

摘要：COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:15975Accepted:6293DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies si 阅读全文

摘要：Muddy FieldsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7340Accepted:2715DescriptionRain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 14 #include15 struct node{16 int x;17 int y;18 }edge[55][55];19 char c[55][55];20 int g[1500][1500];21 int vis[1500];... 阅读全文