摘要： Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4503Accepted Submission(s): 1121Problem DescriptionThese are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is s 阅读全文

摘要： 一个人的旅行Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10134Accepted Submission(s): 3432Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看 阅读全文

摘要： A strange liftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6572Accepted Submission(s): 2443Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.T 阅读全文

摘要： I Wanna Go HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2481Accepted: 1035DescriptionThe country is facing a terrible civil war----cities in the country are divided into two parts supporting different leaders. As a merchant, Mr. M does not pay attention to politics but he actually kn 阅读全文

摘要： 棋盘覆盖时间限制：3000 ms | 内存限制：65535 KB难度：3描述在一个2k×2k（1<=k<=100）的棋盘中恰有一方格被覆盖，如图1（k=2时），现用一缺角的2×2方格（图2为其中缺右下角的一个），去覆盖2k×2k未被覆盖过的方格，求需要类似图2方格总的个数s。如k=1时，s=1;k=2时，s=5图1图2 输入第一行m表示有m组测试数据；每一组测试数据的第一行有一个整数数k;输出输出所需个数s;样例输入3123样例输出1521 1 /* 功能Function Description: NYOJ-45 2 开发环境Environment: 阅读全文

摘要： [ Source : Seaeagle ]1437: 校长杯Time Limit: 1500 ms Memory Limit: 32000 kB Judge type: Multi-cases Special JudgeTotal Submit : 113(54 users)Accepted Submit : 70(48 users)Page View : 3989Font Style: Aa Aa Aa 在南开大学，一年一度的“校长杯”三大球比赛是广大师生必不可少的一次运动大餐。随着南开大学学校规模的扩大和体育事业的发展，参与校长杯赛事的师生越来越多。竞赛采用的是传统的“循环赛”制，即每.. 阅读全文

摘要： 棋盘覆盖问题Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 62, Accepted users: 26Problem 10432 : No special judgementProblem description在一个2k x 2k ( 即：2^k x 2^k )个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋盘。在棋盘覆盖问题中，要用图示的4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌 阅读全文

摘要： RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8980Accepted Submission(s): 3301Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, 阅读全文

摘要： Starship Hakodate-maruTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 243Accepted Submission(s): 175Problem DescriptionThe surveyor starship Hakodate-maru is famous for her two fuel containers with unbounded capacities. They hold the same type of a 阅读全文

摘要： 前m大的数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5524Accepted Submission(s): 1965Problem Description还记得Gardon给小希布置的那个作业么？（上次比赛的1005）其实小希已经找回了原来的那张数表，现在她想确认一下她的答案是否正确，但是整个的答案是很庞大的表，小希只想让你把答案中最大的M个数告诉她就可以了。 给定一个包含N(N<=3000)个正整数的序列，每个数不超过5000，对 阅读全文