#126667 (C#(csc)) No.438 Cwwプログラミング入門

提出ソース

結果

問題	No.438 Cwwプログラミング入門
ユーザー	りあん
提出日時	2016-10-28 22:51:30
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	9,647 bytes
コンパイル時間	4,304 ms
コンパイル使用メモリ	117,260 KB
実行使用メモリ	28,472 KB
最終ジャッジ日時	2024-11-24 18:28:27
合計ジャッジ時間	14,105 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	24 ms 26,184 KB
testcase_01	AC	25 ms 24,368 KB
testcase_02	AC	24 ms 24,492 KB
testcase_03	AC	23 ms 24,364 KB
testcase_04	AC	24 ms 24,360 KB
testcase_05	AC	24 ms 26,176 KB
testcase_06	AC	24 ms 24,488 KB
testcase_07	AC	23 ms 24,264 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	25 ms 24,232 KB
testcase_13	AC	24 ms 24,492 KB
testcase_14	WA	-
testcase_15	AC	25 ms 22,328 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	23 ms 23,980 KB
testcase_19	AC	23 ms 26,316 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	25 ms 24,488 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	AC	24 ms 26,404 KB
testcase_28	AC	25 ms 26,272 KB
testcase_29	AC	24 ms 24,500 KB
testcase_30	AC	24 ms 24,488 KB
testcase_31	AC	24 ms 24,232 KB
testcase_32	AC	23 ms 23,976 KB
testcase_33	AC	25 ms 24,496 KB
testcase_34	WA	-
testcase_35	AC	23 ms 24,232 KB
testcase_36	AC	24 ms 24,484 KB
testcase_37	AC	24 ms 24,364 KB
testcase_38	AC	24 ms 24,264 KB
testcase_39	AC	24 ms 26,276 KB
testcase_40	AC	24 ms 22,192 KB
testcase_41	AC	24 ms 26,272 KB
testcase_42	AC	24 ms 26,060 KB
testcase_43	AC	24 ms 24,364 KB
testcase_44	AC	23 ms 26,308 KB
testcase_45	AC	22 ms 22,192 KB
testcase_46	AC	24 ms 22,196 KB
testcase_47	AC	24 ms 24,128 KB
testcase_48	WA	-
testcase_49	WA	-
testcase_50	AC	23 ms 24,364 KB
testcase_51	AC	24 ms 24,264 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	AC	25 ms 24,364 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	24 ms 24,484 KB
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	AC	26 ms 26,528 KB
testcase_63	WA	-
testcase_64	WA	-
testcase_65	AC	24 ms 24,516 KB
testcase_66	WA	-
testcase_67	AC	25 ms 26,428 KB
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	AC	25 ms 24,492 KB
testcase_79	AC	25 ms 24,244 KB
testcase_80	AC	24 ms 24,368 KB
testcase_81	AC	25 ms 26,272 KB
testcase_82	AC	24 ms 24,364 KB
testcase_83	AC	24 ms 26,144 KB
testcase_84	AC	24 ms 26,276 KB
testcase_85	AC	23 ms 24,232 KB
testcase_86	AC	23 ms 24,232 KB
testcase_87	AC	25 ms 26,404 KB
testcase_88	AC	24 ms 24,364 KB
testcase_89	AC	24 ms 24,112 KB
testcase_90	AC	24 ms 26,180 KB
testcase_91	AC	25 ms 24,144 KB
testcase_92	AC	24 ms 24,104 KB
testcase_93	AC	23 ms 24,236 KB
testcase_94	AC	24 ms 24,360 KB
testcase_95	WA	-
testcase_96	AC	24 ms 24,364 KB
testcase_97	WA	-
testcase_98	AC	25 ms 26,304 KB
testcase_99	AC	24 ms 24,360 KB
testcase_100	WA	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using System.IO;

using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.BinaryExpression>;
using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>;

class Program
{
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        var sc = new Scan();
        int x, y, z;
        sc.Multi(out x, out y, out z);
        var mt = new mymath();
        if (x == 0 && y == 0 && z == 0)
        {
            sw.WriteLine("c");
            sw.Flush();
            return;
        }
        if (x == 0 && y == 0 || z % mt.gcd(x, y) > 0 || z / Math.Max(x, y) > 10000)
        {
            sw.WriteLine("mourennaihasimasenn");
            sw.Flush();
            return;
        }
        long p, q;
        mt.extgcd(x, y, out p, out q);
        p *= z / mt.gcd(x, y);
        q *= z / mt.gcd(x, y);
        if (Math.Abs(p) * 2 + Math.Abs(q) * 2 - 1 > 10000)
        {
            sw.WriteLine("mourennaihasimasenn");
            sw.Flush();
            return;
        }
        if (p < 0)
        {
            for (int i = 0; i < -p; i++)
            {
                sw.Write('c');
            }
            for (int i = 0; i < q; i++)
            {
                sw.Write('w');
            }
            for (int i = 0; i < q - 1; i++)
            {
                sw.Write('C');
            }
            for (int i = 0; i < -p; i++)
            {
                sw.Write('W');
            }
        }
        else if (q < 0)
        {
            for (int i = 0; i < -q; i++)
            {
                sw.Write('w');
            }
            for (int i = 0; i < p; i++)
            {
                sw.Write('c');
            }
            for (int i = 0; i < p - 1; i++)
            {
                sw.Write('C');
            }
            for (int i = 0; i < -q; i++)
            {
                sw.Write('W');
            }
        }
        else
        {
            for (int i = 0; i < p; i++)
            {
                sw.Write('c');
            }
            for (int i = 0; i < q; i++)
            {
                sw.Write('w');
            }
            for (int i = 0; i < p + q - 1; i++)
            {
                sw.Write('C');
            }
        }
        sw.WriteLine();
        sw.Flush();
    }
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }
    static T Max<T>(params T[] a) => a.Max();
    static T Min<T>(params T[] a) => a.Min();
    static void Prt<T>(params T[] a) => sw.WriteLine(string.Join(" ", a));
    static void Prt(params object[] a) => sw.WriteLine(string.Join(" ", a));
}
static class ex
{
    public static void swap<T>(this IList<T> a, int i, int j) { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a)
    {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}
public static class Operator<T>
{
    static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");
    static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");
    public static readonly Func<T, T, T> Add = Lambda(Expression.Add);
    public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);
    public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);
    public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);
    public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);
    public static readonly Func<T, T> Negate = Lambda(Expression.Negate);
    public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();
    public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();
}

