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



Sample input:
3


Sample output:
ACLACLACL

Submission status: Accepted

Solution code:
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
# Original source code : 

"""
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

using int64 = long long;

#define all($) begin($), end($)
#define rall($) rbegin($), rend($)

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int k; cin >> k;
  for (int i = 0; i < k; ++i) {
    cout << "ACL";
  }

  cout << endl;

  return 0;
}

"""

import base64
import subprocess
import zlib


exe_bin = "c$~#qeQaCR6~F#UoHlXYl2TI`c#uxXAZ|?3G#%=&lQ?~bG<5lZ4rp&3+lk+B?8tsD37Sf#&<?AFWzz(eCM3|NiT!~D5<-ljEnN^F5|hHDeF2*a8z@1rWiTqnAl|v}-Shn3^?Tz(NV`#d-uc~g&OP_suXoS8Gd4KjbT|kW7x_A2+)9JSM>u}&VqFBV9?}56Um}-~I^f*~Igx(gFjKGIj;7b+)Oe9zLd?`*pdMmh&NZ4TAwgY_`I>3c&`eX%L?7nu20UgxC)b<fdUISJDdBoZv43v<Kgw~D_7gL8b9(3vCB>dIo4KC?wbT0s=+%)=U;La7V|zAnIm7)$isP_5E01?~?arp!vvRI9(>~MF-QL|5D&|91t3LU;?17;%Ri2GEhKkiUbBxtXy8<trc>ju<{JWlh_vy~|Un&oLdx**UNOj!6qSFDIK5nD=Ok-d1zIrrSQ=W$ZZ5H@(FnGBIe#}OG%m$Yo*7#u?{4X|kuCkH8jNlA3my<T~ejE8~Z1A7h_|p&ew~_#f_%$s*AMhU$4L`P3!vi=GU>+2eRPxFz+1PgzN++lCIa*W_1%*;V<D&;@DqToV%0(qz7(LjR&F9jiiScY&tFx}Td1yo~6l23OJdP+`>0BxsPmU<za59r9P^FNNm0~;@iwy(TIi4uWNt!Pzg>+&nK1xSBXl$gLs;ZqyIj5RadgOeOf@r!co|BdSaO}8%hxZg`b4hx;tYpCbl$?)^t0uzT6pd3kS4<a_&+N*f>qk0i*2<4Q%@62fGG9_yFq0TZ2x0Ozn#|lrClWF!)8tHoCY1DytZ-&R&Ly()9S|?d6nW66642!XgYn)zdUdEvf4VxfM|(ben0AJ`Li>yy8%QUtN2mJhh8>nIEEmym_UC~AA%`~4I^e%qmYdj0zMo^IopJ-yc!<vnhpJQEXUccBIoZzr2$xsde&A)cf5GK(zrp=;Ws^py1^hvNF3kw|BA562%{cNaTQpins{0Tte>C6?2K<}>-(<j74ftjQzHY!94fqEJyvcy$`eMh8&w%6lV)zyVeumqrC)GWel?M&D%YZ*@z}*J?Q3Gx~N1rs{#&cxJfY%%F=MA{mfJ^gld!^H!h58_oPA)0V%8E4qjCWbDuk6_dRh3=M@Vn)*2s|-9!>ZQKRiNzJ#CX=lwH1|jGM)|D+LFqDSO+}o>e{0!|1RTM7uOzC`L`I)y0*5c@~<<Vb!lx*<zEJVViElr8wppy=Rit2?cUYOI#BL!@rIXHlOQWCC@pSjVgFt)^yWEFbA#6B)k&y3-QVIqxpd+xX`%fR@Gkty#Foq8PzLEWXy7TAYU=Ov%Z^nUr1#z0;=c2*Q28QMuI>ONyd<3-Z1JX~&PKJ}QauDJaLbY9)i$UFV|QusT-g6x);ffBwS&2IdVds5NDJGqQ^}sk)!JvgYp-vB+G6;fc=@HHQu%dh{%`AtMh6!>-*PZ3P48*O8d(gszv&5*f1$q(U}#KQ@Hm*keIH2WH<XKD2%qw3L)dhra&97o{v26mqgLfX{{@fg$ge%jOxp(NOJ_G+Qh8lEyLzqUcvgC8LkWPv?{I^S%%GjUx&5!fc$3m@X@381PymzQPa|~uX5d!$Lnl`y=)$v}pM#u(sn0RJ_m;KzGw~y96Iuv?kKPo$F<$;dbSw(7*mc~gcD4Nk(2;2Q<9PY}VA~t&oIU%oYxUZXA;2f!QG(%D(4WEbhlAzw{pEi|E6uM;Fr3o9KbPKO0l(!)^w#K+=+P)$Uab26-ZEbUeAcslFxodr92dK;>Bsc~&9Di0H_#`6o&mZ7v<Eu(5zq|KV?bx17wnu}1$vAx`er_F9d`^9$Bf@`abvxA(NXVbxcaUPx>p+3qqRICEnI&3qe?{$pwB<x3tYEl^X=X_a_!D*zS`MxIqEaNp9eYPI%iY%R`_26{C);Reg0F<s4p<@8t`>Ezq`p703_=3MmNJ-1N0UCyP%&TCVRclf7GX0W4775$YJn1&46B?|9j3}U*KL>%okj6_xf7z@kqXoQ+1NBXTJWRFH-RJM137mUu&-~2y!6b3%1yq@-~}4V8`~Q@c&rwJj3$~&nx4-#z=?w1D+*^c<}KI8Rdu1MV!a;6R&A_?(XCi&r7^d;aI-EQOPrk@Ar5nMEIeBXTcJ$$FuM`?jN3k0Zz9QbHOudj-MAeHV<=(^ApdO9avv)#_z5(`yJ%%<C%@^UrNk!|EXyGb8u*b^R3)oh4bjwI_JH-{@<K8o}pi4(eIH$ImJ70AE!U%^a)O%<@EQQzG+;XpQGS=(t*CduLWDj#!ES+6x<uy6Y6O1EU8@hM7Sr^(bcA*pT?#OqTXY%7}<N~s3q<qiY4yW=cgI>==0Ky*Xi@ujMwYqYR0|#d@$n;`n)saoAmi<#y9Kh)QmThX-m9`tXtwf^UJ7?Z_(Gi8TXT8miSgZZ(zo^kw-1@3-o=&j5q81hZ)~)Ie%T`LVdlPaai4cE4+H&G~*Z5U~JjD$v-P1&hD~Kh#T&&A&!4V)d`T<Z9!e1l|43gBHWJYr5{Q!$0Gth#_>e~zm2y$BeZ*m`dk~&hq#>;!OkP9eC@c{`TwFSzm2@wDAriZzpVb&&XadkJGJ9`Uj4nG#{YVUhKqjgbTB)$^Pxk%2ksz#Vcef^vV2ADJlU(}C93lrm-m28KBQ!m=lL>W^40ZqKgYjsW9Lt-UFQycf5h^pjeM(%;kD~@!$$ror{)jlTk+j3;Ix+iNX2XSnJ%a1rx?$OjhzRa)_I=Co!YpF@pr1@6(Dol%=lTShKud~#-`nOd4JFGd7ei5F6%tir7lhW5RWHr_aT>cKC0hk-EPvxe!&L6$Hoqc(&6-UI-yW_s}CiorwKhUctdY=kkVploW`~E3(M#X_E0M4<(#aLWI-t^rHP49l2mhHRGFelmh&nSN>h0{naz(UvNWaS3q_hJ&5&e%YC4-%(y7qi?tMMhLM#U)(?p?=n5F5QQkW$Zg~U{vrb<&&v!G(&D09UmO6kCG^k9s}hWc5mjvg2qqcMqtQvWca{ofpl9*p-vok=-m2GqQh9)}wS21a6|bTryK7z3;6R6<D*8oxnJs^w^@m`;6i<}DI2W~a>QE?&oTTAx2bD7KL*=4mDYmW&BVD@U{>oZyC#udCKFt<i&h809ZAqiAw2w6B^-tmztz0S*%#FBb9HIw2`)tI5S=v80aq|4!*vW!c2kQ?Qm6tLaKHl(i{j+cdF7Uf0|h2^D9jl*BktrJ&IaKFK*SIZZ;jypj$@d*kg&Vv=){xl(AnBxh6Ya*C*2CQ;0gP-->@_B5&#w3_4TLQ&4=Obms(LOPpZg8XSZtFR^^gzPainTH3MN${)2Dpbg;OC^-f@MW7x6{?)3s;xLp1D~OV#FU(b2UQ)0mxN&Nn1V%awSj%M!tRr7YsG!n?mHb8hrnM!v^yN?i{HV5g1q?J9v1ZRet@*)6ZBbr;XK^oP+$C>)yi?a_lmFMLqxmdqCVa?kk0WAvulFGppW;_8;SYb7v4*dJ|_fBjNehB-BD2=?=MJ$g8#zjNcBB*!=R7%9Hhrc)qf|c?LT{8bsOyAeF!Pu!^QYv|L@}Zy`0B;lTHo(UudC!FEM@ttmZ+GV!i;2IR0fpAMasE=LC7bKz}Ic<9!XO7%#6t9}x8QdmX34!u{26X338QeSEJ(Dqa)C{{M`a*Dt<5BNhD@^&b=T?Y>9b>HkX5$9pHz4q?KJ{=7i6?<1H;s(zo=crjjL{C`KZ?<lB`_m-I^>-I$b*N7H-J&&b-|K|YjSe>AUew`s&|HVAm9RIj8_X+L4CFtw#<$iNJqCS>&j-kH(zRwjS!u*Q}`tS4h#e@&)w+XmaKGP~68{zuvJaFusX(zSozro<Uv2^f-|CmrI?w?z2^k3tN(G39?_5TY2Wukl"

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

