![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
组合数学
文章平均质量分 77
傲慢的么么forever
待到学有所成时,我会找到人生的意义。
展开
-
NYOJ 题目734 奇数阶魔方
奇数阶魔方时间限制:1000 ms | 内存限制:65535 KB难度:3描述一个 n 阶方阵的元素是1,2,...,n^2,它的每行,每列和2条对角线上元素的和相等,这样的方阵叫魔方。n为奇数时我们有1种构造方法,叫做“右上方” ,例如下面给出n=3,5,7时的魔方.38 1 63 5 74 9 2517 24 1 8 1523 5原创 2014-10-31 12:09:09 · 513 阅读 · 0 评论 -
POJ 3187 Backward Digit Sums
Backward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5001 Accepted: 2876DescriptionFJ and his cows enjoy playing a mental game. They write down the numbers from 1 to原创 2015-05-21 15:31:45 · 387 阅读 · 0 评论 -
POJ 1664 放苹果
放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27444 Accepted: 17413Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。Input第一行是测试数据的数目t(0 Ou原创 2015-05-02 18:50:31 · 295 阅读 · 0 评论 -
HDU 1085 Holding Bin-Laden Captive!
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16585 Accepted Submission(s): 7451Problem DescriptionWe all原创 2015-05-02 16:47:27 · 373 阅读 · 0 评论 -
HDU 1171 Big Event in HDU
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27176 Accepted Submission(s): 9580Problem DescriptionNowadays, we al原创 2015-05-02 21:16:16 · 336 阅读 · 0 评论 -
HDU 1028 Ignatius and the Princess III
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14938 Accepted Submission(s): 10521Problem Description"W原创 2015-05-02 16:45:04 · 360 阅读 · 0 评论 -
HDU 2082 找单词
找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4424 Accepted Submission(s): 3171Problem Description假设有x1个字母A, x2个字母B,....原创 2015-01-04 14:33:35 · 375 阅读 · 0 评论 -
HDU 1028 Ignatius and the Princess III
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14069 Accepted Submission(s): 9913Problem Descriptio原创 2015-01-04 15:17:53 · 392 阅读 · 0 评论 -
POJ 1014 Dividing
DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 61130 Accepted: 15794DescriptionMarsha and Bill own a collection of marbles. They want to split原创 2015-01-04 18:34:52 · 360 阅读 · 0 评论 -
HDU 1023 Train Problem II
Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6184 Accepted Submission(s): 3368Problem DescriptionAs we all原创 2015-01-04 16:06:57 · 369 阅读 · 0 评论 -
PKU 3252 Round Numbers
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9477 Accepted: 3396DescriptionThe cows, as you know, have no fingers or thumbs and thus are原创 2015-01-03 20:10:19 · 416 阅读 · 0 评论 -
PKU 1833 排列
排列Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16838 Accepted: 6745Description题目描述: 大家知道,给出正整数n,则1到n这n个数可以构成n!种排列,把这些排列按照从小到大的顺序(字典顺序)列出,如n=3时,列出1原创 2015-01-02 15:51:12 · 317 阅读 · 0 评论 -
PKU 2084 Game of Connections
Game of ConnectionsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7567 Accepted: 3832DescriptionThis is a small but ancient game. You are supposed to w原创 2015-01-03 15:12:54 · 370 阅读 · 0 评论 -
NYOJ 题目88 汉诺塔(一)
汉诺塔(一)时间限制:1000 ms | 内存限制:65535 KB难度:3描述在印度,有这么一个古老的传说:在世界中心贝拿勒斯(在印度北部)的圣庙里,一块黄铜板上插着三根宝石针。印度教的主神梵天在创造世界的时候,在其中一根针上从下到上地穿好了由大到小的64片金片,这就是所谓的汉诺塔。不论白天黑夜,总有一个僧侣在按照下面的法则移动这些金片:一次只移动一片原创 2014-10-31 12:16:24 · 586 阅读 · 0 评论 -
Aoj 0525 Osenbei
pilot系列之最基础的穷竭搜索(初级篇)C题意:药药!切克闹! 煎饼果子来一套!有一个烤饼器可以烤r行c列的煎饼,煎饼可以正面朝上(用1表示)也可以背面朝上(用0表示)。一次可将同一行或同一列的煎饼全部翻转。现在需要把尽可能多的煎饼翻成正面朝上,问最多能使多少煎饼正面朝上?输入:多组输入,每组第一行为二整数r, c (1 ≤ r ≤ 10, 1 ≤ c ≤ 10 000),剩下r行c列表原创 2015-05-22 10:16:50 · 737 阅读 · 0 评论