有人会用Doppler 测小鼠的 Coronary Flow Reserve 吗？# Biology - 生物学
r*n
1 楼
Problem Statement
You have been given a list of jewelry items that must be split
amongst two people: Frank and Bob. Frank likes very expensive jewelry. Bob
doesn't care how expensive the jewelry is, as long as he gets a lot of
jewelry. Based on these criteria you have devised the following policy:
* 1) Each piece of jewelry given to Frank must be valued greater than or
equal to each piece of jewelry given to Bob. In other words, Frank's least
expensive piece of jewelry must be valued greater than or equal to Bob's
most expensive piece of jewelry.
* 2) The total value of the jewelry given to Frank must exactly equal
the total value of the jewelry given to Bob.
* 3) There can be pieces of jewelry given to neither Bob nor Frank.
* 4) Frank and Bob must each get at least 1 piece of jewelry.
Given the value of each piece, you will determine the number of different
ways you can allocate the jewelry to Bob and Frank following the above
policy. For example:
values = {1,2,5,3,4,5}
Valid allocations are:
Bob Frank
1,2 3
1,3 4
1,4 5 (first 5)
1,4 5 (second 5)
2,3 5 (first 5)
2,3 5 (second 5)
5 (first 5) 5 (second 5)
5 (second 5) 5 (first 5)
1,2,3,4 5,5
Note that each '5' is a different piece of jewelry and needs to be accounted
for separately. There are 9 legal ways of allocating the jewelry to Bob and
Frank given the policy, so your method would return 9.
Definition
Class: Jewelry
Method: howMany
Parameters: int[]
Returns: long
Method signature: long howMany(int[] values)
(be sure your method is public)
Constraints
- values will contain between 2 and 30 elements inclusive.
- Each element of values will be between 1 and 1000 inclusive.
Examples
0)
{1,2,5,3,4,5}
Returns: 9
From above.
1)
{1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000}
Returns: 18252025766940
2)
{1,2,3,4,5}
Returns: 4
Valid allocations:
Bob Frank
1,2 3
2,3 5
1,3 4
1,4 5
3)
{7,7,8,9,10,11,1,2,2,3,4,5,6}
Returns: 607
4)
{123,217,661,678,796,964,54,111,417,526,917,923}
Returns: 0
You have been given a list of jewelry items that must be split
amongst two people: Frank and Bob. Frank likes very expensive jewelry. Bob
doesn't care how expensive the jewelry is, as long as he gets a lot of
jewelry. Based on these criteria you have devised the following policy:
* 1) Each piece of jewelry given to Frank must be valued greater than or
equal to each piece of jewelry given to Bob. In other words, Frank's least
expensive piece of jewelry must be valued greater than or equal to Bob's
most expensive piece of jewelry.
* 2) The total value of the jewelry given to Frank must exactly equal
the total value of the jewelry given to Bob.
* 3) There can be pieces of jewelry given to neither Bob nor Frank.
* 4) Frank and Bob must each get at least 1 piece of jewelry.
Given the value of each piece, you will determine the number of different
ways you can allocate the jewelry to Bob and Frank following the above
policy. For example:
values = {1,2,5,3,4,5}
Valid allocations are:
Bob Frank
1,2 3
1,3 4
1,4 5 (first 5)
1,4 5 (second 5)
2,3 5 (first 5)
2,3 5 (second 5)
5 (first 5) 5 (second 5)
5 (second 5) 5 (first 5)
1,2,3,4 5,5
Note that each '5' is a different piece of jewelry and needs to be accounted
for separately. There are 9 legal ways of allocating the jewelry to Bob and
Frank given the policy, so your method would return 9.
Definition
Class: Jewelry
Method: howMany
Parameters: int[]
Returns: long
Method signature: long howMany(int[] values)
(be sure your method is public)
Constraints
- values will contain between 2 and 30 elements inclusive.
- Each element of values will be between 1 and 1000 inclusive.
Examples
0)
{1,2,5,3,4,5}
Returns: 9
From above.
1)
{1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000,
1000,1000,1000,1000,1000}
Returns: 18252025766940
2)
{1,2,3,4,5}
Returns: 4
Valid allocations:
Bob Frank
1,2 3
2,3 5
1,3 4
1,4 5
3)
{7,7,8,9,10,11,1,2,2,3,4,5,6}
Returns: 607
4)
{123,217,661,678,796,964,54,111,417,526,917,923}
Returns: 0
