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: Wrong Answer

Solution code:
x=3
if 1<=int(x)<=5:
  print("ACL"*int(x))

Submission status: Wrong Answer

Solution code:
x=input("整数を入力してください：")
if 1<=int(x)<=5:
  print("ACL"*int(x))

Submission status: Wrong Answer

Solution code:
k=int(input())
k+=1
o=''
a='ALC'
if k==1:
  print('')
  exit()
else:
  for i in range(1,k):
  	o=o+a
print(o)

Submission status: Wrong Answer

Solution code:
K=int(input())
K+=1
o=''
a='ALC'
for i in range(1,K):
  o=o+a
print(o)

Submission status: Wrong Answer

Solution code:
n = int(input())

print("ALC"*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
for i in range(a-1):
  print("ACL")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=3
ACL='ACL'
words =''
for w in range(K):
    words += ACL
else :
    print (words)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=int(input())

for i in range(K):
  print("ACL")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

ans = "ACL" * 5

print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input('K'))
if a==1:
 print('ACL')
elif a==2:
 print('ACL'*2)
elif a==3:
 print('ACL'*3)
elif a==4:
 print('ACL'*4)
else:
 print('ACL'*5)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

print("ACL" * 3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = input()

if K == 1:
    print("ACL")
elif K == 2:
    print("ACLACL")
elif K == 3:
    print("ACLACLACL")
elif K == 4:
    print("ACLACLACLACL")
else:
    print("ACLACLACLACLACL")

Submission status: Wrong Answer

Solution code:
x = int(input())

if(x < 1 or x > 5):
  print("")
else:
  for i in range(x):
    print("ACK",end='')

Submission status: Wrong Answer

Solution code:
x = int(input())

if(x < 1 or x > 5):
  print("")
else:
  for i in range(x):
    print("ACK")

Submission status: Wrong Answer

Solution code:
for i in range(int(input())): print('ACL')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def solve():
   return 'ALC'*int(input())

if __name__ == '__main__':
    print(solve())

Submission status: Wrong Answer

Solution code:
k=int(input())
list=[str("ALK")]*k
ans = str()
for i in range(k):
  ans = ans+str(list[i])
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=int (input("整数"))
Alist=[]
if (K==1):
  print("ACL")
elif (K==2):
  print("ACLACL")
elif (K==3):
  print("ACLACLACL")
elif (K==4):
  print("ACLACLACLACL")
elif (K==5):
  print("ACLACLACLACLACL")
else:
  print("----")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
k = input()

str = ""
for i in range(int(k)):
  str += "ALC"
 
print(str)

Submission status: Wrong Answer

Solution code:
K=3
spam='ACL'
print(spam*K)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())
print(k)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n==1:
  print('AC')
if n==2:
  print('ACLACL')
if n==3:
  print('ACLACLACL')
if n==4:
  print('ACLACLACLACL')
if n==5:
  print('ACLACLACLACLACL')

Submission status: Wrong Answer

Solution code:
input = int(input())

for i in range(input):
  print("ACL")

Submission status: Wrong Answer

Solution code:
num = int(input())

print('ALC'*num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
print(S*3)

Submission status: Wrong Answer

Solution code:
def solve():
    K = int(input())

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


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
#a
k=int(input())
ans=[]
for i in range(k):
    ans.append('acl')
a=''.join(ans)
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())

a = ""

for i in range(K):
    a += "ALT"

print("{}".format(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = int(input())
str = 'ACL'
str = str*3
print(str)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math


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


def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))


def S(): return sys.stdin.readline().rstrip()


def LS(): return list(sys.stdin.readline().rstrip().split())


def main():
    K = I()

    ans = ""

    for i in range(K):
        ans+="ALC"
    
    print(ans)

    


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(input().strip()*3)

Submission status: Wrong Answer

Solution code:
k=input()
print(k*len(k))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(X*3)

Submission status: Wrong Answer

Solution code:
print(input()*3)

Submission status: Time Limit Exceeded

Solution code:
import sys
readline = sys.stdin.readline
from collections import Counter, deque
from time import time


#from submission 17076021
MOD = 998244353
ROOT = 3
roots  = [pow(ROOT,(MOD-1)>>i,MOD) for i in range(24)] # 1 の 2^i 乗根
iroots = [pow(x,MOD-2,MOD) for x in roots] # 1 の 2^i 乗根の逆元
 
