Jack Ge for ACM

摘要： The Accomodation of StudentsTime Limit : 5000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionThere are a group of students. Some of them may know each other, while others d 阅读全文

摘要： SegmentsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7363Accepted:2207DescriptionGivennsegments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point in common.In 阅读全文

摘要： [1271] Nth Day is Which Dayhttp://ac.nbutoj.com/Problem/view.xhtml?id=1271时间限制: 1000 ms　内存限制: 65535 K问题描述The first day is 1 year 1 month 1 day, so the Nth day is which day?输入Input until EOF. Input a positive integer N means the Nth day(0#include#includeusing namespace std;int m1[12]={31,28,31,30,31, 阅读全文

摘要： ChessboardTime Limit:2000MSMemory Limit:65536KTotal Submissions:11078Accepted:3449DescriptionAlice and Bob often play games on chessboard. One day, Alice draws a board with size M * N. She wants Bob to use a lot of cards with size 1 * 2 to cover the board. However, she thinks it too easy to bob, so 阅读全文

摘要： 二叉搜索树Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description判断两序列是否为同一二叉搜索树序列Input开始一个数n，(1#include#includeusing namespace std;const int N=2010;char str[30];int n 阅读全文

摘要： BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5951Accepted Submission(s): 2707Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the 阅读全文

摘要： Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5950Accepted Submission(s): 3625Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai 阅读全文

摘要： Toy StorageTime Limit:1000MSMemory Limit:65536KTotal Submissions:3024Accepted:1726DescriptionMom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious and obeys 阅读全文

摘要： TOYSTime Limit:2000MSMemory Limit:65536KTotal Submissions:8275Accepted:3922DescriptionCalculate the number of toys that land in each bin of a partitioned toy box.Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectangular 阅读全文

摘要： Help JimmyTime Limit:1000MSMemory Limit:10000KTotal Submissions:7701Accepted:2447Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimmy每次下落的高度不能超过MAX米，不然就会 阅读全文