|
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6383 Accepted Submission(s): 2456
Problem Description
For a decimal number x with n digits (A
nA
n-1A
n-2 ... A
2A
1), we define its weight as F(x) = A
n * 2
n-1 + A
n-1 * 2
n-2 + ... + A
2 * 2 + A
1 * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclusive, whose weight is no more than F(A).
Input
The first line has a number T (T <= 10000) , indicating the number of test cases.
For each test case, there are two numbers A and B (0 <= A,B < 10 9)
Output
For every case,you should output "Case #t: " at first, without quotes. The
t is the case number starting from 1. Then output the answer.
Sample Input
Sample Output
Source
————————————————————————————————
题目的意思求0到B
有多少个经过计算F(x)不大于F(A)的有几个
思路:数位dp,2位数组表示到第len位为止,小于等于sum有多少个,dfs求解
|
HDU4734 F(x)
最新推荐文章于 2021-01-19 21:31:29 发布