Submission status: Accepted

Solution code:
#!/usr/bin/env python

k = int(input())
s = 'ACL'
ans = ''
for i in range(k):
    ans += s

print(ans)

Submission status: Accepted

Solution code:
x="ACL"
K=int(input())
print(x*K)

Submission status: Accepted

Solution code:
n = int(input())
acl = 'ACL'
tmp = ''
for i in range(n):
  tmp = tmp + acl
print(tmp)

Submission status: Accepted

Solution code:
k=int(input())
print(k*'ACL')

Submission status: Accepted

Solution code:
K = int(input())
a = ''
for i in range(K):
	a += 'ACL'
print(a)

Submission status: Accepted

Solution code:
ACL = "ACL"
N = int(input())
for i in range(N):
    print(ACL,end="")

Submission status: Accepted

Solution code:
n = int(input())
print('ACL' * n)

Submission status: Accepted

Solution code:
n = int(input());
print(n*"ACL");

Submission status: Accepted

Solution code:
k =int(input())
print('ACL'*k)

Submission status: Accepted

Solution code:
n = int(input())
print('ACL'*n)

Submission status: Accepted

Solution code:
k = int(input())
ans = ''

for i in range(k):
  ans += 'ACL'

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

# from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
printout = sys.stdout.write
sprint = sys.stdout.flush
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
#import math
# from itertools import product, accumulate, combinations, product
#import bisect
# import numpy as np
# from copy import deepcopy
from collections import deque
# from decimal import Decimal
# from numba import jit

