結果

問題 No.3020 サンシャイン◯崎
ユーザー uwi
提出日時 2017-03-31 22:23:11
言語 Java8
(openjdk 1.8.0.191)
結果
AC  
実行時間 167 ms
コード長 3,326 Byte
コンパイル時間 2,937 ms
使用メモリ 24,412 KB
最終ジャッジ日時 2018-12-04 13:24:48

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
1.txt AC 112 ms
20,916 KB
2.txt AC 90 ms
24,192 KB
3.txt AC 89 ms
24,072 KB
4.txt AC 88 ms
22,584 KB
5.txt AC 86 ms
22,576 KB
6.txt AC 161 ms
23,252 KB
7.txt AC 89 ms
24,200 KB
8.txt AC 92 ms
22,592 KB
9.txt AC 123 ms
24,096 KB
10.txt AC 123 ms
22,812 KB
11.txt AC 126 ms
22,800 KB
12.txt AC 125 ms
24,412 KB
13.txt AC 123 ms
23,852 KB
14.txt AC 126 ms
24,312 KB
15.txt AC 127 ms
22,292 KB
16.txt AC 127 ms
23,628 KB
17.txt AC 122 ms
23,572 KB
18.txt AC 167 ms
23,224 KB
19.txt AC 126 ms
23,480 KB
20.txt AC 125 ms
23,432 KB
テストケース一括ダウンロード

ソースコード

diff #
package contest170331;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		out.print(count(s, 'Y') + " ");
		out.print(count(s, 'E') + " ");
		out.print(count(s, 'A') + " ");
		out.print(count(s, 'H') + " ");
		out.print(count(s, '!'));
		out.println();
	}
	
	int count(char[] s, char c)
	{
		int ct = 0;
		for(char x : s)if(x == c)ct++;
		return ct;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0