UVa12700 - Banglawash(杂题)

最新推荐文章于 2021-04-21 00:37:16 发布

原创最新推荐文章于 2021-04-21 00:37:16 发布 · 559 阅读

0 ·

CC 4.0 BY-SA版权

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文提供了一个Java程序的模板，该程序使用了多种输入输出处理方式，如FileInputStream、BufferedReader、PrintWriter等，适用于程序设计竞赛场景。文章通过一个具体的例子展示了如何读取文件或标准输入，并进行字符串解析与处理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import java.io.FileInputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.OutputStreamWriter;
import java.io.StreamTokenizer;

public class Main {
	private static final boolean DEBUG = false;
	private BufferedReader cin;
	private PrintWriter cout;
	private StreamTokenizer tokenizer;
	private int n;
	private String s;
	
	public void init() 
	{
		try {
			if (DEBUG) {
				cin = new BufferedReader(new InputStreamReader(
						new FileInputStream("e:\\uva_in.txt")));
			} else {
				cin = new BufferedReader(new InputStreamReader(System.in));
			}

			tokenizer = new StreamTokenizer(cin);
			
			cout = new PrintWriter(new OutputStreamWriter(System.out));
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	private String next() 
	{
		try {
			 tokenizer.nextToken(); 
			 if (tokenizer.ttype == StreamTokenizer.TT_EOF) return null; 
			 else if (tokenizer.ttype == StreamTokenizer.TT_NUMBER) { 
			 	return String.valueOf((int)tokenizer.nval); 
			} else return tokenizer.sval;
		} catch (Exception e) {
			e.printStackTrace();
			return null;
		}
	}

	public boolean input() 
	{
		n = Integer.parseInt(next());
		s = next();
		return true;
	}
	
	public void solve(int cas) 
	{
		int[] cnt = new int[4];

		for (int i = 0, size = s.length(); i < size; i++) {
			char ch = s.charAt(i);
			if (ch == 'B') cnt[0]++;
			else if (ch == 'W') cnt[1]++;
			else if (ch == 'T') cnt[2]++;
			else if (ch == 'A') cnt[3]++;
		}
		
		//if (cas != 1) cout.print(" ");
		cout.print("Case " + cas + ": ");
		if (cnt[0] != 0 && cnt[0] + cnt[3] == n) cout.println("BANGLAWASH");
		else if (cnt[1] != 0 && cnt[1] + cnt[3] == n) cout.println("WHITEWASH");
		else if (cnt[3] == n) cout.println("ABANDONED");
		else if (cnt[0] > cnt[1]) cout.println("BANGLADESH " + cnt[0] + " - " + cnt[1]);
		else if (cnt[0] < cnt[1]) cout.println("WWW " + cnt[1] + " - " + cnt[0]);
		else  cout.println("DRAW " + cnt[0] + " " + cnt[2]);

		cout.flush();	
	}

	
	public static void main(String[] args) 
	{
		Main solver = new Main();
		solver.init();

		int t = Integer.parseInt(solver.next());
		for (int i = 1; i <= t; i++) {
			solver.input();
			solver.solve(i);
		}
	}
}