class ScanCHK : Scan
{
    public new string Str { get { var s = Console.ReadLine(); return s == s.Trim() ? s : ""; } }
}
class Scan
{
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => Console.ReadLine().Trim();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split();
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U inp) => (T)Convert.ChangeType(inp, typeof(T));
    T cv<T>(string inp) => eq<T, int>() ? ct<T, int>(int.Parse(inp))
                         : eq<T, long>() ? ct<T, long>(long.Parse(inp))
                         : eq<T, double>() ? ct<T, double>(double.Parse(inp))
                         : eq<T, char>() ? ct<T, char>(inp[0])
                         : ct<T, string>(inp);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
class mymath
{
    long Mod = 1000000007;
    public void setMod(long m) => Mod = m;
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public bool[] sieve(int n)
    {
        var p = new bool[n + 1];
        for (int i = 2; i <= n; i++) p[i] = true;
        for (int i = 2; i * i <= n; i++) if (p[i]) for (int j = i * i; j <= n; j += i) p[j] = false;
        return p;
    }
    public List<int> getprimes(int n)
    {
        var prs = new List<int>();
        var p = sieve(n);
        for (int i = 2; i <= n; i++) if (p[i]) prs.Add(i);
        return prs;
    }
    public long[][] E(int n)
    {
        var ret = new long[n][];
        for (int i = 0; i < n; i++) { ret[i] = new long[n]; ret[i][i] = 1; }
        return ret;
    }
    public long[][] pow(long[][] A, long n)
    {
        if (n == 0) return E(A.Length);
        var t = pow(A, n / 2);
        if ((n & 1) == 0) return mul(t, t);
        return mul(mul(t, t), A);
    }
    public long dot(long[] x, long[] y)
    {
        int n = x.Length;
        long ret = 0;
        for (int i = 0; i < n; i++) ret = (ret + x[i] * y[i]) % Mod;
        return ret;
    }
    public long[][] trans(long[][] A)
    {
        int n = A[0].Length, m = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[m];
            for (int j = 0; j < m; j++) ret[i][j] = A[j][i];
        }
        return ret;
    }
    public long[] mul(long[][] A, long[] x)
    {
        int n = A.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]);
        return ret;
    }
    public long[][] mul(long[][] A, long[][] B)
    {
        int n = A.Length;
        var Bt = trans(B);
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = mul(Bt, A[i]);
        return ret;
    }
    public long[] add(long[] x, long[] y)
    {
        int n = x.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = (x[i] + y[i]) % Mod;
        return ret;
    }
    public long[][] add(long[][] A, long[][] B)
    {
        int n = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = add(A[i], B[i]);
        return ret;
    }
    public long pow(long a, long b)
    {
        if (a >= Mod) return pow(a % Mod, b);
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = pow(a, b / 2);
        if ((b & 1) == 0) return t * t % Mod;
        return t * t % Mod * a % Mod;
    }
    public long inv(long a) => pow(a, Mod - 2);
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long extgcd(long a, long b, out long x, out long y)
    {
        long g = a; x = 1; y = 0;
        if (b != 0)
        {
            g = extgcd(b, a % b, out y, out x);
            y -= (a / b) * x;
        }
        return g;
    }
    public long lcm(long a, long b) => a * (b / gcd(a, b));
    public long comb(int n, int r)
    {
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        int[] numer = new int[r], denom = new int[r];
        for (int k = 0; k < r; k++) { numer[k] = n - r + k + 1; denom[k] = k + 1; }
        for (int p = 2; p <= r; p++)
        {
            int piv = denom[p - 1];
            if (piv > 1)
            {
                int ofst = (n - r) % p;
                for (int k = p - 1; k < r; k += p) { numer[k - ofst] /= piv; denom[k] /= piv; }
            }
        }
        long ret = 1;
        for (int k = 0; k < r; k++) if (numer[k] > 1) ret = ret * numer[k] % Mod;
        return ret;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード