Problem:


Score : 100 points

Problem Statement

This contest, AtCoder Beginner Contest, is abbreviated as ABC.

When we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.

What is the abbreviation for the N-th round of ABC? Write a program to output the answer.

Constraints

100 ≤ N ≤ 999

Input

Input is given from Standard Input in the following format:

N

Output

Print the abbreviation for the N-th round of ABC.

Sample Input 1

100

Sample Output 1

ABC100

The 100th round of ABC is ABC100.

Sample Input 2

425

Sample Output 2

ABC425

Sample Input 3

999

Sample Output 3

ABC999



Sample input:
100


Sample output:
ABC100

Submission status: Wrong Answer

Solution code:
print("ABC",input())

Submission status: Wrong Answer

Solution code:
N = int(input())

i = 1
while i < N:
  i = i*2

if i < N:
  print(i)
else:
  print(i / 2)

Submission status: Wrong Answer

Solution code:
print("ABC", int(input()))

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[]
for n in range(1,N+1,1):
  count=0
  while n%2 == 0:
    count+=1
    n/=2
  a.append(count)

print(a.index(max(a))+1)
print(max(a))

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[]
for n in range(1,N,1):
  count=0
  while n%2 == 0:
    count+=1
    n/=2
  a.append(count)

print(a.index(max(a))+1)
print(max(a))

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = []
for i in range(1, n + 1):
    x = i
    for j in range(100):
        if x % 2 == 0:
            x = int(x // 2)
            #ans.append(j)
        else:
            #ans.append(j)
            break
    ans.append(j)

#print(ans)
print(ans.index(max(ans)) + 1)

Submission status: Wrong Answer

Solution code:
n=int,input()
print('ABC',n,sep="")

Submission status: Wrong Answer

Solution code:
N = input ('iydfcgb.gdcg.kdwgivw.guv')
print ('ABC'+N)

Submission status: Wrong Answer

Solution code:
a = input()
b = ('abc')
c = b + a
print( c )

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
array = [0]*n

for i in range(1, n+1):
  count = 0
  num = i
  while num%2==0:
    count += 1
    num = int(num/2)
  array[i-1] = count
print(1+np.argmax(array))

Submission status: Wrong Answer

Solution code:
N=int(input())

for i in range(1,8):
  if N<2**i:
    print(2**(i-1))
    break

Submission status: Wrong Answer

Solution code:
n = input()

print("ABC" + "n")

Submission status: Wrong Answer

Solution code:
n = int()

print("ABC" + "n")

Submission status: Wrong Answer

Solution code:
s = input()

print("0"*(3-len(s))+s)

Submission status: Wrong Answer

Solution code:
a=int(input())
print("ABC")
print(a)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
for i in range(7):
    if 2**i<=n:ans=2**i
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 1
for i in range(7):
  if 2**i <= n:ans = 2**i
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 1
for i in range(7):
  if 2**i <= n: 
    ans = 2**i
print(ans)

Submission status: Wrong Answer

Solution code:
print('ABC'.format(int(input())))

Submission status: Wrong Answer

Solution code:
N=int(input())
for i in range(6,-1,-1):
  k = 2**i
  if N >= k:
    print(k)
    exit()

Submission status: Wrong Answer

Solution code:
N = int(input())
Num = [int(2**i) for i in range(7)]
if N in Num:
  print(N)
else:
  Num.append(N)
  Num = sorted(Num)
  print(2 ** (Num.index(N) - 1))

Submission status: Wrong Answer

Solution code:
N = int(input())
Num = [int(2**i) for i in range(7)]
Num.append(N)
Num = sorted(Num)
print(2 ** (Num.index(N) - 1))

Submission status: Wrong Answer

Solution code:
N = int(input())
a = 1

while a*2 <= N:
    a *= 2

print(a)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = 2

while a*2 <= N:
    a *= 2

print(a)

Submission status: Wrong Answer

Solution code:
print(input()[2:])

Submission status: Wrong Answer

Solution code:
N=input()
print(N[3:])

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
for i in range(7):
    if 2**i <= N:
        count = 2**i
print(count)

Submission status: Wrong Answer

Solution code:
n = input()
print('abc' + n.zfill(3))

Submission status: Wrong Answer

Solution code:
print('ABC'+input())
print("aiu")

Submission status: Wrong Answer

Solution code:
N=str(input())
print("ABCN")

Submission status: Wrong Answer

Solution code:
N=str(input())
print("ABC"+"N")

Submission status: Wrong Answer

Solution code:
N = int(input())
if N == 1:
    print(1)
    exit()
for i in range(8):
    if 2**i > N:
        print(2**(i-1))
        exit()

Submission status: Wrong Answer

Solution code:
# -*- coding: <encoding name> -*-

n = int(input())
print("ABC" + 'n')

Submission status: Wrong Answer

Solution code:
N = int(input())
s = 1
while s <=N:
  s *= 2
print(s//2)

Submission status: Wrong Answer

Solution code:
list = [64,32,16,8,4,2]
O = int(input())
if O == 1:
    print(1)
    exit()

for num in list:
    if O > num:
        print(num)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())

List = []
for x in range(1,N+1):
  s = 0
  while x % 2 == 0:
    s += 1
    x = x//2
  List.append(s)

t = max(List)
print(2**t)

Submission status: Wrong Answer

Solution code:
N=int(input())

for i in range(7):
    if N>=2**i:
        j=2**i
print(j)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0
for i in range(7):
  if 2 ** i <= N:
    ans = 2 ** i
print(ans)

Submission status: Wrong Answer

Solution code:
number = input('a')
print('ABC' + str(number))

Submission status: Wrong Answer

Solution code:
N=int(input())
n=0
while N>=2**(n+1):
    n+=1
print(2**n)

Submission status: Wrong Answer

Solution code:
n = int(input())
nums = [0, 2, 4, 8, 16, 32, 64]
maxi = 0
for i in nums:
    if i <= n:
        maxi = i
print(maxi)

Submission status: Wrong Answer

Solution code:
N = input()
print("abc{}".format(N))

Submission status: Wrong Answer

Solution code:
k = int(input())
ans = 64
 
while ans > k:
    ans /= 2
    
print(int(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 64
 
while ans > N:
    ans /= 2
    
print(int(ans))

Submission status: Wrong Answer

Solution code:
n=raw_input()
print "ABC+n"

Submission status: Wrong Answer

Solution code:
n=input()
print "ABC+n"

Submission status: Wrong Answer

Solution code:
n = input()
for i in range(6):
  if 2**i <= int(n) and 2**(i+1) > int(n):
    print(2**i)

Submission status: Wrong Answer

Solution code:
A = int(input())
i = 0
while (2 ** i) <= A:
    if 2 ** i == A:
        print(A)
        break
    elif (2 ** i) < A:
        i += 1
        continue
else: print(2 ** (i - 1))

Submission status: Wrong Answer

Solution code:
N = int(input())
while N%2 != 0:
    N -= 1
print(N)

Submission status: Wrong Answer

Solution code:
n=int(input())
from numpy import log
print(pow(2,int(log(n)/log(2))))

Submission status: Wrong Answer

Solution code:
n=input()
print ('ABC',n)

Submission status: Wrong Answer

Solution code:
n=str(input())
a="ABC"
print(n+a)

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(7,-1,-1):
    if n < 2**i:
        pass
    else:
        k=i
        break
print(2**k)

Submission status: Wrong Answer

Solution code:
k=int(input())
if k==0:
  for i in range(50):
    print(49-i,end=" ")
    print()
else:
  a=(k-1)//50
  b=k%50
  if b==0:
    for i in range(50):
      print(50+a-i)
      print()
  else:
    for i in range(50):
      b=b-1
      if b>=0:
        print(50+a-i)
      else:
        print(50+a-i-1)
      if i==49:
        print()

Submission status: Wrong Answer

Solution code:
number=input()

print('ABC'.join(number))

Submission status: Wrong Answer

Solution code:
print('ABC',input())

Submission status: Wrong Answer

Solution code:
N = int(input())
range_N = range(1,N+1) # 1<=M<=100
target = 1
for i in range_N:
  if 2 ** i <= N :
    target = 2 ** i
print(target)

Submission status: Wrong Answer

Solution code:
N = int(input())
range_N = range(1,N+1) # 1<=M<=100
target = 1
for i in range_N:
  if 2 ** 1 <= N :
    target = 2 ** i
print(target)

Submission status: Wrong Answer

Solution code:
# ARC068C - X: Yet Another Die Game (ABC053C)
def main():
    X = int(input())
    ans, r = X // 11 * 2, X % 11  # r: remainder
    ans += 1 if 0 < r <= 6 else 2
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
input = int(input())

input_list = list(range(1, input + 1))

count_list = []

for e in input_list:
    count = 0
    e_tmp = e
    while True:
        if e_tmp % 2 == 0:
            e_tmp = e_tmp/2
            count += 1
        else:
            break
    count_list.append([e, count])

max_value = 0
max_key = 0

for i in range(input):    
    curr_value = int(count_list[i][1])
    if curr_value > max_value:
        max_value = curr_value
        max_key = count_list[i][0]
    
print(max_key)

Submission status: Wrong Answer

Solution code:
a = input()
print("ABC"+"a")

Submission status: Wrong Answer

Solution code:
n = int(input())
nl = list(range(1,n+1))
cl = [0]*(n+1)
mc = 0

for i in range(n):
  while(1):
    if nl[i]%2 == 0 and nl[i] != 0:
      cl[i+1]+=1
      nl[i]/=2
    else:
      if cl[i+1] > cl[mc]:
        mc = i+1
      break
      
print(mc if mc != 0 else 1)

Submission status: Wrong Answer

Solution code:
import math
print(2**math.floor(math.log2(int(input()))))

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = 1
for i in range(n):
    if ans*2 <= n:
        ans = ans*2
    elif ans*2 > n:
        break

print(ans)

Submission status: Wrong Answer

Solution code:

Submission status: Wrong Answer

Solution code:
A = int(input())

ans = 1
while (ans < A):
    ans *= 2

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 1
for i in range(7):
    if 2**i <= n:
        ans = 2**i
print(ans)

Submission status: Wrong Answer

Solution code:
N = input()

print(N[3:])

Submission status: Wrong Answer

Solution code:
k=int(input())
m=k//2
if (k%2==0):
    print(2)
    print(str(m)+" "+str(m+1))
else:
    print(2)
    print(str(m)+" "+str(m+2))

Submission status: Wrong Answer

Solution code:
n=int(input())

x=1

while True:
    if x*2>n:
        print(x)
        break
    else:
        x=x*2

Submission status: Wrong Answer

Solution code:
"ABC"+input()

Submission status: Wrong Answer

Solution code:
n=int(input())

print("ABC"+"n")

Submission status: Wrong Answer

Solution code:
n=input()

print("ABC"+"n")

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = [1, 2, 4, 8, 16, 32, 64]

print(max([i for i in ans if n-i >= 0]))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
num = 0
for i in range(1, N + 1):
    now = i
    cnt = 0
    while i % 2 == 0:
        i /= 2
        cnt += 1
    if cnt >= ans:
        ans = cnt
        num = now
 
print(num)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans = 1
for i in range(1,N):
    tmp_count = 0
    tmp_i = i
    while(tmp_i%2==0):
        tmp_count+=1
        tmp_i /= 2
    if count < tmp_count:
        count = tmp_count
        ans = i
print(ans)

Submission status: Wrong Answer

Solution code:
0

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(6,-1,-1):
  if 2**i<=n:
    print(2**i)
    break

Submission status: Wrong Answer

Solution code:
n=input()
print("ABC",n)

Submission status: Wrong Answer

Solution code:
n=int(input())
print("ABC",n)

Submission status: Wrong Answer

Solution code:
n=str(input())
print("ABC",n)

Submission status: Wrong Answer

Solution code:
N=int,input()
print("ABC"+str(N))

Submission status: Wrong Answer

Solution code:
from sys import stdin
n = stdin.readline().rstrip()
print('A'+n)

Submission status: Wrong Answer

Solution code:
N=int(input())
count=[0]*N
for i in range(1,N+1):
  SHOU=i
  while True:
    AMARI=SHOU%2
    SHOU=SHOU//2
    if AMARI==0:
      count[i-1]+=1
    else:
      break
print(1+count.index(max(count)))

Submission status: Wrong Answer

Solution code:
N = int(input())

nList = [i + 1 for i in range(N)]
res = -1
for n in nList :
    count = 0
    buf = n
    while buf % 2 == 0 :
        count += 1
        buf = buf / 2
    if res < count :
        res = n
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
count = 0
currCount = 0
ans = 0
for i in range(n+1):
    currCount = 0
    currNum = i
    while (i % 2) == 0:
        if i == 0:
            break
        i = int(i / 2)
        currCount += 1
    if count < currCount:
        count = currCount
        ans = currNum
print(ans, count)

Submission status: Wrong Answer

Solution code:
N = int(input())
power = [64,32,16,8,4,2,1]
for i in power:
  if N >= i:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
print("ABC",int(input()))

Submission status: Wrong Answer

Solution code:
# N が3桁固定なので、単純に連結するだけでもよい
# N = input()
# print("ABC"+N)

N = int(input())
print("{:03d}".format(N))

Submission status: Wrong Answer

Solution code:
N = int(input())
if(N == 1):
	answer = 1
else:
	answer = 0
max_count = 0
for val in range(N+1):
    tmp = val
    count = 0
    while (tmp % 2 == 0):
        if(tmp == 0):
            break
        tmp /= 2
        count += 1
    if(max_count < count):
        answer = val
        max_count = count

print(answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
answer = 0
max_count = 0
for val in range(N+1):
    tmp = val
    count = 0
    while (tmp % 2 == 0):
        if(tmp == 0):
            break
        tmp /= 2
        count += 1
    if(max_count < count):
        answer = val
        max_count = count

print(answer)

Submission status: Wrong Answer

Solution code:
input_val = int(input())
answer = 0
max_count = 0
for val in range(input_val+1):
    tmp = val
    count = 0
    while (tmp % 2 == 0):
        if(tmp == 0):
            break
        tmp /= 2
        count += 1
    if(max_count < count):
        answer = val
        max_count = count

print(answer)

Submission status: Wrong Answer

Solution code:
input_val = int(input())
answer = 0
max_count = 0
for val in range(input_val+1):
    tmp = val
    count = 0
    while (tmp % 2 == 0):
        if(tmp == 0):
          break
        tmp /= 2
        count += 1
    if(max_count < count):
        answer = val
        max_count = count

print(answer)

Submission status: Wrong Answer

Solution code:
input_val = int(input())
answer = 0
max_count = 0
for val in range(input_val):
    tmp = val
    count = 0
    while (tmp % 2 == 1):
        tmp /= 2
        count += 1
    if(max_count < count):
        answer = val
        max_count = count

print(answer)

Submission status: Wrong Answer

Solution code:
print(2**(len(bin(int(input())))-3))

Submission status: Wrong Answer

Solution code:
N = int(input())
if N < 100:
    ans = '0' + str(N) + 'ABC'
else:
    ans = str(N) + 'ABC'
print(ans)

Submission status: Wrong Answer

Solution code:
str=input();
print ("ABC", str)
print('\n')

Submission status: Wrong Answer

Solution code:
N = int(input())

print("ABC" + "N")

Submission status: Wrong Answer

Solution code:
N = input()

print("ABC" + "N")

Submission status: Wrong Answer

Solution code:
s = raw_input()
print('ABD%s' % s)

Submission status: Wrong Answer

Solution code:
print("ABC" if 1<=int(input())<=999 else "ABD")

Submission status: Wrong Answer

Solution code:
N = int(input())

now = 1
while(True):
    if now>N:
        print(now/2)
        break
    else:
        now *= 2

Submission status: Wrong Answer

Solution code:
def ABC(N):
  return "ABC"+str(N)

def main():
  N = input()
  ABC(N)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n=input()
print("ABC"+n[1:])

Submission status: Wrong Answer

Solution code:
N = int(input())
maxv = 0
ans = 1
for i in range(N, 0, -1):
    if i % 2:
        continue
    tmp = 0
    tmpv = i
    while i % 2 == 0:
        tmp += 1
        i = i // 2
    if tmp > maxv:
        maxv = tmp
        ans = tmpv
print(ans)

Submission status: Wrong Answer

Solution code:
print("ABC", input())

Submission status: Wrong Answer

Solution code:
a=input()
print('ABC')
print(a)

Submission status: Wrong Answer

Solution code:
x=int(input())
n=str(bin(x))
2**(len(n)-3)

Submission status: Wrong Answer

Solution code:
x=int(input())
n=str(bin(x))
print(2**(len(n)-3))

Submission status: Wrong Answer

Solution code:
x=int(input())
n=str(bin(x))
print(len(n)-3)

Submission status: Wrong Answer

Solution code:
x=int(input())
n=str(bin(x))
print(len(n)-3)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = 0
while True:
    if N < 2**p:
        print(2**(p-1))
        break
    else:
        p=p+1

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys

def main():

    n, m = sys.stdin.readline().strip().split(" ")

    n = int(n)
    m = int(m)
    vis = list(map(lambda _: False, list(range(m+1))))

    ans = False

    for i in range(m):
        a, b = sys.stdin.readline().strip().split(" ")
        a = int(a)
        b = int(b)

        if (a == 1):
            if (vis[b] == True):
                ans = True
            else:
                vis[b] = True
        elif (b == n):
            if (vis[a] == True):
                    ans = True
            else:
                    vis[a] = True;



    if (not ans):
        sys.stdout.write("IMPOSSIBLE\n")

    else:
        sys.stdout.write("POSSIBLE\n")

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys

def main():

    n, m = sys.stdin.readline().strip().split(" ")

    n = int(n)
    m = int(m)
    vis = list(map(lambda _: False, list(range(m+1))))

    ans = False

    for i in range(m):
        a, b = sys.stdin.readline().strip().split(" ")
        a = int(a)
        b = int(b)

        if (a == 1):
            if (vis[b] == True):
                ans = True
            else:
                vis[b] = True
        elif (b == n):
            if (vis[a] == True):
                    ans = True
            else:
                    vis[a] = True;
                
        

    if (not ans):
        print ("IMPOSSIBLE")
    
    else:
        print ("POSSIBLE")

Submission status: Wrong Answer

Solution code:
import sys

def main():

    n = sys.stdin.readline().strip()
    m = sys.stdin.readline().strip()

    n = int(n)
    m = int(m)
    vis = map(lambda _: False, list(range(m+1)))

    ans = False

    for i in range(m):
        a = sys.stdin.readline().strip()
        b = sys.stdin.readline().strip()
        a = int(a)
        b = int(b)

        if (a == 1):
            if (vis[b] == True):
                ans = True
            else:
                vis[b] = True
        elif (b == n):
            if (vis[a] == True):
                    ans = True
            else:
                    vis[a] = True;
                
        

    if (not ans):
        print ("IMPOSSIBLE")
    
    else:
        print ("POSSIBLE")

Submission status: Wrong Answer

Solution code:
#!/usr/bin
# -*- coding="utf-8" -*-
 
n = int(input())
if n >= 64:
  a = 64
elif n >= 32:
  a = 32
elif n >= 16:
  a = 16
elif n >= 8:
  a= 8
elif n >= 4:
  a = 4
elif n >= 2:
  a = 2
else:
  a = 1
print(a)

Submission status: Wrong Answer

Solution code:
N = int(raw_input())
data = [1, 2, 4, 8, 16, 32, 64]
print max([d for d in data if d <= N])

Submission status: Wrong Answer

Solution code:
def add(n):
    return n-1
K=int(input())
N=K%50
a=[]
if K==0 :
    a=[3,3,3,3]
for i in range(N):
    a.append(i+1)
for i in range(N):
    a=list(map(add,a))
    b=a.index(min(a))
    a[b]+=N+1
print(N)
print(" ".join(map(str,a)))

Submission status: Wrong Answer

Solution code:
N = int(input())


if 63 < N :
  print (64)
elif 31 < N:
  print (32)
elif 15 < N:
  print (16)
elif 7 < N:
  print (8)
elif 3 < N:
  print (4)
elif 1 < N:
  print (2)
else :
  print (1)

Submission status: Wrong Answer

Solution code:
N = int(input())
print ('ABC %d' %N)

Submission status: Wrong Answer

Solution code:
N = int(input())
score = 0
ans = 0

for i in range(N,0,-1):
    s = i
    c=0
    while (i % 2 == 0) :
        i /= 2
        c += 1
    if score < c:
        score = c
        ans = s
    #カウントが更新されたらスコア配列に格納
print(ans)

Submission status: Wrong Answer

Solution code:
K = int(input())
if K % 2 == 0:
  print(2)
  print("{0} {1}".format((K)//2 + 1, K//2 + 1))
else:
  print(2)
  print("{0} {1}".format((K)//2 - 1, (K)//2))

Submission status: Wrong Answer

Solution code:
K = int(input())
print(2)
print(0, K + 1)

Submission status: Wrong Answer

Solution code:
import math
N=int(input())
L=int(math.log(N,2))
print(2**L)

Submission status: Wrong Answer

Solution code:
# encoding:utf-8

def main():
	k = int(input())
	k = 0
	n = 50
	div = k // n
	res = k % n

	temp = [i for i in range(n)]
	temp = [temp[i] + (i >= (50 - res)) + div for i in range(n)]

	out = [str(x) for x in temp]
	print(n)
	print(" ".join(out))

	#print(calc(temp))

def calc(temp):
	i = 0
	while len([x for x in temp if x >= len(temp)]) > 0:
		temp = query(temp)
		#print([x for x in temp if x >= len(temp)])
		i += 1
	return i

def query(temp):
	temp.sort()
	temp = [x + 1 for x in temp]
	temp[-1] = temp[-1] - 1 - len(temp)
	return temp

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*
n = int(raw_input())
count2 = 0
num2 = 0
if n == 1:
    num2 = 1

for i in range(1,n+1):
    count = 0
    quo,rem = divmod(i,2)
    while rem == 0:
        count += 1
        quo,rem = divmod(quo,2)
        if quo == 0:
            break;
    if count2 < count:
        count2 = count
        num2 = i

print str(num2)

Submission status: Wrong Answer

Solution code:
use = int(input())

best_number = 0
maximum = 0
t = 0

for i in range(2,use+1,2):
    n = i
    while n % 2 == 0:
        n /= 2
        t += 1

    if t > maximum:
        maximum = t
        best_number = i
    t = 0
print(best_number)

Submission status: Wrong Answer

Solution code:
f = len("{0:b}".format(int(input()))) - 1
a = '1' + '0' * f

print(int(a, 2))

Submission status: Wrong Answer

Solution code:
N = int(input())

rc = 1
max = 0

for x in range(2, N + 1):
    r = x
    if x & 1 == 1:
        continue

    count = 0
    while x & 1 != 1:
        x = x >> 1
        count += 1

    if count > max:
        max = count
        rc = r

print(rc)

Submission status: Wrong Answer

Solution code:
num = int(input())
print("ABC%03d".format(num))

Submission status: Wrong Answer

Solution code:
n = int(input())
two = 1
while True:
    if two * 2 > n:
        break
    two *= 2
print(two)

Submission status: Wrong Answer

Solution code:
N = input()

print('ABC',N)

Submission status: Wrong Answer

Solution code:
n = map(int, raw_input().split())

print "ABC%s" % n

Submission status: Wrong Answer

Solution code:
N=int(input())
a = 1
while a <= N:
    a *= 2

print (int(a/2))

Submission status: Wrong Answer

Solution code:
n = map(int, raw_input().split())

print ("ABC%s" % n)

Submission status: Wrong Answer

Solution code:
print("abc"+input())

Submission status: Wrong Answer

Solution code:
N = input()
print(N[3:])

Submission status: Accepted

Solution code:
N = input()
print('ABC' + N)

Submission status: Accepted

Solution code:
N = input()
print('ABC'+N)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.buffer.readline
in_n = lambda: int(input())
in_nn = lambda: map(int, input().split())
in_s = lambda: input().rstrip().decode('utf-8')
in_map = lambda: [s == ord('.') for s in input() if s != ord('\n')]

MOD = 10**9 + 7
INF = 8 * 10**18


def main():

    print("ABC" + in_s())


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print("ABC"+input())

Submission status: Accepted

Solution code:
x =input()
print("ABC"+x)

Submission status: Accepted

Solution code:
s = input()

print('ABC'+s)

Submission status: Accepted

Solution code:
print("ABC" + str(input()))

Submission status: Accepted

Solution code:
N = input()
print("ABC"+N)

Submission status: Accepted

Solution code:
s = input()
print('ABC' + s)

Submission status: Accepted

Solution code:
n = str(input())
print("ABC" + n)

Submission status: Accepted

Solution code:
# A - ABCxxx
def main():
    n = input()

    print('ABC'+n)


if __name__ ==  "__main__":
    main()

Submission status: Accepted

Solution code:
print("ABC"+str(input()))

Submission status: Accepted

Solution code:
N = str(input())
print('ABC' + N)

Submission status: Accepted

Solution code:
n=input()
print('ABC'+n)

Submission status: Accepted

Solution code:
print('ABC' + input())

Submission status: Accepted

Solution code:
N=input()
print("ABC"+N)

Submission status: Accepted

Solution code:
print("ABC" + input())

Submission status: Accepted

Solution code:
N = int(input())

print("ABC{:03d}".format(N))

Submission status: Accepted

Solution code:
n = input()
print('ABC' + n)

Submission status: Accepted

Solution code:
n = int(input())

ans = "{}{}".format("ABC",n)
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
print(f'ABC{n:0>3}')

Submission status: Accepted

Solution code:
print("ABC"+input())

Submission status: Accepted

Solution code:
n = int(input())

print('ABC' + str(n))

Submission status: Accepted

Solution code:
a = int(input())
print('ABC' + str(a))

Submission status: Accepted

Solution code:
N=input()
print('ABC'+N)

Submission status: Accepted

Solution code:
n=input()
print("ABC"+n)

Submission status: Accepted

Solution code:
s = input()
print("ABC"+s)

Submission status: Accepted

Solution code:
print(input("ABC"))

Submission status: Accepted

Solution code:
a = input()
print("ABC" + a)

Submission status: Accepted

Solution code:
N = input()
print("ABC" + N)

Submission status: Accepted

Solution code:
n = input()
print("ABC" + n)

Submission status: Accepted

Solution code:
print('ABC'+input())

Submission status: Accepted

Solution code:
def main():
    n = input()
    print("ABC" + n)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
count_of_contest = int(input())

print('{}{}'.format('ABC', count_of_contest))

Submission status: Accepted

Solution code:
N=input()
res="ABC"+N
print(res)

Submission status: Accepted

Solution code:
#
# abc068 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """100"""
        output = """ABC100"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """425"""
        output = """ABC425"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """999"""
        output = """ABC999"""
        self.assertIO(input, output)


def resolve():
    print("ABC" + input())


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
n = input()
print("ABC" + n )

Submission status: Accepted

Solution code:
n = str(input())
print("ABC"+n)

Submission status: Accepted

Solution code:
n = input()
print("ABC"+n)

Submission status: Accepted

Solution code:
print(f"ABC{input()}")

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" + str(n))

Submission status: Accepted

Solution code:
n=str(input())
print("ABC"+n)

Submission status: Accepted

Solution code:
print("ABC"+ input())

Submission status: Accepted

Solution code:
n = int(input())
print('ABC', n, sep='')

Submission status: Accepted

Solution code:
N = list(input())
if len(N)==1:
    N = ["0","0"]+N
if len(N)==2:
    N = ["0"]+N
print("ABC"+"".join(N))

Submission status: Accepted

Solution code:
N=input()
print("ABC"+N)

Submission status: Accepted

Solution code:
n = str(input())
print('ABC' + n)

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
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 lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    print('ABC' + str(n))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print('ABC'+S())

Submission status: Accepted

Solution code:
N = int(input())
print(f"ABC{N}")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

print('ABC'+input())

Submission status: Accepted

Solution code:
import sys

N = sys.stdin.readline().strip()
print("ABC" + N)

Submission status: Accepted

Solution code:
print(f'ABC{input()}')

Submission status: Accepted

Solution code:
N = input()
print("ABC"+N)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

N = S()
print('ABC'+N)

Submission status: Accepted

Solution code:
n=int(input())
print('ABC'+str(n))

Submission status: Accepted

Solution code:
n = input()
print("ABC"+n)

Submission status: Accepted

Solution code:
print("ABC{}".format(input()))

Submission status: Accepted

Solution code:
print('ABC{}'.format(input()))

Submission status: Accepted

Solution code:
N = input()

print("ABC" + N)

Submission status: Accepted

Solution code:
N = int(input())


print("ABC", N, sep="")

Submission status: Accepted

Solution code:
print("ABC"+input().strip())

Submission status: Accepted

Solution code:
n=input()
ans = 'ABC'+n
print(ans)

Submission status: Accepted

Solution code:
n = input()
print("ABC" + n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input ()
print ('ABC'+N)

Submission status: Accepted

Solution code:
a=input()
print("ABC"+a)

Submission status: Accepted

Solution code:
n = input()
print('ABC'+n)

Submission status: Accepted

Solution code:
N = input()
ans = "ABC" + N
print(ans)