結果

問題 No.3043 yukicoderへようこそ!
ユーザー claw88claw88
提出日時 2019-04-01 21:22:02
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,705 bytes
コンパイル時間 1,023 ms
コンパイル使用メモリ 119,888 KB
実行使用メモリ 26,984 KB
最終ジャッジ日時 2024-05-04 20:39:16
合計ジャッジ時間 1,559 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
18,816 KB
testcase_01 WA -
testcase_02 AC 22 ms
18,944 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        try
        {
            var S = ReadLine();
            var t = S.Split();
            var p = Array.ConvertAll(t, int.Parse);
            var k = p.Sum();
            var s = cin.next;
            WriteLine($"{k} {s}");
        }
        catch
        {
            WriteLine("Hello World!");
        }


        //int K = cin.nextint;
        //int N = cin.nextint;
        //var X = cin.scanint;

    }


    long[][] matpow(long[][] m, long a, long Mod)
    {
        if (a == 0)
        {
            int N = m.Length;
            long[][] ret = new long[N][];
            for (int i = 0; i < N; i++)
            {
                ret[i] = new long[N];
                ret[i][i] = 1;
            }
            return ret;
        }
        if (a % 2 == 0)
        {
            long[][] ret = matpow(m, a / 2, Mod);
            return matmul(ret, ret, Mod);
        }
        else
        {
            return matmul(m, matpow(m, a - 1, Mod), Mod);
        }
    }
    long[][] matmul(long[][] ma, long[][] mb, long Mod)
    {
        int p = ma.Length;
        int q = mb[0].Length;
        int r = ma[0].Length;
        long[][] ret = new long[p][];
        for (int i = 0; i < p; i++)
        {
            ret[i] = new long[q];
            for (int j = 0; j < q; j++)
            {
                for (int k = 0; k < r; k++)
                {
                    ret[i][j] += ma[i][k] * mb[k][j] % Mod;
                }
                ret[i][j] %= Mod;
            }
        }
        return ret;
    }
}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0