2017浙江省赛 E - Seven Segment Display ZOJ - 3962

Posted 2020-09-14 weeping

地址：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3962

题目：

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 ≤ 10⁵), indicating the number of test cases. For each test case:

The first and only line contains an integer n (1 ≤ n ≤ 10⁹) 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.

思路：

　　对于第i位x，先算出从x到x+1要k秒，然后设lf=n-k，则这一位从x+1开始进行lf/(16^i-1)次变化，剩下lf%(16^i-1)的时间第i为的数值保持不变。

　　

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 #define MP make_pair
 6 #define PB push_back
 7 #define ll first
 8 #define rr second
 9 typedef long long LL;
10 typedef pair<int,int> PII;
11 const double eps=1e-8;
12 const double pi=acos(-1.0);
13 const int K=1e6+7;
14 const int mod=1e9+7;
15 
16 
17 LL n,num[20],w[]= {6,2,5,5,4,5,6,3,7,6,6,5,4,5,5,4};
18 LL pr[20];
19 char ss[20];
20 
21 int main(void)
22 {
23     std::ios::sync_with_stdio(false);
24     std::cin.tie(0);
25     pr[0]=1;
26     for(int i=1; i<=8; i++)
27         pr[i]=pr[i-1]*16;
28     int t;
29     cin>>t;
30     while(t--)
31     {
32         LL ans=0,sum=0;
33         cin>>n>>(ss+1);
34         for(int i=1; i<=8; i++)
35             if(ss[9-i]<=‘9‘ && ss[9-i]>=‘0‘)
36                 num[i]=ss[9-i]-‘0‘;
37             else
38                 num[i]=ss[9-i]-‘A‘+10;
39         for(int i=1; i<=8; i++)
40         {
41             LL ta,tb,lf;
42             lf=n-pr[i-1]+sum;
43             ta=lf/pr[i-1],tb=lf%pr[i-1];
44             sum+=num[i]*pr[i-1];
45             if(lf<0)
46             {
47                 ans+=n*w[num[i]];
48                 continue;
49             }
50             ans+=(n-lf)*w[num[i]];
51             while(num[i]+1<16 && ta>0)
52                 ans+=w[num[i]+1]*pr[i-1],ta--,num[i]++;
53             if(ta==0)
54             {
55                 ans+=tb*w[(num[i]+1)%16];
56                 continue;
57             }
58             ans+=78*(ta/16)*pr[i-1];
59             int j;
60             for(j=0; j<ta%16; j++)
61                 ans+=w[j]*pr[i-1];
62             ans+=tb*w[j];
63         }
64         cout<<ans<<"\n";
65     }
66     return 0;
67 }

 再贴一份刚改的简短的代码，前面的那个太啰嗦了

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 
 5 #define MP make_pair
 6 #define PB push_back
 7 #define ll first
 8 #define rr second
 9 typedef long long LL;
10 typedef pair<int,int> PII;
11 const double eps=1e-8;
12 const double pi=acos(-1.0);
13 const int K=1e6+7;
14 const int mod=1e9+7;
15 
16 
17 LL n,num[20],w[]= {6,2,5,5,4,5,6,3,7,6,6,5,4,5,5,4};
18 LL pr[20];
19 char ss[20];
20 
21 int main(void)
22 {
23     std::ios::sync_with_stdio(false);
24     std::cin.tie(0);
25     pr[0]=1;
26     for(int i=1; i<=8; i++)
27         pr[i]=pr[i-1]*16;
28     int t;
29     cin>>t;
30     while(t--)
31     {
32         LL ans=0,sum=0;
33         cin>>n>>(ss+1);
34         for(int i=1; i<=8; i++)
35             if(ss[9-i]<=‘9‘ && ss[9-i]>=‘0‘)
36                 num[i]=ss[9-i]-‘0‘;
37             else
38                 num[i]=ss[9-i]-‘A‘+10;
39         for(int i=1; i<=8; i++)
40         {
41             LL lf=n-pr[i-1]+sum;
42             sum+=num[i]*pr[i-1];
43             if(lf<0)
44             {
45                 ans+=n*w[num[i]];
46                 continue;
47             }
48             ans+=(n-lf)*w[num[i]];
49             for(int j=0;j<16;j++)
50                 ans+=pr[i-1]*w[(num[i]+j+1)%16]*(lf/pr[i]+(j+1<=(lf/pr[i-1])%16?1:0));
51             ans+=(lf%pr[i-1])*w[(num[i]+1+lf/pr[i-1])%16];
52         }
53         cout<<ans<<"\n";
54     }
55     return 0;
56 }