Problem:


Score : 100 points

Problem Statement

Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.

To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.

Constraints

1≦A,B,C≦10

Input

The input is given from Standard Input in the following format:

A B C

Output

If it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.

Sample Input 1

5 5 7

Sample Output 1

YES

Using three phrases of length 5, 5 and 7, it is possible to construct a Haiku.

Sample Input 2

7 7 5

Sample Output 2

NO



Sample input:
5 5 7


Sample output:
YES

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print("YES" if a.count(5) == 2 and a.count(7) == 1 else "NO")

Submission status: Accepted

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

if A[2] == 7:
    if A[0] == 5 and A[0] == A[1]:
        print("YES")
        
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

Solution code:
n=3
a=[0]*n
b=[5,7,5]
a[:]=map(int,input().split())
a.sort()
b.sort()
if a==b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
word = input()
if word.count("5") == 2 and word.count("7") == 1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
cou5 = 0
cou7 = 0
for i in X:
    if i ==5:
        cou5 +=1
    if i ==7:
        cou7 +=1

if cou5 == 2 and cou7 ==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
l =list(map(int,input().split()))
if l.count(5)==2 and l.count(7)==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())
l = [a,b,c]

if (l.count(5) == 2) & (l.count(7) == 1):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
length = list(map(int, input().split()))
judge = {0:5,1:7,2:5}

for i in range(len(judge)):
    for j in range(len(length)):
        if length[j] == judge[i]:
            length.pop(j)
            break
        else:
            if j == len(length)-1:
                print('NO')
                exit()
print('YES')

Submission status: Accepted

Solution code:
A,B,C=(int(x) for x in input().split())

if A==7 and B==5 and C==5:
  print("YES")
elif A==5 and B==7 and C==5:
  print("YES")
elif A==5 and B==5 and C==7:
  print("YES")
else:print("NO")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
ok = False
if a == 5 and b == 5 and c == 7:
    ok = True
elif a == 5 and b == 7 and c == 5:
    ok = True
elif a == 7 and b == 5 and c == 5:
    ok = True
if ok == 1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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 #
#############

l = inputIL()
l.sort()

if l == [5,5,7]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
print("YNEOS"[sorted(map(int, input().split())) != [5, 5, 7]::2])

Submission status: Accepted

Solution code:
ABC = input()
print("YES" if ABC.count("5") == 2 and ABC.count("7") == 1 else "NO")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
x = [5, 7]
if (a + b + c == 17) and (a in x) and (b in x) and (c in x):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
N=list(map(int,input().split()))
if sorted(N)==[5,5,7]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed May 13 11:57:51 2020