INF = 1 << 50
EPS = 1e-8
mod = 998244353


def intread():
    return int(sysread())
def mapline(t=int):
    return map(t, sysread().split())
def mapread(t=int):
    return map(t, read().split())

def run():
     K = intread()
     print('ACL' * K)

if __name__ == "__main__":
    run()

Submission status: Accepted

Solution code:
print(eval("'ACL'*"+input()))

Submission status: Accepted

Solution code:
# coding: utf-8
ans = ""
n = int(input())
for i in range(n):
    ans += "ACL"
print(ans)

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
    
    
def main():
    temp = I()
    print("ACL"*temp)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
k = int(input())
a = 'ACL'
print(a*k)

Submission status: Accepted

Solution code:
s = int(input())
print("ACL"*s)

Submission status: Accepted

Solution code:
import sys


def resolve(in_):
    K = int(next(in_))
    return 'ACL' * K
    

def main():
    ans = resolve(sys.stdin.buffer)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K = int(input())
s = "ACL"
print(s*K)

Submission status: Accepted

Solution code:
n = int(input())

ans = n*"ACL"
print(ans)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop, heapify
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
#from decimal import *

K = INT()
print("ACL"*K)

Submission status: Accepted

Solution code:
k=int(input())
u='ACL'
print(u*k)

