Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18673 Accepted: 9275 Description Railway tickets were difficult to buy around the Lunar New Year in Chin…
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26604 Accepted: 7893 Description There is an apple tree outside of kaka's house. Every autumn, a lot of a…
题目描述 Description 在大学期间，经常需要租借教室。大到院系举办活动，小到学习小组自习讨论，都需要 向学校申请借教室。教室的大小功能不同，借教室人的身份不同，借教室的手续也不一样。 面对海量租借教室的信息，我们自然希望编程解决这个问题。 ...
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 39472 Accepted: 12852 Description Farmer John wants to repair a small length of the fence around the pa…
Expedition Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12564 Accepted: 3591 Description A group of cows grabbed a truck and ventured on an expedition deep into …
题目描述 Description 在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。 每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所耗体力之和。 因为还要…
Day 1 T 1: #include<iostream> #include<cstdio> #include<cstring> using namespace std; long long f[101]; int main() { freopen("hungry.in","r",stdin); freopen(…
真 · Noip模拟赛 Day1 题目概况 试题名称 M又饿了 seq interval 英文题目与子目录名 hungry seq interval 可执行文件名 hungry seq interval 输入文件名 hungry.in seq.in interval.in 输出文件名 hungry.out seq.out interval.out …
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 89835 Accepted: 27972 Case Time Limit: 2000MS Description You have N integers, A1, A…