input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
A, B = list(map(int, input().split()))
numbers = list(range(A, B+1))
count = 0
for i in numbers:
m = str(i)
rm = ''.join(list(reversed(m)))
if m == rm:
count += 1
print(count) | A, B = list(map(int, input().split()))
x = list(range(1,10))
y = list(range(10))
count = 0
for p in x:
for q in y:
for r in y:
sakasama = int(str(p)+str(q)+str(r)+str(q)+str(p))
if A <= sakasama <= B:
count += 1
print(count) | p03416 |
a,b = list(map(int, input().split()))
cnt =0
for i in range(a,b+1):
if str(i) ==str(i)[::-1]:
cnt +=1
print(cnt) | a,b = list(map(int, input().split()))
cnt =0
for i in range(a,b+1):
if str(i)[::-1] ==str(i):
cnt +=1
print(cnt) | p03416 |
def findSumDigit(num):
global total
total = ""
while num > 0:
total += str(num % 10)
num //= 10
return total
def main():
a,b = list(map(int, input().split()))
ans = 0
for i in range(a,b+1):
tmp = str(findSumDigit(i))
if tmp == str(i):
ans += 1
print(ans)
if __name__ == '__main__':
main() | a, b = list(map(int, input().split()))
ans = 0
for i in range(a,b+1):
seki_gyaku = str(i)
if seki_gyaku == seki_gyaku[::-1]:
ans += 1
print(ans)
| p03416 |
A, B = list(map(int, input().split()))
cnt = 0
for n in range(A, B+1):
n_s = str(n)
n_s_len = len(n_s)
for i in range(n_s_len//2):
if n_s[i] != n_s[n_s_len-i-1]:
break
else:
cnt += 1
print(cnt)
| A, B = list(map(int, input().split()))
cnt = 0
for n in range(A, B+1):
n_s = str(n)
n_s_rvs = n_s[::-1]
if n_s == n_s_rvs:
cnt += 1
print(cnt)
| p03416 |
A, B = list(map(int, input().split()))
cnt = 0
for n in range(A, B+1):
n_s = str(n)
n_s_rvs = n_s[::-1]
if n_s == n_s_rvs:
cnt += 1
print(cnt)
| A, B = list(map(int, input().split()))
cnt = 0
for n in range(A, B+1):
if n//10000 == n%10 and (n//1000)%10 == (n//10)%10:
cnt += 1
print(cnt)
| p03416 |
A,B = list(map(int,input().split()))
#greedy O(B-A)*len(B)(=5)
kaibun = 0 # num of kaibun
for i in range(A,B+1,1):
s = str(i)
#print(s)
for i in range(len(s)):
if s[i] != s[len(s)-1-i]:
break
if i == len(s)-1:
kaibun += 1
print(kaibun)
| # 回文数になるA<= <=Bの数の個数
a,b = list(map(int,input().split()))
ans = 0
for i in range(a,b+1,1):
s = str(i)
if s == s[::-1]:
ans += 1
print(ans)
| p03416 |
A,B = list(map(int,input().split()))
def kaibun(n):
key = 0
for i in range(1,n+1):
if str(i) == str(i)[::-1]:
key += 1
return key
print((kaibun(B)-kaibun(A-1))) | A,B = list(map(int,input().split()))
def kaibun(m, n):
key = 0
for i in range(m,n+1):
if str(i) == str(i)[::-1]:
key += 1
return key
print((kaibun(A,B))) | p03416 |
A,B = list(map(int,input().split()))
def kaibun(m, n):
key = 0
for i in range(m,n+1):
if str(i) == str(i)[::-1]:
key += 1
return key
print((kaibun(A,B))) | A,B = list(map(int,input().split()))
def kaibun(m, n):
key = 0
for i in range(m,n+1):
s = i//10000
t = i%10
u = i//1000 % 10
v = i//10 % 10
if (s==t)&(u==v):
key += 1
return key
print((kaibun(A,B))) | p03416 |
#
# abc090 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """11009 11332"""
output = """4"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """31415 92653"""
output = """612"""
self.assertIO(input, output)
def resolve():
A, B = list(map(int, input().split()))
ans = 0
for i in range(A, B+1):
s = str(i)
for j in range((len(s)+1)//2):
if s[j] != s[-1-j]:
break
else:
ans += 1
print(ans)
if __name__ == "__main__":
# unittest.main()
resolve()
| #
# abc090 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """11009 11332"""
output = """4"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """31415 92653"""
output = """612"""
self.assertIO(input, output)
def resolve():
A, B = list(map(int, input().split()))
ans = 0
for i in range(A, B+1):
s = str(i)
for j in range(3):
if s[j] != s[-1-j]:
break
else:
ans += 1
print(ans)
if __name__ == "__main__":
# unittest.main()
resolve()
| p03416 |
#
# abc090 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """11009 11332"""
output = """4"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """31415 92653"""
output = """612"""
self.assertIO(input, output)
def resolve():
A, B = list(map(int, input().split()))
ans = 0
for i in range(A, B+1):
s = str(i)
for j in range(3):
if s[j] != s[-1-j]:
break
else:
ans += 1
print(ans)
if __name__ == "__main__":
# unittest.main()
resolve()
| #
# abc090 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """11009 11332"""
output = """4"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """31415 92653"""
output = """612"""
self.assertIO(input, output)
def resolve():
A, B = list(map(int, input().split()))
ans = 0
for i in range(A, B+1):
s = str(i)
if s[0] == s[-1] and s[1] == s[-2]:
ans += 1
print(ans)
if __name__ == "__main__":
# unittest.main()
resolve()
| p03416 |
a,b = list(map(int, input().split()))
count = 0
for i in range(a,b+1):
j = str(i)
if j==''.join(reversed(j)):
count += 1
print(count) | a,b = list(map(int, input().split()))
n = [i for i in map(str, list(range(a,b+1))) if i==i[::-1]]
print((len(n))) | p03416 |
a,b = list(map(int,input().split()))
n = b - a + 1
count = 0
for i in range(n):
x = a + i
xx = list(str(x))
xx.reverse()
xx = int("".join(xx))
if x == xx:
count += 1
print(count) | a,b=input().split()
ans=0
for i in range(int(a),int(b)+1):
if str(i)==str(i)[::-1]:
ans+=1
print(ans) | p03416 |
A, B = list(map(int, input().split()))
count = 0
for num in range(A, B+1):
nl = list(str(num))
kai = [nl[-i] for i in range(1, len(nl)+1)]
if int("".join(kai))==num:
count += 1
print(count) | A, B = list(map(int, input().split()))
count = 0
for num in range(A, B+1):
nl = str(num)
kai = [nl[-i] for i in range(1, len(nl)+1)]
if int("".join(kai))==num:
count += 1
print(count) | p03416 |
a, b = list(map(int, input().split()))
d = 0
for i in range(a, b+1):
c = str(i)
e = True
for j in range(len(c)//2):
if c[j] != c[-j-1] and e:
e = not e
if e:
d += 1
print(d)
| a, b = list(map(int, input().split()))
d = 0
for i in range(a, b+1):
c = str(i)
if c[0] == c[-1] and c[1] == c[-2]:
d += 1
print(d)
| p03416 |
a, b = list(map(int, input().split()))
count = 0
for i in range(a,b+1):
s = str(i)
if s[0] == s[4] and s[1] == s[3]:
count += 1
else:
pass
print(count)
| a, b = list(map(int, input().split()))
count = 0
for i in range(a,b+1):
if i//10000 == i%10 and i//1000 %10 == i//10 %10:
count += 1
print(count)
| p03416 |
A, B = list(map(int, input().split()))
cnt = 0
for x in range(A, B + 1):
X = str(x)
if X == X[::-1]:
cnt += 1
print(cnt) | A, B = list(map(int, input().split()))
cnt = 0
for i in range(A, B+1):
x = str(i)
if x[0] == x[4] and x[1] == x[3]:
cnt += 1
print(cnt) | p03416 |
# vim: fileencoding=utf-8
def main():
a, b = list(map(int, input().split()))
c = 0
for i in range(a, b + 1):
s = str(i)
r = "".join(reversed(list(s)))
if s == r:
c += 1
print(c)
if __name__ == "__main__":
main()
| # vim: fileencoding=utf-8
def main():
a, b = list(map(int, input().split()))
c = 0
for i in range(a, b + 1):
# s = str(i)
# r = "".join(reversed(list(s)))
# if s == r:
# c += 1
if (i % 10) == (i // 10000 % 10) and (i // 10 % 10) == (i // 1000 % 10):
c += 1
print(c)
if __name__ == "__main__":
main()
| p03416 |
A,B = list(map(int,input().split()))
ans = 0
for i in range(A,B+1):
i = str(i)
if i[0] == i[4]:
if i[1] == i[3]:
ans += 1
else:
ans += 0
else:
ans += 0
print(ans) | A,B = list(map(int,input().split()))
ans = 0
for i in range(A,B+1):
k = str(i)
if k[0] == k[4] and k[1] == k[3]:
ans += 1
print(ans) | p03416 |
a, b = list(map(int, input().split()))
cnt = 0
for x in range(a, b + 1):
s = str(x)
l = len(s)
flg = True
for i in range(l // 2):
if s[i] != s[l - 1 - i]:
flg = False
break
if flg:
cnt += 1
print(cnt)
| a, b = list(map(int, input().split()))
cnt = 0
for i in range(a, b + 1):
s = str(i)
if s[0] == s[4] and s[1] == s[3]:
cnt += 1
print(cnt) | p03416 |
a,b = list(map(int,input().split()))
count = 0
for i in range(a,b+1):
if str(i) == str(i)[::-1]:count += 1
print(count) | a,b = list(map(int,input().split()))
print((sum([i == i[::-1] for i in map(str,list(range(a,b+1)))]))) | p03416 |
A, B = list(map(int, input().split()))
count = 0
for n in range(A, B+1):
n = str(n)
if n == n[::-1]:
count += 1
print(count)
| A, B = list(map(int, input().split()))
print((sum(n == n[::-1] for n in map(str, list(range(A, B+1)))))) | p03416 |
a,b = list(map(int,input().split()))
k = 0
for i in range(a,b+1):
s = str(i)
if s[0]==s[-1] and s[1] == s[-2]:
k += 1
print(('{}'.format(k)))
| A, B = list(map(int, input().split()))
ans = 0
for i in range(A, B+1):
moji = str(i)
if moji[0] == moji[4] and moji[1] == moji[3]:
ans += 1
print(ans) | p03416 |
a,b = list(map(int,input().split()))
d = 0
for i in range(a,b+1):
s = str(i)
if s[0] == s[-1] and s[1] == s[-2]:
d += 1
print(d) | s = input().split()
sa,sb = s[0],s[1]
a,b = int(sa),int(sb)
ap = int(sa[0]+sa[1]+sa[2]+sa[1]+sa[0])
bp = int(sb[0]+sb[1]+sb[2]+sb[1]+sb[0])
da = int(a/100)
db = int(b/100)
if ap < a:
da += 1
if b < bp:
db -= 1
print((db-da + 1)) | p03416 |
a,b = list(map(int,input().split()))
print((sum(i == i[::-1] for i in map(str,list(range(a,b+1)))))) | a,b = list(map(int,input().split()))
print((len([i for i in map(str,list(range(a,b+1)))if i == i[::-1]]))) | p03416 |
a,b = list(map(int, input().split()))
c = 0
while a <= b:
if str(a)[::-1] == str(a):
c += 1
a += 1
print(c) | a,b = list(map(int, input().split()))
c = 0
for i in map(str,list(range(a,b+1))):
if i==i[::-1]:
c += 1
print(c) | p03416 |
def main():
#1. input
a, b = list(map(int, input().split()))
ans = 0
#2. from A to B
for i in range(a, b+1):
#2.1. judge if the number is palindromic
if (str(i)[0]==str(i)[4]) and (str(i)[1]==str(i)[3]):
ans = ans+1
#3. output
print(ans)
if __name__ == '__main__':
main() |
A,B = list(map(int, input().split()))
ans = 0
for n in range(A,B+1):
norm = str(n)
rev = norm[::-1]
if norm == rev:
ans += 1
print(ans) | p03416 |
a,b=list(map(int,input().split()))
ans=0
for i in range(a,b+1):
ir=str(i)
ir=ir[::-1]
ir=int(ir)
if i == ir:
ans+=1
print(ans) | a,b=list(map(int,input().split()))
ans=0
for i in range(a,b+1):
ir=str(i)
if ir == ir[::-1]:
ans+=1
print(ans)
| p03416 |
a,b = list(map(int,input().split()))
ans = 0
for i in range(a,b+1):
li = list(str(i))
if(li[0] == li[4] and li[1] == li[3]):
ans += 1
print(ans) | a, b = list(map(int, input().split()))
ans = 0
for i in range(a, b + 1):
val = str(i)
if (val[0] == val[4] and val[1] == val[3]):
ans += 1
print(ans) | p03416 |
a,b = list(map(int,input().split()))
count = 0
for i in range(a,b+1):
if str(i) == str(i)[::-1]:
count += 1
print(count)
| a,b = list(map(int,input().split()))
print((sum(i==i[::-1] for i in map(str,list(range(a,b+1)))))) | p03416 |
a, b = list(map(int, input().split()))
result = 0
for i in range(a, b + 1):
i_str = str(i)
border = len(i_str) // 2
first_half = i_str[:border]
if len(i_str) % 2 != 0:
border += 1
second_half = i_str[border:]
compared = second_half[::-1]
if first_half == compared:
result += 1
print(result)
| a, b = list(map(int, input().split()))
result = 0
for i in range(a, b + 1):
i_str = str(i)
idx_of_half = len(i_str) // 2
first_half = i_str[:idx_of_half]
if len(i_str) % 2 != 0:
idx_of_half += 1
second_half = i_str[idx_of_half:]
if first_half == second_half[::-1]:
result += 1
print(result)
| p03416 |
a, b = list(map(int,input().strip().split(' ')))
a_rev = ""
i = 0
j = 0
cnt = 0
#chk = []
for i in range(b - a + 1):
for j in range(len(str(a))):
a_rev = a_rev + str(a)[len(str(a)) - 1 - j]
if str(a_rev) == str(a):
cnt+=1
# chk.append(a_rev) #test
else:
pass
a+=1
a_rev =""
print(cnt)
#print(chk) | a,b = list(map(int,input().split()))
cnt = 0
for i in range(a,b+1):
i = str(i)
if i == i[::-1]:
cnt += 1
print(cnt) | p03416 |
n, m = list(map(int, input().split()))
ans = 0
for i in range(n, m+1):
if str(i)[0]+str(i)[1] == str(i)[-1]+str(i)[-2]: ans += 1
print(ans) | a, b = list(map(int, input().split()))
ans = 0
for n in range(a, b+1):
if str(n) == str(n)[::-1]: ans += 1
print(ans) | p03416 |
a,b=list(map(int,input().split()));c=0
while a<=b:s=str(a);c+=s==s[::-1];a+=1
print(c) | a,b=list(map(int,input().split()));print((sum(s==s[::-1]for s in map(str,list(range(a,b+1)))))) | p03416 |
counter = 0
c = list(map(int, input().split(' ')))
for i in range(c[0], c[1] + 1):
if str(i)[0] != str(i)[4]:
continue
if str(i)[1] != str(i)[3]:
continue
counter += 1
print(counter) | a = list(map(int, input().split()))
counter = 0
for i in range(a[0], a[1] + 1):
stri = str(i)
if (stri[0] == stri[4] and stri[1] == stri[3]):
counter += 1
print(counter) | p03416 |
A,B = list(map(int,input().split()))
print(([str(n)==str(n)[::-1] for n in range(A,B+1)].count(True))) | A,B = list(map(int,input().split()))
ans = 0
for n in range(A,B+1):
s = str(n)
if s == s[::-1]:
ans += 1
print(ans) | p03416 |
A, B = list(map(int, input().split()))
counter = 0
for num in range(A, B + 1):
if str(num) == str(num)[::-1]:
counter += 1
print(counter)
| A, B = list(map(int, input().split()))
ans = 0
for i in range(A, B + 1):
if str(i) == str(i)[::-1]:
ans += 1
print(ans) | p03416 |
a,b = list(map(int, input().split()))
n = 0
for i in range(a, b + 1):
f = True
s = str(i)
l = len(s)
for j in range(l//2 + 1):
if s[j] != s[- j - 1]:
f = False
break
if f:
n += 1
print(n) | a,b = list(map(int, input().split()))
n = 0
for i in range(1, 10):
for j in range(10):
for k in range(10):
s = 10000 * i + 1000 * j + 100 * k + 10 * j + i
if a <= s <= b:
n += 1
print(n) | p03416 |
print((sum(s[0]==s[4]and s[1]==s[3]for s in map(str,list(range(*list(map(sum,enumerate(map(int,input().split())))))))))) | print((sum(s[0]==s[4]for s in map(str,list(range(*list(map(sum,enumerate(map(int,input().split())))))))if s[1]==s[3]))) | p03416 |
# 回文かどうかを調べる関数
def is_palindrome(s: str) -> bool:
return s[:len(s)//2] == "".join(list(reversed(s[-1*(len(s)//2):])))
a, b = [int(i) for i in input().split()]
print(([is_palindrome(str(n)) for n in range(a, b+1)].count(True))) | def is_palindrome(s: str) -> bool:
return s[:len(s)//2] == s[-1*(len(s)//2):][::-1]
a, b = [int(i) for i in input().split()]
print(([is_palindrome(str(n)) for n in range(a, b+1)].count(True))) | p03416 |
a, b = list(map(int, input().split()))
cnt = 0
for i in range(a, b+1):
if str(i) == str(i)[::-1]:
cnt += 1
print(cnt) | a, b = list(map(int, input().split()))
lst = [1 for i in range(a, b+1) if str(i) == str(i)[::-1]]
print((sum(lst))) | p03416 |
A,B=list(map(int,input().split()))
count=0
for i in range(A,B+1):
if list(str(i)) == list(reversed(str(i))):
count+=1
print(count)
| A,B=list(map(int,input().split()))
count=0
for i in range(A,B+1):
if str(i) == ''.join(reversed(str(i))):
count+=1
print(count)
| p03416 |
a,b=list(map(int,input().split()))
res=0
for i in range(a,b+1):
s=str(i)
res += s==s[::-1]
print(res)
| a,b = list(map(int,input().split()))
res = 0
for i in range(a,b+1):
s = str(i)
if s == s[::-1]:
res += 1
print(res)
| p03416 |
a, b = list(map(int, input().split()))
count = 0
for i in range(a, b + 1):
listed_i = list(str(i))
if listed_i[0] == listed_i[4] and listed_i[1] == listed_i[3]:
count += 1
print(count)
| a, b = list(map(int, input().split()))
count = 0
for i in range(a, b + 1):
s = i // 10000
t = (i % 10000) // 1000
u = (i % 100) // 10
v = i % 10
if s == v and t == u:
count += 1
print(count)
| p03416 |
a,b = list(map(int,input().split()))
answer = 0
for i in range(a,b+1) :
j = str(i)
p1 = j[4]
p2 = j[3]
p3 = j[2]
p4 = j[1]
p5 = j[0]
k = int(p1+p2+p3+p4+p5)
if i == k :
answer += 1
print(answer)
| A,B = list(map(int,input().split()))
ans = 0
for i in range(A,B+1) :
l = str(i)
if l[0] == l[4] and l[1] == l[3] :
ans += 1
print(ans)
| p03416 |
A, B = list(map(int, input().split()))
count_target = 0
for i in range(A, B + 1):
str_i = str(i)
reversed_i = ''
for n_th_i in reversed(list(range(len(str_i)))):
reversed_i += str_i[n_th_i]
if str_i == reversed_i:
count_target += 1
print(count_target) | A, B = list(map(int, input().split()))
count_target = 0
for i in range(A, B+1):
str_i = str(i)
reversed_i = str_i[::-1]
if str_i == reversed_i:
count_target += 1
print(count_target)
| p03416 |
A, B = list(map(int,input().split()))
cnt = 0
for i in range(A,B+1):
if(list(str(i)) == list(str(i))[::-1]):
cnt += 1
print(cnt) | A, B = list(map(int,input().split()))
cnt = 0
for i in range(A, B+1):
if(str(i) == str(i)[::-1]):
cnt += 1
print(cnt) | p03416 |
a,b=list(map(int,input().split()))
ans=0
for i in range(b+1)[a:]:
if len(str(i))%2==0:
p=list(str(i))[:len(str(i))//2]
q=list(reversed(list(str(i))[len(str(i))//2:]))
if p==q:
ans+=1
else:
s=list(str(i))[:len(str(i))//2+1]
d=list(reversed(list(str(i))[len(str(i))//2:]))
if s==d:
ans += 1
print(ans) | a,s=list(map(int,input().split()))
ad=0
for i in range(a,s+1):
if str(i)==str(i)[::-1]:ad+=1
print(ad) | p03416 |
a, b = list(map(int, input().split()))
ans = 0
for x in range(a,b+1):
s = str(x)
if s == ''.join(reversed(s)):
ans += 1
print(ans)
| a, b = list(map(int, input().split()))
ans = 0
for x in range(a,b+1):
s = str(x)
# if s == ''.join(reversed(s)):
if s == s[::-1] :
ans += 1
print(ans)
| p03416 |
def palindromeQ(num):
if num%10==num//10000:
if (num%100)//10==(num//1000)%10:
return(1)
else:
return(0)
else:
return(0)
ans=0
A,B=[int(s) for s in input().split()]
for i in range(A,B+1):
ans+=palindromeQ(i)
print(ans)
| A,B=[int(s) for s in input().split()]
a=A//100
b=B//100
def pal(num):
return num*101-num%10-(num//100)*99
ans=b-a-1
if pal(a)>=A:
ans+=1
if pal(b)<=B:
ans+=1
print(ans)
| p03416 |
A,B = list(map(int,input().split()))
count = 0
for i in range(A, B + 1):
aa =str(i)
rslt = aa[::-1]
if aa == rslt:
count += 1
print(count) | A,B = list(map(int,input().split()))
su = abs(A -B)
count = 0
for i in range(A, B + 1):
aa =str(i)
rslt = aa[::-1]
if aa == rslt:
count += 1
print(count) | p03416 |
# -*- coding: utf-8 -*-
A,B = list(map(int,input().split()))
a = [] # 回文数の個数を入れるリストの作成
for i in range(A,B+1):
if str(i) == str(i)[::-1]: #回文数を発見した場合
a.append(1) #リストaに1を追加する
else: #iが回文数でない場合
pass # 何もしない
print((sum(a))) #リスト内の1をすべて足す
| ans = 0
A,B = list(map(int,input().split()))
for i in range(A,B+1):
I = str(i)
if I[0] == I[4] and I[1] == I[3]:
ans += 1
print(ans) | p03416 |
a, b = list(map(int, input().split()))
ans = 0
for i in range(a, b + 1):
if str(i) == str(i)[::-1]:
ans += 1
print(ans)
| a, b = list(map(int, input().split()))
ans = 0
for i in range(a, b + 1):
str_i = str(i)
if str_i == str_i[::-1]:
ans += 1
print(ans) | p03416 |
a,b=list(map(int,input().split()))
x=0
for i in range(a,b+1):
if str(i)[:2]==str(i)[3:5][::-1]:
x+=1
print(x) | # 入力
A,B=list(map(int,input().split()))
c=0
for i in range(A,B+1):
i=str(i)
# 1桁目と5桁目が一致する
# かつ2桁目と4桁目が一致する場合
if i[0]==i[4] and i[1]==i[3]:
c+=1
# 出力
print(c) | p03416 |
a,b = (int(i) for i in input().split())
ct= 0
for i in range(a,b+1):
judge = str(i)
if judge == judge[4]+judge[3]+judge[2]+judge[1]+judge[0]:
ct += 1
print(ct) | def solve():
a,b = (int(i) for i in input().split())
ct = 0
for judge in range(a,b+1):
j = str(judge)
if j[0] == j[4] and j[1] == j[3]:
ct += 1
print(ct)
solve() | p03416 |
A,B=list(map(int,input().split()))
count=0
for i in range(A,B+1):
#print(i)
str_i=str(i)
for j in range(len(str_i)):
#print(str_i[j],str_i[-j-1])
if(str_i[j]!=str_i[-j-1]):
break
if(j>(len(str_i)//2+1)):
#print(i)
count+=1
print(count) | A,B=list(map(int,input().split()))
S=0
for I in range(A,B+1):
Q=str(I)
R=Q[::-1]
if R==Q:
S+=1
print(S) | p03416 |
A,B=list(map(int,input().split()))
S=0
for I in range(A,B+1):
Q=str(I)
R=Q[::-1]
if R==Q:
S+=1
print(S) | a,b=list(map(int,input().split()))
print((len([i for i in map(str,list(range(a,b+1))) if i==i[::-1]])))#条件を満たすとき、リストの長さを１増やす。リストの長さが回文数の数。 | p03416 |
# ABC090 B - Palindromic Numbers
a,b = list(map(int,input().split()))
ans = 0
for i in range(a,b+1):
s = ''
s = str(i)
if s[0:1]==s[4:5] and s[1:2]==s[3:4]:
ans += 1
print(ans) | a,b=list(map(int,input().split()))
ans=0
for i in range(a,b+1):
t=str(i)
if t==t[::-1]:
ans+=1
print(ans)
| p03416 |
a, b = list(map(int, input().split()))
x = 0
for i in range(a, b+1):
if str(i)==str(i)[::-1]:
x+=1
print(x) | a,b=list(map(int,input().split()))
print((len([i for i in map(str, list(range(a, b+1))) if i==i[::-1]]))) | p03416 |
a,b = list(map(int,input().split()))
ans = 0
for i in range(a,b+1):
if str(i) == str(i)[::-1]:
ans += 1
print(ans) | a,b = list(map(int,input().split()))
ans = 0
for i in range(a,b+1):
s = str(i)
if s == s[::-1]:
ans += 1
print(ans) | p03416 |
a, b = list(map(int, input().split()))
count = 0
for i in range(a, b+1):
i = str(i)
if i[0] == i[-1] and i[1] == i[-2]:
count +=1
print(count) | A, B = list(map(int, input().split()))
count = 0
for i in range(A, B+1):
s = str(i)
if s[0] == s[4] and s[1] == s[3]:
count += 1
print(count)
| p03416 |
a, b = list(map(int, input().split()))
count = 0
for i in range(a, b + 1):
if str(i)[0] == str(i)[4] and str(i)[1] == str(i)[3]:
count += 1
print(count) | a, b = list(map(int, input().split()))
cnt = 0
for i in range(a, b + 1):
if str(i) == str(i)[::-1]:
cnt += 1
print(cnt) | p03416 |
A,B = list(map(int,input().split()))
j = 0
for i in range(A,B+1):
l = list(str(i))
l_reverse = list(reversed(l))
if l == l_reverse:
j += 1
print(j) | A, B = list(map(int,input().split()))
ans = 0
for n in range(A, B+1):
n = str(n)
if n == n[::-1]:
ans += 1
print(ans) | p03416 |
import math
A, B = list(map(int, input().split()))
flag = True
count = 0
for i in range(A, B+1):
for j in range(int(math.ceil(len(str(A)))/2)):
if str(i)[j] != str(i)[-1-j]:
count -= 1
break
count += 1
print(count) | import math
A, B = list(map(int, input().split()))
flag = True
count = B-A+1
for i in range(A, B+1):
for j in range(int(math.ceil(len(str(A)))/2)):
if str(i)[j] != str(i)[-1-j]:
count -= 1
break
print(count)
| p03416 |
a,b=list(map(int,input().split()))
ans=0
for i in range(a,b+1):
buf=str(i)
#print(buf[0:int(len(buf)/2)],buf[int(len(buf)/2+1):])
str1=buf[0:int(len(buf)/2)]
str2=buf[int(len(buf)/2+1):]
if str1[0]==str2[1] and str1[1]==str2[0]:
ans+=1
print(ans)
| a,b=list(map(int,input().split()))
ans=0
for i in range(a,b+1):
buf=str(i)
str1=buf[::-1]
if buf==str1:
ans+=1
print(ans)
| p03416 |
In = input().split(" ")
T = int(In[0])
A = int(In[1])
K = int(In[2])
if K>=T+A:
print("0 0")
else:
if (K > T):
print(("0 {0}".format(A-(K-T))))
elif (T > K):
print(("{0} {1}".format(T-K, A)))
else:
for i in range(K):
if T >= 1:
T -= 1
else:
if A >= 1:
A -= 1
else:
break
print(("{0} {1}".format(T, A))) | In = input().split(" ")
T = int(In[0])
A = int(In[1])
K = int(In[2])
if K <= T:
print(("{0} {1}".format(T-K,A)))
elif K <= T+A:
print(("0 {0}".format(A-(K-T))))
else:
print("0 0") | p02818 |
a,b,k = list(map(int,input().split()))
if (a + b) <= k:
print("0 0")
else:
for i in range (k):
if a > 0:
a -= 1
elif b > 0:
b -= 1
else:
break
print((str(a) + " " + str(b))) | a,b,k = list(map(int,input().split()))
if (a + b) <= k:
a = 0
b = 0
elif a >= k:
a = a - k
else:
b = b - (k - a)
a = 0
print((str(a) + " " + str(b))) | p02818 |
A,B,K = list(map(int,input().split()))
if K >= A+B:
print((str(0)+' '+str(0)))
else:
for i in range(K):
if A > 0:
A -= 1
elif B > 0:
B -= 1
print((str(A)+' '+str(B))) | A,B,K = list(map(int,input().split()))
if K >= A+B:
print((str(0)+' '+str(0)))
elif K < A:
print((str(A-K)+' '+str(B)))
elif K >= A:
print((str(0)+' '+str(B-(K-A)))) | p02818 |
a = list(map(int, input().split()))
if((a[0]+a[1]) == a[2]):
print("0 0")
if((a[0]+a[1]) != a[2]):
for i in range(0, a[2]):
if(a[0] >= 1):
a[0] -= 1
elif(a[1] >= 1):
a[1] -= 1
print(("%d %d"%(a[0],a[1]))) | a = list(map(int, input().split()))
t = a[0]-a[2]
if t<0:
a[1] = a[1] +t
if(a[1] < 0):
a[1] = 0
t = 0
print(("%d %d"%(t,a[1])))
| p02818 |
# Dinic algorithm
from collections import deque
class Dinic:
def __init__(self, n):
self.n = n
self.g = [[] for i in range(n)]
def add_edge(self, fr, to, cap):
self.g[fr].append([to, cap, len(self.g[to])])
self.g[to].append([fr, 0, len(self.g[fr])-1])
def add_multi_edge(self, v1, v2, cap1, cap2):
self.g[v1].append([v2, cap1, len(self.g[v2])])
self.g[v2].append([v1, cap2, len(self.g[v1])-1])
def bfs(self, s):
level = [-1]*self.n
deq = deque()
level[s] = 0
deq.append(s)
while deq:
v = deq.popleft()
for e in self.g[v]:
if e[1]>0 and level[e[0]]<0:
level[e[0]] = level[v] + 1
deq.append(e[0])
self.level = level
def dfs(self, v, t, f):
if v==t: return f
es = self.g[v]
level = self.level
for i in range(self.it[v], len(self.g[v])):
e = es[i]
if e[1]>0 and level[v]<level[e[0]]:
d = self.dfs(e[0], t, min(f, e[1]))
if d>0:
e[1] -= d
self.g[e[0]][e[2]][1] += d
self.it[v] = i
return d
self.it[v] = len(self.g[v])
return 0
def max_flow(self, s, t):
flow = 0
while True:
self.bfs(s)
if self.level[t]<0: break
self.it = [0]*self.n
while True:
f = self.dfs(s, t, 10**9+7)
if f>0:
flow += f
else:
break
return flow
while 1:
h, w = list(map(int, input().split()))
if h == w == 0:
break
R = [input() for i in range(h)]
conn = [[0 for i in range(w)] for i in range(h)]
P = []
Q = []
dep = 0
for i in range(h-1):
for j in range(w-1):
first = R[i][j:j+2]; second = R[i+1][j:j+2]
# .# ##
# if R[i:i+2][j:j+2] is ## or .#
if (first == '.#' and second == '##') or (first == '##' and second == '.#'):
k = j
# #. #. ##
# while R[i:i+2][k:k+2] is not ## and #. and #.
while k+1 < w and R[i][k+1] != '.' and R[i+1][k+1] != '.':
k += 1
# #. ##
# if R[i:i+2][k:k+2] is ## or #.
if k+1 < w and ((R[i][k+1] == '#') ^ (R[i+1][k+1] == '#')):
P.append(((i, j), (i, k))) # (P)
conn[i][j] += 1
conn[i][k] += 1
# .# #.
# if R[i:i+2][j:j+2] is ## or ##
if first in ['.#', '#.'] and second == '##':
k = i
# ## ## ##
# while R[k:k+2][j:j+2] is not #. and .. and .#
while k+1 < h and R[k+1][j] != '.' and R[k+1][j+1] != '.':
k += 1
# ## ##
# if R[k:k+2][j:j+2] is #. or .#
if k+1 < h and ((R[k+1][j] == '#') ^ (R[k+1][j+1] == '#')):
Q.append(((i, j), (k, j))) # (Q)
conn[i][j] += 1
conn[k][j] += 1
if first.count('#') + second.count('#') == 3:
dep += 1
# Bipartite graph
dinic = Dinic(2 + len(P) + len(Q))
# (s) -> (P)
for i in range(len(P)):
dinic.add_edge(0, i+2, 1)
# (Q) -> (t)
for i in range(len(Q)):
dinic.add_edge(len(P)+i+2, 1, 1)
# (P) -> (Q)
for i, p in enumerate(P):
(a, b), (a, s) = p
for j, q in enumerate(Q):
(c, d), (t, d) = q
# check if two line segments intersect
if c <= a <= t and b <= d <= s:
dinic.add_edge(i+2, len(P) + j+2, 1)
print(dep - (len(P) + len(Q) - dinic.max_flow(0, 1)) + 1) | # Dinic algorithm
from collections import deque
class Dinic:
def __init__(self, n):
self.n = n
self.g = [[] for i in range(n)]
def add_edge(self, fr, to, cap):
self.g[fr].append([to, cap, len(self.g[to])])
self.g[to].append([fr, 0, len(self.g[fr])-1])
def add_multi_edge(self, v1, v2, cap1, cap2):
self.g[v1].append([v2, cap1, len(self.g[v2])])
self.g[v2].append([v1, cap2, len(self.g[v1])-1])
def bfs(self, s):
level = [-1]*self.n
deq = deque()
level[s] = 0
deq.append(s)
while deq:
v = deq.popleft()
for e in self.g[v]:
if e[1]>0 and level[e[0]]<0:
level[e[0]] = level[v] + 1
deq.append(e[0])
self.level = level
def dfs(self, v, t, f):
if v==t: return f
es = self.g[v]
level = self.level
for i in range(self.it[v], len(self.g[v])):
e = es[i]
if e[1]>0 and level[v]<level[e[0]]:
d = self.dfs(e[0], t, min(f, e[1]))
if d>0:
e[1] -= d
self.g[e[0]][e[2]][1] += d
self.it[v] = i
return d
self.it[v] = len(self.g[v])
return 0
def max_flow(self, s, t):
flow = 0
while True:
self.bfs(s)
if self.level[t]<0: break
self.it = [0]*self.n
while True:
f = self.dfs(s, t, 10**9+7)
if f>0:
flow += f
else:
break
return flow
while 1:
h, w = list(map(int, input().split()))
if h == w == 0:
break
R = [input() for i in range(h)]
P = []; Q = []
dep = 0
for i in range(h-1):
for j in range(w-1):
first = R[i][j:j+2]; second = R[i+1][j:j+2]
# .# ##
# if R[i:i+2][j:j+2] is ## or .#
if (first == '.#' and second == '##') or (first == '##' and second == '.#'):
k = j
# #. #. ##
# while R[i:i+2][k:k+2] is not ## and #. and #.
while k+1 < w and R[i][k+1] != '.' and R[i+1][k+1] != '.':
k += 1
# #. ##
# if R[i:i+2][k:k+2] is ## or #.
if k+1 < w and ((R[i][k+1] == '#') ^ (R[i+1][k+1] == '#')):
P.append(((i, j), (i, k))) # (P)
# .# #.
# if R[i:i+2][j:j+2] is ## or ##
if first in ['.#', '#.'] and second == '##':
k = i
# ## ## ##
# while R[k:k+2][j:j+2] is not #. and .. and .#
while k+1 < h and R[k+1][j] != '.' and R[k+1][j+1] != '.':
k += 1
# ## ##
# if R[k:k+2][j:j+2] is #. or .#
if k+1 < h and ((R[k+1][j] == '#') ^ (R[k+1][j+1] == '#')):
Q.append(((i, j), (k, j))) # (Q)
if first.count('#') + second.count('#') == 3:
dep += 1
# Bipartite graph
dinic = Dinic(2 + len(P) + len(Q))
# (s) -> (P)
for i in range(len(P)):
dinic.add_edge(0, i+2, 1)
# (Q) -> (t)
for i in range(len(Q)):
dinic.add_edge(len(P)+i+2, 1, 1)
# (P) -> (Q)
for i, p in enumerate(P):
(a, b), (a, s) = p
for j, q in enumerate(Q):
(c, d), (t, d) = q
# check if two line segments intersect
if c <= a <= t and b <= d <= s:
dinic.add_edge(i+2, len(P) + j+2, 1)
print(dep - (len(P) + len(Q) - dinic.max_flow(0, 1)) + 1) | p00766 |
import random
N = int(eval(input()))
a = [int(ai) for ai in input().split()]
random.seed(42)
count = 0
for i in range(0, N-1):
if a[i] == a[i+1]:
count += 1
while a[i] == a[i+1]:
a[i+1] = random.randint(1, N)
if i < N - 2:
while a[i+1] == a[i+2]:
a[i+1] = random.randint(1, N)
print(count) | N = int(eval(input()))
a = [int(ai) for ai in input().split()]
count = 0
for i in range(0, N-1):
if a[i] == a[i+1]:
count += 1
a[i+1] = float('inf')
print(count) | p03296 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(eval(input()))
a = [int(t) for t in input().split()]
assert len(a) == N
# 同じ値が何個並んでいるか
sslen = [1] # a[0]
for i in range(1, len(a)):
if a[i] == a[i-1]:
sslen[-1] += 1
else:
sslen.append(1)
print((sum(l//2 for l in sslen))) | from itertools import groupby
N = int(eval(input()))
a = list(map(int, input().split()))
n = sum(len(list(s))//2 for _,s in groupby(a))
print(n)
| p03296 |
from itertools import*
print((sum(len(list(j))//2 for _, j in groupby(open(0).read().split()[1:])))) | from itertools import*
eval(input())
print((sum(len(list(j))//2for _,j in groupby(input().split())))) | p03296 |
eval(input())
cnt=0
now=0
res=0
for a in map(int,input().split()):
if a==now:
cnt+=1
else:
res+=cnt//2
cnt=1
now=a
print((res+cnt//2)) | eval(input())
ans=x=0
for a in input().split():
ans+=a==x
x=a*(a!=x)
print(ans) | p03296 |
import random
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if A[i] == A[i-1]:
ans += 1
while(1):
A[i] = random.randrange(10000)+1
if A[i] != A[i-1] and A[i] != A[i+1]: break
if A[-1] == A[-2]: ans += 1
print(ans) | # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n = II()
A = LI()
res = 0
for i in range(1, n):
if A[i] == A[i - 1]:
A[i] = 0
res += 1
return res
print((main()))
| p03296 |
N = int(eval(input()))
src = list(map(int,input().split()))
prev = -1
seq = 1
ans = 0
for a in src:
if prev == a:
seq += 1
else:
ans += seq//2
seq = 1
prev = a
if seq > 1:
ans += seq//2
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
changed = False
for a,b in zip(A,A[1:]):
if changed:
changed = False
continue
if a == b:
ans += 1
changed = True
print(ans) | p03296 |
n = int(eval(input()))
a = list(map(int,input().split()))
neighbor = 1
nei = []
for i in range(1,n):
if a[i] == a[i-1]:
neighbor+=1
else:
if neighbor >1:
nei.append(neighbor)
neighbor = 1
if neighbor >1:
nei.append(neighbor)
ans = 0
for x in nei:
ans += x//2
print(ans) | n = int(eval(input()))
ans = 0
a = list(map(int,input().split()))
now = a[0]
cnt = 1
p = []
for i in range(n-1):
if now == a[i+1]:cnt+=1
else:
p.append(cnt)
now = a[i+1]
cnt = 1
p.append(cnt)
for x in p:
ans+=x//2
print(ans)
| p03296 |
import itertools
n = int(eval(input()))
a = list(map(int,input().split()))
res = 0
g = itertools.groupby(a)
for k,v in g:
vv = len(list(v))
res += vv//2
print(res)
| from itertools import groupby as gb
N = int(eval(input()))
a = list(map(int,input().split()))
g = gb(a)
res = 0
for k,v in g:
res += len(list(v)) // 2
print(res)
| p03296 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
#from operator import itemgetter
from copy import deepcopy
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [LI()for i in range(n)]
inf = 10**17
mod = 10**9 + 7
s=input().rstrip()
u=list(s)
if (u[0]==u[1] and u[0]==u[2]) or (u[3]==u[1] and u[3]==u[2]):
print("Yes")
else:
print("No") | # coding: utf-8
# hello worldと表示する
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def LI2(): return [int(eval(input())) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print(('\n'.join(x)))
def printni(x): print(('\n'.join(list(map(str,x)))))
inf = 10**17
mod = 10**9 + 7
s=SI()
if (s[0]==s[1] and s[1]==s[2]) or (s[1]==s[2] and s[2]==s[3]):
print("Yes")
else:
print("No")
| p03543 |
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
n = sys.stdin.readline().rstrip()
if n[0] * 3 in n: ans = 'Yes'
elif n [3] * 3 in n: ans = 'Yes'
else: ans = 'No'
print(ans)
if __name__ == "__main__":
# execute only if run as a script
main()
| import sys
def main():
n = sys.stdin.readline().rstrip()
cnt = 1
for i in range(3):
if n[i] == n[i+1]:
cnt += 1
if cnt == 3:
ans = 'Yes'
break
else:
cnt = 1
else:
ans = 'No'
print(ans)
if __name__ == "__main__":
main()
| p03543 |
import sys
sys.setrecursionlimit(100000)
N = int(eval(input()))
*a, = list(map(int, input().split()))
dp = [[-1] * N for _ in range(N)]
for i in range(N): dp[i][i] = a[i]
def rec(i, j):
if dp[i][j] != -1:
return dp[i][j]
ans = max(a[i] - rec(i+1, j), a[j] - rec(i, j-1))
dp[i][j] = ans
return ans
print((rec(0, N-1))) | N = int(eval(input()))
*a, = list(map(int, input().split()))
dp = [[None] * N for _ in range(N)]
for i in range(N): dp[i][i] = a[i]
for j in range(1, N):
for i in range(j-1, -1, -1):
dp[i][j] = max(a[i] - dp[i+1][j], a[j] - dp[i][j-1])
print((dp[0][N-1])) | p03171 |
N = int(eval(input()))
*a, = list(map(int, input().split()))
dp = [[None] * N for _ in range(N)]
for i in range(N): dp[i][i] = a[i]
for j in range(1, N):
for i in range(j-1, -1, -1):
dp[i][j] = max(a[i] - dp[i+1][j], a[j] - dp[i][j-1])
print((dp[0][N-1])) | N = int(eval(input()))
*a, = list(map(int, input().split()))
dp = [[0] * N for _ in range(N)]
for i in range(N): dp[i][i] = a[i]
for j in range(1, N):
for i in range(j-1, -1, -1):
dp[i][j] = max(a[i] - dp[i+1][j], a[j] - dp[i][j-1])
print((dp[0][N-1])) | p03171 |
N = int(eval(input()))
A = list(map(int, input().split()))
n = N % 2
DP = [[0] * (N+1) for _ in range(N+1)]
for w in range(1, N+1):
for i in range(N):
j = i + w
if j > N:
continue
if (w+n) % 2 == 1:
DP[i][j] = min(DP[i+1][j] - A[i], DP[i][j-1] - A[j-1])
else:
DP[i][j] = max(DP[i+1][j] + A[i], DP[i][j-1] + A[j-1])
print((DP[0][N]))
| N = int(eval(input()))
A = list(map(int, input().split()))
DP = [[0] * (N+1) for _ in range(N+1)]
for num in range(1, N + 1):
for start in range(N):
end = start + num
if end > N:
break
if num == 1:
DP[start][end] = A[start]
else:
DP[start][end] = max(A[start] - DP[start+1][end], A[end - 1] - DP[start][end - 1])
print((DP[0][N]))
| p03171 |
import sys
sys.setrecursionlimit(10**6)
n=int(sys.stdin.readline())
a=list(map(int,sys.stdin.readline().split()))
d=dict()
def help(a,i,j):
if d.get(str(i)+" "+str(j),None)!=None:
return d[str(i)+" "+str(j)]
if j<i:
return 0
if i==j:
return a[i]
t1=a[i]-help(a,i+1,j)
t2=a[j]-help(a,i,j-1)
# print(i,j)
# print(t1,t2)
if t1>t2:
d[str(i)+" "+str(j)]=t1
else:
d[str(i)+" "+str(j)]=t2
return d[str(i)+" "+str(j)]
print((help(a,0,len(a)-1))) | import sys
n=int(sys.stdin.readline())
a=list(map(int,sys.stdin.readline().split()))
dp=[[0 for i in range(n)] for j in range(n)]
for i in range(n):
dp[i][i]=a[i]
for i in range(2,n+1):
for j in range(n-i+1):
k=j+i-1
dp[j][k]=max(a[k]-dp[j][k-1],a[j]-dp[j+1][k])
print((dp[0][len(a)-1])) | p03171 |
def f(a,p1,p2):
if p1>p2:
return 0
return max(a[p1]+min(f(a,p1+2,p2),f(a,p1+1,p2-1))
,a[p2]+min(f(a,p1+1,p2-1),f(a,p1,p2-2)))
n=int(eval(input()))
a=list(map(int,input().split()))
s=sum(a)
first=f(a,0,n-1)
print((first-(s-first)))
| def f(a,i,j,dp):
if dp[i][j]==-1:
if i>j:
return 0
dp[i][j]=max(a[i]+min(f(a,i+2,j,dp),f(a,i+1,j-1,dp)),
a[j]+min(f(a,i+1,j-1,dp),f(a,i,j-2,dp)))
return dp[i][j]
n=int(eval(input()))
dp=[[-1 for i in range(n)] for j in range(n)]
a=list(map(int,input().split()))
for i in range(n):
dp[i][i]=a[i]
for i in range(n-1):
dp[i][i+1]=max(a[i],a[i+1])
s1=f(a,0,n-1,dp)
print((s1-sum(a)+s1))
| p03171 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * (N + 1) for _ in range(N)]
for l in range(N):
for r in range(l, N + 1):
if l == r: continue
if (N - (r - l)) % 2: dp[l][r] = float("inf")
else: dp[l][r] = -float("inf")
for c in range(N + 1):
for l in range(N - c + 1):
if l == N: continue
r = l + c
t = (N - (r - l)) % 2
if l - 1 >= 0:
if t == 0:
dp[l - 1][r] = min(dp[l - 1][r], dp[l][r] - a[l - 1])
else:
dp[l - 1][r] = max(dp[l - 1][r], dp[l][r] + a[l - 1])
if r + 1 <= N:
if t == 0:
dp[l][r + 1] = min(dp[l][r + 1], dp[l][r] - a[r])
else:
dp[l][r + 1] = max(dp[l][r + 1], dp[l][r] + a[r])
print((dp[0][N])) | import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
inf = 10 ** 14
dp = [[0] * (N + 1) for _ in range(N)]
for l in range(N):
for r in range(l, N + 1):
if l == r: continue
if (N - (r - l)) % 2: dp[l][r] = inf
else: dp[l][r] = -inf
for c in range(N + 1):
for l in range(N - c + 1):
if l == N: continue
r = l + c
t = (N - (r - l)) % 2
if l - 1 >= 0:
if t == 0:
dp[l - 1][r] = min(dp[l - 1][r], dp[l][r] - a[l - 1])
else:
dp[l - 1][r] = max(dp[l - 1][r], dp[l][r] + a[l - 1])
if r + 1 <= N:
if t == 0:
dp[l][r + 1] = min(dp[l][r + 1], dp[l][r] - a[r])
else:
dp[l][r + 1] = max(dp[l][r + 1], dp[l][r] + a[r])
print((dp[0][N])) | p03171 |
import sys
# input処理を高速化する
input = sys.stdin.readline
def chmax(a, b):
if a >= b:
return a
return b
def chmin(a, b):
if a <= b:
return a
return b
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
# aiからajのX−Yの最大値
# [左端,右端)=[l,r)からの遷移
# 左をとる[l+1,r)、右をとる[l,r−1)の2通り
dp = [[0] * (N+2) for _ in range(N+2)]
dp[N+1][N+1] = 4999999995
for len in range(1, N + 1):
for i in range(N + 1 - len):
j = i + len
if (N - len) % 2 == 0:
dp[i][j] = chmax(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1])
else:
dp[i][j] = chmin(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1])
print((dp[0][N]))
main() | import sys
# input処理を高速化する
input = sys.stdin.readline
def chmax(a, b):
if a >= b:
return a
return b
def chmin(a, b):
if a <= b:
return a
return b
def main():
N = int(eval(input()))
a = list(map(int, input().split()))
# aiからajのX−Yの最大値
# [左端,右端)=[l,r)からの遷移
# 左をとる[l+1,r)、右をとる[l,r−1)の2通り
dp = [[0] * (N+2) for _ in range(N+2)]
for len in range(1, N + 1):
for i in range(N + 1 - len):
j = i + len
if (N - len) % 2 == 0:
dp[i][j] = chmax(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1])
else:
dp[i][j] = chmin(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1])
print((dp[0][N]))
main() | p03171 |
N = int(eval(input()))
a = [int(x) for x in input().split()]
dp = [0 for i in range(N)]
for i in range(N-1, -1, -1):
dp[i] = a[i]
prev = dp[i]
for j in range(i+1, N):
right = a[i] - dp[j]
left = a[j] - prev
if right > left:
dp[j] = right
prev = right
else:
dp[j] = left
prev = left
print((dp[-1])) | def main():
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(N-1, -1, -1):
dp[i] = a[i]
prev = dp[i]
for j in range(i+1, N):
right = a[i] - dp[j]
left = a[j] - prev
if right > left:
dp[j] = right
prev = right
else:
dp[j] = left
prev = left
print((dp[-1]))
main() | p03171 |
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(N-1, -1, -1):
dp[i] = a[i]
prev = dp[i]
for j in range(i+1, N):
right = a[i] - dp[j]
left = a[j] - prev
if right > left:
dp[j] = right
prev = right
else:
dp[j] = left
prev = left
print((dp[-1])) | def main():
N = int(eval(input()))
a = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(N-1, -1, -1):
dp[i] = a[i]
prev = dp[i]
for j in range(i+1, N):
right = a[i] - dp[j]
left = a[j] - prev
if right > left:
dp[j] = right
prev = right
else:
dp[j] = left
prev = left
print((dp[-1]))
main() | p03171 |
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
a = list(map(int,input().split()))
cum = [0]*(N+1)
for i in range(N):
cum[i] = cum[i-1]+a[i]
dp = [[-1]*N for _ in range(N)]
for i in range(N):
dp[i][i] = a[i]
def cal(i,j):
if dp[i][j] == -1:
dp[i][j] = cum[j]-cum[i-1]-min(cal(i+1,j),cal(i,j-1))
return dp[i][j]
print((2*cal(0,N-1)-cum[N-1])) | N = int(eval(input()))
a = list(map(int,input().split()))
dp = [[0]*(N+1) for _ in range(N+1)]
for i in range(N-1, -1, -1):
for j in range(i, N):
dp[i][j] = max(a[i]-dp[i+1][j],a[j]-dp[i][j-1])
print((dp[0][N-1])) | p03171 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[[0 for i in range(2)]for i in range(n+2)] for i in range(n+2)]
# dp [start][end][chance] is the diffence between X and Y
# such for range start to end with the current chance of player
for start in range(n, 0, -1):
for end in range(start, n+1):
for chance in range(2):
temp = -1 if chance else 1
val1 = a[start-1]*temp + dp[start+1][end][chance ^ 1]
val2 = a[end-1]*temp + dp[start][end-1][chance ^ 1]
dp[start][end][chance] = min(
val1, val2) if chance else max(val1, val2)
print((dp[1][n][0]))
if __name__ == "__main__":
main()
|
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0 for i in range(n+2)]for i in range(n+2)]
# dp [start][end] is the diffence between X and Y
# such for range start to end
for start in range(n, 0, -1):
for end in range(start, n+1):
if start == end:
dp[start][end] = a[start-1]
else:
dp[start][end] = max(a[start-1]-dp[start+1]
[end], a[end-1]-dp[start][end-1])
print((dp[1][n]))
if __name__ == "__main__":
main()
| p03171 |
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * (n+1) for _ in range(n+1)]
for i in range(n)[::-1]:
for j in range(n + 1):
if i >= j:
continue
minus = (n - i + j) % 2 * (-2) + 1
dp[i][j] = max(a[j - 1]-dp[i][j - 1], a[i]-dp[i + 1][j])
print((dp[0][n]))
| n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * (n+1) for _ in range(n+1)]
for i in range(n)[::-1]:
for j in range(n + 1):
if i >= j:
continue
dp[i][j] = max(a[j - 1] - dp[i][j - 1], a[i] - dp[i + 1][j])
print((dp[0][n]))
| p03171 |
# dp[j][i]=(区間[i,j]が残っているとき次の手番の得点-そうじゃない人の得点)
import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
INF=-10**14
dp=[[0]*(i+1) for i in range(n)]
for i in range(n):
dp[i][i]=a[i]
for i in range(1,n):
for j in range(i-1,-1,-1):
dp[i][j]=max(a[i]-dp[i-1][j],a[j]-dp[i][j+1])
print((dp[-1][0])) | import sys
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
dp=[0]*3000
for i in range(n):
dp[i]=a[i]
for i in range(1,n):
for j in range(i-1,-1,-1):
dp[j]=max(a[i]-dp[j],a[j]-dp[j+1])
print((dp[0])) | p03171 |
import sys
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
dp=[0]*3000
for i in range(n):
dp[i]=a[i]
for i in range(1,n):
for j in range(i-1,-1,-1):
dp[j]=max(a[i]-dp[j],a[j]-dp[j+1])
print((dp[0])) | def solve():
import sys
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
dp=a[:]
for i in range(1,n):
for j in range(i-1,-1,-1):
dp[j]=max(a[i]-dp[j],a[j]-dp[j+1])
print((dp[0]))
solve() | p03171 |
import sys
sys.setrecursionlimit(10**5)
N = int(eval(input()))
*A, = list(map(int, input().split()))
memo = [[-1]*(N+1) for i in range(N+1)]
for i in range(N+1):
memo[i][i] = 0
def dfs(p, q, t):
if memo[p][q] != -1:
return memo[p][q]
if t:
r = min(dfs(p+1, q, 0) - A[p], dfs(p, q-1, 0) - A[q-1])
else:
r = max(dfs(p+1, q, 1) + A[p], dfs(p, q-1, 1) + A[q-1])
memo[p][q] = r
return r
print((dfs(0, N, 0))) | N = int(eval(input()))
*A, = list(map(int, input().split()))
dp = [[-1]*(N+1-i) for i in range(N+1)]
for i in range(N+1):
dp[0][i] = 0
t = (N & 1)
for l in range(1, N+1):
S = dp[l-1]; T = dp[l]
t ^= 1
if t:
T[:] = (min(S[i+1] - A[i], S[i] - A[i+l-1]) for i in range(N-l+1))
else:
T[:] = (max(S[i+1] + A[i], S[i] + A[i+l-1]) for i in range(N-l+1))
print((dp[N][0])) | p03171 |
N = int(eval(input()))
*A, = list(map(int, input().split()))
dp = [[-1]*(N+1-i) for i in range(N+1)]
for i in range(N+1):
dp[0][i] = 0
t = (N & 1)
for l in range(1, N+1):
S = dp[l-1]; T = dp[l]
t ^= 1
T[:] = (min(S[i+1] - A[i], S[i] - A[i+l-1]) for i in range(N-l+1)) if t else (max(S[i+1] + A[i], S[i] + A[i+l-1]) for i in range(N-l+1))
print((T[0])) | N = int(eval(input()))
*A, = list(map(int, input().split()))
t = (N & 1)
S = [0]*(N+1)
for l in range(1, N+1):
S = [min(S[i+1] - A[i], S[i] - A[i+l-1]) for i in range(N-l+1)] if (l ^ N) & 1 else [max(S[i+1] + A[i], S[i] + A[i+l-1]) for i in range(N-l+1)]
print((S[0])) | p03171 |
n=int(eval(input()))
a=list(map(int,input().split()))
dp=[[float("inf")]*(n+1) for _ in range(n)]
z=0
for l in range(n):
dp[l][l]=0
for k in range(1,n+1):
for i in range(n):
j=i+k
if 0<=i<=n-2 and 1<=j<=n:
if (n-(i+j))%2==0: #先手
dp[i][j]=max(dp[i+1][j]+a[i],dp[i][j-1]+a[j-1])
else:
dp[i][j]=min(dp[i+1][j]-a[i],dp[i][j-1]-a[j-1])
elif 0<=i<=n-2 and 0<=j<=n:
dp[i][j]=dp[i+1][j]+a[i]
elif 0<=i<=n-1 and 1<=j<=n:
dp[i][j]=dp[i][j-1]+a[j-1]
else:
z=1
print((dp[0][n])) | n=int(eval(input()))
a=list(map(int,input().split()))
dp=[[float("inf")]*(n+1) for _ in range(n)]
z=0
for l in range(n):
dp[l][l]=0
for k in range(1,n+1):
for i in range(n-k+1):
j=i+k
if 0<=i<=n-2 and 1<=j<=n:
if (n-(i+j))%2==0: #先手
dp[i][j]=max(dp[i+1][j]+a[i],dp[i][j-1]+a[j-1])
else:
dp[i][j]=min(dp[i+1][j]-a[i],dp[i][j-1]-a[j-1])
else:
dp[i][j]=dp[i][j-1]+a[j-1]
print((dp[0][n])) | p03171 |
import sys
def input():
return sys.stdin.readline()[:-1]
n = int(eval(input()))
a = list(map(int, input().split()))
dp=[]
for i in range(n):
dp.append([0]*n)
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1])
print((dp[0][n - 1])) | import sys
def input():
return sys.stdin.readline()[:-1]
n = int(eval(input()))
a = [int(x) for x in input().split()]
dp=[]
for i in range(n):
dp.append([0]*n)
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1])
print((dp[0][n - 1])) | p03171 |
import sys
def input():
return sys.stdin.readline()[:-1]
n = int(eval(input()))
a = [int(x) for x in input().split()]
dp=[]
for i in range(n):
dp.append([0]*n)
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1])
print((dp[0][n - 1])) | n = int(eval(input()))
a = list(map(int, input().split()))
def calc():
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1])
return dp
dp = calc()
print((dp[0][n - 1])) | p03171 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[0] * n for _ in range(n)]
for i in range(n):
dp[i][i] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1])
print((dp[0][n - 1]))
main() | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [0] * (n*n)
for i in range(n):
dp[i+i*n] = a[i]
for i in range(n - 2, -1, -1):
for j in range(i + 1, n):
dp[i+j*n] = max(a[i] - dp[i + 1+j*n], a[j] - dp[i+(j - 1)*n])
print((dp[(n - 1)*n]))
main() | p03171 |
from functools import lru_cache
N = int(eval(input()))
A = list(map(int, input().split()))
import sys
sys.setrecursionlimit(100000)
import random
#N = 20
#A = [random.randint(1, 10**9) for _ in range(N)]
@lru_cache(maxsize=None)
def f(l, r):
if l > r:
return 0
n = r - l
if (N - n) % 2 == 0:
s = -1
else:
s = 1
lv = f(l+1, r) + s*A[l]
rv = f(l, r-1) + s*A[r]
if s*lv > s*rv:
return lv
else:
return rv
print((f(0, N-1)))
| N = int(eval(input()))
A = list(map(int, input().split()))
#import random
#N = 3000
#A = [random.randint(1, 10**9) for _ in range(N)]
dp = [[0] * (N+1) for _ in range(N+1)]
for g in range(N):
for l in range(N-g):
r = l + g
n = r - l
s = -1 if (N-n) % 2 == 0 else 1
lv = dp[l+1][r] + s*A[l]
rv = dp[l][r-1] + s*A[r]
if s*lv > s*rv:
dp[l][r] = lv
else:
dp[l][r] = rv
print((dp[0][N-1]))
| p03171 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.