ZOJ 3962 Seven Segment Display(数位dp)

Seven Segment Display

Time Limit:
2 Seconds     
Memory Limit: 65536 KB

A seven segment display, or seven segment indicator, is a form of electronic display device for displaying decimal numerals that is an alternative to the more complex dot matrix displays. Seven segment displays are widely used in digital clocks,
electronic meters, basic calculators, and other electronic devices that display numerical information.

Edward, a student in Marjar University, is studying the course "Logic and Computer Design Fundamentals" this semester. He bought an eight-digit seven segment display component to make a hexadecimal counter for his course project.

In order to display a hexadecimal number, the seven segment display component needs to consume some electrical energy. The total energy cost for display a hexadecimal number on the component is the sum of the energy cost for displaying each digit
of the number. Edward found the following table on the Internet, which describes the energy cost for display each kind of digit.

4000 Digit Energy Cost (units/s) 0 6 1 2 2 5 3 5 4 4 5 5 6 6 7 3

Digit Energy Cost (units/s) 8 7 9 6 A 6 B 5 C 4 D 5 E 5 F 4

For example, in order to display the hexadecimal number "5A8BEF67" on the component for one second, 5 + 6 + 7 + 5 + 5 + 4 + 6 + 3 = 41 units of energy will be consumed.

Edward's hexadecimal counter works as follows:

The counter will only work for
n seconds. After
n seconds the counter will stop displaying.

At the beginning of the 1st second, the counter will begin to display a previously configured eight-digit hexadecimal number

m.

At the end of the
i-th second (1 ≤
i <
n), the number displayed will be increased by 1. If the number displayed will be larger than the hexadecimal number "FFFFFFFF" after increasing, the counter will set the number to 0 and continue displaying.

Given
n and
m, Edward is interested in the total units of energy consumed by the seven segment display component. Can you help him by working out this problem?

Input

There are multiple test cases. The first line of input contains an integer

T (1 ≤
T ≤ 105), indicating the number of test cases. For each test case:

The first and only line contains an integer
n (1 ≤
n ≤ 109) and a capitalized eight-digit hexadecimal number

m (00000000 ≤
m ≤ FFFFFFFF), their meanings are described above.

We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.

Output

For each test case output one line, indicating the total units of energy consumed by the eight-digit seven segment display component.

Sample Input

3
5 89ABCDEF
3 FFFFFFFF
7 00000000

Sample Output

208
124
327

Hint

For the first test case, the counter will display 5 hexadecimal numbers (89ABCDEF, 89ABCDF0, 89ABCDF1, 89ABCDF2, 89ABCDF3) in 5 seconds. The total units of energy cost is (7 + 6 + 6 + 5 + 4 + 5 + 5 + 4) + (7 + 6 + 6 + 5 + 4 + 5 + 4 + 6) + (7 + 6
+ 6 + 5 + 4 + 5 + 4 + 2) + (7 + 6 + 6 + 5 + 4 + 5 + 4 + 5) + (7 + 6 + 6 + 5 + 4 + 5 + 4 + 5) = 208.

For the second test case, the counter will display 3 hexadecimal numbers (FFFFFFFF, 00000000, 00000001) in 3 seconds. The total units of energy cost is (4 + 4 + 4 + 4 + 4 + 4 + 4 + 4) + (6 + 6 + 6 + 6 + 6 + 6 + 6 + 6) + (6 + 6 + 6 + 6 + 6 + 6 +
6 + 2) = 124.

Author: ZHOU, Jiayu
Source: The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple

数位dp

dp[pos][sum];//sum表示的是当前的层的和，因为是16进制恰好可以用数位dp来做

slove(long long x)

表示0到x的十六进制的符合上述规则的和为多少

#include <stdio.h>
#include <string.h>
#include <math.h>
#define Max 0xffffffff
#include <algorithm>
#define LL long long
using namespace std;
int map[16]={6,2,5,5,4,5,6,3,7,6,6,5,4,5,5,4};
long long dp[20][200];
int a[20];
long long dfs(int pos,int sum,bool limit)
{
if(pos==-1)
{
return sum;
}
if(!limit&&dp[pos][sum]!=-1)
{
return dp[pos][sum];
}

int up=limit?a[pos]:15;
int i;
long long temp=0;
for(i=0;i<=up;i++)
{
temp+=dfs(pos-1,sum+map[i],limit&&i==up);
}
if(!limit)
{
dp[pos][sum]=temp;
}
return temp;
}
long long solve(long long x)
{
int i;
for(i=0;i<8;i++)
{
a[i]=x%16;
x/=16;
}
return dfs(7,0,1);
}
int main(int argc, char *argv[])
{
int t;
memset(dp,-1,sizeof(dp));
scanf("%d",&t);
while(t--)
{
long long l,r,n;
scanf("%lld %llx",&n,&r);
l=r;
r=r+n-1;
if(r>Max)
{
printf("%lld\n",solve(Max)-solve(l-1)+solve(r-Max-1));
}
else
{
printf("%lld\n",solve(r)-solve(l-1));
}

}
return 0;
}