def untt(a,n):
    for i in range(n):
        m = 1<<(n-i-1)
        for s in range(1<<i):
            w_N = 1
            s *= m*2
            for p in range(m):
                a[s+p], a[s+p+m] = (a[s+p]+a[s+p+m])%MOD, (a[s+p]-a[s+p+m])*w_N%MOD
                w_N = w_N*roots[n-i]%MOD
 
def iuntt(a,n):
    for i in range(n):
        m = 1<<i
        for s in range(1<<(n-i-1)):
            w_N = 1
            s *= m*2
            for p in range(m):
                a[s+p], a[s+p+m] = (a[s+p]+a[s+p+m]*w_N)%MOD, (a[s+p]-a[s+p+m]*w_N)%MOD
                w_N = w_N*iroots[i+1]%MOD
            
    inv = pow((MOD+1)//2,n,MOD)
    for i in range(1<<n):
        a[i] = a[i]*inv%MOD
 
def convolution(a,b):
    la = len(a)
    lb = len(b)
    deg = la+lb-2
    n = deg.bit_length()
    if min(la, lb) <= 50:
        if la < lb:
            la,lb = lb,la
            a,b = b,a
        res = [0]*(la+lb-1)
        for i in range(la):
            for j in range(lb):
                res[i+j] += a[i]*b[j]
                res[i+j] %= MOD
        return res
 
    N = 1<<n
    a += [0]*(N-len(a))
    b += [0]*(N-len(b))
    untt(a,n)
    untt(b,n)
    for i in range(N):
      a[i] = a[i]*b[i]%MOD
    iuntt(a,n)
    return a[:deg+1]

def convolution_all(polys):
    if not polys: return [1]
    polys.sort(key=lambda x:len(x))
 
    from collections import deque
    q = deque(polys)
    for _ in range(len(polys)-1):
        a = q.popleft()
        b = q.popleft()
        q.append(convolution(a,b))
    return q[0]    

def frac(limit):
    frac = [1]*limit
    for i in range(2,limit):
        frac[i] = i * frac[i-1]%MOD
    fraci = [None]*limit
    fraci[-1] = pow(frac[-1], MOD -2, MOD)
    for i in range(-2, -limit-1, -1):
        fraci[i] = fraci[i+1] * (limit + i + 1) % MOD
    return frac, fraci
frac, fraci = frac(1341398)
def comb(a, b):
    if not a >= b >= 0:
        return 0
    return frac[a]*fraci[b]*fraci[a-b]%MOD

def calc(c):
    res = [0]*(c//2 + 1)
    for i in range(c//2 + 1):
        res[i] = comb(c, 2*i)*frac[2*i]*fraci[i]%MOD
    return res
  
  
tt = time()
Ch = [10]*10000
Q = []
for c in Ch:
    Q.append(calc(c))
print(Q == [[1, 90, 2520, 25200, 75600, 30240] for _ in range(10000)])
#Q = [[1, 90, 2520, 25200, 75600, 30240] for _ in range(10000)]
print(time()-tt)
res = convolution_all(Q)
print(time()-tt)

Submission status: Accepted

Solution code:
K = int(input())
if K == 1:
    print("ACL")
elif K == 2:
    print("ACLACL")
elif K == 3:
    print("ACLACLACL")
elif K == 4:
    print("ACLACLACLACL")
elif K == 5:
    print("ACLACLACLACLACL")

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())
for i in range(K):
  print("ACL",end="")
print("")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
k+=1
o=''
a='ACL'
if k==1:
  print('')
  exit()
else:
  for i in range(1,k):
  	o=o+a
print(o)

Submission status: Accepted

Solution code:
k = int(input())

s = 'ACL' * k

print(s)

Submission status: Accepted

Solution code:
k = int(input())

s = ""

for _ in range(k):
    s += "ACL"

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
kazu = input()
kazu = int(kazu)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print("ACL"*n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
	k=int(input())
	r=''
	for i in range(k):
		r+='ACL'
	return r

print(solve())

Submission status: Accepted

Solution code:
print(''.join(map(str, ["ACL" for _ in range(int(input()))])))

Submission status: Accepted

Solution code:
k=int(input())
l=['ACL']*k
print(*l,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

def solve():
    k = II()
    print('ACL' * k)

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
e="ACL"
et=""
for i in range(k):
  et+=e
print(et)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
ans = ""
for _ in range(K):
    ans += "ACL"

print(ans)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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

if __name__ == '__main__':
    main()

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())
lista=[]
palavra='ACL'
for x in range(k):
    lista.append(palavra)
print(''.join(lista))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

for _ in range(x):
	print("ACL", end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
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

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

Submission status: Accepted

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

K = int(readline())

A = "ACL"
ans = ""
while K:
  if K & 1:
    ans += A
  A *= 2
  K >>= 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

res = ''
while(k >= 1):
    res += 'ACL'
    k -= 1
print(res)

Submission status: Accepted

Solution code:
k = int(input())

ans = ""

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

print(ans)

Submission status: Accepted

Solution code:
N, = map(int, input().split())
print("ACL"*N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print(n*"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:
# -*- coding utf-8 -*-

MOD = 10 ** 9 + 7

K = int(input())

print('ACL' * K)

Submission status: Accepted

Solution code:
k = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
K = int(a)

x = 'ACL'

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

Submission status: Accepted

Solution code:
k = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
ans = ''
for i in range(k):
    ans += 'ACL'
print(ans)

Submission status: Accepted

Solution code:
K = int(input())

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

print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
readline = stdin.readline
def i_input(): return int(readline().rstrip())
def i_map(): return map(int, readline().rstrip().split())
def i_list(): return list(i_map())

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
print('ACL'*K)

Submission status: Accepted

Solution code:
k = int(input())
ans=[]
for i in range(k):
  ans.append("ACL")

print("".join(ans))

Submission status: Accepted

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

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())
print("ACL"*k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/python3

k = int(input())
print('ACL'*k)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    k = II()
    ans = ""
    for i in range(k):
        ans += "ACL"

    print(ans)


main()

Submission status: Accepted

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  k=I()
  return 'ACL'*k

# main()
print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K=int(input())
A=[]
for i in range(K):
    A.append('ACL')

print(''.join(A))

Submission status: Accepted

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

Submission status: Accepted

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


def solve(K: str):
    T=[]
    for i in range(int(K)):
        T.append('ACL')
    T = "".join(T)
    return print(T)


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = next(tokens)  # type: str
    solve(K)

if __name__ == '__main__':
    main()

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())
S="ACL"
K-=1
while K>0:
  S = S+"ACL"
  K-=1
print(S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
words =''
for w in range(K):
    words += 'ACL'
else:
    print(words)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
a = []
for i in range(k):
    a.append("ACL")
ans = ''.join(a)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    K = int(input())
    print('ACL' * K)
    
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a = input()
str = ""
for i in range(0,int(a)):
  str = str + "ACL"
print(str)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
#from queue import *
import random
#sys.setrecursionlimit(int(1e6))
input = sys.stdin.readline
 
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
    return(int(input()))
def inara():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
################################################################
############ ---- THE ACTUAL CODE STARTS BELOW ---- ############

n=inp()
print("ACL"*n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print("ACL" * N)

Submission status: Accepted

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

Submission status: Accepted

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

print(a*k)

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    K=I()
    print("ACL"*K)

main()

Submission status: Accepted

Solution code:
K = int(input())

print('ACL'*K)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print("".join(["ACL" for i in range(n)]))

Submission status: Accepted

Solution code:
n=int(input())

output=''
for _ in range(n):
  output+='ACL'
  
print(output)

Submission status: Accepted

Solution code:
K = int(input().rstrip())

print("ACL" * K)

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())

print (k*str("ACL"))

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
k = I()
print('ACL'*k)

Submission status: Accepted

Solution code:
# A - Repeat ACL

k = int(input())
ans = 'ACL' * k
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
c = ''

for i in range(1,K+1):
    c += 'ACL'

print(c)

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())
ans = 'ACL'*K
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


K = int(input())

for i in range(K):
    sys.stdout.write("ACL")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
L = []
for i in range(K):
  L += ['A', 'C', 'L']
print(''.join(L))

Submission status: Accepted

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