Seven Segment DisplayTime 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.
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, JiayuSource: The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple
数位dp，
1 #include
2 #define LL long long
3 using namespace std;
4 int num[16]={6,2,5,5,4,5,6,3,
5 7,6,6,5,4,5,5,4};
6 int dig[20];
7 int t;
8 LL l,r,n;
9 char a[20];
10 LL dp[20][100];//dp[i][j]表示从高位枚举到第i位和为各位的和为sum
11
12 LL dfs(int pos,LL sum,bool limit){//枚举的位数
13 if(pos<0) return sum;
14 if(!limit&&dp[pos][sum]!=-1) return dp[pos][sum];
15 int res=limit?dig[pos]:15;
16 LL tmp=0;
17 for(int i=0;i<=res;i++){
18 tmp+=dfs(pos-1,sum+num[i],limit&&i==dig[pos]);
19 }
20 if(!limit) dp[pos][sum]=tmp;
21 return tmp;
22 }
23 LL judge(LL n){
24 for(int i=0;i<8;i++){
25 dig[i]=n%16;
26 n/=16;
27 }
28 return dfs(7,0,1);
29 }
30 int main(){
31 // freopen("in.txt","r",stdin);
32 memset(dp,-1,sizeof dp);
33 scanf("%d",&t);
34 while(t--){
35 scanf("%lld %llX",&r,&n);
36 r--;
37 l=n;
38 r+=l;
39 if(r>(LL)4294967295){
40 r%=(LL)(4294967296);
41 printf("%lld\n",judge((LL)4294967295)-judge(l-1)+judge(r));
42 }else{
43 printf("%lld\n",judge(r)-judge(l-1));
44 }
45 }
46 return 0;
47 }
1 #include
2 using namespace std;
3
4 #define LL long long
5
6 const LL MAXN = 0xffffffff;
7
8 int cost[16] = {6, 2, 5, 5, 4, 5, 6, 3,
9 7, 6, 6, 5, 4, 5, 5, 4};
10
11 LL n, m;
12 LL dp[10][100];
13 int bit[8];
14
15 LL dfs(int pos, LL sum, bool flag)
16 {
17 if (pos < 0) {
18 return sum;
19 }
20 if (!flag && dp[pos][sum]) {
21 return dp[pos][sum];
22 }
23 int ed = flag ? bit[pos] : 15;
24 LL tmp = 0;
25 int i;
26 for (i = 0; i <= ed; ++i) {
27 tmp += dfs(pos - 1, sum + cost[i], flag && i == bit[pos]);
28 }
29 if (!flag) {
30 dp[pos][sum] = tmp;
31 }
32 return tmp;
33 }
34
35 LL calc(LL x)
36 {
37 int i;
38 for (i = 0; i < 8; ++i) {
39 bit[i] = x % 16;
40 x /= 16;
41 }
42 return dfs(7, 0, 1);
43 }
44
45 void test()
46 {
47 int sum = 0;
48 int i;
49 for (i = 0; i < 16; ++i) {
50 sum += cost[i];
51 }
52 sum *= 8;
53 printf("sum = %d\n", sum);//624
54 }
55
56 int main()
57 {
58 // test();
59
60 int T;
61 LL l, r;
62
63 scanf("%d", &T);
64
65 while (T--) {
66 scanf("%lld%llX", &n, &m);
67 //printf("%lld %llX\n", n, m);
68 l = m;
69 r = m + n - 1;
70 if (r > MAXN) {
71 r -= MAXN + 1;
72 printf("%lld\n", calc(MAXN) - calc(l - 1) + calc(r));
73 } else {
74 printf("%lld\n", calc(r) - calc(l - 1));
75 }
76 //printf("l = %lld, r = %lld\n", l, r);
77 }
78
79 return 0;
80 }
View Code
1 #include
2 using namespace std;
3
4 #define LL long long
5
6 const LL MAXN = 0xffffffff;
7
8 LL cost[16] = {6, 2, 5, 5, 4, 5, 6, 3,
9 7, 6, 6, 5, 4, 5, 5, 4};
10 LL tcost[16];
11
12 LL calc(LL x)
13 {
14 LL sum = 0;
15 int i;
16 LL base = 1;
17 int now;
18 for (i = 0; i < 8; ++i) {
19 now = x % (base << 4) / base;
20 sum += tcost[15] * (x / (base << 4) * base);//进位轮次，0到15
21 sum += tcost[now - 1] * base;//当前位，0到now - 1
22 sum += cost[now] * (x % base + 1);//当前位，now
23 base <<= 4;
24 }
25 return sum;
26 }
27
28 int main()
29 {
30 int i;
31 tcost[0] = cost[0];
32 for (i = 1; i < 16; ++i) {
33 tcost[i] = tcost[i - 1] + cost[i];
34 }
35
36 int T;
37 LL n, m;
38 LL l, r;
39
40 scanf("%d", &T);
41
42 while (T--) {
43 scanf("%lld%llX", &n, &m);
44 //printf("%lld %llX\n", n, m);
45 l = m;
46 r = m + n - 1;
47 if (r > MAXN) {
48 r -= MAXN + 1;
49 printf("%lld\n", calc(MAXN) - calc(l - 1) + calc(r));
50 } else {
51 printf("%lld\n", calc(r) - calc(l - 1));
52 }
53 //printf("l = %lld, r = %lld\n", l, r);
54 }
55
56 return 0;
57 }
View Code
精彩文章
发表评论