結果

問題 No.227 簡単ポーカー
ユーザー EmKjpEmKjp
提出日時 2015-06-19 22:23:48
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 66 ms / 5,000 ms
コード長 3,328 bytes
コンパイル時間 5,626 ms
コンパイル使用メモリ 110,472 KB
実行使用メモリ 24,004 KB
最終ジャッジ日時 2023-09-21 09:54:30
合計ジャッジ時間 3,865 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
21,804 KB
testcase_01 AC 65 ms
21,704 KB
testcase_02 AC 64 ms
21,872 KB
testcase_03 AC 66 ms
21,984 KB
testcase_04 AC 66 ms
21,864 KB
testcase_05 AC 65 ms
21,732 KB
testcase_06 AC 65 ms
21,772 KB
testcase_07 AC 66 ms
19,748 KB
testcase_08 AC 66 ms
21,760 KB
testcase_09 AC 64 ms
19,712 KB
testcase_10 AC 66 ms
21,780 KB
testcase_11 AC 66 ms
21,976 KB
testcase_12 AC 66 ms
24,004 KB
testcase_13 AC 65 ms
21,856 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;

partial class Solver {
    public void Run() {
        var A = ni(5).OrderBy(x => x).ToArray();
        var Hist = A
            .GroupBy(x => x)
            .Select(x => x.Count())
            .OrderBy(x => x)
            .ToArray();
        if (Hist.Count() == 2 && Hist[0] == 2 && Hist[1] == 3)
            cout.WriteLine("FULL HOUSE");
        else if (Hist.Contains(3))
            cout.WriteLine("THREE CARD");
        else if (Hist.Count(x => x == 2) == 2)
            cout.WriteLine("TWO PAIR");
        else if (Hist.Count(x => x == 2) == 1)
            cout.WriteLine("ONE PAIR");
        else
            cout.WriteLine("NO HAND");
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0