uva 12105 Bigger is Better
来源:互联网 发布:电脑模拟装机软件 编辑:程序博客网 时间:2024/06/05 08:11
dp[cost][x]表示用了cost根火柴,取模后余x的最大数
import java.math.BigInteger;import java.util.Scanner;public class Main {static int n,mod;static int a[]={ 6,2,5,5,4,5,6,3,7,6 };static BigInteger dp[][]=new BigInteger[103][3004] ;public static void main(String args[]){int kase=0;Scanner sc=new Scanner(System.in);while(sc.hasNextInt()){n=sc.nextInt();if(n==0) break;mod=sc.nextInt();for(int i=0;i<=n;i++){for(int j=0;j<mod;j++){dp[i][j]=BigInteger.valueOf(-1);}}for(int i=0;i<10;i++){dp[a[i] ][ i%mod ]=BigInteger.valueOf(i);}for(int v=2;v<=n;v++){for(int i=0;i<10;i++) if(v-a[i]>=0 ){int v2=v-a[i];for(int j=0;j<mod;j++) if(dp[v2][j]!=BigInteger.valueOf(-1)){int tmpV=(j*10+i)%mod;BigInteger ret=dp[v2][j].multiply(BigInteger.valueOf(10)).add(BigInteger.valueOf(i) );dp[ v][tmpV]=dp[v][tmpV].max( ret );}}}BigInteger ans=BigInteger.valueOf(-1);for(int i=2;i<=n;i++) {ans=ans.max(dp[i][0]);}System.out.printf("Case %d: ",++kase);System.out.println(ans);}}}
0 0
- 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
- UVA 12105 Bigger is Better(数位dp)
- 12105 - Bigger is Better
- UVA 12105 Bigger is Better(数位DP)
- UVA 12105 Bigger is Better(数位DP)
- HDU2929:Bigger is Better
- Bigger is Better
- uva12105 Bigger is Better
- 理解“红黑树”
- XP系统缺少msxml4.dll文件,应该放在哪里?
- openstack报错解决一
- Gitosis + repo 搭建安卓源码开发环境
- 文件系统
- uva 12105 Bigger is Better
- 老生常谈-JSR规范
- jquery queue详解
- 【入门篇(二)】ANDROID开发之BUG专讲
- 给家里老台式机装ubuntu15.10的一点杂记
- 使用设计模式优化设计案例<一>
- Unity3D问题之EnhanceScollView选择角色3D循环滚动效果实现
- 聚类经典算法之DBSCAN算法
- CocurrentHashMap和Hashtable的区别