Problem:


Score: 100 points

Problem Statement

In AtCoder Kingdom, Gregorian calendar is used, and dates are written in the "year-month-day" order, or the "month-day" order without the year.

For example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.  

In this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.

How many days from 2018-1-1 through 2018-a-b are Takahashi?

Constraints

a is an integer between 1 and 12 (inclusive).

b is an integer between 1 and 31 (inclusive).

2018-a-b is a valid date in Gregorian calendar.

Input

Input is given from Standard Input in the following format:

a b

Output

Print the number of days from 2018-1-1 through 2018-a-b that are Takahashi.

Sample Input 1

5 5

Sample Output 1

5

There are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.

Sample Input 2

2 1

Sample Output 2

1

There is only one day that is Takahashi: 1-1.

Sample Input 3

11 30

Sample Output 3

11

There are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.



Sample input:
5 5


Sample output:
5

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
q=0
for i in range(1,a+1):
  for j in range(1,b+1):
    if i==j:
      q+=1
      
print(q)

Submission status: Wrong Answer

Solution code:
A, B = [int(i) for i in input().split()]

print(min(A, B))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())

print(min(a,b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(min(a,b))

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
ans = a
if b < 5:
    ans -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())

    print(min(a, b))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def resolve():
    a, b = map(int, input().split())
    if a > b: c = a-1
    else: c = a
    print(c)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())

print(a) if a<b else print(a-1)

Submission status: Wrong Answer

Solution code:

a,b=map(int,input().split())
cnt = 0
cnt += a
if a < b:
    cnt -= 1
print(cnt)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(a-(a<b))

Submission status: Wrong Answer

Solution code:
a, b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(b)

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
print(min(n,m))

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
print(a) if a<=b else a-1

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a <= b:
  print(a + 1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
LI = lambda: list(map(int, input().split()))

a, b = LI()


def main():
    ans = a - 1 if a < b else a
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    b = int(parts[1])
    if a>=b:
        stdout.write(str(a))
    else:
        stdout.write(str(a-1))
main()

Submission status: Wrong Answer

Solution code:
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    b = int(parts[1])
    stdout.write(str(min(a,b)))
main()

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
if b > 13:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
if b > 12:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
if b >= 12:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a==1 and b==1:
  print(1)
else:
  print(min(a,b))

Submission status: Wrong Answer

Solution code:
import sys

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


def main():
    a, b = map(int, readline().split())

    ans = 0
    for i in range(1, 12):
        if i < a:
            ans += 1
        elif i == a and i <= b:
            ans += 1

    print(ans)
    return


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())

if a<=b:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:


def main():
    a, b = map(int, input().split())
    cnt =  0
    for i in range(1, a+1):
        for j in range(1, b+1):
            if i == j:
                cnt += 1
    print(cnt)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
m,d =map(int,input().split())
print(m if m>=d else m-1)

Submission status: Wrong Answer

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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

a, b = MAP()
if a < b:
    print(a)
