Submission #1965596


Source Code Expand

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

namespace SandboxCSharp
{
    class Solver
    {
        void Yes()
        {
            io.WriteLine("WANWAN");
            Exit();
        }
        void No()
        {
            io.WriteLine("BOWWOW");
            Exit();
        }

        public void Solve()
        {
            var n = io.ScanLong();
            var k = n * (n + 1) / 2;

            if (k == 1 || k % 2 == 0)
                No();

            for (long x = 3; x<= Math.Min(n,1000); x+=2)
            {
                if (k % x == 0)
                    No();
            }

            Yes();
        }

        // =================================================
        // =================================================

        Stdio io;
        bool isjdg;
        static void Main()
        {
            var s = new Solver();
            s.Solve();
            s.io.Flush();
        }
        public Solver(Stdio _io = null)
        {
            isjdg = _io == null;
            io = _io == null ? new Stdio() : _io;
        }

        void Exit()
        {
            if (isjdg)
            {
                io.Flush();
                Environment.Exit(0);
            }
            else
                throw new HaltException();
        }
    }
    class Stdio
    {
        protected string[] stack = new string[0];
        protected int stackptr = 0;
        protected StringBuilder outbuff = new StringBuilder();

        public virtual int ScanInt()
        {
            return Check() ? int.Parse(stack[stackptr++]) : 0;
        }
        public virtual long ScanLong()
        {
            return Check() ? long.Parse(stack[stackptr++]) : 0;
        }
        public virtual string ScanString()
        {
            return Check() ? stack[stackptr++] : string.Empty;
        }
        public virtual double ScanDouble()
        {
            return Check() ? double.Parse(stack[stackptr++]) : 0;
        }
        protected virtual bool Check()
        {
            if (stackptr < stack.Length) return true;
            var l = Console.ReadLine();
            if (l == null) return false;
            stack = l.Split(' ').ToArray(); stackptr = 0;
            return Check();
        }
        public Stdio Write(long v) { return Write($"{v}"); }
        public Stdio WriteLine(long v) { return WriteLine($"{v}"); }
        public Stdio Write(string str)
        {
            outbuff.Append(str);
            return this;
        }
        public Stdio WriteLine(string str = "")
        {
            outbuff.AppendLine(str);
            return this;
        }
        public virtual Stdio Flush()
        {
            Console.Write(outbuff.ToString());
            outbuff.Clear();
            return this;
        }
    }
    class HaltException : Exception { }

}

Submission Info

Submission Time
Task A - ホリドッグ
User m_buyoh
Language C# (Mono 4.6.2.0)
Score 100
Code Size 3038 Byte
Status AC
Exec Time 24 ms
Memory 13268 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 16
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 23 ms 11220 KB
subtask0_sample_02.txt AC 22 ms 9172 KB
subtask0_sample_03.txt AC 23 ms 11220 KB
subtask0_sample_04.txt AC 22 ms 9172 KB
subtask1_01.txt AC 23 ms 9172 KB
subtask1_02.txt AC 23 ms 13268 KB
subtask1_03.txt AC 23 ms 11220 KB
subtask1_04.txt AC 23 ms 11220 KB
subtask1_05.txt AC 23 ms 11220 KB
subtask1_06.txt AC 23 ms 11220 KB
subtask1_07.txt AC 24 ms 13268 KB
subtask1_08.txt AC 23 ms 11220 KB
subtask1_09.txt AC 23 ms 11220 KB
subtask1_10.txt AC 23 ms 11220 KB
subtask1_11.txt AC 23 ms 11220 KB
subtask1_12.txt AC 23 ms 11220 KB