#110406 (C#(csc)) No.411 昇順昇順ソート

• 問題: No.411 昇順昇順ソート
• ユーザー: 紙ぺーぱー
• 提出日時: 2016-08-12 23:02:46
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 4,697 bytes
• コンパイル時間: 1,056 ms
• コンパイル使用メモリ: 117,056 KB
• 実行使用メモリ: 27,684 KB
• 最終ジャッジ日時: 2024-11-07 15:42:41
• 合計ジャッジ時間: 2,944 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	23 ms; 23,392 KB
testcase_01	AC	21 ms; 21,304 KB
testcase_02	AC	22 ms; 23,520 KB
testcase_03	AC	23 ms; 23,720 KB
testcase_04	AC	23 ms; 25,772 KB
testcase_05	AC	22 ms; 23,524 KB
testcase_06	AC	22 ms; 23,776 KB
testcase_07	AC	23 ms; 21,684 KB
testcase_08	AC	23 ms; 23,396 KB
testcase_09	AC	25 ms; 25,516 KB
testcase_10	AC	24 ms; 25,428 KB
testcase_11	AC	24 ms; 23,656 KB
testcase_12	AC	24 ms; 25,688 KB
testcase_13	AC	24 ms; 25,436 KB
testcase_14	AC	25 ms; 27,684 KB
testcase_15	AC	24 ms; 25,592 KB
testcase_16	AC	24 ms; 23,528 KB
testcase_17	AC	24 ms; 25,816 KB
testcase_18	AC	23 ms; 23,652 KB
testcase_19	AC	23 ms; 23,784 KB
testcase_20	AC	23 ms; 23,268 KB
testcase_21	AC	23 ms; 25,772 KB
testcase_22	AC	23 ms; 23,520 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	23 ms; 23,520 KB
testcase_26	AC	23 ms; 23,592 KB
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	23 ms; 23,712 KB
testcase_30	AC	23 ms; 23,468 KB
testcase_31	AC	24 ms; 23,780 KB
testcase_32	AC	22 ms; 23,516 KB
testcase_33	AC	22 ms; 25,692 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 n = sc.Integer();
            var k = sc.Integer() - 1;
            long ans = 0;
            var cnt = 0;
            for (int i = k + 1; i < n; i++)
                cnt++;
            if (k > 0)
                ans += (1L << cnt);
            else if (cnt > 0) ans += (1L << (cnt - 1));
            IO.Printer.Out.WriteLine(ans);

        }
        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