Submission status: Accepted

Solution code:
n = int(input())
arr = ['ACL']*n
arr2 = ''.join(arr)
print(arr2)

Submission status: Accepted

Solution code:
print('ACL' * int(input()))

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from math import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
# mod = 10**9 + 7
#mod = 9982443453
mod = 998244353
INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
k = I()
print('ACL' * k)

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    r = 'ACL'
    print(r*k)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
k=int(input())
v='ACL'
print(k*v)

Submission status: Accepted

Solution code:
k = int(input())

print("ACL"*k)

Submission status: Accepted

Solution code:
K = int(input())

print('ACL'*K)

Submission status: Accepted

Solution code:
K=int(input())
res=""
for i in range(K) :
  res+="ACL"
print(res)

Submission status: Accepted

Solution code:
k = int(input())
print('ACL' * k)

Submission status: Accepted

Solution code:
def main():
    K: int = int(input())
    S: str = 'ACL'
    print(S*K)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
K = int(input())
print('ACL'*K)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    k  = int(input())
    ans = ""
    for i in range(k):
        ans += "ACL"
    print(ans)

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
print 'ACL'* int(raw_input())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
print('ACL'*N)

Submission status: Accepted

Solution code:
K = int(input())
s = ''
for _ in range(K):
  s += 'ACL'
print(s)

Submission status: Accepted

Solution code:
k=int(input())
print('ACL'*k)

Submission status: Accepted

Solution code:
n=int(input())
r="ACL"*n
print(r)

Submission status: Accepted

Solution code:
num = int(input())
print(num * "ACL")

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    K = int(readline())
    
    print('ACL' * K)
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
print('ACL'*n)

Submission status: Accepted

Solution code:
k = int(input())
print(k * "ACL")

Submission status: Accepted

Solution code:
print("ACL"* int(input()))

Submission status: Accepted

Solution code:
K =int(input())
print("ACL"* K)

Submission status: Accepted

Solution code:
n = int(input())
print("ACL" * n)

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline

K = int(input())

print("ACL" * K)

Submission status: Accepted

Solution code:
class ARepeatACL():
    def main(self):
        K = int(input())
        print('ACL' * K)

if __name__ == "__main__":
    this_class = ARepeatACL()
    this_class.main()

Submission status: Accepted

Solution code:
N = int(input())
print('ACL' * N)

Submission status: Accepted

Solution code:
k = int(input())
S = "ACL"

for i in range(3*k):
    print(S[i%3],end='')

print("")

Submission status: Accepted

Solution code:
print( "ACL" * int(input()) )

Submission status: Accepted

Solution code:
K = int(input())
s = ""
for i in range(K):
    s += "ACL"
print(s)

Submission status: Accepted

Solution code:
s="ACL"*int(input()) 
print(s)

Submission status: Accepted

Solution code:
k = int(input())
ans = 'ACL' * k
print(ans)

Submission status: Accepted

Solution code:
s = "ACL"
ans = ""
for i in range(int(input())):
    ans += s
