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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print('YNeos'[b-a!=c-b::2])

Submission status: Wrong Answer

Solution code:
#58

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=input().split()
a,b,c=int(l[0]),int(l[1]),int(l[2])
if a-b==b-c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
a1=int(a)
b1=int(b)
c1=int(c)
d=b1-a1
e=c1-b1
if d==e:
	print('yes')
else :
	print('no')

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if abs(a[0] - a[1]) == abs(a[1] - a[2]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
#coding utf-8 -*-

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

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

Submission status: Wrong Answer

Solution code:
#coding utf-8 -*-

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

if abs(a-b) == abs(c-b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

d = abs(a-b)
e = abs(b-c)

print('YES' if d == e else'NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
if abs(a-b) == abs(b-c):
	if a>=b and b>=c:
		print('Yes')
	elif a<=b and b<=c:
		print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
for s in input().split():print(s[0],end='')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(abs(n[1]-n[0])==abs(n[2]-n[1])):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

print(('No','Yes')[(b-a)==(c-b)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b-a is c-b:
    print 'YES'
else:
    print 'NO'

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if xs[1] - xs[0] and xs[2] - xs[1]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:

xs = map(int, input().split())
xs = sorted(xs)


if xs[1] - xs[0] and xs[2] - xs[1]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print((lambda x: "YES" if (x == sorted(x) or x == sorted(x)[::-1]) else "NO")([int(i) for i in input().split()]))

Submission status: Wrong Answer

Solution code:
print((lambda x: "YES" if (x == sorted(x) or x == sorted(x)[::-1]) else "NO")(map(int, input().split())))

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

if __name__ == '__main__':
    a,b,c = map(int,input().split())
    if b-a == c-b:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
# coding: utf-8

if __name__ == '__main__':
    a,b,c = map(int,input().split())
    if b-a == c-b:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
tmp1 = b - a
tmp2 = c - b
if tmp1 == tmp2 and tmp1 != 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input().split()
a,b,c = int(s[0]),int(s[1]),int(s[2])
if b-a==c-b:
 print('yes')
else:
 print('no')

Submission status: Wrong Answer

Solution code:
input=raw_input()
print input

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

a, b, c = (int(i) for i in input().split(" "))

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

Submission status: Wrong Answer

Solution code:
print (lambda l: l[2]-l[1] == l[1]-l[0] )([int(x) for x in raw_input().split()])

Submission status: Wrong Answer

Solution code:
l = list(map(int, input().split()))
 
a=l[0]
b=l[1]
c=l[2]
 
A=b-a
B=c-b
 
if A==B:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

a=l[0]
b=l[1]
c=l[2]

A=b-a
B=c-b

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

Submission status: Wrong Answer

Solution code:
import sys

x = sys.stdin.readline().strip().split(" ")

if int(x[1])-int(x[0]) is int(x[2])-int(x[1]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys

x = sys.stdin.readline().strip().split(" ")

if int(x[1])-int(x[0]) is int(x[2])-int(x[1]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from __future__ import division
import io, sys, atexit, os, itertools
sys.stdout = io.BytesIO()
atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
sys.stdin = io.BytesIO(sys.stdin.read())
raw_input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Wrong Answer

Solution code:
l = input().split()
l.sort()

a = l[0]
b = l[1]
c = l[2]

x = int(b) - int(a)
y = int(c) - int(b)

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

Submission status: Wrong Answer

Solution code:

def list_n():
    return [int(e) for e in input().split()]



def main(a, b, c):
    if b - a == c - a:
        return 'YES'
    else:
        return 'NO'


if __name__ == '__main__':
    a, b, c = list_n()
    print(main(a, b, c))

Submission status: Wrong Answer

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

    if one == two:
        print("YES")
    else:
        print("NO")



if __name__ == "__main__":
    iroha()

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())
print(['NO','YES'][b-a == c-b])

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

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

Submission status: Accepted

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

def main():
    a, b, c = map(int, input().split())
    print("YES" if b - a == c - b else "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 = input().split()
if int(a[2])-int(a[1]) == int(a[1])-int(a[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("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:
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:
    ans="YES"
else:
    ans="NO"

print(ans)

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())

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    a, b, c = read_ints()
    if b-a == c-b:
        return 'YES'
    return 'NO'


if __name__ == '__main__':
    print(solve())

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("YNEOS"[2*b!=a+c::2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A + C == B * 2:
    print('YES')
else:
    print('NO')

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 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 - ι⊥l
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:
def main():
    t = list(map(int, input().split()))
    if t[1] - t[0] == t[2] - t[1]:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#58
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())
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:
# 058_a
a, b, c = map(int, input().split())
if (1 <= a & a <= 100) & (1 <= b & b <= 100) & (1 <= c & c <= 100):
    d_ab = b - a
    d_bc = c - b
    if d_ab == d_bc:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
import sys

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


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())
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 b - a == c - b:
    ans = 'YES'
elif a - b == b - c:
    ans = 'YES'

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())
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")[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 - ι⊥l
# https://atcoder.jp/contests/abc058/tasks/abc058_a

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

result = 'NO'

if b - a == c - b:
    result = 'YES'
elif a - b == b - c:
    result = 'YES'

print(result)

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=list(map(int,input().split()))
 
if a[0]+a[2]==2*a[1]:
  print('YES')
 
else:
  print('NO')

Submission status: Accepted

Solution code:
# 柱の高さa,b,cがb-a=c-bを満たすか

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 - ι⊥l

# b-a = c-bを満たしていればYes, そうでなければNoを出力する


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

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

Submission status: Accepted

Solution code:
# 3 本の柱が等間隔に並んでいます。柱の高さは左から順に a メートル, b メートル, c メートル です。
# 柱の先端が同一直線上に並んでいる時、つまり b − a = c − b を満たしているとき、 この柱の並び方を美しいと呼びます。
# 柱の並び方が美しいかどうかを判定してください。

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())

# b-a=c-bならYes、違うならNo
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:
l=list(map(int,input().split()))
if(l[1]-l[0]==l[2]-l[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:
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:
#   AtCoder abc058 a
#   ストレッチ課題

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

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

Submission status: Accepted

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

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'[b-a!=c-b::2])

Submission status: Accepted

Solution code:
# 058a

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

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

Submission status: Accepted

Solution code:
# 3本の柱が等間隔に並んでいます。柱の高さは左から順に
# a メートル,b メートル,c メートル です。
# 柱の先端が同一直線上に並んでいる時、つまり
# b − a = c − b を満たしているとき、
# この柱の並び方を美しいと呼びます。
# 柱の並び方が美しいかどうかを判定してください。

# 標準入力から a, b, c を取得する
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:
pole1, pole2, pole3 = map(int, input().split())
if pole2 - pole1 == pole3 - pole2:
  print('YES')
else:
  print('NO')

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:
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:
# 柱の高さ（aメートル,bメートル,cメートル）を整数で入力
a,b,c = map(int,input().split())
# b-aとc-bが同じなら美しい（YES）、そうでなければNO
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')