杂题
文章平均质量分 82
Wiking__acm
这个作者很懒,什么都没留下…
展开
-
整数划分相关递推
前面讨论的“石子合并”问题也属于划分问题,同时前面还讨论了“前10个阶乘所能构成和为n的方法数”这样的问题,已经基本属于整数划分的问题了,本小节,根据碰到的一些整数划分问题给出算法分析与解决。一.基本划分问题问题描述:给定一个正整数n,求将其划分为m份的不同方法数。问题分析:(1) 首先,何谓不同方法总数?即两个不同的划分的元素不能完全相同,eg:10 = 1+2+3+4,是转载 2012-05-25 21:25:24 · 2083 阅读 · 0 评论 -
hdu 4597 Play Game (博弈dp)
Play GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionAlice and Bob are play原创 2013-08-24 14:14:58 · 2711 阅读 · 2 评论 -
Poj 1082 (博弈)
Calendar GameTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4494 Accepted: 2099DescriptionAdam and Eve enter this year's ACM International Collegiate Pro原创 2013-08-13 22:34:08 · 1187 阅读 · 0 评论 -
Poj 1740(男人八题——博弈)
A New Stone GameTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4448 Accepted: 2399DescriptionAlice and Bob decide to play a new stone game.At the beginni原创 2013-08-13 21:04:44 · 1181 阅读 · 0 评论 -
uva 12293 uva 11892 (简单博弈)
两道简单的博弈题,关键是多写几组数据找规律,同时在验算时注意写的有根有据,推理清晰第一题比较好的演算方式是列表格写个n*n的表,然后往里填先手或是后手胜,每个格子的答案都可以根据左边格子内的情况推出这样写了部分表后就可以看出规律是:判断n+1是不是2的整数次幂。那么这个判断一句话就可以完成了n & n+1 == 0 (来源于 n & n-1 == 0)第二题分堆数及每堆原创 2013-03-03 18:26:16 · 1052 阅读 · 0 评论 -
Poj 3292(筛法变形)
Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6750 Accepted: 2868DescriptionThis problem is based on an exercise of David Hilbert,原创 2013-08-14 00:27:28 · 973 阅读 · 2 评论 -
zoj Candies
CandiesTime Limit: 1 Second Memory Limit: 32768 KBAs we know, the majority of students in the world-class university like candy and game so much. With some candies, the students are playi原创 2013-09-23 13:57:31 · 1001 阅读 · 0 评论 -
《组合数学》读书笔记
又临近期末了,没什么时间刷题。就忙里偷闲,看了看布鲁迪的《组合数学》,先看了计数部分,图的部分寒假再说吧。学的仓促,理解也比较肤浅,这里先记下各种有用的公式定理和经典的证明方法,以及一点总结归纳。1. 鸽巢原理鸽巢原理的内容就不说了,很简单,但它的应用却有着让人意想不到的功力。几个例子:1. 证明:在序列a1,a2,...,am中存在连续个a,这些a的和能被m整除。如果枚举原创 2013-01-08 22:31:55 · 3652 阅读 · 3 评论 -
uva 11012 - Cosmic Cabbages
Problem ACosmic Cabbages Input: Standard InputOutput: Standard Output CABBAGE, n.A familiar kitchen-garden vegetable aboutas large and wise as a man's head.Ambrose原创 2014-07-16 18:50:33 · 953 阅读 · 1 评论 -
Poj 1759 (二分)
GarlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1184 Accepted: 515DescriptionThe New Year garland consists of N lamps attached to a common wire tha原创 2013-08-10 21:39:11 · 916 阅读 · 1 评论 -
CF 127 div1 A
A. Clear Symmetrytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputConsider some square matrix A with side n原创 2013-07-24 20:14:43 · 1303 阅读 · 0 评论 -
LA 4727 jump(约瑟夫环变形)
Integers 1, 2, 3,..., n are placed on a circle in the increasing order as in the following figure. We want to construct a sequence from these numbers on a circle. Starting with the number 1, we contin原创 2012-12-12 10:02:21 · 1619 阅读 · 0 评论 -
Hoj 1005 利用矩阵计算线性递推式
#include void matrix_mul(int (*a)[2],int (*b)[2]);//a = a * bvoid matrix_matrix(int n,int (*a)[2],int (*b)[2]);int main (){ int a,b,n,fn; int f[2][2],ans[2][2]; while原创 2012-05-16 13:23:58 · 986 阅读 · 0 评论 -
uva 11149(矩阵倍增)
Problem B : Power of MatrixTime limit: 10 secondsConsider an n-by-n matrixA. We define Ak = A *A * ... * A (k times). Here, * denotes the usual matrix multiplication.Yo原创 2013-03-04 19:31:55 · 1509 阅读 · 0 评论 -
uva 11181(条件概率)
Problem GProbability|GivenInput: Standard InputOutput: Standard Output N friends go to the local super market together. The probability of their buying something from the market is respectivel原创 2013-03-05 09:46:35 · 2889 阅读 · 0 评论 -
CF 173(div2) B
B. Painting Eggstime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Bitlandians are quite weird people. They have ve原创 2013-05-16 09:54:23 · 922 阅读 · 0 评论 -
CF 159 div2 d
a[i] 则 若tem-a[n-2] >= 0,则令tem = tem - a[n-2],此时 0 若 tem-a[n-2] ,最后直到a[1] 都满足,解就构造出来了。 #include #include #include #include #include #include #include #include #include #includ原创 2013-06-24 18:26:20 · 848 阅读 · 0 评论 -
CF 191 div2 C
这倒题找出规律不难,关键是有mod运算,还要求等比数列,直接用公式求,存在除法,不行,所以采用二分的方式。#include #include #include #include #include #include #include #include typedef long long LL;using namespace std;const int maxn = 500 +原创 2013-07-17 14:56:53 · 1851 阅读 · 0 评论 -
CF 148 div1 A
A. Not Wool Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA sequence of non-negative integers a1原创 2013-07-24 19:10:55 · 1018 阅读 · 0 评论 -
uva 10570 Meeting with Aliens
Problem DMeeting with AliensInput: Standard InputOutput: Standard OutputTime Limit: 3 Seconds The aliens are in an important meeting just before landing on the earth. All the aliens sit ar原创 2014-08-08 13:33:35 · 1304 阅读 · 5 评论