转角的守望

Find a multipleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7705 Accepted: 3362 Special JudgeDescriptionThe input contains N natural (i.e. posi

Killer NamesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 353    Accepted Submission(s): 186Problem Description> Galen Marek, code

Limited PermutationTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1240    Accepted Submission(s): 313Problem DescriptionAs to a p

Card CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4592    Accepted Submission(s): 2319Special JudgeProblem DescriptionIn

How many integers can you findTime Limit: 12000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8973    Accepted Submission(s): 2681Problem Description

Saving BeansTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5952    Accepted Submission(s): 2379Problem DescriptionAlthough winter i

Stancu likes space travels but he is a poor software developer and will never be able to buy his own spacecraft. That is why he is preparing to steal the spacecraft of Petru. There is only one problem

见刘汝佳白书146页题意：            n颗珠子t种颜色 求有多少种不同项链和手镯             其中项链不可以翻转 手镯可以翻转思路：Polya定理  求等价类           先介绍Polya定理：置换 F 分解成 m(F) 个循环到乘积，那么每个循环内所有珠子的颜色必须相同，假设有k种颜色，则有 C(F) = k ^m(F) . 代

题意：给出26个大写字母到置换B，问是否存在一个置换A，使得 A^2 == B  题解：刘汝佳白书148页结论知：一个长度为n的循环置换，（1）当n为奇数的时候，可以由两个相同的2×n长到循环节分裂得到，或者两个相同的长度为 n 的循环节相乘得到                                              （2）当n为偶数的时候，只能由两个相同

1008: [HNOI2008]越狱Time Limit: 1 Sec  Memory Limit: 162 MBSubmit: 10581  Solved: 4592[Submit][Status][Discuss]Description　　监狱有连续编号为1...N的N个房间，每个房间关押一个犯人，有M种宗教，每个犯人可能信仰其中一种。如果相邻房间的犯人的宗教相

Unknown TreasureTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3056    Accepted Submission(s): 1128Problem DescriptionOn the way

1004: [HNOI2008]CardsTime Limit: 10 Sec  Memory Limit: 162 MBSubmit: 3821  Solved: 2303[Submit][Status][Discuss]Description　　小春现在很清闲,面对书桌上的N张牌,他决定给每张染色,目前小春只有3种颜色:红色,蓝色,绿色.他询问Sun有多少种染色

A题目描述给个n，求1到n的所有数的约数个数的和~ 输入描述:第一行一个正整数n输出描述:输出一个整数，表示答案示例1输入3输出5说明样例解释：1有1个约数12有2个约数1,23有2个约数1,3备注:n <= 100000000#incl

hdu 6243 组合数学（公式推导）Dogs and CagesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 203    Accepted Submission(s): 131Special Judge

FunctionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 548    Accepted Submission(s): 215Problem DescriptionYou are given a permu

Just do itTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 579    Accepted Submission(s): 319Problem DescriptionThere is a nonnegat

Rikka with SubsetTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 108    Accepted Submission(s): 41Problem DescriptionAs we know, Rik

RPG的错排Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11487    Accepted Submission(s): 4717Problem Description今年暑假杭电ACM集训队第一次组成女

FrogsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2042    Accepted Submission(s): 676Problem DescriptionThere are m stones lyin

The Boss on MarsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2666    Accepted Submission(s): 846Problem DescriptionOn Mars, t

Co-primeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 626    Accepted Submission(s): 234 Problem DescriptionGiven a numbe

RemotelandTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1240    Accepted Submission(s): 501Problem DescriptionIn the Republ

Wall PaintingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2902    Accepted Submission(s): 940Problem DescriptionMs.Fang loves pa

Examining the RoomsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1602    Accepted Submission(s): 975Problem DescriptionA murder ha

给出n  k当 i 属于 1~n 时 ，求解 n% i 的和n 和 k 的范围都是 1 到 十的九次方普通的计算当然会超时我们先通过打表几个数来看看下面的括号表示当余数为0的时候 i 为多少n = k =90 的时候0 (1)0 (2)0 (3)2 0 (5)0 (6)6 2 0 (9)0 (10)2 6 12 6 0 (15)10 5 0

This is a classical problem. Your job is to calculate the combination formula C(n,m) , and  C ( n , m )  fit a 64-bit unsigned integer.（注意答案的范围）Input The first 

卡特兰数C（n） = 1 /（n-1）*C（2*n，n）递推公式为C（n）=（4*n - 2）/( n - 1 ) *C（n-1）                 若用递推公式，会在32的时候溢出下面的代码用的是dp的思想#include#include#includeusing namespace std;long long c[50

莫慈金：默慈金数的：一个给定的数的默慈金数是在一个圆上的个点间，画出彼此不相交弦的全部方法的总数。比如为4时，方法数为9，如下图                      默慈金数在几何，组合数学和数论等领域中皆有其重要用途，它的递归定义如下        接下来是最重要的环节，来探讨上述递推公式的由来。有一篇论文有详细讲解，我已放到豆丁网上，如下 

Count the BuildingsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1497    Accepted Submission(s): 499Problem DescriptionThere are N

题意：给出n个卡，求这些卡放在一个包里面的方法数  +  放在两个包的方法数  +  放在三个包的方法数  。。。。放在n个包的方法数  的总和题解：模板题第二类斯特拉数将p个物体排成k个非空集合排列的方法数。s(p,0)=0 ,p>=1 ;s(p,p)=1  ,p>=0。递推式：s(p,k)=k*s(p-1,k)+s(p-1,k-1) ,1

题目：有N个机器，每天选出R个机器，而且每两个机器的编号差要大于等于K，而且每天将R个机器最多分为M组工作，问最多有多少种方案题解：先选出R个机器，然后将R个机器分为m个组第一步自己打草稿解决，第二部看斯特林数#include#include#includeusing namespace std;const int MAXN=2010;#defi

在中国，很多人都把6和8视为是幸运数字！lxhgww也这样认为，于是他定义自己的“幸运号码”是十进制表示中只包含数字6和8的那些号码，比如68，666，888都是“幸运号码”！但是这种“幸运号码”总是太少了，比如在[1,100]的区间内就只有6个（6，8，66，68，86，88），于是他又定义了一种“近似幸运号码”。lxhgww规定，凡是“幸运号码”的倍数都是“近似幸运号码”，当然，任何的“幸运号