#80305 (C#(csc)) No.338 アンケート機能

• 問題: No.338 アンケート機能
• ユーザー: りあん
• 提出日時: 2016-03-06 03:04:47
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 6,262 bytes
• コンパイル時間: 1,018 ms
• コンパイル使用メモリ: 116,056 KB
• 実行使用メモリ: 29,180 KB
• 最終ジャッジ日時: 2024-09-24 14:35:54
• 合計ジャッジ時間: 2,830 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	28 ms; 23,092 KB
testcase_01	AC	29 ms; 25,472 KB
testcase_02	AC	28 ms; 27,268 KB
testcase_03	AC	28 ms; 27,244 KB
testcase_04	AC	28 ms; 25,076 KB
testcase_05	WA	-
testcase_06	AC	28 ms; 27,372 KB
testcase_07	WA	-
testcase_08	AC	29 ms; 29,180 KB
testcase_09	WA	-
testcase_10	AC	29 ms; 25,348 KB
testcase_11	AC	29 ms; 27,244 KB
testcase_12	AC	28 ms; 27,368 KB
testcase_13	AC	28 ms; 25,472 KB
testcase_14	AC	28 ms; 24,964 KB
testcase_15	AC	28 ms; 25,260 KB
testcase_16	AC	28 ms; 27,516 KB
testcase_17	AC	28 ms; 25,200 KB
testcase_18	AC	29 ms; 25,392 KB
testcase_19	AC	28 ms; 27,140 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	28 ms; 23,216 KB
testcase_24	AC	28 ms; 25,204 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	28 ms; 25,012 KB
testcase_29	AC	28 ms; 27,396 KB
testcase_30	AC	27 ms; 25,220 KB

コンパイルメッセージ

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

ソースコード

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 a = sc.IntArr;
            for (int i = 1; i < 200; i++)
            {
                for (int j = 0; j <= i; j++)
                {
                    if (Math.Round(j * 100.0 / i + eps) == a[0] && Math.Round((i - j) * 100.0 / i + eps) == a[1])
                    {
                        Console.WriteLine(i);
                        return;
                    }
                }
            }
        }
         
        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); }
    }
}