Submission #3599603


Source Code Expand

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

namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            Solve();
        }
        private const long MOD = 1000000007;
        
        static void Solve()
        {
            var o = ReadAndParseIntArr();
            int h = o[0];
            int w = o[1];
            var c = new string[h];
            for(int i=0;i<h;++i)
            {
                c[i] = Console.ReadLine();
            }

            for(int i=0;i<2*h;++i)
            {
                string s = c[(i+1)/2];
                Console.WriteLine(s);
            }
        }

        #region よく使う便利関数
        private static bool isPrime(long x)
        {
            if (x == 2) { return true; }
            if (x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while (i * i <= x)
            {
                if (x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            return x / gcd(x, y) * y;
        }
        private static long gcd(long x, long y)
        {
            return y > 0 ? gcd(y, x % y) : x;
        }
        private static long pow(long x, long n)
        {
            if (n == 0) { return 1; }
            long res = pow(x * x % MOD, n / 2);
            if (n % 2 == 1)
            {
                res = res * x % MOD;
            }
            return res;
        }
        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }
        #endregion
    }
}

Submission Info

Submission Time
Task B - Thin
User masakam1
Language C# (Mono 4.6.2.0)
Score 0
Code Size 2209 Byte
Status RE
Exec Time 21 ms
Memory 12768 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
RE × 3
RE × 13
Set Name Test Cases
Sample 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_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt RE 20 ms 10720 KB
subtask0_1.txt RE 20 ms 8672 KB
subtask0_2.txt RE 20 ms 10592 KB
subtask1_0.txt RE 21 ms 12768 KB
subtask1_1.txt RE 20 ms 10720 KB
subtask1_2.txt RE 21 ms 12768 KB
subtask1_3.txt RE 21 ms 10720 KB
subtask1_4.txt RE 21 ms 10720 KB
subtask1_5.txt RE 21 ms 12768 KB
subtask1_6.txt RE 20 ms 8672 KB
subtask1_7.txt RE 21 ms 10720 KB
subtask1_8.txt RE 21 ms 10720 KB
subtask1_9.txt RE 21 ms 10720 KB