結果

問題 No.438 Cwwプログラミング入門
ユーザー りあん
提出日時 2016-10-28 23:43:19
言語 C#
(csc 3.100.19.26603)
結果
AC  
実行時間 210 ms
コード長 11,058 Byte
コンパイル時間 4,260 ms
使用メモリ 20,384 KB
最終ジャッジ日時 2019-10-12 14:17:49

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_sample_1.txt AC 33 ms
14,252 KB
0_sample_2.txt AC 31 ms
16,296 KB
0_sample_3.txt AC 30 ms
14,252 KB
1_smalllarge01.txt AC 31 ms
16,280 KB
1_smalllarge02.txt AC 90 ms
16,276 KB
1_smalllarge03.txt AC 81 ms
18,332 KB
1_smalllarge04.txt AC 31 ms
16,284 KB
1_smalllarge05.txt AC 32 ms
18,332 KB
1_smallmiddle01.txt AC 32 ms
16,288 KB
1_smallmiddle02.txt AC 32 ms
16,276 KB
1_smallmiddle03.txt AC 32 ms
16,292 KB
1_smallmiddle04.txt AC 32 ms
16,288 KB
1_smallmiddle05.txt AC 32 ms
18,328 KB
1_smallmiddle06.txt AC 31 ms
14,244 KB
1_smallmiddle07.txt AC 32 ms
16,296 KB
1_smallmiddle08.txt AC 31 ms
16,288 KB
1_smallmiddle09.txt AC 31 ms
16,288 KB
1_smallmiddle10.txt AC 31 ms
16,276 KB
1_smallmiddle11.txt AC 31 ms
16,272 KB
1_smallmiddle12.txt AC 31 ms
14,244 KB
1_smallmiddle13.txt AC 31 ms
16,300 KB
1_smallmiddle14.txt AC 33 ms
16,280 KB
1_smallmiddle15.txt AC 32 ms
12,200 KB
1_smallmiddle16.txt AC 33 ms
16,284 KB
1_smallmiddle17.txt AC 31 ms
16,292 KB
1_smallmiddle18.txt AC 31 ms
16,280 KB
1_smallmiddle19.txt AC 32 ms
16,300 KB
1_smallmiddle20.txt AC 31 ms
16,276 KB
1_smallsmall01.txt AC 31 ms
14,248 KB
1_smallsmall02.txt AC 32 ms
18,332 KB
1_smallsmall03.txt AC 32 ms
16,280 KB
1_smallsmall04.txt AC 31 ms
14,252 KB
1_smallsmall05.txt AC 31 ms
16,272 KB
1_smallsmall06.txt AC 31 ms
18,336 KB
1_smallsmall07.txt AC 31 ms
16,288 KB
1_smallsmall08.txt AC 31 ms
16,296 KB
1_smallsmall09.txt AC 31 ms
16,284 KB
1_smallsmall10.txt AC 31 ms
16,292 KB
1_smallsmall11.txt AC 31 ms
14,256 KB
1_smallsmall12.txt AC 32 ms
14,256 KB
1_smallsmall13.txt AC 31 ms
14,252 KB
1_smallsmall14.txt AC 32 ms
16,296 KB
1_smallsmall15.txt AC 31 ms
16,284 KB
1_smallsmall16.txt AC 31 ms
16,268 KB
1_smallsmall17.txt AC 32 ms
18,332 KB
1_smallsmall18.txt AC 33 ms
18,336 KB
1_smallsmall19.txt AC 32 ms
18,340 KB
1_smallsmall20.txt AC 32 ms
18,340 KB
2_middlemiddle01.txt AC 30 ms
12,220 KB
2_middlemiddle02.txt AC 31 ms
16,288 KB
2_middlemiddle03.txt AC 31 ms
16,276 KB
2_middlemiddle04.txt AC 30 ms
12,212 KB
2_middlemiddle05.txt AC 31 ms
16,280 KB
2_middlemiddle06.txt AC 31 ms
14,236 KB
2_middlemiddle07.txt AC 31 ms
16,284 KB
2_middlemiddle08.txt AC 31 ms
14,236 KB
2_middlemiddle09.txt AC 32 ms
16,280 KB
2_middlemiddle10.txt AC 31 ms
14,248 KB
2_middlemiddle11.txt AC 32 ms
16,288 KB
2_middlemiddle12.txt AC 33 ms
16,276 KB
2_middlemiddle13.txt AC 31 ms
16,292 KB
2_middlemiddle14.txt AC 35 ms
20,384 KB
2_middlemiddle15.txt AC 31 ms
14,240 KB
2_middlemiddle16.txt AC 31 ms
16,296 KB
2_middlemiddle17.txt AC 33 ms
18,336 KB
2_middlemiddle18.txt AC 31 ms
16,288 KB
2_middlemiddle19.txt AC 31 ms
16,280 KB
2_middlemiddle20.txt AC 31 ms
16,284 KB
3_large01.txt AC 32 ms
16,280 KB
3_large02.txt AC 42 ms
16,288 KB
3_large03.txt AC 35 ms
12,224 KB
3_large04.txt AC 32 ms
14,260 KB
3_large05.txt AC 75 ms
16,280 KB
3_large06.txt AC 32 ms
14,252 KB
3_large07.txt AC 189 ms
16,288 KB
3_large08.txt AC 100 ms
16,292 KB
3_large09.txt AC 31 ms
14,244 KB
3_large10.txt AC 31 ms
16,288 KB
3_large11.txt AC 210 ms
16,292 KB
3_large12.txt AC 31 ms
14,252 KB
3_large13.txt AC 169 ms
14,252 KB
3_large14.txt AC 31 ms
16,292 KB
3_large15.txt AC 42 ms
16,280 KB
3_large16.txt AC 95 ms
16,292 KB
3_large17.txt AC 32 ms
16,292 KB
3_large18.txt AC 32 ms
16,292 KB
3_large19.txt AC 144 ms
14,252 KB
3_large20.txt AC 83 ms
16,272 KB
4_hand_1.txt AC 33 ms
18,332 KB
4_hand_2.txt AC 32 ms
16,292 KB
4_hand_3.txt AC 32 ms
18,328 KB
4_hand_4.txt AC 32 ms
18,332 KB
4_hand_5.txt AC 32 ms
18,320 KB
4_hand_6.txt AC 31 ms
12,208 KB
4_hand_7.txt AC 32 ms
16,288 KB
4_hand_8.txt AC 32 ms
16,296 KB
4_hand_9.txt AC 32 ms
16,284 KB
4_hand_10.txt AC 31 ms
14,240 KB
system_test1.txt AC 31 ms
14,252 KB
system_test2.txt AC 55 ms
16,292 KB
system_test3.txt AC 33 ms
16,296 KB
テストケース一括ダウンロード
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.100.19.26603 (9d80dea7)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
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 == z)
        {
            sw.WriteLine("c");
            sw.Flush();
            return;
        }
        if (y == z)
        {
            sw.WriteLine("w");
            sw.Flush();
            return;
        }
        if (z == 0)
        {
            sw.WriteLine("ccW");
            sw.Flush();
            return;
        }
        if (x == 0 && y == 0 || z % mt.gcd(x, y) > 0)
        {
            sw.WriteLine("mourennaihasimasenn");
            sw.Flush();
            return;
        }
        int g = (int)mt.gcd(x, y);
        x /= g;
        y /= g;
        z /= g;
        long p, q;
        mt.extgcd(x, y, out p, out q);
            p *= z;
            q *= z;
            while (true)
            {
                if (Math.Abs(p + y) + Math.Abs(q - x) < Math.Abs(p) + Math.Abs(q))
                {
                    p += y;
                    q -= x;
                }
                else break;
            }
            while (true)
            {
                if (Math.Abs(p - y) + Math.Abs(q + x) < Math.Abs(p) + Math.Abs(q))
                {
                    p -= y;
                    q += x;
                }
                else break;
            }
        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 < q; i++)
            {
                sw.Write('w');
            }
            for (int i = 0; i < q - 1; i++)
            {
                sw.Write('C');
            }
        }
        else if (q == 0)
        {
            for (int i = 0; i < p; i++)
            {
                sw.Write('c');
            }
            for (int i = 0; i < p - 1; i++)
            {
                sw.Write('C');
            }
        }
        else 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 DBG<T>(params T[] a) => Console.WriteLine(string.Join(" ", a));
    static void DBG(params object[] a) => Console.WriteLine(string.Join(" ", a));
    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;
    }
}
0