HDU 3709 数位dp
来源:互联网 发布:2016星火英语听力软件 编辑:程序博客网 时间:2024/06/06 03:03
Balanced Number
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Problem Description
A balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indicated by the digit. When a pivot is placed at some digit of the number, the distance from a digit to the pivot is the offset between it and the pivot. Then the torques of left part and right part can be calculated. It is balanced if they are the same. A balanced number must be balanced with the pivot at some of its digits. For example, 4139 is a balanced number with pivot fixed at 3. The torqueses are 4*2 + 1*1 = 9 and 9*1 = 9, for left part and right part, respectively. It's your job
to calculate the number of balanced numbers in a given range [x, y].
to calculate the number of balanced numbers in a given range [x, y].
Input
The input contains multiple test cases. The first line is the total number of cases T (0 < T ≤ 30). For each case, there are two integers separated by a space in a line, x and y. (0 ≤ x ≤ y ≤ 1018).
Output
For each case, print the number of balanced numbers in the range [x, y] in a line.
Sample Input
20 97604 24324
Sample Output
10897
题意:给你一个区间,求区间内所有平衡数。
平衡数是指可以找到一个支点,左边右边的数乘以力矩加起来之和相等。
题解:数位dp,但要注意排除00,000,这样的情况。
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;typedef long long ll;ll dp[20][20][2000];ll digit[20];ll dfs(ll len,ll fixloc,ll sum,bool fp){if(!len){return sum==0?1:0;}if(sum<0)return 0;if(!fp&&dp[len][fixloc][sum]!=-1)return dp[len][fixloc][sum];ll ret=0,i,fpmax=fp?digit[len]:9;for(i=0;i<=fpmax;i++){ret+=dfs(len-1,fixloc,sum+i*(len-fixloc),fp&&i==fpmax);}if(!fp)dp[len][fixloc][sum]=ret;return ret;}ll solve(ll n){if(n==-1)return 0;if(n==0)return 1;ll len=0;while(n){digit[++len]=n%10;n/=10;}ll ret=0,i;for(i=len;i>=1;i--){ret+=dfs(len,i,0,true);}return ret-len+1;//排除00,000这些情况}int main(){memset(dp,-1,sizeof(dp));ll t,x,y;scanf("%lld",&t);while(t--){scanf("%lld%lld",&x,&y);printf("%lld\n",solve(y)-solve(x-1));}return 0;}
0 0
- hdu 3709 数位DP
- hdu 3709 数位DP
- HDU 3709 数位DP
- HDU 3709 数位dp
- HDU 3709 数位DP
- HDU - 3709 数位dp
- HDU-3709-数位dp
- HDU 3709 数位dp
- HDU 3709 数位DP
- hdu 3709+hdu 3555(数位dp)
- HDU 3709 Balanced Number(数位DP)
- hdu--3709--Banlanced-Number--数位DP
- 数位dp HDU 3709 Balanced Number
- hdu 3709 Balanced Number (数位dp)
- HDU 3709 数位dp dfs版
- hdu 3709 Balanced Number(数位dp)
- Balanced Number - HDU 3709 数位dp
- [数位dp] hdu 3709 Balanced Number
- hdoj5805 NanoApe Loves Sequence && hdoj 5806 NanoApe Loves Sequence Ⅱ
- android studio R.java的path
- 2016.8.5 学习总结
- Linux桌面坏境小结
- 跨域访问
- HDU 3709 数位dp
- SGU101 Domino
- 九度OJ 1101 计算表达式
- Gym 100531 GGrave【水题】
- connect by rn = prior cnt + prior rn
- 引用的知识
- L2-008. 最长对称子串-PAT团体程序设计天梯赛GPLT
- BestCoder Round #86 HDU 5804,HDU 5805,HDU 5806,HDU 5807
- 相差超过一个小时的数据