LightOJ 1027 - A Dangerous Maze http://lightoj.com/volume_showproblem.php?problem=1027 概率

LightOJ1027.java

import java.io.BufferedReader;
import java.io.IOError;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class P1027 {

        int gcd(int a, int b) {
		return b > 0 ? gcd(b, a % b) : a;
	}

	public void run() {
		Scanner cin = new Scanner(System.in);
		PrintWriter cout = new PrintWriter(new OutputStreamWriter(System.out));
		int test = cin.nextInt();
		for (int cas = 1; cas <= test; cas++) {
			int n = cin.nextInt();
			int num = 0, sum = 0;
			for (int i = 0; i < n; i++) {
				int x = cin.nextInt();
				if (x < 0) {
					sum += -x;
				} else {
					sum += x;
					num++;
				}
			}
			if (num == 0) {
				System.out.println("Case " + cas + ": inf");
			} else {
				int ansx = sum / gcd(sum, num);
				int ansy = num / gcd(sum, num);
				System.out.println("Case " + cas + ": " + ansx + "/" + ansy);
			}
		}
		cout.flush();
	}

	public static void main(String args[]) {
		new P1027().run();
	}

	class Scanner {

		BufferedReader br;
		StringTokenizer st;

		Scanner(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
			eat("");
		}

		void eat(String s) {
			st = new StringTokenizer(s);
		}

		String nextLine() {
			try {
				return br.readLine();
			} catch (IOException e) {
				throw new IOError(e);
			}
		}

		boolean hasNext() {
			while (!st.hasMoreTokens()) {
				String s = nextLine();
				if (s == null)
					return false;
				eat(s);
			}
			return true;
		}

		String next() {
			hasNext();
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}

}