码迷,mamicode.com
首页 >  
搜索关键字:c. dzy loves sequences    ( 1332个结果
Codeforces 450B - Jzzhu and Sequences ( 矩阵快速幂 )
Codeforces 450B - Jzzhu and Sequences ( 矩阵快速幂 )题意:给定f1和f2,求fn分析:特判f1,f2当n>=3时使用矩阵快速幂即可( 简单题 )将公式转化一下 ,可以得到一个变换矩阵代码:#include #include #include using na...
分类:其他好文   时间:2014-10-21 12:04:58    阅读次数:196
HDU - 4810 Wall Painting(组合数学)
Description Ms.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by mixing water and some bags of pigm...
分类:其他好文   时间:2014-10-20 23:22:07    阅读次数:259
HDU4882ZCC Loves Codefires(贪心)
ZCC Loves Codefires Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 823 Accepted Submission(s): 438 Problem Description Though ZCC has man...
分类:其他好文   时间:2014-10-18 19:44:50    阅读次数:176
HDU4876ZCC loves cards(多校题)
ZCC loves cards Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2362 Accepted Submission(s): 590 Problem Description ZCC loves playing car...
分类:其他好文   时间:2014-10-18 15:36:01    阅读次数:218
clojure实现最长上升子序队列算法
4Clojure上的一道题:[4Clojure 最长上升子序列算法][1] 描述如下: > Given a vector of integers, find the longest consecutive sub-sequence of increasing numbers. If two sub-sequences have the same le...
分类:编程语言   时间:2014-10-18 09:55:22    阅读次数:259
CodeForces Round #257 (Div. 2)
题目:A Jzzhu and Children ------ CodeForces 450AB Jzzhu and Sequences ------ CodeForces 450BC Jzzhu and Chocolate ------ CodeForces 449AD Jzz...
分类:其他好文   时间:2014-10-14 19:47:39    阅读次数:191
Codeforces Round #272 (Div. 1) A. Dreamoon and Sums(数论)
题目链接Dreamoon loves summing up something for no reason. One day he obtains two integersaandboccasionally. He wants to calculate the sum of allniceinteg...
分类:其他好文   时间:2014-10-13 23:10:27    阅读次数:221
最简单的图片轮播
无标题文档 转载原文:http://blog.csdn.net/wjr_loves/article/details/7865537
分类:其他好文   时间:2014-10-10 13:30:24    阅读次数:197
【数论】 大数的各个位数和直到取到个位
2012年3月11日dlut周赛1002LOVELY-POINTTimeLimit:1 SecondMemoryLimit:32 MegabyteTotalsubmit:154Accepted:42DescriptionLolihunter loves Lolita,To tell while lo...
分类:其他好文   时间:2014-10-10 13:03:54    阅读次数:158
HDU 4360 As long as Binbin loves Sangsang spfa
题意: 给定n个点m条边的无向图 每次必须沿着LOVE走,到终点时必须是完整的LOVE,且至少走出一个LOVE, 问这样情况下最短路是多少,在一样短情况下最多的LOVE个数是多少。 有自环。 #include #include #include #include #include #include using namespace std; typedef __int64 ll...
分类:其他好文   时间:2014-09-28 20:22:06    阅读次数:186
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!