print(ans)

Submission status: Accepted

Solution code:
k=int(input())
for i in range(k):
  print(str("ACL"),end="")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)

import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache

#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


#####Shorten#####
def DD(arg): return defaultdict(arg)

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b: a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############

print("ACL"*int(input()))

Submission status: Accepted

Solution code:
n=int(input()); s=""
for i in range(n):
  s+='ACL'
print(s)

Submission status: Accepted

Solution code:
k=int(input())

ans=''
for i in range(k):
  ans+='ACL'
  
print(ans)

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    acl = 'ACL'
    ans = ''
    for i in range(k):
        ans += acl
    print(ans)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase

def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def li():  return list(mi())

def main():
    # pass
    k = ii()
    # return "ACL"*k
    print("ACL"*k)

# print(main())


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
k = int(input())
s = ""
for _ in range(k):
  s = s + "ACL"
print(s)

Submission status: Accepted

Solution code:
print("ACL" * int(input()))

Submission status: Accepted

Solution code:
k = int(input())
print("ACL" * k)

Submission status: Accepted

Solution code:
n=int(input())
ans=''
for i in range(n):
    ans+='ACL'
print(ans)

Submission status: Accepted

Solution code:
k = int(input())

ans = "ACL" * k

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
S=""
for i in range(N):
  S+="ACL"
print(S)

Submission status: Accepted

Solution code:
def resolve():
    #n=int(input())
    #a,b=map(int,input().split())
    #x=list(map(int,input().split()))
    #a=[list(map(lambda x:int(x)%2,input().split())) for _ in range(h)]
    k=int(input())
    x='ACL'
    ans=''
    for i in range(k):
        ans+=x
    print(ans)
      
      
if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
K = int(input())
print("ACL" * K)

Submission status: Accepted

Solution code:
K = int(input())
print("ACL"*K)

Submission status: Accepted

Solution code:
def main():
    print("ACL" * int(input()))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K = input(str())
a = 'ACL'

if K == '1':
    print(a)

if K == '2':
    print(a * 2)

if K == '3':
    print(a * 3)

if K == '4':
    print(a * 4)

if K == '5':
    print(a * 5)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

k = I()
print("ACL"*k)

Submission status: Accepted

Solution code:
k = int(input())
s = ""
for _ in range(k):
  s += "ACL"
print(s)

Submission status: Accepted

Solution code:
K = int(input())

for i in range(0, K):
    print("ACL", end="")

Submission status: Accepted

Solution code:
K = int(input())

print("ACL" * K)

Submission status: Accepted

Solution code:
N = int(input())
print("ACL"*N)

Submission status: Accepted

Solution code:
#A - Repeat ACL
K = int(input())
a = "ACL"*K
print(a)

Submission status: Accepted

Solution code:
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7

import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


def main():
    k = i_input()
    print("ACL"*k)


    

 

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
k = int(input())

print("ACL" * k)

Submission status: Accepted

Solution code:
n = int(input())
for i in range(n):
  print('ACL',end='')

Submission status: Accepted

Solution code:
k = int(input())
for _ in range(k):
    print("ACL", end = "")

Submission status: Accepted

Solution code:
k = int(input())
for i in range(k):
  print("ACL", end='')

Submission status: Accepted

Solution code:
def A():
    K = int(input())
    print('ACL'*K)
def B():
    A,B,C,D = map(int,input().split())
    left = max(A,C)
    right = min(B,D)
    if(left <= right):
        print('Yes')
    else:
        print('No')
A()

Submission status: Accepted

Solution code:
n = int(input())
acl = "ACL" * n
print(acl)

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())


K = I()
ans = ''
for _ in range(K):
    ans += 'ACL'
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
s = ''
for i in range(k):
  s += 'ACL'
print(s)

Submission status: Accepted

Solution code:
a = int(input())
s = ''
for i in range(a):
  s = s+"ACL"
print(s)

Submission status: Accepted

