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++ (GCC 9.2.1 with AC Library v1.1) (judge verdict: Runtime Error)

#include <iostream>
#include <vector>
using namespace std;
 
void DFS(vector<vector<int>>& graph, int idx, vector<bool>& visited)
{
  visited[idx] = true;
  for(int i : graph[idx]) {
    if(!visited[i])	DFS(graph, i, visited);
  }
}
int main(){
  int n;
  cin>>n;
  
  vector<vector<int>> graph(n);
  int m;
  cin>>m;
  
  for(int i = 0; i < m; i++){
    int x, y;
    cin>>x>>y;
    x--,y--;
    graph[x].push_back(y);
    graph[y].push_back(x);
  }
  
  int con = 0;
  vector<bool> visited(n);
  for(int i = 0; i < n; i++){
    if(!visited[i]) {
      con++;
      DFS(graph, i, visited);
    }
  }
  cout<<con - 1;
  return 0;
}