#176853 (C#(csc)) No.524 コインゲーム

• 問題: No.524 コインゲーム
• ユーザー: 紙ぺーぱー
• 提出日時: 2017-06-02 22:30:10
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 24 ms / 1,000 ms
• コード長: 6,618 bytes
• コンパイル時間: 1,945 ms
• コンパイル使用メモリ: 119,772 KB
• 実行使用メモリ: 17,408 KB
• 最終ジャッジ日時: 2024-10-02 10:18:42
• 合計ジャッジ時間: 3,803 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	22 ms; 17,152 KB
testcase_01	AC	22 ms; 16,896 KB
testcase_02	AC	22 ms; 16,896 KB
testcase_03	AC	23 ms; 17,152 KB
testcase_04	AC	22 ms; 17,280 KB
testcase_05	AC	22 ms; 17,280 KB
testcase_06	AC	21 ms; 17,280 KB
testcase_07	AC	22 ms; 17,280 KB
testcase_08	AC	22 ms; 16,896 KB
testcase_09	AC	22 ms; 17,024 KB
testcase_10	AC	23 ms; 17,280 KB
testcase_11	AC	22 ms; 17,024 KB
testcase_12	AC	23 ms; 17,024 KB
testcase_13	AC	22 ms; 17,024 KB
testcase_14	AC	23 ms; 16,896 KB
testcase_15	AC	22 ms; 17,280 KB
testcase_16	AC	22 ms; 17,152 KB
testcase_17	AC	23 ms; 17,280 KB
testcase_18	AC	22 ms; 17,152 KB
testcase_19	AC	23 ms; 17,152 KB
testcase_20	AC	22 ms; 17,280 KB
testcase_21	AC	22 ms; 17,024 KB
testcase_22	AC	22 ms; 17,152 KB
testcase_23	AC	22 ms; 17,152 KB
testcase_24	AC	23 ms; 17,280 KB
testcase_25	AC	23 ms; 17,280 KB
testcase_26	AC	22 ms; 17,280 KB
testcase_27	AC	23 ms; 17,152 KB
testcase_28	AC	22 ms; 17,152 KB
testcase_29	AC	23 ms; 17,408 KB
testcase_30	AC	22 ms; 17,152 KB
testcase_31	AC	22 ms; 17,152 KB
testcase_32	AC	22 ms; 17,280 KB
testcase_33	AC	22 ms; 17,280 KB
testcase_34	AC	24 ms; 17,024 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
using static System.Math;
//using static MathEx;
//using P = System.Collections.Generic.KeyValuePair<int, int>;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = rl;
            if (n >= 100000) n = (100000 + (n - 100000) % 4);
            var ans = 0;
            for (int i = 0; i <= n; i++)
                ans ^= i;
            if (ans == 0) IO.Printer.Out.WriteLine("X");
            else IO.Printer.Out.WriteLine("O");

        }

        //*
        int ri => sc.Integer();
        long rl => sc.Long();
        double rd => sc.Double();
        string rs => sc.Scan();
        char rc => sc.Char();

        [System.Diagnostics.Conditional("DEBUG")]
        void put(params object[] a) => Debug.WriteLine(string.Join(" ", a));

        //*/
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static T[] Enumerate<T>(int n, Func<int, T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f(i);
            return a;
        }
        static void Swap<T>(ref T a, ref T b)
        {
            var tmp = a;
            a = b;
            b = tmp;
        }
    }
}

#region main

static class Ex
{
    public static string AsString(this IEnumerable<char> ie)
    {
        return new string(ie.ToArray());
    }

    public static string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ")
    {
        return string.Join(st, ie);
    }

    public static void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}

#endregion
#region Ex

namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer: StreamWriter
    {
        static Printer()
        {
            Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false };
        }

        public static Printer Out { get; set; }

        public override IFormatProvider FormatProvider
        {
            get { return CultureInfo.InvariantCulture; }
        }

        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true))
        {
        }

        public Printer(Stream stream, Encoding encoding) : base(stream, encoding)
        {
        }

        public void Write<T>(string format, T[] source)
        {
            base.Write(format, source.OfType<object>().ToArray());
        }

        public void WriteLine<T>(string format, T[] source)
        {
            base.WriteLine(format, source.OfType<object>().ToArray());
        }
    }

    public class StreamScanner
    {
        public StreamScanner(Stream stream)
        {
            str = stream;
        }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof;

        public bool IsEndOfStream
        {
            get { return isEof; }
        }

        private byte read()
        {
            if (isEof) return 0;
            if (ptr < len) return buf[ptr++];
            ptr = 0;
            if ((len = str.Read(buf, 0, 1024)) > 0) return buf[ptr++];
            isEof = true;
            return 0;
        }

        public char Char()
        {
            byte b;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }

        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }

        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0;
            byte b;
            var ng = false;
            do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-')
            {
                ng = true;
                b = read();
            }
            for (; ; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                ret = ret * 10 + b - '0';
            }
        }

        public int Integer()
        {
            return (isEof) ? int.MinValue : (int)Long();
        }

        public double Double()
        {
            var s = Scan();
            return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN;
        }

        static T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n)
        {
            return enumerate(n, Char);
        }

        public string[] Scan(int n)
        {
            return enumerate(n, Scan);
        }

        public double[] Double(int n)
        {
            return enumerate(n, Double);
        }

        public int[] Integer(int n)
        {
            return enumerate(n, Integer);
        }

        public long[] Long(int n)
        {
            return enumerate(n, Long);
        }
    }
}

#endregion
#region ModInt
public struct ModInt
{
    public const long Mod = (long)1e9 + 7;
    public long num;
    public ModInt(long n) { num = n; }
    public override string ToString() { return num.ToString(); }
    public static ModInt operator +(ModInt l, ModInt r) { l.num += r.num; if (l.num >= Mod) l.num -= Mod; return l; }
    public static ModInt operator -(ModInt l, ModInt r) { l.num -= r.num; if (l.num < 0) l.num += Mod; return l; }
    public static ModInt operator *(ModInt l, ModInt r) { return new ModInt(l.num * r.num % Mod); }
    public static implicit operator ModInt(long n) { return new ModInt(n); }
    public static ModInt Pow(ModInt v, long k)
    {
        k %= Mod - 1;
        ModInt ret = 1;
        var n = k;
        for (; n > 0; n >>= 1, v *= v)
            if ((n & 1) == 1) ret = ret * v;
        return ret;
    }
    public static ModInt Inverse(ModInt v)
    {
        return Pow(v, Mod - 2);
    }
}
#endregion