码迷,mamicode.com
首页 >  
搜索关键字:bestcoder    ( 690个结果
HDU 5056 Boring count(BestCoder Round #11 (Div. 2))
Problem Description:You are given a string S consisting of lowercase letters, and your task is counting the number of substring that the number of eac...
分类:其他好文   时间:2015-10-30 20:22:11    阅读次数:169
HDU 4990 Reading comprehension(BestCoder Round #8)
Problem Description:Read the program below carefully then answer the question.#pragma comment(linker, "/STACK:1024000000,1024000000")#include #include...
分类:其他好文   时间:2015-10-29 13:11:03    阅读次数:207
BestCoder Round #60.1003.GT and set/HDU5506 dfs
GT and setAccepts: 35Submissions: 194Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)问题描述有NN个集合,每个集合中有A_iA?i??个数。你要将这NN...
分类:其他好文   时间:2015-10-21 18:58:25    阅读次数:156
HDU 4932 Miaomiao's Geometry(BestCoder Round #4)
Problem Description:There are N point on X-axis . Miaomiao would like to cover them ALL by using segments with same length.There are 2 limits:1.A poin...
分类:其他好文   时间:2015-10-21 17:29:43    阅读次数:185
HDU 4883 TIANKENG’s restaurant(BestCoder Round #2)
Problem Description:TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its deli...
分类:其他好文   时间:2015-10-21 15:35:07    阅读次数:211
HDU 4908 BestCoder Sequence(BestCoder Round #3)
Problem Description:Mr Potato is a coder.Mr Potato is the BestCoder.One night, an amazing sequence appeared in his dream. Length of this sequence is o...
分类:其他好文   时间:2015-10-21 15:24:33    阅读次数:118
BestCoder Round #60/HDU 5505 暴力数学
GT and numbers问题描述给出两个数NN和MM。NN每次可以乘上一个自己的因数变成新的NN。求最初的NN到MM至少需要几步。如果永远也到不了输出-1?1。输入描述第一行读入一个数TT表示数据组数。接下来TT行,每行两个数NN和MM。T\leq1000T≤1000, 1\leq N \leq...
分类:其他好文   时间:2015-10-19 22:17:19    阅读次数:228
hdu5504 GT and sequence(BestCoder Round #60 )
GT and sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 334 Accepted Submission(s): 85 Problem Description You are given a sequenc...
分类:其他好文   时间:2015-10-18 11:32:48    阅读次数:212
BestCoder Round #60 1002
Problem DescriptionYou are given two numbers NNN and MMM.Every step you can get a new NNN in the way that multiply NNN by a factor of NNN.Work out how...
分类:其他好文   时间:2015-10-17 23:46:53    阅读次数:433
bestcoder#58(div2) 1002 LCS 置换
bestcoder#58(div2) 1002 LCS 置换LCSAccepts: 127Submissions: 397Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)问题描述你有两个序....
分类:其他好文   时间:2015-10-06 16:55:56    阅读次数:190
690条   上一页 1 ... 20 21 22 23 24 ... 69 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!