Problem:


Score : 100 points

Problem Statement

Three poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.
We will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.

Determine whether the arrangement of the poles is beautiful.

Constraints

1 \leq a,b,c \leq 100

a, b and c are integers.

Input

Input is given from Standard Input in the following format:

a b c

Output

Print YES if the arrangement of the poles is beautiful; print NO otherwise.

Sample Input 1

2 4 6

Sample Output 1

YES

Since 4-2 = 6-4, this arrangement of poles is beautiful.

Sample Input 2

2 5 6

Sample Output 2

NO

Since 5-2 \neq 6-5, this arrangement of poles is not beautiful.

Sample Input 3

3 2 1

Sample Output 3

YES

Since 1-2 = 2-3, this arrangement of poles is beautiful.



Sample input:
2 4 6


Sample output:
YES

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

# 処理&出力
if b-a == c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
# A - ι⊥l

# 3本の柱が等間隔に並んでいる
# 柱の高さは左から順に a[m] b[m] c[m]
# 柱の先端が同一線上に並んでいるとき
# ⇔ b - a = c - b
# 美しいな！

# a b c を標準入力から得る
a, b, c = map(int, input().split(maxsplit=3))
# print(a, b, c)

# b - a を計算
pillar_ba = b - a
# c - b を計算
pillar_cb = c - b
# print(pillar_ba, pillar_cb)

# pillar_ba ⇔ pillar_cb の時　Yes
# そうでないとき　No を代入
if pillar_ba == pillar_cb:
    answer = "YES"
else:
    answer = "NO"

# 結果を出力
print(answer)

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a = list(map(int, input().split()))
if a[1] - a[0] == a[2] - a[1]: print("YES")
else: print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a_poll, b_poll, c_poll = map(int, input().split())

