#510425 (C#(csc)) No.339 何人が回答したのか

提出ソース

結果

問題	No.339 何人が回答したのか
ユーザー	eSeF
提出日時	2020-07-11 01:38:52
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	24 ms / 1,000 ms
コード長	7,547 bytes
コンパイル時間	1,028 ms
コンパイル使用メモリ	121,256 KB
実行使用メモリ	27,244 KB
最終ジャッジ日時	2024-04-20 03:49:44
合計ジャッジ時間	3,794 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	22 ms 22,896 KB
testcase_01	AC	23 ms 24,044 KB
testcase_02	AC	22 ms 27,116 KB
testcase_03	AC	21 ms 25,064 KB
testcase_04	AC	21 ms 25,080 KB
testcase_05	AC	19 ms 24,148 KB
testcase_06	AC	21 ms 26,076 KB
testcase_07	AC	21 ms 25,076 KB
testcase_08	AC	21 ms 25,816 KB
testcase_09	AC	21 ms 24,820 KB
testcase_10	AC	21 ms 26,996 KB
testcase_11	AC	21 ms 26,072 KB
testcase_12	AC	21 ms 24,952 KB
testcase_13	AC	22 ms 24,684 KB
testcase_14	AC	21 ms 26,992 KB
testcase_15	AC	21 ms 26,860 KB
testcase_16	AC	23 ms 27,244 KB
testcase_17	AC	22 ms 25,152 KB
testcase_18	AC	21 ms 23,892 KB
testcase_19	AC	24 ms 24,016 KB
testcase_20	AC	24 ms 24,948 KB
testcase_21	AC	24 ms 27,116 KB
testcase_22	AC	24 ms 25,036 KB
testcase_23	AC	23 ms 26,208 KB
testcase_24	AC	21 ms 23,768 KB
testcase_25	AC	22 ms 25,072 KB
testcase_26	AC	21 ms 25,076 KB
testcase_27	AC	21 ms 24,016 KB
testcase_28	AC	23 ms 24,692 KB
testcase_29	AC	22 ms 23,908 KB
testcase_30	AC	21 ms 25,208 KB
testcase_31	AC	22 ms 24,948 KB
testcase_32	AC	21 ms 24,940 KB
testcase_33	AC	21 ms 24,704 KB
testcase_34	AC	23 ms 25,928 KB
testcase_35	AC	23 ms 25,816 KB
testcase_36	AC	22 ms 23,636 KB
testcase_37	AC	23 ms 22,900 KB
testcase_38	AC	22 ms 24,024 KB
testcase_39	AC	21 ms 23,896 KB
testcase_40	AC	21 ms 25,076 KB
testcase_41	AC	21 ms 24,692 KB
testcase_42	AC	21 ms 25,076 KB
testcase_43	AC	22 ms 24,940 KB
testcase_44	AC	22 ms 25,196 KB
testcase_45	AC	21 ms 24,820 KB
testcase_46	AC	21 ms 26,064 KB
testcase_47	AC	23 ms 25,072 KB
testcase_48	AC	21 ms 25,200 KB
testcase_49	AC	20 ms 23,892 KB
testcase_50	AC	21 ms 23,916 KB
testcase_51	AC	21 ms 26,068 KB
testcase_52	AC	22 ms 23,888 KB
testcase_53	AC	22 ms 23,160 KB
testcase_54	AC	20 ms 24,028 KB
testcase_55	AC	21 ms 24,692 KB
testcase_56	AC	22 ms 26,984 KB
testcase_57	AC	22 ms 24,948 KB
testcase_58	AC	21 ms 23,892 KB
testcase_59	AC	20 ms 24,020 KB
testcase_60	AC	21 ms 24,148 KB
testcase_61	AC	21 ms 24,812 KB
testcase_62	AC	22 ms 24,820 KB
testcase_63	AC	22 ms 24,296 KB

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

コンパイルメッセージ

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.IO;
using System.Text;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
using static System.Math;
using static System.Array;
using static AtCoder.Sc_out;
using static AtCoder.Tool;
using static AtCoder.ModInt;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        //const int MOD = 998244353;

        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };
        static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };
        //static List<List<int>> G = new List<List<int>>();
        //static List<List<Edge>> G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw);

            var th = new Thread(Run, 1 << 26);
            th.Start();
            th.Join();

            //Run();
            Console.Out.Flush();
        }
        static void Run()
        {
            int Testcase = 1;
            for (var _ = 0; _ < Testcase; _++) Solve();
        }
        static void Solve()
        {
            int N = Cin.Int;
            var A = new int[N];
            for (var i = 0; i < N; i++) A[i] = Cin.Int;
            for(var i = 1; i <= 100; i++)
            {
                var ok = true;
                for (var j = 0; j < N; j++) ok &= (A[j] * i) % 100 == 0;
                if (ok) { OutL(i);return; }
            }
            
        }
        public struct Edge
        {
            public int from;

            public int to;
            public long dist;

            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }
        }
    }
    struct ModInt
    {
        public long value;
        private const int MOD = 1000000007;
        //private const int MOD = 998244353;
        public ModInt(long value) { this.value = value; }
        public static implicit operator ModInt(long a)
        {
            var ret = a % MOD;
            return new ModInt(ret < 0 ? (ret + MOD) : ret);
        }
        public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);
        public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);
        public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);
        public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);
        public static ModInt operator <<(ModInt a, int n) => (a.value << n);
        public static ModInt operator >>(ModInt a, int n) => (a.value >> n);
        public static ModInt operator ++(ModInt a) => a.value + 1;
        public static ModInt operator --(ModInt a) => a.value - 1;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt Modpow(ModInt a, long n)
        {
            var k = a;
            ModInt ret = 1;
            while (n > 0)
            {
                if ((n & 1) != 0) ret *= k;
                k *= k;
                n >>= 1;
            }
            return ret;
        }
        private static readonly List<long> Factorials = new List<long>() { 1 };
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt Fac(long n)
        {
            for (var i = Factorials.Count(); i <= n; i++)
            {
                Factorials.Add((Factorials[i - 1] * i) % MOD);
            }
            return Factorials[(int)n];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt nCr(long n, long r)
        {
            return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));
        }
        public static explicit operator int(ModInt a) => (int)a.value;
    }
    static class Cin
    {
        public static string[] ReadSplit => Console.ReadLine().Split();
        public static int[] ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);
        public static long[] ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);
        public static double[] ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);
        public static string Str => Console.ReadLine();
        public static int Int => int.Parse(Console.ReadLine());
        public static long Long => long.Parse(Console.ReadLine());
        public static double Double => double.Parse(Console.ReadLine());
        public static T Conv<T>(string input)
        {
            if (typeof(T).Equals(typeof(ModInt)))
            {
                return (T)(dynamic)(long.Parse(input));
            }
            return (T)Convert.ChangeType(input, typeof(T));
        }
        public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());
        public static void Input<T, U>(out T a, out U b)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); }
        public static void Input<T, U, V>(out T a, out U b, out V c)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); }
        public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); }
        public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
        { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); }
    }
    static class Sc_out
    {
        public static void OutL(object s) => Console.WriteLine(s);
        public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));
        public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_One(object s) => Console.Write($"{s} ");
        public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");
        public static void Endl() => Console.WriteLine();
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            array = ConvertAll(array, x => initialvalue);
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }
        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }
        static public long Gcd(long a, long b)
        {
            if (a == 0 || b == 0) return Max(a, b);
            return a % b == 0 ? b : Gcd(b, a % b);
        }
        static public long LPow(int a, int b) => (long)Pow(a, b);
        static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;
        static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード