随笔分类 -  HDU

1 2 3 4 5 ··· 9 下一页
摘要:MZL's Circle Zhou Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description MZL's Circle Zhou is good at 阅读全文
posted @ 2017-10-02 17:56 meekyan 阅读(457) 评论(0) 推荐(0)
摘要:The Dominator of Strings Time Limit: 3000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Problem Description Here you have a set of s 阅读全文
posted @ 2017-10-01 20:49 meekyan 阅读(460) 评论(0) 推荐(0)
摘要:Reincarnation Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Problem Description Now you are back,and have a task t 阅读全文
posted @ 2017-09-30 15:20 meekyan 阅读(302) 评论(0) 推荐(0)
摘要:Security Check Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem Description In airport of Bytetown, there ar 阅读全文
posted @ 2017-09-11 22:14 meekyan 阅读(404) 评论(0) 推荐(0)
摘要:Phone Call Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem Description There are n houses in Bytetown, labe 阅读全文
posted @ 2017-09-09 21:58 meekyan 阅读(366) 评论(0) 推荐(0)
摘要:B. Neural Network country time limit per test 2 seconds memory limit per test 256 megabytes B. Neural Network country time limit per test 2 seconds ti 阅读全文
posted @ 2017-09-08 19:55 meekyan 阅读(315) 评论(0) 推荐(0)
摘要:Senior Pan Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem DescriptionSenior Pan fails in his discrete mat 阅读全文
posted @ 2017-09-05 19:30 meekyan 阅读(323) 评论(0) 推荐(0)
摘要:Color it Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others) Problem Description Do you like painting? Little D doesn 阅读全文
posted @ 2017-09-01 11:31 meekyan 阅读(270) 评论(0) 推荐(0)
摘要:Query on A Tree Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others) Problem Description Monkey A lives on a tree, he 阅读全文
posted @ 2017-08-31 17:04 meekyan 阅读(569) 评论(0) 推荐(0)
摘要:Subsequence Count Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others) Problem Description Given a binary string S[1,.. 阅读全文
posted @ 2017-08-21 17:15 meekyan 阅读(604) 评论(0) 推荐(0)
摘要:A Secret Problem Description Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in 阅读全文
posted @ 2017-08-21 15:06 meekyan 阅读(208) 评论(0) 推荐(0)
摘要:Give out candies Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem Description There are n children numbered  阅读全文
posted @ 2017-08-18 11:31 meekyan 阅读(710) 评论(0) 推荐(0)
摘要:Free from square Problem Description There is a set including all positive integers that are not more then n. HazelFan wants to choose some integers f 阅读全文
posted @ 2017-08-17 19:08 meekyan 阅读(263) 评论(0) 推荐(0)
摘要:Fleet of the Eternal Throne Problem Description > The Eternal Fleet was built many centuries ago before the time of Valkorion by an unknown race on th 阅读全文
posted @ 2017-08-17 17:21 meekyan 阅读(249) 评论(0) 推荐(0)
摘要:Typesetting Problem Description Yellowstar is writing an article that contains N words and 1 picture, and the i-th word contains ai characters.The pag 阅读全文
posted @ 2017-08-12 11:42 meekyan 阅读(452) 评论(0) 推荐(0)
摘要:String Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem DescriptionBob has a dictionary with N words in it.N 阅读全文
posted @ 2017-08-11 16:11 meekyan 阅读(245) 评论(0) 推荐(0)
摘要:Rikka with String Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to p 阅读全文
posted @ 2017-08-08 20:25 meekyan 阅读(729) 评论(1) 推荐(2)
摘要:Matching In Multiplication Problem DescriptionIn the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divid 阅读全文
posted @ 2017-08-06 21:04 meekyan 阅读(307) 评论(0) 推荐(1)
摘要:Classic Quotation Problem Description When online chatting, we can save what somebody said to form his ''Classic Quotation''. Little Q does this, too. 阅读全文
posted @ 2017-08-06 10:07 meekyan 阅读(569) 评论(0) 推荐(0)
摘要:Limited Permutation Problem Description As to a permutation p1,p2,⋯,pn from 1 to n, it is uncomplicated for each 1≤i≤n to calculate (li,ri) meeting th 阅读全文
posted @ 2017-08-05 11:15 meekyan 阅读(355) 评论(0) 推荐(0)

1 2 3 4 5 ··· 9 下一页