URAL 1036. Lucky Tickets(dp+大数)

最新推荐文章于 2019-01-26 11:58:00 发布

画船听雨

最新推荐文章于 2019-01-26 11:58:00 发布

阅读量1k

点赞数

分类专栏： dp URAL

本文链接：https://blog.csdn.net/fulongxu/article/details/27081733

版权

dp 同时被 2 个专栏收录

126 篇文章 2 订阅

订阅专栏

URAL

18 篇文章 0 订阅

订阅专栏

题目很水，就是得用到大数，用Java过的啊、、

就是给你n，s。判断前面n个数和后面n个数的和为s/2的情况有多少种。注意s为奇数输出0.

1036. Lucky Tickets

Time limit: 2.0 second
Memory limit: 64 MB

You are given a number 1 ≤ N ≤ 50. Every ticket has its 2 N-digit number. We call a ticket lucky, if the sum of its first N digits is equal to the sum of its last N digits. You are also given the sum of ALL digits in the number. Your task is to count an amount of lucky numbers, having the specified sum of ALL digits.

Input

Two space-separated numbers: N and S. Here S is the sum of all digits. Assume that 0 ≤ S ≤ 1000.

Output

The amount of lucky tickets.

Sample

input	output
2 2	4

Hint

The tickets are 0101, 0110, 1001, 1010 in the example above

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
	public static void main(String agrs[]) {
		Scanner cin = new Scanner(System.in);
		BigInteger dp[][] = new BigInteger[101][1001];
		int i, j, k;
		for (i = 0; i <= 100; i++) {
			for (j = 0; j <= 1000; j++)
				dp[i][j] = BigInteger.valueOf(0);
		}
		dp[0][0] = BigInteger.valueOf(1);
		for (i = 1; i <= 51; i++) {
			for (j = 0; j <= i * 10; j++) {
				for (k = 0; k <= 9; k++) {
					if (dp[i - 1][j].compareTo(BigInteger.valueOf(0)) != 0) {
						dp[i][j + k] = dp[i][j + k].add(dp[i - 1][j]);
					}
				}
			}
		}
		int n, s;
		while (cin.hasNext()) {
			n = cin.nextInt();
			s = cin.nextInt();
			if (s % 2 == 1)
				System.out.println("0");
			else
				System.out.println(dp[n][s / 2].multiply(dp[n][s / 2]));
		}
	}
}