摘要： DividingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7678Accepted Submission(s): 2095Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the ma 阅读全文

摘要： Reduced ID NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7494Accepted: 3029DescriptionT. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an integer in the range 0 ≤ s ≤ MaxSIN with MaxSIN = 106-1. 阅读全文

摘要： http://acmoj.shu.edu.cn/openjudge/viewproblem?coll_id=1&prob_id=241Franklin's TroubleDescriptionProfessor Franklin is consulting for an oil company, which is planning a large pipeline running east to west through an oil field of M wells. From each well, a sub-pipeline is to be connected dire 阅读全文

摘要： RealPhobiaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 69Accepted Submission(s): 27Problem DescriptionBert is a programmer with a real fear of floating point arithmetic. Bert has quite successfully used rational numbers to write his programs but 阅读全文

摘要： The BalanceTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 2490Accepted: 1091DescriptionMs. Iyo Kiffa-Australis has a balance and only two kinds of weights to measure a dose of medicine. For example, to measure 200mg of aspirin using 300mg weights and 700mg weights, she can put one 700mg we 阅读全文

摘要： #include<stdio.h>#include<string.h>#include<iostream>using namespace std;char str[1000];char name[100];char ans1[100],ans2[100],ans3[100],ans4[100],ans5[100];int main(){ // freopen("test.in","r",stdin); // freopen("test.out","w",stdout); int 阅读全文

摘要： Oil SkimmingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 87Accepted Submission(s): 50Problem DescriptionThanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude 阅读全文

摘要： 选课时间(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1516Accepted Submission(s): 1253Problem Description又到了选课的时间了，xhd看着选课表发呆，为了想让下一学期好过点，他想知道学n个学分共有多少组合。你来帮帮他吧。（xhd认为一样学分的课没区别）Input输入数据的第一行是一个数据T，表示有T组数据。每组数据的第一行是两个整数n(1 <= n <= 40 阅读全文

摘要： Ignatius and the Princess IIITime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description"Well, it seems the first problem is too easy. I will let you know 阅读全文

摘要： GraphTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 962Accepted Submission(s): 510Problem DescriptionEveryone knows how to calculate the shortest path in a directed graph. In fact, the opposite problem is also easy. Given the length of shortest pa 阅读全文