Solution code:
import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
import random
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    K = int(input())
    print("ACL" * K)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
K = int(input())
for _ in range(K):
    print("ACL", end = "")
print()

Submission status: Accepted

Solution code:
k=int(input())
s="ACL"
ans=""
for i in range(k):
  ans+=s
print(ans)

Submission status: Accepted

Solution code:
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    print("ACL" * int(input()))
resolve()

Submission status: Accepted

Solution code:
K=int(input())

print("ACL" * K)

Submission status: Accepted

Solution code:
n=int(input())
k="ACL"
print(n*k)

Submission status: Accepted

Solution code:
N = int(input())

print("ACL"*N)

Submission status: Accepted

Solution code:
n = int(input())
print(n * 'ACL')

Submission status: Accepted

Solution code:
for _ in range(int(input())):
  print("ACL", end="")

Submission status: Accepted

Solution code:
import sys
k = int(sys.stdin.readline().strip())
print('ACL'*k)

Submission status: Accepted

Solution code:
Moji = 'ACL'
K = int(input())
Answer = (Moji * K)
print(Answer)

Submission status: Accepted

Solution code:
K = int(input())
for _ in range(K):
  print("ACL", end="")

Submission status: Accepted

Solution code:
K=int(input())
ans=[]
for i in range(K):
    ans.extend("ACL")
print("".join(ans))

Submission status: Accepted

Solution code:
K = int ( input().strip() ) ;
print ( "ACL" * K ) ;

Submission status: Accepted

Solution code:
k = int(input())
text = "ACL" * k
print(text)

Submission status: Accepted

Solution code:
#ACL-a
K = int(input())

print("ACL"* K)

Submission status: Accepted

Solution code:
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007

#+++++

def main():
	k = int(input())
	#b , c = tin()
	#s = input()
	ret = 'ACL'*k
	return ret
	
	
#+++++
isTest=False

def pa(*vl):
	if not isTest:
		return
	for v in vl:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
n = int(input())
acl = 'ACL'
print(acl*n)

Submission status: Accepted

Solution code:
K = int(input())

acl ='ACL'
ans =''
for i in range(K):
    ans += acl
print(ans)

Submission status: Accepted

Solution code:
k=int(input())
s="ACL"
a=""
for i in range(k):
    a+=s
print(a)

Submission status: Accepted

Solution code:
s = "ACL"
K = int(input())
print(s*K)

Submission status: Accepted

Solution code:
l = int(input())
print(l*"ACL")

Submission status: Accepted

Solution code:
K = int(input())
S = ""
for i in range(K):
    S = S + "ACL"
print(S)

Submission status: Accepted

Solution code:
K = int(input())
Ans = 'ACL'
for i in range(K-1):
    Ans += 'ACL'
print(Ans)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

print('ACL' * int(read()))

Submission status: Accepted

Solution code:
N = int(input())

for i in range(N):
    print('ACL',end='')

Submission status: Accepted

Solution code:
K = int(input())
P = str("ACL")
D = print(P*K)

Submission status: Accepted

Solution code:
K = int(input())
K1 = "ACL"
print(K*K1)

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1] 
for i in range(2, 10**5 + 1):
    fact.append((fact[-1] * i) % Mod)
    inv.append((-inv[Mod % i] * (Mod // i)) % Mod)
    factinv.append((factinv[-1] * inv[-1]) % Mod)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n - r] % p
    
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res
 
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[y] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)
def pow_k(x, n):
 
    if n == 0:
        return 1
 
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2
 
    return K * x
def main():  #startline-------------------------------------------
    print("ACL"*int(input()))

if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

Solution code:
a=int(input())
for _ in range(a):
  print("ACL",end="")

Submission status: Accepted

Solution code:
k=int(input())
o=''
for i in range(k):
    o+='ACL'
print(o)

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    for i in range(k):
        print('ACL', end='')
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
k = int(input())

for i in range(k):
    print("ACL",end = "")