摘要: Language:ZipperTime Limit:1000MSMemory Limit:65536KTotal Submissions:12609Accepted:4399Description Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay 阅读全文
posted @ 2012-05-12 13:49 Felix_F 阅读(214) 评论(0) 推荐(1) 编辑
摘要: OverflowWrite a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be represented as a ``normal'' signed integer (typeinteger if you are working Pascal, type int if you are worki 阅读全文
posted @ 2012-05-12 13:34 Felix_F 阅读(171) 评论(0) 推荐(0) 编辑
摘要: 这里主要是归纳了一些他人博客上的对于JAVA大数处理的一些方法.主要是BigInteger类的应用转载虽然要注明出处...但是我已经找不到地址了...见谅Ⅰ基本函数:1.valueOf(parament); 将参数转换为制定的类型比如 int a=3; BigInteger b=BigInteger.valueOf(a);则b=3;String s=”12345”; BigInteger c=BigInteger.valueOf(s); 则c=12345;2.add(); 大整数相加 BigInteger a=new BigInteger(“23”); BigInteger b=new Big 阅读全文
posted @ 2012-05-12 13:27 Felix_F 阅读(3235) 评论(0) 推荐(0) 编辑