poj1014

maksyuki 发表于 oj 分类,标签:
0

Dividing

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value. Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.

Input

Each line in the input file describes one collection of marbles to be divided. The lines contain six non-negative integers n1 , . . . , n6 , where ni is the number of marbles of value i. So, the example from above would be described by the input-line "1 0 1 2 0 0". The maximum total number of marbles will be 20000.
The last line of the input file will be "0 0 0 0 0 0"; do not process this line.

Output

For each collection, output "Collection #k:", where k is the number of the test case, and then either "Can be divided." or "Can't be divided.".
Output a blank line after each test case.

Sample Input

1 0 1 2 0 0
1 0 0 0 1 1
0 0 0 0 0 0

Sample Output

Collection #1:

Can't be divided.

Collection #2:

Can be divided.

Source

Mid-Central European Regional Contest 1999

 

题目类型:多重背包

算法分析:使用dp[i]表示恰好组成体积i时所具有的最大价值,递推方程为dp[i] = max (dp[i], dp[i-w[i]] + w[i]),初始化为dp[0] = 0,其他都为-1,最后判断dp[v] == v是否成立即可

 

2015ACM-ICPC亚洲区北京站网赛(1/10)

maksyuki 发表于 比赛 分类,
0

H 描述

This is the logo of PKUACM 2016. More specifically, the logo is generated as follows:

  1. Put four points A0(0,0), B0(0,1), C0(1,1), D0(1,0) on a cartesian coordinate system.
  2. Link A0B0, B0C0, C0D0, D0A0separately, forming square A0B0C0D0.
  3. Assume we have already generated square AiBiCiDi, then square Ai+1Bi+1Ci+1Di+1is generated by linking the midpoints of AiBi, BiCi, CiDiand DiAisuccessively.
  4. Repeat step three 1000 times.

Now the designer decides to add a vertical line x=k to this logo( 0<= k < 0.5, and for k, there will be at most 8 digits after the decimal point). He wants to know the number of common points between the new line and the original logo.

输入

In the first line there’s an integer T( T < 10,000), indicating the number of test cases.

Then T lines follow, each describing a test case. Each line contains an float number k, meaning that you should calculate the number of common points between line x = k and the logo.

输出

For each test case, print a line containing one integer indicating the answer. If there are infinity common points, print -1.

样例输入

3

0.375

0.001

0.478

样例输出

-1

4

20

 

题目类型:二分查找

算法分析:由题目可知内部的每个小正方形都可以看作是相对较大的正方形二分边得来的,此时可以对于每个输入的坐标在[0,0. 5)二分坐标值

 

BestCoder Round #56(Div.2) (0/4) (Div.1) (0/4)

maksyuki 发表于 比赛 分类,标签:
0