Ramanujan

摘要： You are given N processors and M jobs to be processed. Two processors are specified to each job. To process the job, the job should be allocated to and executed on one of the two processors for one unit of time. If K jobs are allocated to a processor, then it takes K units of time for the processor 阅读全文

摘要： Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as soon as pos-sible, there is also a need to schedule all the taxi rides which have been booked in advance. Given a list of 阅读全文

摘要： Problem CSAM I AMInput: Standard InputOutput: Standard Output The world is in great danger!! Mental's forces have returned to Earth toeradicate humankind. Our last hope to stop this great evil is Sam “Serious” Stone. Equipped withvarious powerful weapons, Serious Sam starts his mission to destro 阅读全文

摘要： AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12768Accepted: 6949DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 #include#include#include#include#include#include#includeusing namespace std;#define LL long long# 阅读全文

摘要： Caocao's BridgesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3871Accepted Submission(s): 457Problem DescriptionCaocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was no 阅读全文

摘要： Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid that some of them might become couples. While you can never exclude this possibility, he has made some rules that he thinks indicates a low probability two persons will 阅读全文

摘要： A technique used in early multiprogramming operating systems involved partitioning the available primary memory into a number of regions with each region having a fixed size, different regions potentially having different sizes. The sum of the sizes of all regions equals the size of the primary memo 阅读全文

摘要： Problem I – Ladies’ ChoiceBackgroundTeenagers from the local high school have asked you to help them with the organization of next year’s Prom. The idea is to find a suitable date for everyone in the class in a fair and civilized way. So, they have organized a web site where all students, boys and g 阅读全文

摘要： Marriage is StableTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 438Accepted Submission(s): 257Special JudgeProblem DescriptionAlbert, Brad, Chuck are happy bachelors who are in love with Laura, Marcy, Nancy. They all have three choices. But in fa 阅读全文

摘要： Problem GGolden Tiger ClawTime Limit: 8 SecondOmi, Raymondo, Clay and Kimiko are on new adventure- in search of new Shen Gong Wu. But Evil Boy Genius Jack Spicer is also there. Omi and Jack found the Shen Gong Wu at the same time so they rushed for it but alas they touched it at the same time. Then 阅读全文