Submission #345757


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoderBeginnerContest019
{
    class Program
    {
        static void A()
        {
            String[] str = Console.ReadLine().Split(' ');
            int[] data = new int[str.Length];

            for (int i = 0; i < str.Length;i++)
            {
                data[i] = int.Parse(str[i]);
            }

            Array.Sort(data);

            Console.WriteLine(data[1]);
        }

        static void B()
        {
            String s = Console.ReadLine();
            char[] c = s.ToCharArray();

            int count = 0;
            char pre = '0';
            String str = "";
            for(int i = 0;i<c.Length;i++)
            {
                if(count==0)
                {
                    pre = c[i];
                    count = 1;
                    continue;
                }
                else
                {
                    if(pre == c[i])
                    {
                        count++;
                        continue;
                    }else
                    {

                        str = str +  pre +""+ count;
                        pre = c[i];
                        count = 1;
                        continue;
                    }
                }
            }
            str = str + pre + "" + count;
            Console.WriteLine(str);
        }

        static void C()
        {
            int N = int.Parse(Console.ReadLine());
            String[] str = Console.ReadLine().Split(' ');
            int[] data = new int[str.Length];

            for(int i = 0;i<data.Length;i++)
            {
                data[i] = int.Parse(str[i]);
            }

            int sum = N;
            for (int i = 0; i < data.Length - 1; i++)
            {
                for (int j = i + 1; j < data.Length; j++)
                {
                    if(data[i] * 2 == data[j] || data[j]*2 == data[i])
                    {
                        sum--;
                    }
                }
            }

            Console.WriteLine(sum);

        }

        static void D()
        {

        }

        static void Main(string[] args)
        {
            //A();
           //B();
           C();
           //D();
        }
    }
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User tookunn
Language C# (Mono 2.10.8.1)
Score 0
Code Size 2442 Byte
Status WA
Exec Time 2035 ms
Memory 15296 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 0 / 20 0 / 30 0 / 50
Status
AC × 3
AC × 14
WA × 9
AC × 3
TLE × 10
AC × 14
WA × 9
TLE × 20
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask1 subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask2 subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 144 ms 7840 KB
subtask0_1.txt AC 137 ms 7704 KB
subtask0_2.txt AC 144 ms 7736 KB
subtask1_0.txt AC 164 ms 7880 KB
subtask1_1.txt WA 162 ms 8068 KB
subtask1_10.txt AC 165 ms 7936 KB
subtask1_11.txt AC 161 ms 8064 KB
subtask1_12.txt AC 161 ms 8000 KB
subtask1_13.txt AC 161 ms 7936 KB
subtask1_14.txt AC 160 ms 8072 KB
subtask1_15.txt AC 164 ms 7968 KB
subtask1_16.txt AC 165 ms 7944 KB
subtask1_17.txt AC 162 ms 8068 KB
subtask1_18.txt AC 163 ms 7940 KB
subtask1_19.txt AC 163 ms 7996 KB
subtask1_2.txt WA 175 ms 7952 KB
subtask1_3.txt WA 162 ms 8056 KB
subtask1_4.txt WA 160 ms 8016 KB
subtask1_5.txt WA 161 ms 8052 KB
subtask1_6.txt WA 160 ms 8012 KB
subtask1_7.txt WA 163 ms 7940 KB
subtask1_8.txt WA 161 ms 8064 KB
subtask1_9.txt WA 162 ms 8000 KB
subtask2_0.txt TLE 2032 ms 14412 KB
subtask2_1.txt TLE 2033 ms 14408 KB
subtask2_2.txt TLE 2033 ms 14404 KB
subtask2_3.txt TLE 2033 ms 14440 KB
subtask2_4.txt TLE 2035 ms 14396 KB
subtask2_5.txt TLE 2032 ms 14408 KB
subtask2_6.txt TLE 2033 ms 14412 KB
subtask2_7.txt TLE 2033 ms 14408 KB
subtask2_8.txt TLE 2032 ms 14388 KB
subtask2_9.txt TLE 2034 ms 14412 KB
subtask3_0.txt TLE 2033 ms 14404 KB
subtask3_1.txt TLE 2033 ms 15172 KB
subtask3_2.txt TLE 2034 ms 15172 KB
subtask3_3.txt TLE 2034 ms 15296 KB
subtask3_4.txt TLE 2033 ms 15204 KB
subtask3_5.txt TLE 2034 ms 15184 KB
subtask3_6.txt TLE 2035 ms 15268 KB
subtask3_7.txt TLE 2033 ms 15204 KB
subtask3_8.txt TLE 2034 ms 15180 KB
subtask3_9.txt TLE 2035 ms 15180 KB