#108881 (C#(csc)) No.405 ローマ数字の腕時計

• 問題: No.405 ローマ数字の腕時計
• ユーザー: 紙ぺーぱー
• 提出日時: 2016-08-05 23:52:51
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 23 ms / 2,000 ms
• コード長: 7,775 bytes
• コンパイル時間: 2,228 ms
• コンパイル使用メモリ: 116,128 KB
• 実行使用メモリ: 17,664 KB
• 最終ジャッジ日時: 2024-07-06 19:01:01
• 合計ジャッジ時間: 3,388 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	22 ms; 17,152 KB
testcase_01	AC	21 ms; 17,408 KB
testcase_02	AC	21 ms; 17,536 KB
testcase_03	AC	22 ms; 17,536 KB
testcase_04	AC	21 ms; 17,408 KB
testcase_05	AC	23 ms; 17,408 KB
testcase_06	AC	23 ms; 17,408 KB
testcase_07	AC	21 ms; 17,280 KB
testcase_08	AC	23 ms; 17,408 KB
testcase_09	AC	22 ms; 17,280 KB
testcase_10	AC	22 ms; 17,280 KB
testcase_11	AC	22 ms; 17,664 KB
testcase_12	AC	21 ms; 17,280 KB
testcase_13	AC	21 ms; 17,536 KB
testcase_14	AC	20 ms; 17,536 KB
testcase_15	AC	20 ms; 17,408 KB
testcase_16	AC	20 ms; 17,408 KB
testcase_17	AC	21 ms; 17,536 KB
testcase_18	AC	21 ms; 17,408 KB
testcase_19	AC	22 ms; 17,408 KB
testcase_20	AC	22 ms; 17,408 KB
testcase_21	AC	22 ms; 17,280 KB
testcase_22	AC	20 ms; 17,152 KB
testcase_23	AC	22 ms; 17,408 KB
testcase_24	AC	22 ms; 17,408 KB
testcase_25	AC	22 ms; 17,664 KB
testcase_26	AC	21 ms; 17,536 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.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var s = sc.Scan();
            var str = new string[] { "XII", "I", "II", "III", "IIII", "V", "VI", "VII", "VIII", "IX", "X", "XI", };
            var x = sc.Integer();
            var p = -1;
            for (int i = 0; i < 12; i++)
                if (s == str[i]) p = i;
            p = (p + 12 * 114514 + x) % 12;
            IO.Printer.Out.WriteLine(str[p]);

        }
        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 public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }


    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public 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(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.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 = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; 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 = 0; 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 (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else 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; }
        private 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 LazyRangeAddAndStarry
public class LazyRangeAddAndStarryTree
{
    int n;
    Pair<long, int>[] min;
    long[] lazy;
    public LazyRangeAddAndStarryTree(int size)
    {
        n = 1;
        while (n < size)
            n <<= 1;
        lazy = new long[n << 1];
        min = new Pair<long, int>[n << 1];
        for (int i = 0; i < size; i++)
            min[i + n].y = -i;
        for (int i = n - 1; i >= 0; i--)
            min[i] = Pair.Min(min[i * 2], min[i * 2 + 1]);

    }
    private void lazyEval(int k, int a, int b)
    {
        if (lazy[k] == 0)
            return;
        Add(a, (a + b) >> 1, lazy[k], k << 1, a, (a + b) >> 1);
        Add((a + b) >> 1, b, lazy[k], (k << 1) + 1, (a + b) >> 1, b);
        lazy[k] = 0;
    }
    private void eval(int k)
    {
        int l = k << 1, r = (k << 1) + 1;
        min[k] = Pair.Min(min[l], min[r]);
    }
    public void Add(int a, int b, long v)
    {
        Add(a, b, v, 1, 0, n);
    }
    private void Add(int a, int b, long v, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return;
        else if (a <= l && r <= b)
        {
            lazy[k] += v;
            min[k].x += v;
        }
        else
        {
            lazyEval(k, l, r);
            Add(a, b, v, k << 1, l, (l + r) >> 1);
            Add(a, b, v, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
        }
    }
    readonly Pair<long, int> max = new Pair<Number, int>(1000000000000000000, 0);
    public Pair<long, int> Min(int a, int b) { return Min(a, b, 1, 0, n); }
    private Pair<long, int> Min(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return max;
        if (a <= l && r <= b)
            return min[k];
        else
        {
            lazyEval(k, l, r);
            var vl = Min(a, b, k << 1, l, (l + r) >> 1);
            var vr = Min(a, b, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
            return Pair.Min(vl, vr);
        }
    }
    //*/
}
#endregion
#region Compair
static public class Pair
{
    static public Pair<FT, ST> Create<FT, ST>(FT f, ST s)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return new Pair<FT, ST>(f, s); }
    static public Pair<FT, ST> Min<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return (p.CompareTo(q) <= 0) ? p : q; }
    static public Pair<FT, ST> Max<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return (p.CompareTo(q) >= 0) ? p : q; }
}
public struct Pair<FT, ST>: IComparable<Pair<FT, ST>>
    where FT : IComparable<FT>
    where ST : IComparable<ST>
{
    public FT x;
    public ST y;
    public Pair(FT f, ST s) : this() { x = f; y = s; }

    public int CompareTo(Pair<FT, ST> other)
    {
        var cmp = x.CompareTo(other.x);
        return cmp != 0 ? cmp : y.CompareTo(other.y);
    }
    public override string ToString() { return string.Format("{0} {1}", x, y); }
}
#endregion