2014 Multi-University Training Contest 2（标程+数据）

import java.io.*; import java.util.*; import java.math.BigInteger; public class Intersection { public static void main(String[] arg) { Scanner reader=new Scanner(System.in); while (reader.hasNextInt()) { int n = reader.nextInt(); int d = reader.nextInt(); BigInteger p, q; p = BigInteger.valueOf((d * d - d) / 2).multiply(BigInteger.valueOf(n + 4).pow(2)); q = BigInteger.valueOf(9).multiply(BigInteger.valueOf(n).pow(d)); BigInteger a, b, t, z; z = BigInteger.valueOf(0); a = p; b = q; while (b.compareTo(z) != 0) { t = a.remainder(b); a = b; b = t; } p = p.divide(a); q = q.divide(a); if (q.compareTo(BigInteger.valueOf(1)) == 0) System.out.println(p.toString()); else { System.out.print(p.toString()); System.out.print("/"); System.out.println(q.toString()); } } } }