hdu java 大数 转载

// hdu 1753 大明A＋B
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class hdu_1753 {
public static void main(String[]args)
{
BigDecimal a,b;
Scanner cin = new Scanner(System. in );
while (cin.hasNextBigDecimal())
{
a = cin.nextBigDecimal();
b = cin.nextBigDecimal();
a = a.add(b);
String str = a.stripTrailingZeros().toPlainString();
System. out .println(str);
}
}
}

// hdu A+B problem 11
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class Main {
public static void main(String[]args)
{
int n;
BigInteger a,b;
Scanner cin = new Scanner(System. in );
while (cin.hasNextInt())
{
n = cin.nextInt();
boolean flag = false ;
for ( int i = 0 ;i < n;i ++ )
{
a = cin.nextBigInteger();
b = cin.nextBigInteger();
if (flag) System. out .println();
flag = true ;
System. out .println( " Case " + (i + 1 ) + " : " );
System. out .println(a + " " + " + " + " " + b + " " + " = " + " " + a.add(b));
}
}
}

}

// hdu 1715 大斐波数
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class hdu_1715 {
public static void main(String[] args)
{
int n;
BigInteger f[] = new BigInteger[ 1005 ];
f[ 1 ] = BigInteger.valueOf( 1 );
f[ 2 ] = BigInteger.valueOf( 1 );
for ( int i = 3 ;i < 1005 ;i ++ )
{
f[i] = f[i - 1 ].add(f[i - 2 ]);
}
Scanner cin = new Scanner(System. in );
while (cin.hasNextInt())
{
n = cin.nextInt();
int p;
for ( int i = 0 ;i < n;i ++ )
{
p = cin.nextInt();
System. out .println(f[p]);
}
}
}
}

// hdu 1316 How Many Fibs?
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class hdu_1316 {
public static void main(String[] args)
{
int maxn = 505 ;
BigInteger []arr = new BigInteger[maxn];
BigInteger a,b;
arr[ 1 ] = BigInteger.valueOf( 1 );
arr[ 2 ] = BigInteger.valueOf( 2 );
for ( int i = 3 ;i < maxn;i ++ )
{
arr[i] = arr[i - 1 ].add(arr[i - 2 ]);
}
Scanner cin = new Scanner(System. in );
while (cin.hasNextBigInteger())
{
a = cin.nextBigInteger();
b = cin.nextBigInteger();
if (a.compareTo(BigInteger.ZERO) == 0 && b.compareTo(BigInteger.ZERO) == 0 ) break ;
int cnt = 0 ;
for ( int i = 1 ;i < maxn;i ++ )
{
if (arr[i].compareTo(b) > 0 ) break ;
if (arr[i].compareTo(a) >= 0 && arr[i].compareTo(b) <= 0 ) cnt ++ ;
}
System. out .println(cnt);
}
}
}

// hdu 1063 Exponentiation
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class hdu_1063 {
public static void main(String[]args)
{
BigDecimal a,res;
int b;
Scanner cin = new Scanner(System. in );
while (cin.hasNextBigDecimal())
{
a = cin.nextBigDecimal();
res = BigDecimal.ONE;
b = cin.nextInt();
for ( int i = 0 ;i < b;i ++ )
{
res = res.multiply(a);
}
String str = res.stripTrailingZeros().toPlainString();
if (str.charAt( 0 ) == ' 0 ' ) System. out .println(str.substring( 1 ));
else System. out .println(str);
}
}
}

// hdu 1047 Integer Inquiry
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class hdu_1047 {
public static void main(String[] args)
{
int n;
BigInteger tmp,res;
boolean flag = false ;
Scanner cin = new Scanner(System. in );
cin.hasNextInt();
n = cin.nextInt();
for ( int i = 0 ;i < n;i ++ )
{
if (flag) System. out .println();
flag = true ;
res = BigInteger.ZERO;
while (cin.hasNextBigInteger())
{
tmp = cin.nextBigInteger();
if (tmp.intValue() == 0 ) break ;
res = res.add(tmp);
}
System. out .println(res);
}
}
}

// hdu 1042 N!
import java.io. * ;
import java.util. * ;
import java.math. * ;

public class hdu_1042 {
public static void main(String[] args)
{
int n;
BigInteger res;
Scanner cin = new Scanner(System. in );
while (cin.hasNextInt())
{
n = cin.nextInt();
res = BigInteger.ONE;
for ( int i = 1 ;i <= n;i ++ )
{
res = res.multiply(BigInteger.valueOf(( long )i));
}
System. out .println(res);
}
}

}

注：提交时要把类名改成Main

转载于:https://www.cnblogs.com/tangcong/archive/2011/05/09/2040819.html