Ramanujan

摘要： Road ConstructionTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7370Accepted: 3694DescriptionIt's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Island 阅读全文

摘要： Redundant PathsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7651Accepted: 3337DescriptionIn order to get from one of the F (1 2 and 1 –> 6 –> 5 –> 21 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 43 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5 –> 7Every pair of f 阅读全文

摘要： 迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5322Accepted Submission(s): 2373Problem Description为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define ULL un 阅读全文

摘要： King's QuestTime Limit: 15000MSMemory Limit: 65536KTotal Submissions: 6569Accepted: 2342Case Time Limit: 2000MSDescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did li 阅读全文

摘要： Cashier EmploymentTime Limit: 10 Seconds Memory Limit: 32768 KBA supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager has hired you to help him, solve his problem. The problem is that the supermarket needs different number ... 阅读全文

摘要： IntervalsTime Limit: 10 Seconds Memory Limit: 32768 KBYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn. Write a program that: > reads the number of intervals, their endpoints and integers c1, ..., cn from the standard input, > computes the minimal size of a... 阅读全文

摘要： Popular CowsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20472Accepted: 8316DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 1，即有cow认为 no cow is popular，所以答案为0；否则出度为0的强连通分量为1，因为至少有一个点，则答案为该强连通分量的点数，证明如下： 1.因为仅该强连通分量为0表明其它强连通分量所有点间接/直接地指向该强 阅读全文

摘要： Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2119Accepted Submission(s): 502Problem DescriptionAfter awarded lands to ACMers, the queen want to choose a city be her capital. This is an important event in ice_cream world, and 阅读全文

摘要： Problem A: The MonocycleA monocycle is a cycle that runs on one wheel and the one we will be considering is a bit more special. It has a solid wheel colored with five different colors as shown in the figure:The colored segments make equal angles (72o) at the center. A monocyclist rides this cycle o. 阅读全文

摘要： Problem B: Fire! Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze.Given Joe's location in the maze and which squares of the maze are on fire, you must determine whether Joe can 阅读全文