摘要： 2038: [2009国家集训队]小Z的袜子(hose) Description 作为一个生活散漫的人，小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天，小Z再也无法忍受这恼人的找袜子过程，于是他决定听天由命……具体来说，小Z把这N只袜子从1到N编号，然后从编号L到R(L 尽管 阅读全文

摘要： 65536K Today is a bad day. Teemo is scolded badly by his teacher because he didn't do his homework.But Teemo is very self-confident, he tells the teac 阅读全文

摘要： Let's consider some math problems. JSZKC has a set A=A={1,2,...,N}. He defines a subset of A as 'Meo set' if there doesn't exist two integers in this 阅读全文

摘要： JSZKC is going to spend his vacation! His vacation has N days. Each day, he can choose a T-shirt to wear. Obviously, he doesn't want to wear a singer 阅读全文

摘要： Alice and Bob are playing a simple game. They line up a row of n identical coins, all with the heads facing down onto the table and the tails upward. 阅读全文

摘要： Method ringing is used to ring bells in churches, particularly in England. Suppose there are 6 bells that have 6 different pitches. We assign the numb 阅读全文

摘要： 1 局部数组：没有默认值，如果声明的时候不定义，则会出现随机数（undefined）；如果声明的长度与赋值长度不相等，则有，声明的长度>赋值长度，后面用0补足，声明的长度>赋值长度，发生编译错误； 2 3 4 5 全局数组：声明时不赋值，默认值为0 6 在所有函数（包括主函数）之外定义的变量称为“全局变量”。 阅读全文

摘要： #1050 : 树中的最长路 #1050 : 树中的最长路 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 上回说到，小Ho得到了一棵二叉树玩具，这个玩具是由小球和木棍连接起来的，而在拆拼它的过程中，小Ho发现他不仅仅可以拼凑成一棵二叉树！还可以拼凑成一棵多叉树——好吧 阅读全文

摘要： All as we know, a mountain is a large landform that stretches above the surrounding land in a limited area. If we as the tourists take a picture of a 阅读全文

摘要： 1 //数据量较小,1000 2 void C() 3 { 4 c[0][0]=1; 5 for(int i=1;in) return 0; 77 ll ans=1ll; 78 for(ll i=1;i a)return 0; 5 return fac[a] * inv[b] % mod * inv[a - b] % mod;... 阅读全文