hdu 1250 hdu 1130 java水大数
2012-05-25 21:00
218 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1250
http://acm.hdu.edu.cn/showproblem.php?pid=1130
JAVA水 卡特兰数
//import java.io.*; import java.math.*; import java.util.*; public class Main { public static void main(String args[]){ Integer n,i,N = 9001; BigInteger []f = new BigInteger ; f[1] = f[2] = f[3] = f[4] = BigInteger.valueOf(1); for(i = 5; i < N; ++i) f[i] = f[i-1].add(f[i-2]).add(f[i-3]).add(f[i-4]); Scanner cin = new Scanner(System.in); while(cin.hasNext()){ n = cin.nextInt(); System.out.println(f ); //System.out.println(f .toString().length()); } } }
http://acm.hdu.edu.cn/showproblem.php?pid=1130
JAVA水 卡特兰数
import java.io.*; import java.math.*; import java.util.*; public class Main{ public static void main(String []args){ Scanner cin = new Scanner(System.in); int i,N = 101; BigInteger []c = new BigInteger ; c[1] = BigInteger.valueOf(1); for(i = 2; i < N; ++i) c[i] = c[i-1].multiply(BigInteger.valueOf(4 * i - 2)).divide(BigInteger.valueOf(i + 1)); while(cin.hasNext()){ i = cin.nextInt(); System.out.println(c[i]); } } }
相关文章推荐
- hdu 1130 How Many Trees? (java)
- HDU 1250 Hat's Fibonacci(Java大数相加)+讲解
- hdu 1250 java大数练习
- hdu 1250 Hat's Fibonacci(java大数)
- hdu 1250 Hat's Fibonacci (Java大数)
- HDU 1250 Hat's Fibonacci (JAVA大数)
- HDU1130_How Many Trees?(卡特兰数 _java)
- 【HDU】1250 - Hat's Fibonacci(java - BigDecimal)
- 【HDU】1130 - How Many Trees?(java - BigDecimal & 卡特兰大数打表)
- HDU 1250(JAVA版)
- hdu 1250(java大数)
- hdu 1250 Hat's Fibonacci(java,简单,大数)
- hdu1250(Java)大数相加的问题
- HDU 1250 Hat's Fibonacci (Java大数,类似Fib数,有个坑!!)
- HDU 1250 Hat's Fibonacci JAVA大数
- hdu 1130, 1133, 1250
- hdu 1250 字典树+内存释放
- HDU 1250 Hat's Fibonacci
- Hdu 1502 Regular Words (java高精度 + DP)
- hdu 1250 Hat's Fibonacci (大数相加)