uva 12105——Bigger is Better
来源:互联网 发布:linux漏洞公布 编辑:程序博客网 时间:2024/05/29 16:51
题意:给定n个火柴,求能够摆出的最大的数。
思路:递推,dp(i,j)表示i根火柴拼出除以m余数为j的最大的数,然后递推用dp(i,j)*10+k更新dp(i+mp(k),(j*10+K)%m);lrj说大数精度问题,java乱搞搞过。。
code:
import java.util.*;import java.math.BigInteger;public class Main{public static void main(String args[]){Scanner cin=new Scanner(System.in);int mp[]={6, 2, 5, 5, 4, 5, 6, 3, 7, 6};BigInteger dp[][]=new BigInteger[105][3005];int ca=0;while (cin.hasNextInt()){int n=cin.nextInt();if (n==0) break;int m=cin.nextInt();BigInteger ans=BigInteger.valueOf(-1);for (int i=0;i<=n;i++) for (int j=0;j<m;j++)dp[i][j]=BigInteger.valueOf(-1);dp[0][0]=BigInteger.valueOf(0);for (int i=0;i<=n;i++){for (int j=0;j<m;j++){if (dp[i][j].compareTo(BigInteger.valueOf(-1))==0) continue;for (int k=0;k<10;k++){if (i+mp[k]>n) continue;BigInteger b=dp[i][j].multiply(BigInteger.valueOf(10)).add(BigInteger.valueOf(k));if (dp[i+mp[k]][(j*10+k)%m].compareTo(b)==-1)dp[i+mp[k]][(j*10+k)%m]=b;}}if (i>=2&&ans.compareTo(dp[i][0])==-1) ans=dp[i][0];}ca++;System.out.println("Case "+ca+": "+ans);}}}
0 0
- uva 12105——Bigger is Better
- UVa:12105 Bigger is Better
- uva 12105 Bigger is Better
- UVA 12105 Bigger is Better
- Bigger is Better UVA
- Bigger is Better UVA
- UVA 12105 - Bigger is Better(DP+高精度)
- uva 12105 - Bigger is Better(dp)
- UVA - 12105 Bigger is Better(dp)
- Bigger is Better - UVa 12105 dp
- UVA - 12105 Bigger is Better DP
- UVA 12105 Bigger is Better(数位dp)
- 12105 - Bigger is Better
- UVA 12105 Bigger is Better(数位DP)
- UVA 12105 Bigger is Better(数位DP)
- 100道动态规划——19 UVA 12105 Bigger is Better 状态的定义以及转移方程
- UVA—10131 Is Bigger Smarter?
- HDU2929:Bigger is Better
- iOS调试常见错误汇总 如:symbol(s) not found for architecture x86_64
- Delete Node in a Linked List
- 13、Roman to Integer
- MySQL++简介
- Map集合的三种遍历方式
- uva 12105——Bigger is Better
- hdoj 1148 - Mad Counting 【水题(模拟)】【周赛】
- WinForm实现股票实时查询小程序
- scala并发编程第三章习题
- C#中数组、ArrayList和List三者的区别
- 批处理提高工作效率
- Arduino 平台与C语言程序设计-week2-C Programming-Lesson3
- 鸡心炒青椒【经典菜】
- 栈与队列之用java实现队列