Problem:


Score : 100 points

Problem Statement

Decades have passed since the beginning of AtCoder Beginner Contest.

The contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?

In the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.

You are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.

Constraints

1 \leq N \leq 1998

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.

Sample Input 1

999

Sample Output 1

ABC

The 999-th round of AtCoder Beginner Contest is labeled as ABC999.

Sample Input 2

1000

Sample Output 2

ABD

The 1000-th round of AtCoder Beginner Contest is labeled as ABD001.

Sample Input 3

1481

Sample Output 3

ABD

The 1481-th round of AtCoder Beginner Contest is labeled as ABD482.



Sample input:
999


Sample output:
ABC

Submission status: Accepted

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

def main():
    N = int(input())
    if N >= 1000:
        print('ABD')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
if a < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

if N<=999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

N = int(input())

if N>999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
print(['ABC', 'ABD'][len(input())==4])

Submission status: Accepted

Solution code:
print('ABD' if int(input())>=1000 else 'ABC')

Submission status: Accepted

Solution code:
N = int(input())

if N < 1000:
  s = "ABC"
else:
  s = "ABD"

print(s)

Submission status: Accepted

Solution code:
n = int(input())

print("ABC" if n <= 999 else "ABD")

Submission status: Accepted

Solution code:
# ABC 099: A – ABD
n = int(input())
print('ABC' if n < 1000 else 'ABD')

Submission status: Accepted

Solution code:
N = int(input())
if N < 1000: print("ABC")
else: print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
ans = 'ABC' if N<1000 else 'ABD'
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

if n > 999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
N = int(input())

if N <= 999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
import itertools
def main():
  n = int(input())
  print("ABC"if n<=999 else "ABD")
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
print(["ABC","ABD"][len(input())==4])

Submission status: Accepted

Solution code:
n = int(input())
if n <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

print("ABD" if n >= 1000 else "ABC")

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    ans = 'ABD' if n >= 1000 else 'ABC'
    print(ans)  

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    if a[0] >999:
        print("ABD")
    else:
        print("ABC")

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
# print(N)
if N >= 1000:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
N = int(input())

if N <= 999:
	print("ABC")
elif 1000 <= N  <= 1998:
	print("ABD")

Submission status: Accepted

Solution code:
print("AB"+("C"if int(input())<1000else"D"))

Submission status: Accepted

Solution code:
n = int(input())

if n < 100:
    result = "ABC"# + "00" + str(n)
elif n > 999:
    n = n - 999
    result = "ABD" #+ str(n)
else:
    result = "ABC" #+ str(n)

print(result)

Submission status: Accepted

Solution code:
n=int(input())
if n<=999:print('ABC')
else:print('ABD')

Submission status: Accepted

Solution code:
def ABD(n):

    return "ABC" if n / 1000 < 1 else "ABD"

def main():
    n = int(input())
    print(ABD(n))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
if a >= 1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
N = int(input())
ans = 'ABC' if N < 1000 else 'ABD'
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

if N <1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
print('ABC' if N<=999 else'ABD')

Submission status: Accepted

Solution code:
N = int(input())
if N<=999:
  print('ABC')
elif N>=1000:
  print('ABD')

Submission status: Accepted

Solution code:
print('AB'+'DC'[int(input())<1000])

Submission status: Accepted

Solution code:
n = int(input())
if n >= 1000:
    ans = "ABD"
else:
    ans = "ABC"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.buffer.readline().rstrip())
    print('ABC' if N <= 999 else 'ABD')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
if n<1000:print('ABC')
else:print('ABD')

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n <= 999:
        ans = "ABC"
    else:
        ans = "ABD"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())

# def adjust(n):
#     if n < 10:
#         return '00' + str(n)
#     elif n < 100:
#         return '0' + str(n)
#     else:
#         return str(n)

if n < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if n > 999:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:

n = int(input())
if n <= 999:
  answer = "ABC"
else:
  answer = "ABD"
print(answer)

Submission status: Accepted

Solution code:
n=int(input())

