Problem:


Score : 100 points

Problem Statement

An elementary school student Takahashi has come to a variety store.

He has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?

Note that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.

Constraints

All input values are integers.

1 \leq A, B \leq 500

1 \leq C \leq 1000

Input

Input is given from Standard Input in the following format:

A B C

Output

If Takahashi can buy the toy, print Yes; if he cannot, print No.

Sample Input 1

50 100 120

Sample Output 1

Yes

He has 50 + 100 = 150 yen, so he can buy the 120-yen toy.

Sample Input 2

500 100 1000

Sample Output 2

No

He has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.

Sample Input 3

19 123 143

Sample Output 3

No

There are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.

Sample Input 4

19 123 142

Sample Output 4

Yes



Sample input:
50 100 120


Sample output:
Yes

Submission status: Accepted

Solution code:
a = input()
l = a.split()
if int(l[0]) + int(l[1]) >= int(l[2]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main(A: int, B: int, C: int):
    if (A + B) >= C:
        return 'Yes'
    else:
        return 'No'


if __name__ == "__main__":
    A, B, C = map(int, input().split(' '))

    print(main(A, B, C))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A+B>=C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

print('YNeos'[a+b<c::2])

Submission status: Accepted

Solution code:
C = list(map(int,open(0).read().split()))
print("Yes" if C[0]+C[1]>=C[2] else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

print ("Yes" if A + B >= C else "No")

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())

    if A + B < C:
        print('No')
    else:
        print('Yes')

main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(("No","Yes")[a+b>=c])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(['No','Yes'][c<=a+b])

Submission status: Accepted

Solution code:

a, b, c = map(int, input().split())
print('Yes' if a+b >= c else 'No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split(' '))
print('Yes' if a + b >= c else 'No')

Submission status: Accepted

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

if c <= a+b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
print('Yes') if A+B >= C else print('No')

Submission status: Accepted

Solution code:
#91

A, B, C = map(int, input().rstrip().split())

if C-(A+B) <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print('No' if a+b<c else 'Yes')

Submission status: Accepted

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

if x[0] + x[1] >= x[2]:
  print("Yes")

else:
  print("No")

Submission status: Accepted

Solution code:
#ABC092
a,b,c = map(int,input().split())
if a+b>=c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A + B >= C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if C<=A+B:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print('Yes') if (a+b) >= c else print('No')

Submission status: Accepted

Solution code:
A, B, C = list(map(int,input().split()))
if A + B >= C :
	print("Yes")
else:
  	print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print('Yes' if (a+b)>=c else 'No')

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
if a+b>=c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if C<=A+B:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C = list(map(int,input().split()))

print('Yes' if A+B>=C else 'No')

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
if x + y >= z:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if a[0]+a[1]>=a[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print('Yes' if a+b>=c else'No')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A+B >=C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if (a+b) >= c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("Yes" if C <= A + B else "No")

Submission status: Accepted

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

if a + b >= c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a + b < c:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a+b >= c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A+B >= C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split(' '))
print("YNeos"[a + b < c::2])

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A + B >= C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if (A+B>=C):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

i = list(map(int, input().split()))
if i[0]+i[1] < i[2]:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split()); print('Yes') if a+b >= c else print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a+b >= c:
    print("Yes")
if a+b < c:
    print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print('Yes' if (a+b)>=c else 'No' )

Submission status: Accepted

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

Submission status: Accepted

Solution code:

#A
def A():
    a, b, c = map(int, input().split())
    if a + b >= c:
        print("Yes")
    else:
        print("No")
    return



#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
import numpy as np
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    a, b, c = LI()
    if a + b >= c:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    return

#C
def C():
    n = II()
    ab = LIR(n)
    cd = LIR(n)
    ab.sort()
    cd.sort()
    check = [0 for i in range(n)]
    ans = 0
    #print(ab)
    for _, c in enumerate(cd):
        d = c[1]
        c = c[0]
        maxy = -1
        x = -1
        for k, a in enumerate(ab):
            b = a[1]
            a = a[0]
            if maxy < b and c > a and check[k] == 0 and d > b:
                maxy = b
                x = k
                #print(a,b,c,d)
        if x != -1:
            ans += 1
            check[x] += 1
    print(ans)


    return

#D
def D():
    N = II()
    a = LI()
    b = LI()
    ans = 0
    for i in range(29):
        t = 2 ** i
        a2 = [A % (2 * t) for A in a]
        b2 = [B % (2 * t) for B in b]
        a2.sort()
        b2.sort()
        ansb = 0
        for A in a2:
            ansb += np.searchsorted(b2, 2 * t - A) - np.searchsorted(b2, t - A)
            ansb += N - np.searchsorted(b2, 3* t - A)
            #print(ansb)
        #ans += (ansb % 2) << i
        ans += ((ansb %2 ) << i)
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

print("Yes" if a+b >= c else "No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = 'No'
if a + b >= c:
    ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

A, B, C = map(int, input().split())

# print(A)
# print(B)
# print(C)

# オモチャを買えるならば Yes，買えないならば No を出力せよ。

if A + B >= C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if C <= A + B:
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

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

if a+b >= c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A + B >= C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a[0]+a[1]>=a[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    A, B, C = map(int, input().split())


    if A + B >= C:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

# input
A, B, C = map(int, input().split())

# solve
ans = "Yes" if (A + B) >= C else "No"

# output
print(ans)

Submission status: Accepted

Solution code:
#96
A,B,C = map(int,input().split())
ans= ((A+B)>=C)
if ans:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

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

if __name__ == "__main__":
    a, b, c = map(int, input().split())

    print("Yes" if (a+b) >= c else "No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
print("Yes" if C<=A+B else "No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A+B >= C:
    print ("Yes")

else:
    print ("No")

Submission status: Accepted

Solution code:
a,b,c,= map(int,input().split())
if a+b < c:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

print("Yes") if a+b>=c else print("No")

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if A+B >= C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print('Yes' if c<=a+b else 'No')

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

A, B, C = nl()

if C <= A+B:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A+B>=C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print('Yes' if A + B >= C else 'No')

Submission status: Accepted

Solution code:
s = list(map(int,input().split()))
a = s[0]
b = s[1]
c = s[2]
if a + b >= c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    A,B,C = (int(_) for _ in input().split())
    if A+B>=C:
        print('Yes')
    else:
        print('No')
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C = [int(abc) for abc in input().split()]
if A+B >= C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=map(int, input().split())
if A+B>=C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def abc():
    a, b, c = map(int, input().rstrip().split())

    print('Yes' if a + b >= c else 'No')


abc()

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A + B >= C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if a+b>=c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))

if A + B >= C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

if a+b >= c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split(" ")))
print('Yes' if a+b>=c else 'No')

Submission status: Accepted

Solution code:
A, B ,C = map(int, input().split())
if A + B >= C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
print('Yes') if A + B >= C else print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a + b >= c :
        print('Yes')
else :
        print('No')

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


a, b, c = MI()
print('Yes' if a + b >= c else 'No')

Submission status: Accepted

Solution code:
A,B,C = list(map(int,input().split()))
if A+B >= C :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

if a + b >= c:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a+b>=c:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
A,B,C=input().split()
a=int(A)
b=int(B)
c=int(C)
if a+b>=c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if(A+B >= C):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print('Yes' if A + B >= C else 'No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print('Yes') if A + B >= C else print('No')

Submission status: Accepted

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

if (a+b) >= c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print('Yes' if C <= A + B else 'No')

Submission status: Accepted

Solution code:
A,B,C=[int(x) for x in input().split()]
print(["No","Yes"][A+B>=C])

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
print("Yes" if A+B>=C else "No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
answer = 'Yes' if a+b>=c else 'No'
print(answer)

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(A: int, B: int, C: int):
    print(YES if (A+B) >= C else NO)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print("Yes" if a+b >= c else "No")

Submission status: Accepted

Solution code:
ans = "No"
a, b, c = [ int(v) for v in input().split() ]
if a + b >= c:
  ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a+b < c:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
A, B, C = map(int, raw_input().split())
if A+B >= C: print 'Yes'
else: print 'No'

Submission status: Accepted

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

Submission status: Accepted

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

print("Yes" if c <= a + b else "No")

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(A: int, B: int, C: int):
    if A + B >= C:
        ret = YES
    else:
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if (A+B) >= C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a+b < c:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

if a+b>=c:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a + b >= c:
    print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


def main():
    a, b, c = intin()

    if a + b >= c:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if (a+b) >=  c :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("Yes" if (A + B >= C) else "No")

Submission status: Accepted

Solution code:
a, b, c = input().split()
a, b, c = int(a), int(b), int(c)
if a + b >= c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if a + b >= c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(["Yes","No"][(a+b)<c])

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
money = A+B
if C>money:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
from collections import defaultdict

def main():
    a, b, c = map(int, input().split())
    if a + b >= c:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

l = list(map(int, input().split()))
C = l[-1]
l.pop()

if sum(l) >= C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a+b >= c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]
print("Yes") if A + B >= C else print("No")

Submission status: Accepted

Solution code:
b, c, d = map(int, input().split())
if(b+c<d):
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a+b >= c:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


a,b,c=map(int,input().split())
if a+b>=c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

print('Yes' if (A+B) >= C else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,c = f()
    if a+b>=c:
        print('Yes')
    else:
        print('No')

solve()

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if (A+B)<C:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print('Yes') if a+b >= c else print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A+B>=C:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
answer = 'Yes' if c <= a + b else 'No'
print(answer)

Submission status: Accepted

Solution code:
a,b,c = map(int,open(0).read().split())
print("Yes" if a+b>=c else "No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split(' '))
if A + B >= C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
if a+b >= c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
if a + b < c:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
def main(A, B, C):
    if A + B < C:
        print('No')
    else:
        print('Yes')


if __name__ == '__main__':
    A, B, C = list(map(int, input().strip().split(' ')))
    main(A, B, C)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
total = A + B
if total >= C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A + B >= C:
  print ('Yes')
else:
  print ('No')

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if C<=A+B:print('Yes')
else: print('No')

Submission status: Accepted

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

if a+b>=c:
 print("Yes")
else:
 print("No")

Submission status: Accepted

Solution code:


def read_input():
    a, b, c  = map(int, input().split())
    return a, b, c


def submit():
    a, b, c = read_input()

    if a + b < c:
        print('No')
    else:
        print('Yes')


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]
if a + b >= c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
print('No'if A+B<C else 'Yes')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if C > A + B:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
#list=[1,5,10,50,100,500]
print('Yes' if c <= a+b  else 'No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
s="Yes" if a+b>=c else "No"
print(s)

Submission status: Accepted

Solution code:
a,s,d=map(int,input().split())
if a+s>=d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))
[print("Yes") if (a+b)>=c else print("No")]

Submission status: Accepted

Solution code:
def main():
	A, B, C = map(int,input().split())
	if A+B >= C:
		print("Yes")
	else:
		print("No")


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
a, b, c = (int(_) for _ in input().split())  

if a + b >= c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(A: int, B: int, C: int):
    if A+B >= C:
        yes()
    else:
        no()
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c = list(map(int, input().split()))
print("Yes" if a+b>=c else "No")

Submission status: Accepted

Solution code:
[A,B,C] = list(map(int, input().split()))
if A+B >= C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
if a + b >= c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if (a+b)>=c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print("YNeos"[a+b<c::2])