結果

問題 No.339 何人が回答したのか
ユーザー りあんりあん
提出日時 2016-03-06 03:11:58
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 24 ms / 1,000 ms
コード長 6,103 bytes
コンパイル時間 1,028 ms
コンパイル使用メモリ 118,040 KB
実行使用メモリ 26,060 KB
最終ジャッジ日時 2024-09-24 14:36:16
合計ジャッジ時間 3,985 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
23,536 KB
testcase_01 AC 23 ms
25,832 KB
testcase_02 AC 23 ms
25,968 KB
testcase_03 AC 23 ms
23,604 KB
testcase_04 AC 22 ms
23,792 KB
testcase_05 AC 23 ms
25,964 KB
testcase_06 AC 23 ms
23,796 KB
testcase_07 AC 24 ms
25,940 KB
testcase_08 AC 23 ms
25,836 KB
testcase_09 AC 22 ms
23,544 KB
testcase_10 AC 22 ms
23,596 KB
testcase_11 AC 22 ms
21,808 KB
testcase_12 AC 23 ms
25,816 KB
testcase_13 AC 23 ms
23,632 KB
testcase_14 AC 23 ms
23,668 KB
testcase_15 AC 23 ms
25,464 KB
testcase_16 AC 22 ms
23,732 KB
testcase_17 AC 23 ms
23,672 KB
testcase_18 AC 22 ms
23,628 KB
testcase_19 AC 22 ms
25,800 KB
testcase_20 AC 23 ms
23,724 KB
testcase_21 AC 23 ms
23,668 KB
testcase_22 AC 23 ms
23,416 KB
testcase_23 AC 23 ms
25,836 KB
testcase_24 AC 23 ms
25,684 KB
testcase_25 AC 22 ms
25,708 KB
testcase_26 AC 22 ms
23,896 KB
testcase_27 AC 23 ms
25,808 KB
testcase_28 AC 22 ms
23,860 KB
testcase_29 AC 23 ms
25,668 KB
testcase_30 AC 23 ms
25,676 KB
testcase_31 AC 22 ms
23,508 KB
testcase_32 AC 23 ms
25,800 KB
testcase_33 AC 22 ms
23,856 KB
testcase_34 AC 22 ms
23,628 KB
testcase_35 AC 22 ms
23,788 KB
testcase_36 AC 22 ms
23,376 KB
testcase_37 AC 22 ms
23,536 KB
testcase_38 AC 22 ms
25,812 KB
testcase_39 AC 22 ms
25,832 KB
testcase_40 AC 23 ms
23,924 KB
testcase_41 AC 22 ms
23,416 KB
testcase_42 AC 23 ms
21,808 KB
testcase_43 AC 23 ms
23,632 KB
testcase_44 AC 23 ms
23,796 KB
testcase_45 AC 23 ms
25,712 KB
testcase_46 AC 22 ms
23,672 KB
testcase_47 AC 22 ms
23,880 KB
testcase_48 AC 23 ms
25,804 KB
testcase_49 AC 22 ms
23,504 KB
testcase_50 AC 23 ms
23,728 KB
testcase_51 AC 22 ms
23,536 KB
testcase_52 AC 23 ms
23,888 KB
testcase_53 AC 23 ms
25,840 KB
testcase_54 AC 22 ms
21,680 KB
testcase_55 AC 22 ms
25,868 KB
testcase_56 AC 23 ms
24,020 KB
testcase_57 AC 23 ms
23,636 KB
testcase_58 AC 23 ms
25,932 KB
testcase_59 AC 23 ms
25,572 KB
testcase_60 AC 23 ms
25,808 KB
testcase_61 AC 23 ms
26,060 KB
testcase_62 AC 22 ms
23,732 KB
testcase_63 AC 23 ms
25,808 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 System.IO.Compression;
using System.Text;

namespace Solver
{
    class Program
    {
        const int M = 1000000007;
        const double eps = 1e-9;
        static int[] dd = { 0, 1, 0, -1, 0 };
        static void Main()
        {
            var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            var sc = new Scan();
            var mt = new mymath();
            int n = sc.Int;
            int g = 100;
            for (int i = 0; i < n; i++)
            {
                g = (int)mt.gcd(g, sc.Int);
            }
            sw.WriteLine(100 / g);
            sw.Flush();
        }
         
        static void swap<T>(ref T a, ref T b)
        {
            var t = a;
            a = b;
            b = t;
        }
 
        static bool isprime(long n)
        {
            if (n == 1) return false;
 
            for (long i = 2; i * i <= n; i++)
                if (n % i == 0)
                    return false;
 
            return true;
        }
 
        static string strsort(string s)
        {
            var c = s.ToCharArray();
            Array.Sort(c);
            return string.Join("", c);
        }
        static string strswap(string s, int i, int j)
        {
            var c = s.ToCharArray();
            c[i] = s[j];
            c[j] = s[i];
            return string.Join("", c);
        }
 
        static T[] copy<T>(T[] a)
        {
            var ret = new T[a.Length];
            for (int i = 0; i < a.Length; i++) ret[i] = a[i];
            return ret;
        }
    }
    class Scan
    {
        public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
        public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
        public string Str { get { return Console.ReadLine().Trim(); } }
        public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
        public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
        public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
        public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
        public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
        public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }
        public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }
        public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
        public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
        public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
        public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
        public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
        public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
        public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
        public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
        public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
        public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
        public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
        public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
    }
    class mymath
    {
        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 long[][] powmat(long[][] A, int n, int M)
        {
            var E = new long[A.Length][];
            for (int i = 0; i < A.Length; i++)
            {
                E[i] = new long[A.Length];
                E[i][i] = 1;
            }
            if (n == 0) return E;
            
            var t = powmat(A, n / 2, M);
            if ((n & 1) == 0) return mulmat(t, t, M);
            else return mulmat(mulmat(t, t, M), A, M);
        }
        public long[] mulmat(long[][] A, long[] x, int M)
        {
            var ans = new long[A.Length];
            for (int i = 0; i < A.Length; i++)
                for (int j = 0; j < x.Length; j++)
                    ans[i] = (ans[i] + x[j] * A[i][j]) % M;

            return ans;
        }
        public long[][] mulmat(long[][] A, long[][] B, int M)
        {
            var ans = new long[A.Length][];
            for (int i = 0; i < A.Length; i++)
            {
                ans[i] = new long[B[0].Length];
                for (int j = 0; j < B[0].Length; j++)
                    for (int k = 0; k < A[0].Length; k++)
                        ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
            }
            return ans;
        }
        public long powmod(long a, long b, long M)
        {
            if (a == 0) return 0;
            if (b == 0) return 1;
            if (b == 1) return a % M;
 
            var t = powmod(a, b / 2, M);
 
            if ((b & 1) == 0) return t * t % M;
            else return t * t % M * a % M;
        }
        public long gcd(long a, long b)
        {
            while (b != 0)
            {
                var t = a % b;
                a = b;
                b = t;
            }
            return a;
        }
        public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }
    }
}
0