Super Jumping! Jumping! Jumping!
Problem Description
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. >>继续阅读
hdu1085
maksyuki 发表于 oj 分类，标签: 组合数学-普通母函数
15
9月
2015
Holding Bin-Laden Captive!
Problem Description
We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China! >>继续阅读
hdu1075
15
9月
2015
What Are You Talking About
Problem Description
Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want >>继续阅读
hdu1042
15
9月
2015
hdu1028
15
9月
2015
Ignatius and the Princess III
Problem Description
"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says.
"The second problem is, given an positive integer N, we define an equation like this >>继续阅读
hdu1025
15
9月
2015
Constructing Roads In JGShining's Kingdom
Problem Description
JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines. >>继续阅读
hdu1023
maksyuki 发表于 oj 分类，标签: 组合数学-Catalan数
15
9月
2015
Train Problem II
Problem Description
As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway. >>继续阅读
hdu1009
15
9月
2015
FatMouse' Trade
Problem Description
FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.
The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans a >>继续阅读
hdu1005
15
9月
2015
Number Sequence
Problem Description
A number sequence is defined as follows:
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n). >>继续阅读
hdu1004
15
9月
2015
Let the Balloon Rise
Problem Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count th >>继续阅读
hdu1003
15
9月
2015
Max Sum
Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), >>继续阅读
TopCoder SRM#667(Div2)(2/3)
maksyuki 发表于 比赛 分类，标签: 比赛-topcoder
14
9月
2015
A Problem Statement
You are given two distinct points A and B in the two-dimensional plane. Your task is to find any point C with the following properties:
C is different from A and B. >>继续阅读
2015ACM-ICPC亚洲区长春网赛(2/13)
maksyuki 发表于 比赛 分类，
14
9月
2015
B Ponds
Problem Description
Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value v. Now Betty wants to remove some ponds becaus >>继续阅读