if b_poll - a_poll == c_poll - b_poll:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

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

    print('YES' if b-a == c-b else 'NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())
if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if b-a == c-b:
  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 b-a == c-b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    a, b, c = map(int, input().split())
    if b - a == c - b:
        print("YES")
    else:
        print("NO")
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=(int(x) for x in input().split())
d = c - b
e = b - a
if d == e:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h=list(map(int,input().split()))
w=sorted(h)
if (w[1]-w[0])==(w[2]-w[1]):
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    a, b, c = map(int, readline().split())
    if b-a==c-b:
        print('YES')
    else:
        print('NO')



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if b-a == c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a,b,c =map(int,input().split())
print(["YES","NO"][b-a != c-b])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(["NO","YES"][2*b-a-c==0])

Submission status: Accepted

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

Submission status: Accepted

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

x = b-a
y = c-b

if x == y:
  ans = 'YES'
else:
  ans = 'NO'
  
print(ans)

Submission status: Accepted

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

print("YES" if b-a == c-b else "NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
if b - c == a - b:
  my_result = 'YES'
else:
  my_result ='NO'
print(my_result)

Submission status: Accepted

Solution code:
a,b,c = (int(T) for T in input().split())
print(['NO','YES'][(c-b)==(b-a)])

Submission status: Accepted

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, c = MAP()
if (b - a) == (c - b):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
ary = list(map(lambda n: int(n), input().split(" ")))

print("NO") if 2 * ary[1] - ary[0] - ary[2] else print("YES")

Submission status: Accepted

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

if(b-a) ==(c-b):
    print('YES') 
else:
    print('NO')

Submission status: Accepted

Solution code:
a, b, c = [int(x) for x in input().split()]
print("YES" if b - a == c - b else "NO")

Submission status: Accepted

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

if 2*B == A+C:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if b-a == c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
def is_beautiful(a,b,c):
  return b-a==c-b

a,b,c=map(int,input().split())
if is_beautiful(a,b,c):
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

if (b - a) == (c - b):
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

if b - a == c - b:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

if b-c==a-b:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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, c = map(int, readline().split())

    if b - a == c - b:
        print('YES')
    else:
        print('NO')

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if b-a == c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print("YES" if a[1] - a[0] == a[2] - a[1] else "NO")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().rstrip().split(" "))
if B-A == C-B:print("YES")
else:print("NO")

Submission status: Accepted

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

YN = lambda b: print('YES') if b else print('NO')
YN( b-a==c-b )

Submission status: Accepted

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

print('YES' if b - a == c - b else 'NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("YES") if b-a == c-b else print("NO")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

a,b,c = I()
if b-a == c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(['NO','YES'][b-a==c-b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    if B - A == C - B:
        return True

    return False


if __name__ == '__main__':
    res = solve()
    if res:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

if 2*b-a-c==0:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x in input().split())
if b-a == c-b:
  print ('YES')
else:
  print ('NO')

Submission status: Accepted

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

if b-a==c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

print("YES" if B - A == C - B else "NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(['NO','YES'][b - a == c - b])

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b, c = rm()
if b-a == c-b:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())
if B-A == C-B:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("YES" if B-A == C-B else "NO")

Submission status: Accepted

Solution code:
#入力
lst = input().split()

a = int(lst[0])
b = int(lst[1])
c = int(lst[2])

#出力
if b - a == c - b:
   print('YES')
else:
   print('NO')

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b, c = M()
x = b-a
y = c-b
if x == y:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

if b-a == c-b:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = [int(s) for s in input().split()]
A = i[1] - i[0]
Atwo = i[2] - i[1]
if A == Atwo:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, input().split())
    if b - a == c - b:
        print('YES')
    else:
        print("NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

    print('YES') if b - a == c - b else print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

d1 = b - a
d2 = c - b

if (d1 == d2):
    print("YES")

else:
    print("NO")

Submission status: Accepted

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

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

if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
def actual(a, b, c):
    if (b - a) == (c - b):
        return 'YES'

    return 'NO'

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    if B - A == C - B:
        print('YES')
    else:
        print('NO')
main()

Submission status: Accepted

Solution code:
import sys
a,b,c = map(int,input().split())
if a < 0 or b < 0 or c < 0 or a > 100 or b > 100 or c > 100:
    sys.exit()

diff_a_b = b - a
diff_b_c = c - b

if diff_a_b == diff_b_c:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if (b - a) == (c - b):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys

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

if b - a == c - b:
    print('YES')
    sys.exit()

print('NO')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print(['NO','YES'][b-a==c-b])

Submission status: Accepted

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

Submission status: Accepted

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

if b-a == c-b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = [int(i) for i in input().split()]
if b - a == c - b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main(a, b, c):
    A = int(a) - int(b)
    B = int(b) - int(c)
    if A == B:
        print("YES")
    else:
        print("NO")

[a, b, c] = input().split()
main(a, b, c)

Submission status: Accepted

Solution code:
#
from collections import Counter

a,b,c = map(int,input().split())
if(b-a ==  c-b):
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

b=a.split(' ')

c=[]

for i in range(3):
  c.append(int(b[i]))

if c[1]-c[0]==c[2]-c[1]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

k = b - a
l = c - b

if k == l:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A = [a,b,c]
A.sort()
if A[2] - A[1] == A[1] - A[0]:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if (b-a)==(c-b):
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if (b-a) == (c-b):
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
left = b - a
right = c - b
if left == right:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if 1 <= a <= 100 and 1 <= b <= 100 and 1 <= c <= 100:
  if b - a == c - b:
    print('YES')
  elif a - b == b - c:
    print('YES')
  else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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


if b - a == c - b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

if b-a == c-b:
  print('YES')
else:
  print("NO")

Submission status: Accepted

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

    ans = str()
    if b-a == c-b:
        ans = "YES"
    else:
        ans = "NO"
    
    print(ans)
resolve()

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c  = mi()
    print('YES') if b - a == c - b else print('NO')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

a,b,c,=map(int,input().split())
if (b-a)==(c-b):print('YES')
else:print('NO')