better_life30的专栏

I. Treasure IslandTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 262144KB64-bit integer IO format: %lld      Java class name: MainSubmit Status PID: 35607Font Size: 

最小的数Accepted : 42 Submit : 255Time Limit : 1000 MS Memory Limit : 65536 KB 题目描述给你一个n位数，每次操作可以选该数任意的相邻两位进行交换，如果最多可以操作k次,那么最终可以得到的最小的数是什么（n位且不能含前导零)？输入

Problem 2188 过河IAccept: 52    Submit: 131Time Limit: 3000 mSec    Memory Limit : 32768 KB Problem Description一天，小明需要把x只羊和y只狼运输到河对面。船可以容纳n只动物和小明。每次小明划船时，都必须至少有一只动物来陪他，不然他会感到厌倦，不安。不论是船上还是岸

DigitAccepted : 82 Submit : 301Time Limit : 1000 MS Memory Limit : 65536 KB 题目描述我们把十进制整数依次写成一个字符串，123456789101112…请问第n位数码是多少？输入第一行是一个整数T(T≤10000)，表示样例

Beauty of ArrayTime Limit: 2 Seconds      Memory Limit: 65536 KBEdward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the arra

括号匹配Accepted : 26 Submit : 210Time Limit : 10000 MS Memory Limit : 65536 KB 题目描述有一串括号(只包含"(", ")", "[", "]", "{", "}")， 保证这一括号串是匹配的， 长度小于100000， 有m个询问, 每个

Team FormationTime Limit: 3 Seconds      Memory Limit: 131072 KBFor an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of h

/* * 题目：C.Catalan Square * 链接：http://acm.bnu.edu.cn/v3/problem_show.php?pid=48266 * 题意：输入n，求S[n]。 * 分析：由已知得，S[n]=Catalan[n+1];Catalan[n]=C(2*n,n)/(n+1),所以S[n]=C(2*(n+1),(n+1))/((n+1)+1)。 * */imp

May Day HolidayTime Limit: 2 Seconds      Memory Limit: 65536 KBAs a university advocating self-learning and work-rest balance, Marjar University has so many days of rest, including holidays a

Problem 2196 EscapeAccept: 76    Submit: 393Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description小明进入地下迷宫寻找宝藏，找到宝藏后却发生地震，迷宫各处产生岩浆，小明急忙向出口处逃跑。如果丢下宝藏，小明就能迅速离开迷宫，但小明并不想轻易放弃自己的辛苦所得。所以他急忙联

DZY Loves Topological Sorting  Accepts: 112  Submissions: 586 Time Limit: 4000/2000 MS (Java/Others)  Memory Limit: 131072/131072 K (Java/Others)问题描述一张有向图的拓扑序列是图中点的一个排列，满足对

贪心的搜索也能做：http://blog.youkuaiyun.com/u013611908/article/details/44572549转自：http://vainman.coding.io/http://acm.fzu.edu.cn/problem.php?pid=2185题意：給一棵树, 用最少的路径去覆盖所有的边, 求(1)允许边被重复覆盖, (2)不允许边被重复覆

H. Horace and his primesTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 262144KB64-bit integer IO format: %lld      Java class name: MainSubmit Status PID: 35606Font S

I - Integration of PolynomialTime Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)SubmitStatusProblem DescriptionSuppose there are a polynomial which has n n

Abs ProblemTime Limit: 2 Seconds      Memory Limit: 65536 KB      Special JudgeAlice and Bob is playing a game, and this time the game is all about the absolute value!Alice has N diffe

First DateTime Limit: 3000ms, Special Time Limit:7500ms, Memory Limit:65536KBTotal submit users: 77, Accepted users: 43Problem 12952 : No special judgementProblem description

题目大意：有一个N*M大的地图，'.'

Design roadTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 9, Accepted users: 9Problem 13267 : Special judgeProblem description

Contest2071 - 湖南多校对抗赛（2015.03.28）Contest2071 - 湖南多校对抗赛（2015.03.28）  本次比赛试题由湖南大学ACM校队原创  http://acm.csu.edu.cn/OnlineJudge/contest.php?cid=2071Problem A: RectangleTime Limit: 1

Valid Pattern LockTime Limit: 2 Seconds      Memory Limit: 65536 KBPattern lock security is generally used in Android handsets instead of a password. The pattern lock can be set by joini

Problem 1565 - B - MagicTime Limit: 1000MS   Memory Limit: 65536KB   Total Submit: 439  Accepted: 163  Special Judge: NoDescriptionHere are n numbers.You have a magic : first ,

SuperbotTime Limit: 2 Seconds      Memory Limit: 65536 KBSuperbot is an interesting game which you need to control the robot on an N*M grid map.As you see, it's just a simple gam

RectangleTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 23, Accepted users: 13Problem 13266 : No special judgementProblem description

/*题目：C - Plane Ticket Pricing链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=78470#problem/C题意：给你n个座位,m天剩余,接下来m+1行代表剩余i天,对于每天有k种价格的机票,你必须挑选一种作为你当日的机票价, 每种机票价对应当日会销售掉的票数,不够就全卖掉,问你最大的销售利