Problem:
Score : 100 points

Problem Statement

You are given an integer K.
Print the string obtained by repeating the string ACL K times and concatenating them.

For example, if K = 3, print ACLACLACL.

Constraints

1 \leq K \leq 5

All values in input are integers.

Input

Input is given from Standard Input in the following format:

K

Output

Print the string obtained by repeating the string ACL K times and concatenating them.

Sample Input 1

3

Sample Output 1

ACLACLACL

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

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

namespace ACLBeginnerContest
{
    class Program
    {
        static void Main(string[] args)
        {
            // 課題D：Friends(2020/9/26)

            //string[] str = Console.ReadLine().Split(' ');
            int K = int.Parse(Console.ReadLine());
            //int rows = int.Parse(str[1]);

            //if (rows == 0)
            //{
            //    Console.Write(1);
            //    return;
            //}

            //int[] pair;
            //int[] revsPairs;
            //int[] frends;
            //HashSet<int[]> groupArray = new HashSet<int[]>();
            //HashSet<int[]> info = new HashSet<int[]>();

            //HashSet<int> groupMember = new HashSet<int>();
            //HashSet<int> tmpGroupMember = new HashSet<int>();
            //int arraySize;
            //int gCnt;
            //int p1, p2;

            //int maxGroup = 2;

            //for (int i = 0; i < rows; i++)
            //{
            //    str = Console.ReadLine().Split(' ');
            //    pair = new int[] { p1 = int.Parse(str[0]), p2 = int.Parse(str[1]) };
            //    revsPairs = new int[] { p2, p1 };

            //    if (info.Contains(pair) || info.Contains(revsPairs)) continue;
            //    else info.Add(pair);

            //    gCnt = 0;

            //    groupMember.Clear();

            //    foreach (int[] group in groupArray)
            //    {

            //        if (!group.Contains(pair[0]) && !group.Contains(pair[1])) continue;

            //        tmpGroupMember.Clear();

            //        tmpGroupMember.UnionWith(group);
            //        tmpGroupMember.UnionWith(pair);

            //        groupMember.UnionWith(tmpGroupMember);

            //        gCnt++;

            //        if (gCnt == 2)
            //        {
            //            groupArray.Remove(group);
            //            break;
            //        }

            //    }

            //    if (gCnt == 0)
            //    {
            //        groupArray.Add(pair);
            //    }
            //    else
            //    {
            //        arraySize = groupMember.Count();
            //        frends = new int[arraySize];
            //        groupMember.CopyTo(frends);

            //        groupArray.Add(frends);
            //        if (maxGroup < arraySize) maxGroup = arraySize;
            //    }

            //}

            string str= "ACL";
            if(K==1)
            {
                Console.Write(str);

                return;
            }

            for (int i= 0;i<K-1; i++)
            {
                str = str + "ACL";
            }

            Console.Write(str);
        }
    }
}