google中国编程挑战赛题目FillBaskets

题目:

You have several identical balls that you wish to place in several baskets. Each basket has the same maximum capacity. You are given an int baskets, the number of baskets you have. You are given an int capacity, the maximum capacity of each basket. Finally you are given an int balls, the number of balls to sort into baskets. Return the number of ways you can divide the balls into baskets. If this cannot be done without exceeding the capacity of the baskets, return 0.
Each basket is distinct, but all balls are identical. Thus, if you have two balls to place into two baskets, you could have (0, 2), (1, 1), or (2, 0), so there would be three ways to do this.
Definition

Class:
FillBaskets
Method:
countWays
Parameters:
int, int, int
Returns:
int
Method signature:
int countWays(int baskets, int capacity, int balls)
(be sure your method is public)


Constraints
-
baskets will be between 1 and 5, inclusive.
-
capacity will be between 1 and 20, inclusive.
-
balls will be between 1 and 100, inclusive.
Examples
0)


2
20
2
Returns: 3
The example from the problem statement.
1)


3
20
1
Returns: 3
We have only 1 ball, so we must choose which of the three baskets to place it in.
2)


3
20
2
Returns: 6
We can place both balls in the same basket (3 ways to do this), or one ball in each of two baskets (3 ways to do this).
3)


1
5
10
Returns: 0
We have more balls than our basket can hold.
4)


4
5
10
Returns: 146

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.

源代码:

/**
 *
 * @author greentea
 * Email: greenteanet@gmail.com
 * Copyright: Copyright(c) 2005
 */
public class FillBaskets {
 private static int count = 0;

 public static int countWays(int baskets, int capacity, int balls) {
  count =0;
  if (baskets * capacity < balls)
   return count;

  count(baskets,capacity,balls);
  return count;
 }
 
 public static void count(int baskets, int capacity, int balls){  
  if (balls == 0){
   count++;
  }
  for (int i = 1; i <= baskets; i++) {
   for (int j = 1; j <= balls; j++) {
    if (j <= capacity) {
     count(baskets - i, capacity, balls - j);
    }
   }
  }
 }

 /**
  * @param args
  */
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  System.out.println(countWays(1, 5, 10));
  System.out.println(countWays(4, 5, 10));
  System.out.println(countWays(3, 10, 2));
  System.out.println(countWays(3, 20, 1));
  System.out.println(countWays(2, 20, 2));
 }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值