結果

問題 No.532 Possible or Impossible
ユーザー EmKjpEmKjp
提出日時 2019-06-03 23:54:56
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 4,510 bytes
コンパイル時間 1,174 ms
コンパイル使用メモリ 111,924 KB
実行使用メモリ 24,272 KB
最終ジャッジ日時 2023-10-17 23:35:23
合計ジャッジ時間 3,585 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
24,272 KB
testcase_01 AC 26 ms
24,272 KB
testcase_02 AC 26 ms
24,272 KB
testcase_03 AC 26 ms
24,272 KB
testcase_04 AC 26 ms
24,272 KB
testcase_05 AC 26 ms
24,272 KB
testcase_06 AC 26 ms
24,272 KB
testcase_07 AC 26 ms
24,272 KB
testcase_08 AC 25 ms
24,272 KB
testcase_09 AC 26 ms
24,272 KB
testcase_10 AC 26 ms
24,272 KB
testcase_11 AC 25 ms
24,272 KB
testcase_12 AC 25 ms
24,272 KB
testcase_13 AC 26 ms
24,272 KB
testcase_14 AC 26 ms
24,272 KB
testcase_15 AC 26 ms
24,272 KB
testcase_16 AC 26 ms
24,272 KB
testcase_17 AC 26 ms
24,272 KB
testcase_18 AC 26 ms
24,272 KB
testcase_19 AC 26 ms
24,272 KB
testcase_20 AC 25 ms
24,272 KB
testcase_21 AC 26 ms
24,272 KB
testcase_22 AC 26 ms
24,272 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;
using E = System.Linq.Enumerable;


partial class Solver
{
    public void Run()
    {
        var N = ni();
        var M = ni();
        bool ans = false;
        if (N == 1)
        {
            ans = M == 1;
        }
        else if (N == 2)
        {
            // 2 - 1 = 1
            // 2 * 1 = 2
            ans = M >= 1;
        }
        else if (N == 3)
        {
            // 1,2,3
            // 3-2*1 = 1
            // 1+3-2 = 2
            // 3*(2-1) = 3
            ans = true;
        }
        else if (N == 4)
        {
            // 1,2,3,4
            // (1+4)/(2+3) = 1
            // 1+2+3-4 = 2
            // 1+(2*3)-4=3
            // (3*4)/(1+2) = 4
            ans = true;
        }
        else if (N >= 5)
        {
            ans = true;
        }

        cout.WriteLine(ans ? "Possible" : "Impossible");
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    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)
    {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

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

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

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.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 double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        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();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0