else:
    print(a - 1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(min(a,b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if b<a:
    print(min(a,b)-1)
else:
    print(min(a, b))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(min([a,b,12]))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

ans = 0

for i in range(1, a+1):
    for j in range(1, b+1):
        if i==j:
            ans += 1
            
print(ans)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
print(min(min(a,12)-1,min(b,31)-1)+1)

Submission status: Wrong Answer

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

# A - Day of Takahashi
a, b = map(int ,input().split())
ans = 0

for i in range(1, 13):
	if i <= a and i <= b:
		ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, readline().split())
print(min(a, b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

ans = 0
for i in range(1, a+1):
    for j in range(1, b+1):
        if i == j:
            ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = 0
for i in range(1, a+1):
  for j in range(1, b+1):
    if i == j:
      ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a <= b:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(b if a>b else a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(b if a==b else a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a if a==b else '1')

Submission status: Wrong Answer

Solution code:
def main():
    a,b = map(int, input().split())
    if a<b:
        print(a)
    else:
        print(a-1)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    a,b = map(int, input().split())
    print(min(a,b))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a, b = list(map(int, input().split()))

print(min(a,b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = a
if b <= a:
    ans -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = a
if b >= a:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
if a<b:
  print(a)
else:
  print(a-1)

Submission status: Wrong Answer

Solution code:
print(min(list(map(int, input().split()))))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

if a <= b:
    a += 1

print(a)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(a if b>=a else b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(a if b>a else b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(a if b>a else a-1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(min(a,b))

Submission status: Wrong Answer

Solution code:
print(min(map(int,input().split())))

Submission status: Wrong Answer

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

a, b = map(int, input().split())

if a <= b:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())

print(min(a,b))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());
import datetime
r=0
for i in range(1,a+1):
  for j in range(1,b+1):
    if i==j:
      try:
          newDate = datetime.datetime(2018,i,j)
          r+=1
      except ValueError:
          pass
print(r)

Submission status: Wrong Answer

Solution code:
#n=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=0
for month in range(1,a+1):
    for day in range(1,b+1):
        if month==day :
            ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
# input
a, b = map(int, input().split())

# check
print(min(a, b))

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())
print(a) if a < b else print(a-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
cnt = a-1
if a == b:
    cnt += 1
print(cnt)

Submission status: Wrong Answer

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
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_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    a, b = i_map()

    if a == b:
        a += 1

    print(a)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

if a>= b:
  print(a - 1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b <= 12:
    print(min(a,b))
else:
    print(a)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if b <= 12:
    print(min(a,b))
else:
    print(a)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if max(a,b) <= 12:
    print(min(a,b))
else:
    print(a)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if max(a,b) <= 12:
    print(min(a,b))
elif a <= 12:
    print(a)
else:
    print(12)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b <= 12:
    print(a)
elif a == b > 12 or (a and b > 12):
    print(12)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b <= 12:
    print(a)
elif a == b > 12 or (a,b > 12):
    print(12)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b <= 31:
    print(a)
elif a == b > 12:
    print(12)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b <= 31:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b < 13:
    print(b)
else:
    print(a)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<b:
  print(a-1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
c = max(a,b)
if c > 12:
    print(a)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(min(a, b))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(a)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a <= b:
  print(a+1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
i = 1
for n in range(1, a):
    for m in range(1, b):
        if n == m:
            i += 1
print(int(i))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
i = 1
for n in range(1, a):
    for m in range(1, b):
        if n == m:
            i += 1
print(i)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
i = 0
for n in range(1, a + 1):
    for m in range(1, b + 1):
        if n == m:
            i += 1
print(i)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<b:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>=b:
    print(a-1)
else:
    print(a)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>=b:
    print(a)
else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
count=0
while a>0:
    for i in range(b+1):
        if a==i:
            count+=1
    a-=1
print(count)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

if b > a:
  print(a-1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
cnt = 0
for i in range(1,a+1):
    for j in range(1,b+1):
        if i == j:
            cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
cnt = 0
for i in range(1,a):
    for j in range(1,b):
        if i == j:
            cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(min(a,b))

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print( (a-1) if a>b else (a+1))

Submission status: Wrong Answer

Solution code:
n,m = map(int,input().split())
print (min(n,m))

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
if a < b:
  print(a)
else:
  print(a-1)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
mn = min(a,b)
ans = min(mn,12)
print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b:
    print(a)
else:
    print(a - 1)

Submission status: Wrong Answer

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

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

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


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

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

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

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

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

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

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

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

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

    if arr==[]:
        arr.append([n, 1])
    return arr

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

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

a,b = inputIL()

if a>=b:
  print(a)
else:
  print(a-1)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
if a < b:
    print(a)
else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
if a > b:
    print(a)
else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = a - 1
if b >= a:
    ans += 1
print(ans + 1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<b:
  print(a)
else:
  (print(b))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  print(b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b:
  print(a)
else:
  (print(b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

if a == b:
    print(a)
else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())

ans = a-1

for i in range(1,b-1):
  if a==i:
    ans = ans+1
    break

print(ans)

Submission status: Wrong Answer

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

a, b= LI()
if a - b > 0:
    print(b)
else:
    print(a)

Submission status: Wrong Answer

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
a, b = ri_()
print(a if b < a else a + 1)

Submission status: Wrong Answer

Solution code:

a,b = map(int,input().split())

print(min(a,b))

Submission status: Wrong Answer

Solution code:
print(min(map(int, input().split())))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

print(a if a>=b else a-1)

Submission status: Wrong Answer

Solution code:

a, b = map(int, input().split())

print(a if a>=b else b)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a-1) if a > b else (a)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=a-b

if a <= b:
    print(c+1)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print("a-1" if a>b else "a")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print("a" if b>=a else "a-1")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print("a" if b>=a else "b")

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

ans = min(a, b)
print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==a):
                break
            elif(i==j):
                ct=ct+1
        elif(i==j):
            ct=ct+1
               
print(ct)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ct=0
for i in range(1,a+1):
    for j in range(1,32):
        if(a!=b):
            if(i==a):
                break
        elif(i==j):
            ct=ct+1
               
print(ct)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())

print(a if a<= b else b)

Submission status: Wrong Answer

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

a, b = MAP()
print(a if a < b else a-1)

Submission status: Wrong Answer

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

a, b = MAP()
print(min(a,b))

Submission status: Wrong Answer

Solution code:
def resolve():
    a,b=map(int, input().split())
    if b<5:
        print(a-1)
    else:
        print(a)
resolve()

Submission status: Wrong Answer

Solution code:
a, b = input().split()
print(min(a,b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b:
    print(a)

else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())
    cnt = 0
    for i in range(1, 13):
        if i <= a and i <= b:
            cnt += 1
    print(cnt)
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
s = min(a, b)
print(s)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
s = min(a, b)
cnt = 0

for i in range (s+1):
  if i < a and i < b:
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
s = min(a, b)
cnt = 0
print(s)

for i in (str(s+1)):
  if a == i and b == i:
    cnt += 1

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
if a<b:
  print(a-1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
flag=0
for a in range(1,a+1):
  for b in range(1,b+1):
   if(a==b):
      flag=flag+1
print(flag)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<b:
    print(a)
else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
cnt = 0
for i in range(1, a+1):
    for j in range(1, 13):
        if i == j:
            cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
cnt = 0
for i in range(1, a+1):
    for j in range(1, b+1):
        if i == j:
            cnt += 1
print(cnt)

Submission status: Wrong Answer

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

if n <= b:
  print(n + 1)
  
else:
  print(n)

Submission status: Wrong Answer

Solution code:
a,b = list(map(int,input().split()))
if a < b:
    print(a-1)
else:
    print(a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())

print(a if a<=b else b)

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())

if a < b:
  print(a-1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a<b:
    print(a)
elif a>=b:
    print(b)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a >= b:
  print(a-1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a >= b:
  print(b)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a if a<b else a-1)

Submission status: Wrong Answer

Solution code:
def resolve():
    a, b = list(map(int, input().split(" ")))
    cnt = 0
    for i in range(1, a+1):
        for j in range(1, b+1):
            if i == j:
                cnt += 1
                break
    print(cnt)

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    a, b = list(map(int, input().split(" ")))
    cnt = 0
    for i in range(a):
        for j in range(b):
            if i == j:
                cnt += 1
                break
    print(cnt)

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:

a,b = map(int,input().split())

if a == 12:
    if b >= 12:
        print(12)
    else:
        print(11)
else:
    print(min(a,b))

Submission status: Wrong Answer

Solution code:

a,b = map(int,input().split())

if a >=12:
    print(12)
else:
    print(min(a,b))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b:
    print(a)
else:
    print(b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
x=0
for i in range(a):
    for j in range(b):
        if i==j:
            x += 1
print(x)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
cnt = 0
for i in range(a):
    for j in range(b):
        if i==j:
            cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
cnt=0
for i in range(a):
    for j in range(b):
        if i==j:
            cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

ans = 0
for i in range(1, a + 1):
    for j in range(1, b + 1):
        if i == j:
            ans += 1

print(ans )

Submission status: Wrong Answer

Solution code:
count = 0
a,b = map(int,input().split())
for i in range(1,a+1):
  for j in range(1,b+1):
    if i == j:
      count += 1
      break
    #print(i,j)
print(count)

Submission status: Wrong Answer

Solution code:
count = 0
a,b = map(int,input().split())
for i in range(1,a+1):
  for j in range(1,b+1):
    if i == j:
      count += 1
print(count)

Submission status: Wrong Answer

Solution code:
count = 0
a,b = map(int,input().split())
for i in range(a):
  for j in range(b):
    if i == j:
      count += 1
print(count)

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())
print(min(a,b))

Submission status: Wrong Answer

Solution code:
import sys

a, b = map(int, sys.stdin.readline().split())

def main():
    print(min(a, b))

if __name__ ==  '__main__':
    main()

Submission status: Wrong Answer

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] < a[1]:
        print(a[0])
    else:
        print(a[0]-1)

Submission status: Wrong Answer

Solution code:
# ABC 096: A – Day of Takahashi
a, b = [int(s) for s in input().split()]
print(a if a <= b else b)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(a if a<=b else b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())

if a<b:
  print(a)
else:
  print(a-1)

Submission status: Wrong Answer

Solution code:
a,b= map(int,input().split())
if b>a:
    print(a)
else:
    print(a-1)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<b:
  print(a-1)
else:
  print(a)

Submission status: Wrong Answer

Solution code:
def DayofTaka(a , b):

    return min(a , b)

def main():
    a , b = map(int , input().split())
    print(DayofTaka(a , b))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
if a<b:
  print(a)
else:
  print(a-1)

Submission status: Wrong Answer

Solution code:
l = [int(x) for x in input().split(" ")]
print(l[0]-1+l[1]/l[0])

Submission status: Wrong Answer

Solution code:
a,b= map(int, input().split())

if a<=b:
        print(a)
else:
        print(a-b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a < b:
  print(a)
else:
  print(b)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
c = 0
for i in range(1,a+1):
  for j in range(1, b+1):
    if i == j:
      c +=1
print(c)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
c = 0
for i in range(1,a+1):
  if i == b:
    c +=1
print(c)