@author: shinba
"""

A = list(map(int,input().split()))

B = [[5,5,7],[5,7,5],[7,5,5]]

if A in B:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
l = map(int, input().split())
print("YES" if sorted(l) == [5, 5, 7] else "NO")

Submission status: Accepted

Solution code:
l = input().split()
print("YES" if sorted(l) == ['5', '5', '7'] else "NO")

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
MAX = 10**18
MIN = -10**18

a = list(map(int,input().split()))
a.sort()
if a[0] == 5 and a[1] == 5 and a[2] == 7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print("YES" if a*b*c ==175 else "NO")

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
x = l.count(5);
y = l.count(7);
if x==2 and y==1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
s = [int(i) for i in input().split()]
s.sort()
if s == [5,5,7]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

g = 0
if a == 5:
  g = g + 1
if b == 5:
  g = g + 1
if c == 5:
  g = g + 1

h = 0
if a == 7:
  h = h + 1
if b == 7:
  h = h + 1
if c == 7:
  h = h + 1
  
if h == 1 and g == 2:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
if a == 5 and b == 5 and c == 7 or a == 5 and b == 7 and c == 5 or a == 7 and b == 5 and c == 5:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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 = LIST()
if sorted(A) == [5, 5, 7]:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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 = LIST()
A.sort()

if A == [5, 5, 7]:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    A = list(map(int, input().split()))
    A.sort()
    if len(A) == 3 and A == [5, 5, 7]:
        print('YES')
    else:
        print('NO')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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 = LIST()

A.sort()

if A == [5, 5, 7]:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
A = sorted(input().split())
print('YES' if A == ['5', '5', '7'] else 'NO')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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 = LIST()
 
if all(x in A for x in [5,7]) and sum(A) == 17:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
A_B_C = list(map(int, input().split()))
if A_B_C.count(5) == 2 and A_B_C.count(7) == 1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
As=input().split()

count5=0
count7=0

for A in As:
    if A=="5":
        count5+=1
    elif A=="7":
        count7+=1

if count5==2 and count7==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
s = {a,b,c}
list1 = [a,b,c]
if s == {5,7} and sum(list1) == 17:
  print("YES")
else :
  print("NO")

Submission status: Accepted

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

list_iroha = [A,B,C]

#print(list_iroha)
if [5,7,5] == list_iroha or [7,5,5] == list_iroha or [5,5,7] == list_iroha:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:

numArray = list(map(int, input().split()))

if numArray.count(5) == 2 and numArray.count(7) == 1: print("YES")
else: print("NO")

Submission status: Accepted

Solution code:
input_num = input().split()
numbers = {'5':0,'7':0}
for num in input_num:
  if(num=='5' or num=='7'):
    numbers[num] +=1

if(numbers['5']==2 and numbers['7']==1):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
val = sorted([int(i) for i in input().split()])

if val[0] == val[1] == 5 and val[2] == 7:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

#print(str_len)

num5 = str_len.count(5)
num7 = str_len.count(7)

#print(num5)
#print(num7)

if num5 == 2 and num7 == 1:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
X = list(input().split())
if X.count("5") == 2 and X.count("7") == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
X = list(input().split())
if X.count("5") == 2 and X.count("7") == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))
result = [0]*2

for i in n:
    if i == 5:
        result[0] +=1
    if i == 7:
        result[1]+=1
if result[0] ==2 and result[1] ==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
input_list = list(map(int, input().split()))
lists = [5,7,5]
try:
  for x in input_list:
    lists.remove(x)
  print("YES")
except ValueError:
  print("NO")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
lst = list(map(int, input().split()))

if lst[0] == 5:
    if (lst[1] == 7 and lst[2] == 5) or (lst[1] == 5 and lst[2] == 7):
        print("YES")
        exit()

elif lst[0] == 7:
    if lst[1] == 5 and lst[2] == 5:
        print("YES")
        exit()

print("NO")

Submission status: Accepted

Solution code:
input = input().split(" ")
count5 = input.count("5")
count7 = input.count("7")

if count5 == 2 and count7==1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
input_st = input().split()
input_num = [int(s) for s in input_st]
num = sorted(input_num)
if num[0] == 5 and num[1] == 5 and num[2] == 7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==5 and b==5 and c==7:
    print("YES")
elif a==5 and b==7 and c==5:
    print("YES")
elif a==7 and b==5 and c==5:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a.count(5)==2 and a.count(7)==1:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
S = input()

if S.count('5') == 2 and S.count('7') == 1:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

f=0
s=0

for i in range(3):
  if a[i] == 5:
    f += 1
  if a[i] == 7:
    s += 1

if f == 2 and s == 1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
if a[0]==5 and a[1]==5 and a[2]==7:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
S = input()
if S.count('5') == 2 and S.count('7') == 1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
length = input().split()
if length.count("5") == 2 and length.count("7") == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from collections import Counter
abc_list = list(map(int,input().split()))
abc_counter = Counter(abc_list)
most_counter = abc_counter.most_common()
if most_counter[0][0] == 5 and most_counter[0][1] == 2:
    if most_counter[1][0] == 7 and most_counter[1][1] == 1:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

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

a_list = [int(x) for x in input().split(' ')]
a_list.sort()
# print(a_list)
if a_list == [5,5,7]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a = input().split()
a.sort()
print("YES" if a[0] == '5' and a[1] == '5' and a[2] == '7' else "NO")

Submission status: Accepted

Solution code:
a = input()
b = a.count("5")
c = a.count("7")
if b == 2:
    if c == 1:
        print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l.sort()
if l == [5,5,7]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a, b, c = map(int, input().split())
# カウンタのクリア
five_count = 0
seven_count = 0
# 5,7,5を判定
def setsu_check(x):
	global five_count, seven_count
	if x == 5:
		five_count+=1
	elif x == 7:
		seven_count+=1
# 判定関数のCALL
setsu_check(a)
setsu_check(b)
setsu_check(c)
if five_count == 2 and seven_count == 1:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
def main():
    if sorted(input().split()) == ['5','5','7']: print('YES')
    else: print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

if L.count(5) == 2 and L.count(7) == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
abc = list(map(int,input().split()))
if abc.count(5)==2 and abc.count(7)==1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:

A, B, C = input().split()
list = [A, B, C]
print("YES" if list.count("5")==2 and list.count("7")==1 else "NO")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
bunsetsu = [a, b, c]
if bunsetsu.count(5) == 2 and bunsetsu.count(7)==1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
ABC = input().split()

print('YES' if ABC.count('5') ==2 and ABC.count('7')==1 else 'NO')

Submission status: Accepted

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

ans = [[5, 5, 7], [5, 7, 5], [7, 5, 5]]

if iroha in ans:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
X.sort()
print('YES' if X==[5,5,7] else 'NO')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
LIST=[a,b,c]
go=LIST.count(5)
sichi=LIST.count(7)
if go==2 and sichi==1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
def canConstructHaiku(arr):
  arr.sort()
  if arr[0] == 5 and arr[1] == 5 and arr[2] == 7:
    return True
  return False
 
arr = list(map(int, input().split()))
print("YES" if canConstructHaiku(arr) else "NO")

Submission status: Accepted

Solution code:
X=list(map(int,input().split()))
if X.count(5)==2 and X.count(7)==1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

a5 = 0
a7 = 0
b = 0
i = 0
while i < 3:
    if a[i] == 5:
        a5 += 1
    elif a[i] == 7:
        a7 += 1
    i += 1

if a5 == 2 and a7 == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

lis = [A, B, C]

if lis.count("5") == 2 and lis.count("7") == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
#和風いろはちゃんイージー
def ABC_42_A():
    A,B,C = map(int, input().split())
    iroha = [0 for i in range(3)]
    iroha = []
    iroha.append(A)
    iroha.append(B)
    iroha.append(C)

    if iroha.count(7)==1 and iroha.count(5)==2:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':

    ABC_42_A()

Submission status: Accepted

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

ans = [A,B,C]

for i in ans:
    if i == 7:
        count7 += 1
    elif i == 5:
        count5 += 1

if count7 == 1 and count5 == 2:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
from collections import defaultdict
a = list(map(int, input().split()))
d = defaultdict(lambda: 0)
for v in a:
  d[v] += 1
if d[5] == 2 and d[7] == 1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print("YES" if a+b+c == 17 else "NO")

Submission status: Accepted

Solution code:
W = input().split()
if W.count('5') == 2 or W.count('7') == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,c = sorted(list(map(int, input().split())))
if a == b == 5 and c == 7:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
arr = list(map(int,input().split()))
if arr.count(5)==2 and arr.count(7)==1:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

if l.count(5) == 2 and l.count(7) == 1:
    print("YES")

else:
    print("NO")

Submission status: Accepted

Solution code:
x = input()
ls_x = x.split()

for i in range(len(ls_x)):
    ls_x[i] = int(ls_x[i])


ct7=0
for i in range(len(ls_x)):
    if ls_x[i]==7:
        ct7 = ct7 + 1


ct5=0    
for i in range(len(ls_x)):
    if ls_x[i]==5:
        ct5 = ct5 + 1
    
if (ct7==1) and (ct5==2):
    print("YES")

else:
    print("NO")

Submission status: Accepted

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

if a == [5, 5, 7]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
haiku=list(map(int, input().split())) #a1 a2 a3
haiku.sort()


print('YES' if haiku[0]==5 and haiku[1]==5 and haiku[2]==7 else 'NO')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
MC = [A, B, C]
if MC.count(5)==2 and MC.count(7)==1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a = eval(input().replace(" ","+"))
if a == 17:print("YES")
else:print("NO")

Submission status: Accepted

Solution code:
List = [int(i) for i in input().split()]
a = List[0]
b = List[1]
c = List[2]

if a*b*c==175:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
lis5=0
lis7=0
for i in a,b,c:
    if i ==5:
        lis5+=1
    elif i ==7:
        lis7+=1
if lis5==2 and lis7==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
seven = 0
five = 0
for n in l:
    if n == 7:
        seven += 1
    if n == 5:
        five += 1

if five == 2 and seven == 1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
S=input();print('YES' if S.count('7')==1 and S.count('5')==2 else 'NO')

Submission status: Accepted

Solution code:
N = list(map(str, input().split()))
if N.count("5") == 2 and N.count("7") == 1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

l = [A, B, C]

l = sorted(l)

if l[0] == l[1] == 5 and l[2] == 7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:

l,m,n = map(int,input().split())
cnt = l+m+n 

if cnt == 17:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:

def resolve():
    import collections
    count = collections.Counter(list(map(int, input().split())))
    print("YES" if count[5] == 2 and count[7] == 1 else "NO")
    
    


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if sum(a) == 17:
	a.sort()
	if a[0]==5 and a[1]==5:
		print('YES')
	else:
		print('NO')
else:
	print('NO')

Submission status: Accepted

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

for i in range(3):
    if a[i] == 7:
        b += 1
    elif a[i] == 5:
        c += 1

if b == 1 and c == 2:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
n = input().split()
print('YES' if n.count('5') == 2 and n.count('7') == 1 else 'NO')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=[a,b,c]
if d.count(5)==2 and d.count(7)==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A = list(map(str, input().split()))
A7 = 0
A5 = 0
for i in A:
  if i == "7":
    A7 += 1
  elif i == "5":
    A5 += 1

if A5 == 2 and A7 == 1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a = na()
a.sort()
if a[0] == 5 and a[1] == 5 and a[2] == 7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if a.count(5) == 2 and a.count(7) == 1:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

if a==7:
  if b==5:
    if c==5:
      res='YES'
    else:
      res='NO'
      
  else:
    res='NO'
    
elif a==5:
  if b==5:
    if c==7:
      res='YES'
    else:
      res='NO'
      
  elif b==7:
    if c==5:
      res='YES'
    else:
      res='NO'
      
else:
  res='NO'
  
print(res)

Submission status: Accepted

Solution code:
s = list(input().split())
a = s.count("5")
b = s.count("7")
if a == 2 and b == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
print("YES" if sum(map(int, input().split())) == 17 else "NO")

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
if abc.count(5) == 2 and abc.count(7) == 1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
lis = sorted(input().split())
if lis == ['5', '5', '7']:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
s = input().split(" ")
if s.count('5') == 2 and s.count('7') == 1:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print("YES" if (a*b*c==175) else "NO")

Submission status: Accepted

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

if a == 5 and b == 5 and c == 7:
  print('YES')
elif a == 5 and b == 7 and c == 5:
  print('YES')
elif a == 7 and b == 5 and c == 5:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))
print('YES' if a[0]==a[1]==5 and a[2]==7 else 'NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
A, B, C = map(int, input().split())
# 文字列の入力
#s = input()
#print(s[0:K-1]+s[K-1].lower()+s[K:N])
if A*B*C == 5*5*7:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())
if A+B+C==17:
  if A+B==10 and A==B:
    print("YES")
  elif A+B==12 and A!=B:
    print("YES")
  else:
    print("NO")
else:
  print("NO")

Submission status: Accepted

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

count7=0

if a==7:
    count7=count7+1
if b==7:
    count7=count7+1
if c==7:
    count7=count7+1

if count7==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
#a=[map(int,input().split())]
#print(a)
if a.count(5)==2 and a.count(7)==1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if (a==5 and b==5 and c==7) or(a==5 and c==5 and b==7) or (c==5 and b==5 and a==7):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
#2020-04-30
a = list(map(int,input().split()))
if a.count(5) == 2 and a.count(7) == 1:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
numbers = [int(x) for x in input().split()]

if numbers.count(5) == 2 and numbers.count(7) == 1:
    print("YES")
else:print("NO")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l.sort()
if l[0] == l[1] == 5 and l[2] == 7:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

print("YES" if A == B == 5 and C == 7 else "NO")

Submission status: Accepted

Solution code:
if "7 7" in input():
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
#! python3

def main():
    s = [int(i) for i in input().split()]
    s.sort()
    if s == [5, 5, 7]:
        print("YES")
    else:
        print("NO")
        
main()

Submission status: Accepted

Solution code:

l = [int(x) for x in input().split(' ')]

if (5 not in l):
  print('NO')

if (7 not in l):
  print('NO')

if (sum(l) == 17):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7


u=LI()
if u.count(5)==2 and u.count(7)==1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
s = input().split()
s5 = s.count("5")
s7 = s.count("7")
 
if s5 == 2:
    if s7 == 1:
  	    print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

Solution code:
def resolve():
    l=list(map(int, input().split()))
    if l.count(5)==2 and l.count(7)==1:
        print('YES')
    else:
        print('NO')
resolve()

Submission status: Accepted

Solution code:
def resolve():
    l=list(map(int, input().split()))
    l.sort()
    if l==[5,5,7]:
        print('YES')
    else:
        print('NO')
resolve()

Submission status: Accepted

Solution code:
def resolve():
    a,b,c=map(int, input().split())
    if a==b==5 and c==7:
        print('YES')
    elif a==c==5 and b==7:
        print('YES')
    elif b==c==5 and a==7:
        print('YES')
    else:
        print('NO')
resolve()

Submission status: Accepted

Solution code:
a,b,c=(int(x)for x in input().split())
if a==b==5 and c==7:
    print("YES")
elif a==c==5 and b==7:
    print("YES")
elif b==c==5 and a==7:
    print("YES")
else:
    print("NO")