常用技巧
Archger
Thanks for adventure.
展开
-
HDU 6129 Just do it【杨辉三角】【思维题】【好题】
Just do itTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 635 Accepted Submission(s): 356Problem DescriptionThere is a nonn原创 2017-08-16 11:18:47 · 426 阅读 · 0 评论 -
HDU 6103 Kirinriki【尺取法】【思维题】【好题】
KirinrikiTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 456 Accepted Submission(s): 160Problem DescriptionWe define the dist原创 2017-08-10 21:07:31 · 1742 阅读 · 0 评论 -
ACM常用解题技巧方法
转自:http://blog.csdn.net/consciousman/article/details/51407514参加acm也一段时间了,决定重新总结下自己学到的一些东西,这样才会收获得更多。比赛考验的不仅仅是知识面,思维能力,编码能力,更有团队合作的意识以及心态。平时接触的题目会涵盖各个方面的内容,我们都需要有一些适当的解题技巧,在这里总结谈一些比较重要的技巧或者方法的运用:1、转载 2017-08-10 21:13:15 · 1445 阅读 · 0 评论 -
HDU Friend-Graph【暴力】【卡内存】【水题】
Friend-GraphTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 464 Accepted Submission(s): 230Problem DescriptionIt is well kno原创 2017-08-19 21:09:40 · 662 阅读 · 0 评论 -
HDU 6114 Chess【逆元+组合数】【模板题】
ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 95 Accepted Submission(s): 72Problem Description車是中国象棋中的一种棋子,它能攻击同一行或同一列原创 2017-08-13 19:15:17 · 622 阅读 · 0 评论 -
HDU 6119 小小粉丝度度熊【线段合并+尺取法】(2017"百度之星"程序设计大赛 - 初赛(B))
小小粉丝度度熊Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 540 Accepted Submission(s): 164Problem Description度度熊喜欢着喵哈哈村的大明星——星星小姐原创 2017-08-13 21:58:25 · 398 阅读 · 0 评论 -
ZOJ 2996 (1+x)^n【模板题】【常用技巧】
(1+x)^nTime Limit: 2 Seconds Memory Limit: 65536 KBPlease calculate the coefficient modulo 2 of x^i in (1+x)^n.InputFor each case, there are two integers n, i (0OutputFor each c原创 2017-08-15 19:10:26 · 560 阅读 · 0 评论 -
HDU 6178 Monkeys【dfs】【输入外挂模板】
MonkeysTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others)Total Submission(s): 717 Accepted Submission(s): 232Problem DescriptionThere is a tree ha原创 2017-08-25 17:05:57 · 404 阅读 · 0 评论