chenjun15的博客

Problem Description Have 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

AC代码是网上找来的，我没读懂。留待以后来看 #include #include #define M 30005 #define SIZE 128 #define WORDMAX 3200 #define BIT 32 char s1[M], s2[M]; int nword; unsigned int str[SIZE][WORDMAX]; unsigned int tmp1[

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三项以外

参考： http://blog.youkuaiyun.com/chty2018/article/details/53510651 http://blog.youkuaiyun.com/zy691357966/article/details/43073871 两篇文章均未完全说清楚原理。 假设取了 X1 个A，X2个C，X3个B、D （B、D个数之和为X3），则答案应该为 F[n] = n! / (X1! * X2