码迷,mamicode.com
首页 >  
搜索关键字:c. dzy loves sequences    ( 1332个结果
Hamburgers 假定解是否可行
HamburgersTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionPolycarpus loves hamburgers very much. He especial...
分类:其他好文   时间:2015-07-27 22:45:09    阅读次数:106
hdu 5265 技巧题 O(nlogn)求n个数中两数相加取模的最大值
pog loves szh II Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2106    Accepted Submission(s): 606 Problem Description Pog and Szh ar...
分类:其他好文   时间:2015-07-27 13:09:55    阅读次数:115
CDOJ 486 Good Morning 傻逼题
Good MorningTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.uestc.edu.cn/#/problem/show/486DescriptionSam loves Lily very much that he shows his ...
分类:其他好文   时间:2015-07-26 18:52:50    阅读次数:165
Codeforces Round #312 (Div. 2) C.Amr and Chemistry
Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.Amr hasndifferent types of chemicals. Each chem...
分类:其他好文   时间:2015-07-26 00:25:49    阅读次数:168
Codeforce417C——二分——Hamburgers
Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three de...
分类:其他好文   时间:2015-07-25 16:40:57    阅读次数:111
Codeforces Round #312 (Div. 2)——C暴力技巧——Amr and Chemistry
Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.Amr hasndifferent types of chemicals. Each chem...
分类:其他好文   时间:2015-07-22 22:35:50    阅读次数:146
HDU 5274 Dylans loves tree(LCA+dfs时间戳+成段更新 OR 树链剖分+单点更新)
Problem Description Dylans is given a tree with N nodes. All nodes have a value A[i].Nodes on tree is numbered by 1~N. Then he is given Q questions like that: ①0 x y:change node x′...
分类:其他好文   时间:2015-07-22 13:19:22    阅读次数:173
KMP(1-模板题)
DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 #include #include using namespace std;const in...
分类:其他好文   时间:2015-07-21 12:43:02    阅读次数:167
BestCoder Round #43
T1:pog loves szh I(hdu 5264)题目大意:给出把AB两个字符串交叉拼起来的结果,求出原串。题解:不解释。。直接每次+2输出。T2:pog loves szh II(hdu 5265)题目大意:给出N个数,求Mod P域下两个数最大和。 N<=100000题解:先把所有数Mod...
分类:其他好文   时间:2015-07-20 09:10:14    阅读次数:106
CodeForces 373B——模拟——Making Sequences is Fun
We'll defineS(n)for positive integernas follows: the number of then's digits in the decimal base. For example,S(893)?=?3,S(114514)?=?6.You want to mak...
分类:其他好文   时间:2015-07-19 16:13:36    阅读次数:95
1332条   上一页 1 ... 87 88 89 90 91 ... 134 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!