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

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

diff_ab = b - a
diff_cb = c - b
if diff_ab == diff_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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 30, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a,b,c = map(int, readline().decode('utf8').split())

print('YES' if 2 * b == a + 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 a+c == 2*b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    a,b,c=MI()
    if b-a==c-b:print("YES")
    else:print("NO")
main()

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:
import sys
input = sys.stdin.readline
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 a + c == 2 * 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())
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("YES" if b - a == c - b else "NO")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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 a + c == b * 2:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

n_i = [int(s) for s in n]

a, b, c = n_i

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())
x = b - a
y = c - b
if x == y:
    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 = [int(s) for s in input().split()]

print(["NO", "YES"][a - b == b - c])

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:
import sys
input = sys.stdin.readline
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(lambda x: int(x), 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 a-b == b-c or b-a == c-b:
  ans = "YES"
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())

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:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a,b,c = IL()
if b*2 == a + 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 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 math

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 c + a - b*2 == 0:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
import sys

a,b,c = map(int, sys.stdin.readline().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:
import sys

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

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

if __name__ == '__main__':
    ans = main()
    print(ans)

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:
#58a
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[1]) - int(a[0]) == int(a[2]) - int(a[1]):
    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, open(0).read().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 c - b == b - a:
	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 a-b==b-c:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

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=list(map(int, input().split()))
A.sort()
if A[0]+A[2]==2*A[1]:
  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(" "))

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print('YES' if (max(a, b, c) + min(a, b, c)) / 2 == (a + b + c) / 3 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 a-b == b-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());print(" YNEOS"[b-a==c-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:
a, b, c=map(int, input().split())
if b-a==c-b:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from sys import stdin

a,b,c = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

Solution code:
# ABC058a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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:
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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    a,b,c = MI()
    print("YNEOS"[not(b-a==c-b)::2])
if __name__ == '__main__':
    main()

Submission status: Accepted

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

b_a = (b-a)
c_b = (c-b)

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

Submission status: Accepted

Solution code:
#A
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 2 * b == a + c:
    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:
# -*- coding: utf-8 -*-
import math

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

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

Submission status: Accepted

Solution code:
#ABC058 A - ι⊥l
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
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 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())
print(["NO","YES"][b-a==c-b])

Submission status: Accepted

Solution code:
def examA():
    a, b, c = LI()
    da = b-a
    db = c-b
    if da==db:
        ans="YES"
    else:
        ans="NO"
    print(ans)


import sys
import copy
import bisect
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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
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:
#ι⊥l
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 2*b==a+c else 'NO')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a+c)/2 == 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
a, b, c = [int(s) for s in input().split()]
print('YES' if b - a == c - b else '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:
a,b,c = map(int, input().split())
print('YNEOS'[not((b-a)==(c-b))::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
f=lambda x:x[0]-2*x[1]+x[2]==0
print('YES' if f(list(map(int,input().split()))) 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 a - 2*b + c == 0 else "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:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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 a + c == b * 2:
    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())
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())

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

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 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 = map(int, input().split())
print('YES' if a+c==2*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())
print("YNEOS"[(c-b!=b-a)::2])

Submission status: Accepted

Solution code:
A= list(map(int,input().split()))
a=A[0]
b=A[1]
c=A[2]
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 c - b == b - a:
    ans = "YES"
else:
    ans = "NO"

print(ans)

Submission status: Accepted

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

if a + c == 2 * b :
    print('YES')
else :
    print('NO')

Submission status: Accepted

Solution code:
a, b, c = tuple(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" if 2*b-a-c else "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 = 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:
#2019/10/03
a, b, c = map(int, open(0).read().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 slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print("YES" if b - a == c - b else "NO")


if __name__ == '__main__':
    slove()

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


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, 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 a+c==2*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:
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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    a,b,c = INTM()
    if (a+c)/2 == b:
        print('YES')
    else:
        print('NO')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
gap1 =a-b
gap2=b-c
if gap1==gap2:
    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(n) for n in input().split()]
print('YES' if B * 2 == A + 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-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 A-B == B-C else "NO")

Submission status: Accepted

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

if A-B == B-C:
  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")


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

Solution code:
x=list(input().split())
x1=int(x[0])
x2=int(x[1])
x3=int(x[2])
if (x2-x1)==(x3-x2):
  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())
print("YES" if c-b == b-a 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
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 = (int(x) for x in input().split())

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

Submission status: Accepted

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

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

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:
#print(" ",sep='',end='')
s=input().split()
a=int(s[0])
b=int(s[1])
c=int(s[2])

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())
print("YES" if a+c == 2*b else "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:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
a,b,c=map(int,input().split())

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