![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
chenjun15
这个作者很懒,什么都没留下…
展开
-
Quoit Design(最近点对问题)
Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the po原创 2015-10-27 18:37:26 · 670 阅读 · 0 评论 -
HDU 2253 Longest Common Subsequence Again
AC代码是网上找来的,我没读懂。留待以后来看#include #include #define M 30005#define SIZE 128#define WORDMAX 3200#define BIT 32char s1[M], s2[M];int nword;unsigned int str[SIZE][WORDMAX];unsigned int tmp1[转载 2015-11-24 20:20:19 · 457 阅读 · 0 评论 -
HDU 1098 Ignatius's puzzle
65|f(x) 表示是f(x)能被65整除。思路:则f(x+1 ) = f (x) + 5*( (13 1 ) x^12 ...... .....+(13 13) x^0 )+ 13*( (5 1 )x^4+...........+ ( 5 5 )x^0 )+k*a;很容易证明,除了5*(13 13) x^0 、13*( 5 5 )x^0 和k*a三项以外原创 2015-12-18 19:30:10 · 197 阅读 · 0 评论 -
HDU 2065 红色病毒
参考:http://blog.csdn.net/chty2018/article/details/53510651http://blog.csdn.net/zy691357966/article/details/43073871两篇文章均未完全说清楚原理。假设取了 X1 个A,X2个C,X3个B、D (B、D个数之和为X3),则答案应该为 F[n] = n! / (X1! * X2原创 2017-12-14 03:15:56 · 204 阅读 · 0 评论