print("ABC" if n<=999 else"ABD")

Submission status: Accepted

Solution code:
# | Its_Rashid | #
a = int(input())
print('ABC' if a < 1000 else 'ABD')

Submission status: Accepted

Solution code:
n = int(input())
print("ABD") if n>999 else print("ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

if n<1000:
        print("ABC")
else:
        print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N <= 999:
    ans = 'ABC'
else:
    ans = 'ABD'

print(ans)

Submission status: Accepted

Solution code:
print("ABD" if int(input())//1000 else "ABC")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N =int(input())
if N < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n=input()
if int(n)<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
a = int(input())
if a <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
#abc099 a
n=int(input())
if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
a = int(input())
print('ABC') if a < 1000 else print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000: print("ABC")
else: print("ABD")

Submission status: Accepted

Solution code:
#pypyは内包表記使わない, rstrip注意
#提出前に見返すこと！
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 1000000007

    N = int(input())
    if N<=999:
        print('ABC')
    else:
        print('ABD')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    n = int(input())

    if n <= 999:
        print('ABC')
    else:
        print('ABD')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=int(input())
if 1998>=N>=1000:
  print('ABD')
elif 999>=N>=1:
  print('ABC')

Submission status: Accepted

Solution code:
print('ABD') if int(input()) >= 1000 else print('ABC')

Submission status: Accepted

Solution code:
N = int(input())

if N >= 1 and N <= 999:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
print("ABC" if (int(input())<1000) else "ABD")

Submission status: Accepted

Solution code:
x=int(input())
if x>999:
	print('ABD')
else:
	print('ABC')

Submission status: Accepted

Solution code:
# A - ABD
n=int(input())
if n>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
if (n > 999):
	print("ABD")
else:
	print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
if n>=1000:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:
A = int(input())
if A <1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    n = int(input())
    if n < 1000:
        print("ABC")
    else:
        print("ABD")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=int(input())
if N>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n=int(input())
if n>=1000:
	print('ABD')
else:
	print('ABC')

Submission status: Accepted

Solution code:
N=int(input())
if N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

a = 'ABC'
b = 'ABD'

if n >= 1000:
    print(b)
else:
    print(a)

Submission status: Accepted

Solution code:
N=int(input())
if N>999:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())

if N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
#099_A
n=int(input())
print('AB'+'CD'[n//1000])

Submission status: Accepted

Solution code:
a=int(input())

if a<1000:
  print("ABC")
else :
  print("ABD")

Submission status: Accepted

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

n = int(input().strip())

print( "ABC" if n <= 999 else "ABD" )

Submission status: Accepted

Solution code:
n = int(input())
if n >= 1000:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
print('ABC' if 1 <= n < 1000 else 'ABD')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
if x < 1000:
    print "ABC"
if x > 999:
    print "ABD"

Submission status: Accepted

Solution code:
n=input()
if n<1000: 
  print "ABC" 
elif n < 1999:
  print "ABD"

Submission status: Accepted

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

if (N <= 999):
	print("ABC")
else:
	print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: stdin.readline().split()

n = ni()

if n < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())

if N <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
    *a,=map(int,open(0))
def S_():
    return input()
def IS():
    return input().split()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0}):
#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
    mp=[1]*(w+2)
    found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[1]+[mp_def[j] for j in s]+[1]
    mp+=[1]*(w+2)
    return h+2,w+2,mp,found
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['YES','NO']

mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()
 
def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True

ans=0

n=I()

if n<=999:
    ans='ABC'
else:
    ans='ABD'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if N > 999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n=input()
n=int(n)
if n<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N >999:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
N = int(input())

if N < 1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
N = int(input())


if 1 <= N < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())
print("AB"+("C"*(n<=999) or "D"))

Submission status: Accepted

Solution code:
n = int(input())

print('ABC' if n < 1000 else 'ABD')

Submission status: Accepted

Solution code:
N=int(input())
print("ABC" if N<1000 else "ABD")

Submission status: Accepted

