【ZOJ 3962 Seven Segment Display】
来源:互联网 发布:mac应用程序图标大小 编辑:程序博客网 时间:2024/06/08 15:36
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.
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.
AC代码:
#include<cstdio>#include<cstring>#include<vector>#include<algorithm>#include<iostream>using namespace std;typedef long long LL;const LL mod = 0xFFFFFFFF;int numm[16]={6,2,5,5,4,5,6,3,7,6,6,5,4,5,5,4};int sum[16];LL Num2(LL ans,int num,int K){ LL x=0,k=1; for(int i=1;i<=8;i++){ LL t=ans%16; ans/=16; if(K==1&&i<=num) t=15; if(i==num) continue; x = x + t*k; k*=16; } return x;}LL Num3(LL num){ LL ans=num,ans1=0; LL x=1; for(int i=1;i<=8;i++){ LL k = ans%16; ans/=16; if(k) ans1 = ans1+(Num2(num, i,1)+1)*sum[k-1]; ans1 = ans1+(Num2(num, i,0)+1)*numm[k]; if(k!=15) ans1 = ans1+(Num2(num, i,1)+1-x)*(sum[15]-sum[k]); x=x*16; } return ans1;}void slove(){ LL n; LL num; scanf("%lld %llx",&n,&num); LL ans1 = Num3(num); LL tm = (num+n-1)%(mod+1); LL ans2 = Num3( tm ); LL t=0; LL x=num; for(int i=1;i<=8;i++) t+=numm[num%16],num/=16; if(x+n-1>mod){ LL ans3 = Num3(mod); printf("%lld\n",ans3-ans1+ans2+t); } else printf("%lld\n",ans2-ans1+t);}int main(){ sum[0]=numm[0]; for(int i=1;i<=15;i++) sum[i]=sum[i-1]+numm[i]; int T; scanf("%d",&T); while(T--){ slove(); } return 0;}
- ZOJ 3962 Seven Segment Display
- 【ZOJ 3962 Seven Segment Display】
- ZOJ Seven Segment Display
- ZOJ 3962Seven Segment Display (数位DP)
- zoj 3962 Seven Segment Display 数位dp
- zoj 3962 Seven Segment Display(数位dp)
- zoj 3962 Seven Segment Display 数位dp
- ZOJ 3954 Seven-Segment Display
- ZOJ 3954 Seven-Segment Display
- ZOJ 3954 Seven-Segment Display
- ZOJ 3962 Seven Segment Display(数位dp)
- ZOJ 3962 Seven Segment Display(*数位DP 总结)
- ZOJ 3962 Seven Segment Display (数位 DP)
- 浙江省赛E zoj 3962 Seven Segment Display
- ZOJ 3962Seven Segment Display(数位dp)
- ZOJ 3954 Seven-Segment Display(思维)
- ZOJ 3954 Seven-Segment Display (预处理)
- zoj 3954 Seven-Segment Display 思维
- Codeforces 798D 构造
- 第23节:Scala外部命令和正则表达式
- YAML部署实践
- TCP/IP详解--举例明白发送/接收缓冲区、滑动窗口协议之间的关系
- DAY10
- 【ZOJ 3962 Seven Segment Display】
- MYSQL性能查看(命中率,慢查询)
- 从系统中的到的原始日期转换成YYYY-MM-DD
- 前端_css
- Android 新一代多渠道打包神器
- 博弈,三种博弈 巴什博奕,尼姆博奕,威佐夫博弈
- 如何提高自己的工作能力 高效工作方法是绝效
- YDT-Routesim学习(三)
- 求一个有向图G的拓扑序列