SDUT中大数实现的题目，持续更新（JAVA实现）

import java.util.Scanner;
import java.math.*;

public class Main
{

public static void main(String[] args)
{
Scanner ci = new Scanner(System.in);
BigInteger a;
BigInteger b;
while(ci.hasNext())
{
a=ci.nextBigInteger();
b=ci.nextBigInteger();
System.out.println(a.subtract(b));
}
ci.close();
}

}

import java.util.Scanner;
import java.math.*;

public class Main
{
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
while(cin.hasNext())
{
BigInteger a,b;
a=cin.nextBigInteger();
b=cin.nextBigInteger();
System.out.println(a.add(b));

}
cin.close();
}

}

import java.util.Arrays;
import java.util.Scanner;
import java.math.*;

public class Main
{
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
int n,t,cnt,ff;
while(cin.hasNext())
{
n=cin.nextInt();
cnt=0;
ff=-1;
int[] a=new int
;
int[] b=new int
;
for(int i=0;i<n;i++)
{
a[i]=cin.nextInt();
}
Arrays.sort(a);
for(int i=0;i<n;i++)
{
if(a[i]>0)
b[cnt++]=a[i];
}
for(int i=0;i<cnt;i++)
{
if(b[i]!=(i+1))
{
ff=i+1;
break;
}
}
if(ff==-1) ff=cnt+1;
BigInteger sum=BigInteger.valueOf(ff);
System.out.println(sum.pow(5));

}
cin.close();
}

}