Solution code:
N = int(input())
if N < 1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
print('ABC') if int(input()) < 1000 else print('ABD')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
if n<=999: print('ABC')
else: print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

print("ABC" if N < 1000 else "ABD")

Submission status: Accepted

Solution code:
N = int(input())
print('ABD' if N // 1000 else 'ABC')

Submission status: Accepted

Solution code:
n = int(input())
if n>999:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
N=int(input())
print('ABC' if N<=999 else 'ABD')

Submission status: Accepted

Solution code:

n = int(input())
print('ABC' if n < 1000 else 'ABD')

Submission status: Accepted

Solution code:
print(['ABC', 'ABD'][int(input())//1000])

Submission status: Accepted

Solution code:
def main():
    contest_num = int(input())
    if contest_num < 1000:
        print("ABC")
    else:
        print("ABD")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
 
if n < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

if N >= 1000:
    print('ABD')
else :
    print('ABC')

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:print("ABC")
else:print("ABD")

Submission status: Accepted

Solution code:
N = [int(_) for _ in input().split()][0]
if N>=1000:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
N = int(input())

if N <= 999:
    s = 'ABC'
else:
    s = 'ABD'

print(s)

Submission status: Accepted

Solution code:
N = int(input())
if N>999:
	print("ABD")
else:
	print("ABC")

Submission status: Accepted

Solution code:
usrInput = int(input())
isD = False

if usrInput >= 1000:
    isD = True
    number = usrInput - 999
else:
    isD = False
    number = usrInput

if isD:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
print("AB" + ("C" if int(input()) <= 999 else "D"))

Submission status: Accepted

Solution code:
N = int(input())

if N < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
print('ABD' if n>999 else 'ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N < 1000 :
    print("ABC")
else :
    print("ABD")

Submission status: Accepted

Solution code:
print("AB"+chr(int(input())//1000+67))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    N = int(input())
    print('ABC'if N < 1000 else 'ABD')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
if n >= 1000: print("ABD")
else: print("ABC")

Submission status: Accepted

Solution code:
n=int(input())

if n < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())

if n <= 999: print("ABC")
else: print("ABD")

Submission status: Accepted

Solution code:
number = int(input())

if number > 999:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('AB'+'DC'[len(input())<4])

Submission status: Accepted

Solution code:
print('AB'+'CD'[(int(input())-1)//999])

Submission status: Accepted

Solution code:
n = int(input())
print('ABC' if n < 1000 else 'ABD')

Submission status: Accepted

Solution code:
N=int(input())

if N<=999:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
print("AABBDC"[int(input())<1000::2])

Submission status: Accepted

Solution code:
n=int(input())
if n<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


n = int(sys.stdin.buffer.readline())
if n <= 999:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
# import numpy as np
# import scipy as sp
# print(a,b,c,sep="") # 半角スペースなしで出力(abc)
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 文字列の二次元配列入力
# s = [list(map(int, input().split())) for i in range(n)] # 数値の二次元配列入力
# import sys ; sys.exit() # プログラム終了
# from copy import deepcopy ; b=deepcopy(a)
# chr(ord('a') + 1)
# s.sort(key=lambda x: x[1], reverse=False) # 2番目の要素で昇順にソート（Trueなら降順）
#
a = max(map(int, input().split()))
if a <= 999:
    ans = 'ABC'
else:
    ans = "ABD"

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
if n>999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys

# import numpy as np

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

a = int(readline())
print('ABC' if a < 1000 else 'ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
N = int(input())
print("ABC" if N <1000 else "ABD")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((["ABC"]+["ABD"])[int(input())//1000])

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000:
	print('ABC')
else:
	print('ABD')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from itertools import product, permutations, combinations

N=int(input())
if N > 999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    r = stdin.readline()[:-1]
    #n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]

    res = 0
    if len(r) == 4:
        print('ABD')
    else:
        print('ABC')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
print('ABD') if N >= 1000 else print('ABC')

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    n = int(input())
    if n < 1000:
        print('ABC')
    else:
        print('ABD')
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
print('ABC') if n < 1000 else print('ABD')

Submission status: Accepted

Solution code:
N = int(input())

ans = "ABC"
if N > 999:  
  ans = "ABD"
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
if N <= 999:
  r = 'ABC'
else:
  r = 'ABD'
print(r)

Submission status: Accepted

Solution code:
n = int(input())

if(n <= 999):
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

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

def gcd(a: int, b: int):
    """ https://cocodrips.hateblo.jp/entry/2014/03/05/143623
    """
    while b:
        a, b = b, a%b
    return a

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


def main():
    N = int(input())
    #N, M = map(int, input().split())
    #print(lcm(N, M))
    print("ABC" if N<1000 else "ABD")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=int(input())
if a>=1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n=int(input())

print("ABC" if n <1000 else "ABD")

Submission status: Accepted

Solution code:
N=int(input())
if N <= 999:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
N = int(input())
if N<1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())

if n<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
if n >999:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
ans = "ABC"
if N >= 1000 :
    ans = "ABD"
print(ans)

Submission status: Accepted

Solution code:
N=int(input())

if N<1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
if n >=1000:print('ABD')
else:print('ABC')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = int(input())
 
if s > 999:
  print('ABD')
else:
  print('ABC')

Submission status: Accepted

Solution code:
N=int(input())
if N > 999:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
n = int(input())
if 0 < n < 1000:
    print('ABC')
else:
    print('ABD')

Submission status: Accepted

Solution code:
n = int(input())

if (n < 1000):
   print('ABC')
else:
   print('ABD')

Submission status: Accepted

Solution code:
if int(input()) < 1000:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())
if n<1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
if n>=1000:
    print('ABD')
else:
    print('ABC')

Submission status: Accepted

Solution code:
print("AB"+"DC"[len(input())<4])

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    return 'ABC' if n < 1000 else 'ABD'

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

Solution code:
MOD=10**9+7
cnt=0; sum=0
#h=Hash.new(0)

def gs(): return input()
def gi(): return int(input())
def gsmi(): return [int(n) for n in input().split()]
# min,max,sum,sorted
def desc(ar): return sorted(ar,reverse=True)
def printend(s): print(s);import sys;sys.exit()
###
n=gi()
print("ABC" if n<=999 else "ABD")

Submission status: Accepted

Solution code:
N = int(input())

keta = len(str(N))

if keta<=3:
    print("ABC")
else:
    print("ABD")

Submission status: Accepted

Solution code:
n = int(input())

ans = "ABC" if n <= 999 else "ABD"
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
if N >= 1000:
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
N = int(input())
if N > 999:
  print("ABD")
else:
  print("ABC")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
code = ["ABC", "ABD"]
print(code[N//1000])

Submission status: Accepted

Solution code:
n = int(input())

if n <= 999:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:


if __name__ == "__main__":
    n = int(input())
    if 1000 <= n:
        print("ABD")
    else:
        print("ABC")

Submission status: Accepted

Solution code:
N = int(input())

if N < 1000:
    print("ABC")

else:
    print("ABD")

Submission status: Accepted

Solution code:
a=int(input())
if a<1000:
  print('ABC')
else:
  print('ABD')

Submission status: Accepted

Solution code:
n=int(input())
print("ABD" if n > 999 else "ABC")

Submission status: Accepted

Solution code:
n = int(input())
if 1000 <= n <=1998:
    n = n-999
    print("ABD")
else:
    print("ABC")

Submission status: Accepted

Solution code:
n = int(input())
if n < 1000:
    print("ABC")
else :
    print("ABD")

Submission status: Accepted

Solution code:
import math

n = int(input())
print("ABC" if n < 1000 else "ABD")

Submission status: Accepted

Solution code:
n=int(input())
if n<1000 :
  print("ABC")
else :
  print("ABD")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())

if A < 1000:
  print("ABC")
else:
  print("ABD")

Submission status: Accepted

Solution code:
n=int(input())
a=0
if n<1000:
	a="ABC"
else:
	a="ABD"
print(a)