結果

問題 No.227 簡単ポーカー
コンテスト
ユーザー threepipes_s
提出日時 2015-06-19 22:33:00
言語 Java
(openjdk 23)
結果
AC  
実行時間 51 ms / 5,000 ms
コード長 3,496 bytes
コンパイル時間 2,525 ms
コンパイル使用メモリ 80,696 KB
実行使用メモリ 36,996 KB
最終ジャッジ日時 2024-07-07 04:06:14
合計ジャッジ時間 3,263 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.TreeMap;

public class Main {
	public static int[] dp;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		MultiSet set = new MultiSet();
		for(int i=0; i<5; i++){
			set.add(in.nextInt());
		}
		int three = 0;
		int two = 0;
		for(int i: set.set.values()){
			if(i==3) three++;
			else if(i==2) two++;
		}
		if(three>0 && two>0){
			System.out.println("FULL HOUSE");
		}else if(three>0){
			System.out.println("THREE CARD");
		}else if(two>1){
			System.out.println("TWO PAIR");
		}else if(two>0){
			System.out.println("ONE PAIR");
		}else{
			System.out.println("NO HAND");
		}
	}
}

class MultiSet{
	HashMap<Integer, Integer> set = new HashMap<Integer, Integer>();
	public MultiSet(){
		
	}
	
	public void add(int val){
		if(set.containsKey(val)){
			set.put(val, set.get(val)+1);
		}else{
			set.put(val, 1);
		}
	}
	
	public int get(int val){
		if(set.containsKey(val)){
			return set.get(val);
		}return 0;
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

class Node{
	int id;
	ArrayList<Node> edge = new ArrayList<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0