shengweisong

java大数。代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new Scanner(System.in); BigInteger a, b; BigInteger t = BigI

先算出来2^k*2^k 之后减去1，最后除3即可代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new Scanner(System.in); BigInteger ans,ans1,

这道题有点小坑。。特殊数据输入 0.0 0.0输出 0代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new Scanner(System.in); BigDecimal

现将前1000个的斐波那契数打表，然后再找就好了。代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new Scanner(System.in

rt代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new Scanner(System.in); BigInteger a, b, c, ans, temp1, temp2; wh

先用字符串将字符串接收，然后在用BigInteger就好了代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new Scanner(System.in); while(cin.hasNex

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=524

我自己写了一个gcd TL了，然后调用了math里面的gcd，AC了、、、思路：就是拿n前面的最小公倍数和n求 1~n的最小公倍数代码：import java.util.Scanner;import java.math.*;public class Main{ public static void main(String[] args){ Scanner cin = new