結果

問題 No.773 コンテスト
ユーザー chizuchizu
提出日時 2019-01-28 21:43:39
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 28 ms / 2,000 ms
コード長 4,459 bytes
コンパイル時間 149 ms
コンパイル使用メモリ 12,928 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-07-06 11:31:51
合計ジャッジ時間 1,578 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# coding: utf-8
import sys
# import bisect
# import math
# import numpy as np
"""Template"""
class IP:
"""
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1使
:return: int
"""
return int(self.input())
def S(self):
"""
1(str
:return: str
"""
return self.input()
def IL(self):
"""
1(int
:return:
"""
return list(map(int, self.input().split()))
def SL(self):
"""
1
:return:
"""
return list(map(str, self.input().split()))
def ILS(self, n):
"""
1(int
:param n:
:return:
"""
return [int(self.input()) for _ in range(n)]
def SLS(self, n):
"""
1str
:param n:
:return:
"""
return [self.input() for _ in range(n)]
def SILS(self, n):
"""
Some Int LineS
:param n:
:return: list
"""
return [self.IL() for _ in range(n)]
class Idea:
def __init__(self):
pass
def HF(self, p):
"""
Half enumeration
p
:param p: list :
:return: list :
"""
return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))
def Bfs2(self, a):
"""
bit_full_search2
bit
210
:return: list : 2(16) 2 10
"""
#
# https://blog.rossywhite.com/2018/08/06/bit-search/
# https://atcoder.jp/contests/abc105/submissions/4088632
value = []
for i in range(1 << len(a)):
output = []
for j in range(len(a)):
if self.bit_o(i, j):
"""j+1i1"""
# output.append(a[j])
output.append(a[j])
value.append([format(i, 'b').zfill(16), sum(output)])
value.sort(key=lambda x: x[1])
bin = [value[k][0] for k in range(len(value))]
val = [value[k][1] for k in range(len(value))]
return bin, val
def S(self, s, r=0, m=-1):
"""
:param s:
:param r: revers 0=False 1=True
:param m: 2
:return: None
"""
r = bool(r)
if m == -1:
s.sort(reverse=r)
else:
s.sort(reverse=r, key=lambda x: x[m])
def bit_n(self, a, b):
"""
bit使0True
n
:param a: int
:param b: int
:return: bool
"""
return bool((a >> b & 1) > 0)
def bit_o(self, a, b):
"""
bit使1True
one1
:param a: int
:param b: int
:return: bool
"""
return bool(((a >> b) & 1) == 1)
def ceil(self, x, y):
"""
Round up
:param x: int
:param y: int
:return: int
"""
return -(-x//y)
def ave(self, a):
"""
:param a: list
:return: int
"""
return sum(a) / len(a)
""""""
def main():
# 1
r, e = range, enumerate
ip = IP()
id = Idea()
""""""
a, b = ip.IL()
ans = 3
for i in r(a, b+1):
if i == 23 or i == 24 or i == 25:
ans -= 1
print(ans)
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0