input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
check1=[[i,i,0] for i in range(1,10)]
check2=[[i,j,0] for i in range(1,10) for j in range(i+1,10)]
l=len(check2)
check3=[[check2[i][1],check2[i][0],0] for i in range(l)]
for i in range(1,n+1):
s=str(i)
s1=int(s[0])
s2=int(s[-1])
if s2!=0:
if s1==s2:
... | n=int(eval(input()))
check=[[0]*9 for i in range(9)]
for i in range(1,n+1):
s=str(i)
s1=int(s[0])-1
s2=int(s[-1])-1
if s2==-1:continue
check[s1][s2]+=1
cnt=0
for i in range(9):
for j in range(9):
cnt+=check[i][j]*check[j][i]
print(cnt)
| p02792 |
N, C = list(map(int, input().split()))
events = []
for i in range(N):
events.append(list(map(int, input().split())))
dp = [[0]*2001 for i in range(C+1)]
for j in range(C+1):
for k in range(-1000, 1001):
if k != 0:
dp[j][k] = -10**18
for a, b, c in events:
for j in range(C-c, ... | N, C = list(map(int, input().split()))
events = []
for i in range(N):
events.append(list(map(int, input().split())))
def solve():
L = 250
dp = [[-10**18]*(L+1) for i in range(C+1)]
for j in range(C+1):
dp[j][0] = 0
for a, b, c in events:
for j in range(C-c, -1, -1):
... | p01941 |
S = input().strip()
print(("x"*len(S))) | S = input().strip()
a = "x"*len(S)
print(a) | p02778 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
s = str(input().rstrip('\n'))
s = "x" * len(s)
print(s)
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
print(("x" * len(s)))
if __name__ == '__main__':
solve()
| p02778 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
flag = False
for i in range(a, b+1):
if i % k == 0:
flag = True
break
else:
continue
if flag is True:
print("OK")
else:
print("NG") | k = int(eval(input()))
a, b = list(map(int, input().split()))
if b//k * k >= a:
print("OK")
else:
print("NG") | p02693 |
K = int(eval(input()))
A, B = list(map(int, input().split()))
while True:
if A % K == 0:
print('OK')
break
A += 1
if A == B + 1:
print('NG')
break
| K = int(eval(input()))
A, B = list(map(int, input().split()))
while True:
if A == B + 1:
print('NG')
break
if A % K == 0:
print('OK')
break
A += 1
| p02693 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
if (a%k == 0 or b%k == 0):
print('OK')
elif (a//k != b//k):
print('OK')
else:
print('NG') | k = int(eval(input()))
a, b = list(map(int, input().split()))
Flag = False
for i in range(a, b+1):
if (i%k == 0):
Flag = True
if (Flag):
print('OK')
else:
print('NG') | p02693 |
import sys
input = sys.stdin.readline
from collections import *
K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(A, B+1):
if i%K==0:
print('OK')
exit()
print('NG') | K = int(eval(input()))
A, B = list(map(int, input().split()))
if (A-1)//K!=B//K:
print('OK')
else:
print('NG') | p02693 |
k = int(eval(input()))
a,b = list(map(int, input().split()))
m = int(b/k)
for i in range(m):
if a<=k*(i+1) and b>=k*(i+1):
print('OK')
exit()
else:
i += 1
print('NG') | K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(A, B + 1):
if i % K == 0:
print('OK')
exit()
print('NG') | p02693 |
k = int(eval(input()))
a, b = list(map(int,input().split()))
for i in range(a//k,b//k+1):
if (k*i) <= b and k*i >= a:
print('OK'); break
else:
print('NG') | k = int(eval(input()))
a, b = list(map(int,input().split()))
print(('OK' if a <= ( b // k * k) else 'NG')) | p02693 |
k,a,b=list(map(int,open(0).read().split()))
print(("OK"if a<=b//k*k else"NG")) | k,a,b=list(map(int,open(0).read().split()))
print(("ONKG"[a>b//k*k::2])) | p02693 |
K = int(eval(input()))
score = input().split()
s1 = int(score[0])
s2 = int(score[1])
if ( s1 % K ) == 0:
print('OK')
elif ( s2 % K ) == 0:
print('OK')
elif ( s1 // K ) < ( s2 // K ):
print('OK')
else:
print('NG') | K = int(eval(input()))
A,B = list(map(int, input().split()))
for i in range(A, B+1):
if i % K == 0:
print('OK')
exit()
print('NG') | p02693 |
from sys import exit
def main():
K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(A, B + 1):
if i % K == 0:
print("OK")
exit()
print("NG")
if __name__ == '__main__':
main() | from sys import exit
def main():
K = int(eval(input()))
A, B = list(map(int, input().split()))
# for i in range(A, B + 1):
# if i % K == 0:
# print("OK")
# exit()
# print("NG")
if A % K == 0:
print("OK")
exit()
if B // K >... | p02693 |
k = int(eval(input()))
a, b = list(map(int,input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
exit()
print("NG")
| k = int(eval(input()))
a, b = list(map(int,input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
break
else:
print("NG") | p02693 |
k = int(eval(input()))
a,b = [int(i) for i in input().split(' ')]
if a%k == 0 or b%k == 0:
print('OK')
else:
a1 = a+1
for i in range(a1, b):
if (i%k == 0):
print('OK')
break
else:
print('NG') | k = int(input())
a,b = [int(i) for i in input().split(' ')]
print('OK') if (a <= b//k*k) else print('NG')
| p02693 |
k =int(eval(input()))
a , b=list(map(int,input().split()))
flag = False
if b-a >= k:
flag=True
else:
for i in range(a,b+1):
if i%k==0:
flag=True
if flag :
print("OK")
else:
print("NG")
| k =int(eval(input()))
a , b=list(map(int,input().split()))
flag = False
for i in range(a,b+1):#range(a,b+1)=[a,a+1,a+2,.....,b]
if i % k == 0:
flag=True
if flag :
print("OK")
else:
print("NG")
| p02693 |
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a, b = list(map(int, input().split()))
flag = False
for i in range(a,b+1):
if i % n == 0:
flag = True
break
if flag:
print('OK')
else:
print('NG')
if __nam... | import sys
input = sys.stdin.readline
def main():
k = int(eval(input()))
a, b = list(map(int, input().split()))
largest = (b // k) * k
if a <= largest:
print('OK')
else:
print('NG')
if __name__ == '__main__':
main()
| p02693 |
n = int(eval(input()))
a, b = list(map(int, input().split()))
k = 1
while True:
if a <= n*k <= b:
print("OK")
exit()
elif n*k > b:
print("NG")
exit()
else:
k += 1 | import math
k = int(eval(input()))
a, b = list(map(int, input().split()))
if k == 1:
print("OK")
exit()
elif a <= k <= b :
print("OK")
exit()
cnt = 1
while True:
tmp = cnt * k
if a <= tmp <= b:
print("OK")
exit()
elif b <= tmp:
print("NG")
... | p02693 |
K = int(eval(input()))
a,b=list(map(int,input().split()))
ans = 'NG'
for i in range(a, b+1):
if i%K == 0:
ans = 'OK'
if K == 1:
ans = 'OK'
print(ans) | K = int(eval(input()))
a,b=list(map(int,input().split()))
if b//K-a//K>0:
ans ='OK'
elif K==1:
ans = 'OK'
elif a%K==0:
ans = 'OK'
else:
ans = 'NG'
print(ans)
| p02693 |
k = int(eval(input()))
a,b = list(map(int,input().split()))
if k <= b - a:
print('OK')
else:
if b // k > a // k or a % k == 0:
print('OK')
else:
print('NG') | k = int(eval(input()))
a,b = list(map(int,input().split()))
if b // k > a // k or a % k == 0:
print('OK')
else:
print('NG') | p02693 |
k=int(eval(input()))
a,b=list(map(int,input().split()))
f=0
for i in range(1,1001):
if a<=i*k<=b:
f=1
print("OK")
break
if f==0:
print("NG")
| k=int(eval(input()))
a,b=list(map(int,input().split()))
f=0
for i in range(1,1001):
if a<=i*k<=b:
print("OK")
f=1
break
if f==0:
print("NG")
| p02693 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
flag = False
if a <= int(b / k) * k:
print("OK")
else:
print("NG") | k = int(eval(input()))
a, b = list(map(int, input().split()))
if a <= (b // k) * k:
print("OK")
else:
print("NG")
| p02693 |
# -*- coding: utf-8 -*-
K = int(eval(input()))
A, B = (int(x) for x in input().split())
a = A // K
b = B // K
if b-a >= 1 or K == 1:
print("OK")
elif B%K==0 or A%K==0:
print("OK")
else:
print("NG") |
K = int(eval(input()))
A, B = (int(x) for x in input().split())
#倍数が何個含まれるかで考える場合
# a = A // K
# b = B // K
#
# if b-a >= 1 or K == 1:
# print("OK")
# elif B%K==0 or A%K==0:
# print("OK")
# else:
# print("NG")
#B以下の最大のKの倍数がAを超えるかどうかで考える場合
#B以下の最大のkの倍数
maxbk = (B//K)*K
if maxbk >= A:
... | p02693 |
import sys
input = sys.stdin.buffer.readline
K = int(eval(input()))
A, B = list(map(int, input().split()))
def main(K, A, B):
for i in range(A, B + 1):
if i % K == 0:
print('OK')
sys.exit()
print('NG')
if __name__ == '__main__':
main(K, A, B)
| import sys
input = sys.stdin.buffer.readline
def main():
K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(A, B + 1):
if i % K == 0:
print('OK')
sys.exit()
print('NG')
if __name__ == '__main__':
main()
| p02693 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
INF = 2**62-1
def read_int():
return int(eval(input()))
def read_int_n():
return list(map(int, input().split()))
def slv(K, A, B):
for i in range(INF):
if A <= i*K <= B:
return 'OK'
if i * K > B:
break
return 'NG'
... | p02693 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
print(('OK' if sum(i % k == 0 for i in range(a, b + 1)) else 'NG')) | k = int(eval(input()))
a, b = list(map(int, input().split()))
print(('OK' if b // k * k >= a else 'NG')) | p02693 |
K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(A, B + 1):
if i % K == 0:
print('OK')
exit()
print('NG')
| K = int(eval(input()))
A, B = list(map(int, input().split()))
if (B // K) * K >= A:
print('OK')
else:
print('NG')
| p02693 |
K = int(eval(input()))
S = input().split()
A = int(S[0])
B = int(S[1])
for i in range(A, B + 1):
if i % K == 0:
print("OK")
exit()
print("NG")
| K = int(eval(input()))
A, B = list(map(int, input().split()))
flag = False
for i in range(A, B + 1):
if i % K == 0:
flag = True
break
if flag == True:
print("OK")
else:
print("NG")
| p02693 |
s_K = eval(input())
s_AB = input().split()
str = "NG"
K = int(s_K)
A = int(s_AB[0])
B = int(s_AB[1])
for w in range(A, B+1):
if(w%K==0):
str = "OK"
print(str) | s_K = eval(input())
s_AB = input().split()
str = "NG"
K = int(s_K)
A = int(s_AB[0])
B = int(s_AB[1])
for w in range(A, B+1):
if(w%K==0):
str = "OK"
break
print(str)
| p02693 |
k = int(eval(input()))
a, b = list(map(int,input().split()))
bb = b//k
aa , i = divmod(a, k)
if (aa != bb) or ( i ==0):
print("OK")
else:
print("NG") | K = int(eval(input()))
A, B =list(map(int,input().split()))
ad,am=divmod(A,K)
bd,bm=divmod(B,K)
if bd>ad:
print("OK")
elif am ==0:
print("OK")
else:
print("NG") | p02693 |
# -*- coding: utf-8 -*-
# 標準入力の取得
K = int(eval(input()))
A,B = list(map(int, input().split()))
# 求解処理
min_value = K * (A // K)
if min_value < A:
min_value += K
result = ""
if min_value <= B:
result = "OK"
else:
result = "NG"
# 結果出力
print(result) | # -*- coding: utf-8 -*-
# 標準入力の取得
K = int(eval(input()))
A, B = list(map(int, input().split()))
def main() -> None:
"""Entry point
"""
# 求解処理
# A以上の最小のKの倍数とBを比較
min_multiple = K * ((A // K) + (A % K != 0))
result = ""
if min_multiple <= B:
result = "OK"
else:
... | p02693 |
k = int(eval(input()))
a,b = list(map(int,input().split()))
flag = "ng"
for i in range(a,b+1):
if i % k == 0:
flag = "ok"
if flag == "ok":
print("OK")
else:
print("NG") | k = int(eval(input()))
a,b = list(map(int,input().split()))
for i in range(a,b+1):
if i%k == 0:
print("OK")
break
else:
print("NG") | p02693 |
K = eval(input())
A, B = list(map(int, input().split()))
if int(B) - int(A) + 1 >= int(K):
print('OK')
else:
i = int(A)
while i < int(B) + 1:
if i % int(K) == 0:
print('OK')
else:
i = i+1
print('NG') | K = eval(input())
li = input().split()
A = int(li[0])
B = int(li[1])
if B - A + 1 >= int(K):
print('OK')
else:
i = A
while i < B + 1:
if i % int(K) == 0:
print('OK')
else:
i = i+1
print('NG') | p02693 |
k = int(eval(input()))
a,b = [int(a) for a in input().split()]
c=0
for i in range (a,b+1):
if i%k!=0:
continue
else:
c+=1
break
if c==1:
print("OK")
else:
print("NG")
| k = int(eval(input()))
a,b = [int(a) for a in input().split()]
c=0
for i in range (a,b+1):
if i%k!=0:
c+=1
if c==b-a+1:
print("NG")
else:
print("OK") | p02693 |
k, a, b = list(map(int, open(0).read().split()))
for i in range(b+1):
if k * i > b:
print('NG')
break
if k * i >= a:
print('OK')
break | k,a,b=list(map(int,open(0).read().split()));print(('ONKG'[b<b%k+a::2])) | p02693 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
K = ir()
A, B = lr()
left = -(-A//K)
right = B // K
bl = left <= right
if A % K == 0 or B % K == 0:
bl = True
print(('OK' if bl else 'NG'))
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
K = ir()
A, B = lr()
left = -(-A//K)
right = B // K
bl = left <= right
print(('OK' if bl else 'NG'))
| p02693 |
K = int(eval(input()))
l, h = list(map(int, input().split(' ')))
for n in range(l, h + 1):
if n % K == 0:
print('OK')
break
else:
print('NG')
| K = int(eval(input()))
A, B = list(map(int, input().split(' ')))
if B // K * K >= A:
print('OK')
else:
print('NG')
| p02693 |
#設定
import sys
input = sys.stdin.buffer.readline
#ライブラリインポート
from collections import defaultdict
con = 10 ** 9 + 7
#入力受け取り
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
K = int(eval(input()))
A, B = getlist()
for i in range(1001):
if A <= K * i and K * i <= B:
pri... | import sys; input = sys.stdin.buffer.readline
from collections import defaultdict
con = 10 ** 9 + 7
def getlist():
return list(map(int, input().split()))
def main():
K = int(eval(input()))
A, B = getlist()
for i in range(1001):
if A <= K * i and K * i <= B:
print("OK")
return
print("NG")
... | p02693 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
if k == 1:
print("OK")
else:
if b//k - a//k == 0 and a%k != 0:
print("NG")
else:
print("OK") | k = int(eval(input()))
a, b = list(map(int, input().split()))
if b//k - a//k == 0 and a%k != 0:
print('NG')
else:
print('OK') | p02693 |
K = int(eval(input()))
A,B = list(map(int,input().split()))
import sys
for i in range(A,B+1):
if i % K == 0:
print('OK')
sys.exit()
print('NG') | K = int(eval(input()))
A,B = list(map(int,input().split()))
tmp = B//K * K
if A <= tmp:
print('OK')
else:
print('NG') | p02693 |
K = int(eval(input()))
a, b = list(map(int, input().split()))
if a%K == 0:
print('OK')
elif (a//K+1)*K <= b:
print('OK')
else:
print('NG') | K = int(eval(input()))
A, B = list(map(int, input().split()))
lar = B//K * K
if lar >= A:
print('OK')
else:
print('NG') | p02693 |
# import numpy as np
# import queue
# import heapq
def main():
print((resolve()))
def resolve():
K = int(eval(input()))
A, B = list(map(int, input().split()))
for n in range(A, B+1):
if n % K == 0:
return 'OK'
return 'NG'
if __name__ == "__main__":
... | def main():
K = int(eval(input()))
A, B = list(map(int, input().split()))
if A % K == 0 or B % K == 0:
print('OK')
elif A // K != B // K:
print('OK')
else:
print('NG')
if __name__ == "__main__":
main()
| p02693 |
K = int(eval(input()))
A, B = list(map(int, input().split()))
flag = False
for i in range(A, B+1):
if i % K == 0:
flag = True
if (flag):
print('OK')
else:
print('NG')
| k = int(eval(input()))
a, b = list(map(int,input().split()))
for i in range(a,b+1):
if i % k == 0:
print('OK')
quit()
print('NG')
| p02693 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
break
else:
print("NG")
| K=int(eval(input()))
A,B=list(map(int, input().split()))
ans='NG'
for i in range (A,B+1):
if i%K==0:
ans='OK'
break
print(ans) | p02693 |
k = int(eval(input()))
a, b = list(map(int, input().split()))
is_ok = False
for i in range(a, b+1):
if i % k == 0:
is_ok = True
print(("OK" if is_ok else "NG")) | K = int(eval(input()))
A, B = list(map(int, input().split()))
is_ok = False
# A以上B以下の要素xについて
for x in range(A, B + 1):
# x が K の倍数であれば is_ok = True
if x % K == 0:
is_ok = True
print(("OK" if is_ok else "NG")) | p02693 |
K = int(eval(input()))
A, B = list(map(int, input().split()))
print(("OK" if A <= (B // K) * K else "NG")) | K = int(eval(input()))
A, B = list(map(int, input().split()))
print(("OK" if A // K != B // K or A % K == 0 else "NG")) | p02693 |
K=int(eval(input()))
A,B=list(map(int, input().split()))
for i in range(A,B+1):
if i%K==0:
print('OK')
exit()
print('NG') | K=int(eval(input()))
A,B=list(map(int, input().split()))
print(('OK' if (A+K-1)//K*K <= B else 'NG')) | p02693 |
K=int(eval(input()))
A,B=list(map(int,input().split()))
for i in range(A,B+1):
if i%K==0:
print("OK")
exit()
print("NG") | K=int(eval(input()))
A,B=list(map(int,input().split()))
for n in range(A,B+1):
if n%K==0:
print("OK")
exit()
print("NG")
| p02693 |
H, A = list(map(int, input().split()))
ans = (H + A - 1) // A
print(ans) | H, A = list(map(int, input().split()))
ans = (H + A - 1 ) // A
print((int(ans))) | p02783 |
import sys
for line in sys.stdin:
l= line.split()
H=int(l[0])
A=int(l[1])
i = 0
while(H>0):
H-=A
i+=1
print(i)
| h,a = list (map (int, input ().split ()))
print(((h + a - 1) // a)) | p02783 |
H,A=list(map(int,input().split()))
count=0
while(H>0):
H-=A
count+=1
print(count) | h,a=list(map(int,input().split()))
print(((h+a-1)//a)) | p02783 |
l = list(map(int, input().split()))
def attack(l):
H = l[0]
A = l[1]
cnt = 0
while H > 0:
H -= A
cnt += 1
return cnt
print((attack(l)))
| l1 = list(map(int, input().split()))
H = l1[0]
A = l1[1]
T = H%A
if T == 0:
print((H//A))
else:
print((H//A+1)) | p02783 |
a, b = list(map(int,input().strip().split()))
print((a//b+1 if a%b else a//b)) | a, b = list(map(int,input().split()))
if a%b:
print((a//b+1))
else:
print((a//b)) | p02783 |
h,a=list(map(int,input().split()))
print(((h+a-1)//a))
| h,a=list(map(int,input().split()))
print((-(-h//a))) | p02783 |
_input = input().split()
h = int(_input[0])
a = int(_input[1])
if h % a == 0:
print((int(h / a)))
else:
print((int(h / a) + 1)) | N, K = list(map(int, input().split()))
if N % K == 0:
print((int(N / K)))
else:
print((int(N / K) + 1)) | p02783 |
a,b=list(map(int,input().split()))
c=0
while a>0:
a-=b
c+=1
print(c) | a,b=list(map(int,input().split()))
print((-(-a//b))) | p02783 |
import math
def main():
hp, attack = (int(i) for i in input().rstrip().split(' '))
print((str(math.ceil(hp / attack))))
if __name__ == '__main__':
main()
| import math
def main():
hp, attack = (int(i) for i in input().rstrip().split(' '))
ans = str(math.ceil(hp / attack))
print(ans)
if __name__ == '__main__':
main()
| p02783 |
import sys
import socket
hostname = socket.gethostname()
if hostname == 'F451C':
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(eval(input()))
def read_str():
... | import sys
import socket
hostname = socket.gethostname()
if hostname == 'F451C':
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(eval(input()))
def read_str():
... | p02783 |
h,a = list(map(int, input().split()))
i = 0
while i < 10**4:
i += 1
h = h - a
if h <= 0:
print(i)
break | h, a = list(map(int,input().split()))
print((h//a + (h%a!=0))) | p02783 |
h,a=list(map(int,input().split()))
i=0
while h>0:
h=h-a
i+=1
print(i) | h,a=list(map(int,input().split()))
print((-(-h//a))) | p02783 |
h, a = list(map(int, input().split()))
ans = 0
while h > 0:
h -= a
ans += 1
print(ans) | import math
h, a = list(map(int, input().split()))
ans = 0
print((math.ceil(h/a))) | p02783 |
import sys
h, a = list(map(int, sys.stdin.readline().split()))
def main():
return (h + a - 1) // a
if __name__ == '__main__':
ans = main()
print(ans) | import sys
h, a = list(map(int, sys.stdin.readline().split()))
def main():
print(((h + a - 1) // a))
if __name__ == '__main__':
main() | p02783 |
h, a = list(map(int, input().split()))
ans = 0
while h > 0:
h -= a
ans += 1
print(ans) | h, a = list(map(int, input().split()))
ans = 1 + (h - 1) // a
print(ans)
| p02783 |
H, A = list(map(int, input().split()))
print(((H + A - 1) // A))
| H, A = list(map(int, input().split()))
print(((H - 1) // A + 1))
| p02783 |
H, A=list(map(int, input().split()))
ans=0
while H>0:
ans+=1
H-=A
print(ans) | H, A=list(map(int, input().split()))
print(((H-1)//A+1))
| p02783 |
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
H,A = inputlist()
d = H //A
m = H % A
if m != 0:
d +=1
print(d) | #template
def inputlist(): return [int(k) for k in input().split()]
#template
H,A = inputlist()
if H % A == 0:
print((H//A))
else:
print(((H//A)+1)) | p02783 |
h,a=list(map(int,input().split()))
l=0
while h>0:
h = h-a
l += 1
print(l) | H, A = list(map(int, input().split()))
print((H//A if H % A == 0 else H//A+1)) | p02783 |
H,A = list(map(int, input().split()))
count = 0
for i in range(10000):
if i*A >= H:
break
else:
i += 1
count += 1
print(count) | H,A = list(map(int, input().split()))
print((-(-H//A)))
| p02783 |
h, a = list(map(int, input().split()))
if h % a == 0:
print((h//a))
else:
print((h//a + 1))
| a, b = list(map(int, input().split()))
print((-(-a//b))) | p02783 |
H, A = list(map(int, input().split()))
print(((H-1)//A + 1)) | H, A = list(map(int, input().split()))
print(((H+A-1)//A)) | p02783 |
H,A=list(map(int,input().split()))
print(((H+A-1)//A)) | H,A=list(map(int,input().split()))
print((-(-H//A))) | p02783 |
import itertools
import math
import fractions
import functools
h, a = list(map(int,input().split()))
print((math.ceil(h / a))) | h, a = list(map(int, input().split()))
print(((h+a-1)//a)) | p02783 |
import collections
import itertools as it
import math
#import numpy as np
# = input()
# = int(input())
h, a = list(map(int, input().split()))
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
#
# c = collections.Counter()
if h%a==0:
print((int(h/a)))
else:
print((h//a+1)... | #import collections
#import itertools as it
#import math
#import numpy as np
#import sys
#sys.exit()
# = input()
# = int(input())
h, a = list(map(int, input().split()))
'''
# = list(map(int, input().split()))
'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input()... | p02783 |
H, A = list(map(int, input().split()))
cnt = 0
while(H > 0):
H = H - A
cnt += 1
print(cnt) | H, A = list(map(int, input().split()))
total = H // A
if H % A != 0:
print((total+1))
else:
print(total) | p02783 |
h,a=list(map(int,input().split()))
print((0--h//a)) | print((-eval(input().replace(' ','//-')))) | p02783 |
H, A = list(map(int, input().split()))
import math
print((math.ceil(H/A))) | H, A = list(map(int, input().split()))
print((H // A if H % A == 0 else (H // A) + 1)) | p02783 |
H, A = list(map(int, input().split()))
x = 0
while True:
if H <= 0:
break
if H > 0:
H -= A
x += 1
print(x) | H, A = list(map(int, input().split()))
print(((H+A-1)//A)) | p02783 |
H,A = list(map(int, input().split()))
print((-(-H//A))) | H,A = list(map(int, input().split()))
print((int(-(-H//A)))) | p02783 |
h,a = list(map(int,input().split()))
print(((h + a - 1) // a)) | h,a = list(map(int,input().split()))
cnt = 0
while h > 0:
h -= a
cnt += 1
print(cnt)
| p02783 |
H, A = list(map(int, input().split()))
i = 0
while H > 0:
H = H - A
i = i + 1
print(i) | H, A = list(map(int, input().split()))
print((int((H + A - 1) / A)))
| p02783 |
n, m, k = list(map(int, input().split()))
mod = 998244353
ans = 0
comb = 1
for i in range(k+1):
ans += (((m*pow(m-1,n-i-1,mod))%mod)*comb)%mod
ans %= mod
comb *= (n-1-i)
comb //= i+1
print(ans) | n, m, k = list(map(int, input().split()))
mod = 998244353
ans = 0
comb = 1
for i in range(k+1):
ans += (((m*pow(m-1,n-i-1,mod))%mod)*comb)%mod
ans %= mod
comb *= (n-1-i)
comb %= mod
comb *= pow(i+1, mod-2, mod)
comb %= mod
print(ans) | p02685 |
n, m, k = list(map(int, input().split()))
mod = 998244353
ans = 0
comb = 1
for i in range(k+1):
ans += (((m*pow(m-1,n-i-1,mod))%mod)*comb)%mod
ans %= mod
comb *= (n-1-i)
comb %= mod
comb *= pow(i+1, mod-2, mod)
comb %= mod
print(ans) | n, m, k = list(map(int, input().split()))
mod = 998244353
ans = 0
comb = 1
for i in range(k+1):
ans += (((m*pow(m-1,n-i-1,mod))%mod)*comb)%mod
ans %= mod
comb = (comb*(n-1-i)*pow(i+1, mod-2, mod))%mod
print(ans) | p02685 |
MOD = 998244353
#階乗のリストを作成する
N, M, K = list(map(int, input().split()))
frac = [1]
for i in range(N):
frac.append(frac[i]*(i+1)%MOD)
#上の公式を用いてcombの計算を行う
def comb(n, k, mod):
a=frac[n]
b=frac[k]
c=frac[n-k]
return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod
def main():
ans... | MOD = 998244353
#階乗のリストを作成する
N, M, K = list(map(int, input().split()))
frac = [1]
for i in range(N):
frac.append(frac[i]*(i+1)%MOD)
#上の公式を用いてcombの計算を行う
def comb(n, k, mod):
a=frac[n]
b=frac[k]
c=frac[n-k]
return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod
def main():
ans... | p02685 |
MOD = 10000000007
lim = 200000
MOD = 998244353
inv_t = [-1 for i in range(lim+1)]
factrial = [-1 for i in range(lim+1)]
factrial_inv = [-1 for i in range(lim+1)]
def set_inv(max=lim):
inv_t[0] = 0
for i in range(1, max):
if inv_t[i] == -1:
_ = mod_inv(i)
inv_t[i]... | MOD = 998244353
lim = 200000
inv_t = [-1 for i in range(lim+1)]
factrial = [-1 for i in range(lim+1)]
factrial_inv = [-1 for i in range(lim+1)]
def set_inv(max=lim):
inv_t[0] = 0
for i in range(1, max):
inv_t[i] == mod_inv(i)
def mod_inv(x, mod=MOD):
y, u, v, _x = mod, 1, 0, x
... | p02685 |
from math import factorial
# def comb(n,r):
# return(factorial(n) // (factorial(n-r) * factorial(r)))
def comb(n,k,p):
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a=factorial(n) %p
b=factorial(k) %p
c=factorial(n-k) %p
return (a*power_func(b,p-2,p)*power_func(c,p-2,... |
def power_func(a,b,p):
if b==0: return 1
if b%2==0:
d=power_func(a,b//2,p)
return d*d %p
if b%2==1:
return (a*power_func(a,b-1,p ))%p
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998... | p02685 |
n,m,k = list(map(int,input().split()))
mod = 998244353
def pascal(n):
line = [1]
for k in range(n):
line.append(int(line[k] * (n-k) // (k+1)) )
return line
line = pascal(n-1)
#print(line)
mm1 = [1]
for i in range(1, n+1):
mm1 += [(mm1[-1] * (m-1)) % mod]
mm = [1]
for i in rang... | max_n=2 * 10**5
mod=998244353
fact, inv_fact = [0] * (max_n + 1), [0] * (max_n + 1)
fact[0] = 1
for i in range(max_n):
fact[i + 1] = fact[i] * (i + 1) % mod
inv_fact[-1] = pow(fact[-1], mod - 2, mod)
for i in reversed(list(range(max_n))):
inv_fact[i] = inv_fact[i + 1] * (i + 1) % mod
def nCr_mod(n,... | p02685 |
n, m, k = list(map(int, input().split()))
mod = 998244353
ans = 0
t = 1
b = 1
for i in range(k+1):
ans += t * pow(m-1, n-1-i, mod) * pow(b, mod-2, mod)
ans %= mod
#n-1Ci * (m-1)**i
t *= (n-1-i)
b *= (i+1)
print((ans*m%mod)) | n, m, k = list(map(int, input().split()))
mod = 998244353
ans = 0
t = 1
b = 1
for i in range(k+1):
ans += t * pow(m-1, n-1-i, mod) * pow(b, mod-2, mod)
ans %= mod
#n-1Ci * (m-1)**i
t *= (n-1-i)
t %= mod
b *= (i+1)
b %= mod
print((ans*m%mod)) | p02685 |
import sys,os
from collections import defaultdict, deque
from math import ceil, floor, inf
if sys.version_info[1] >= 5:
from math import gcd
else:
from fractions import gcd
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ... | import sys,os
from collections import defaultdict, deque
from math import ceil, floor, inf
if sys.version_info[1] >= 5:
from math import gcd
else:
from fractions import gcd
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ... | p02685 |
import sys,os
from collections import defaultdict, deque
from math import ceil, floor, inf
if sys.version_info[1] >= 5:
from math import gcd
else:
from fractions import gcd
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ... | import sys,os
from collections import defaultdict, deque
from math import ceil, floor, inf
if sys.version_info[1] >= 5:
from math import gcd
else:
from fractions import gcd
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ... | p02685 |
mod=998244353
def mod_pow(x,n):
res=1
while n>0:
if n&1:
res=res*x%mod
x=x*x%mod
n>>=1
return res
def inverse_element(t):
return mod_pow(t,mod-2)
n,m,k=list(map(int,input().split()))
ans=0
p1=m*mod_pow(m-1,n-1)%mod
p2=1
for i in range(0,k+1):
ans... | mod=998244353
def mod_pow(x,n):
res=1
while n>0:
if n&1:
res=res*x%mod
x=x*x%mod
n>>=1
return res
def inverse_element(t):
return mod_pow(t,mod-2)
n,m,k=list(map(int,input().split()))
if m==1:
if k==n-1:
print(m)
else:
print((0... | p02685 |
# from math import factorial
from sys import exit
n,m,k = list(map(int, input().split()))
if m == 1:
if k == n-1:
print((1))
else:
print((0))
exit()
MOD = 998244353
ans = tmp = (m * (m-1) ** (n-1))
ans %= MOD
for i in range(k):
tmp *= (n-1-i)
tmp //= (m-1) * (i+1)
... | # from math import factorial
from sys import exit
n,m,k = list(map(int, input().split()))
if m == 1:
if k == n-1:
print((1))
else:
print((0))
exit()
MOD = 998244353
ans = tmp = (m * (m-1) ** (n-1)) % MOD
for i in range(k):
tmp *= (n-1-i)
tmp %= MOD
tmp *= pow((m... | p02685 |
from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
INF, NINF = float('inf'), float('-inf')
def binom_tables(n, q):
fact = [1 for _ in range(n + 1)]
inv = [1 for _ in range(n + 1)]
for i in range(1, n+... | from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
INF, NINF = float('inf'), float('-inf')
def binom_tables(n, q):
fact = [1 for _ in range(n + 1)]
inv = [1 for _ in range(n + 1)]
for i in range(1, n+... | p02685 |
mod = 998244353 #出力の制限
N = 2 * (10**5)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def nCr(n, r, mod):
... |
class ModCombination():
def __init__(self, n, mod=998244353):
self.mod = mod
self.N = n
fact = [1, 1] # 元テーブル
ifact = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, n + 1 ):
fact.append( ( fact[-1] * i ) % mod )
... | p02685 |
N,M,K = list(map(int,input().split()))
MOD = 998244353
cmbarr = [1] * (N)
for r in range(N-1):
cmbarr[r+1] = cmbarr[r] * (N - 1 - r) // (r + 1)
A = [M*pow(M-1,N-1-i,MOD) % MOD for i in range(K+1)]
A = [A[i] * cmbarr[i] % MOD for i in range(K+1)]
print((sum(A) % MOD)) | N,M,K = list(map(int,input().split()))
MOD = 998244353
fac = [1] * (N+1)
inv = [1] * (N+1)
ifac = [1] * (N+1)
for i in range(2,N+1):
fac[i]=(fac[i-1]*i)%MOD
inv[i]= -(inv[MOD%i]*(MOD//i))%MOD
ifac[i]=(ifac[i-1]*inv[i])%MOD
cmbarr = [1] * N
for r in range(N-1):
cmbarr[r+1] = cmbarr[r] * (N... | p02685 |
n, m, k = list(map(int, input().split()))
# tmp = m
mod = 998244353
ans = m * pow(m-1, n-1, mod)
ans %= mod
ncm = 1
for i in range(k):
ncm *= n-1-i
ncm *= pow(i+1, mod-2, mod)
ans += m * pow(m-1, n-i-2, mod) * ncm
ans %= mod
print(ans)
| n, m, k = list(map(int, input().split()))
# tmp = m
mod = 998244353
ans = m * pow(m-1, n-1, mod)
ans %= mod
ncm = 1
ncm_list = [0 for _ in range(k)]
for i in range(k):
ncm *= n-1-i
ncm *= pow(i+1, mod-2, mod)
ncm %= mod
ncm_list[i] = ncm
powm_list = [0 for _ in range(k)]
tmp = m * pow(m-1... | p02685 |
N, M, K = list(map(int, input().split()))
mod = 998244353
MAX_N = 2 * (10**5)
fact = [1]
fact_inv = [0] * (MAX_N + 4)
for i in range(MAX_N + 3):
fact.append(fact[-1]*(i+1)%mod)
fact_inv[-1] = pow(fact[-1],mod-2,mod)
for i in range(MAX_N+2,-1,-1):
fact_inv[i] = fact_inv[i+1]*(i+1)%mod
def cmb(n... | N, M, K = list(map(int, input().split()))
mod = 998244353
fact = [1 for i in range(N+1)]
fact_inv = [1 for i in range(N+1)]
for i in range(1, N+1):
fact[i] = fact[i-1] * i % mod
fact_inv[i] = pow(fact[i], mod-2, mod)
def cmb(n,k):
return fact[n] * fact_inv[k] % mod * fact_inv[n-k] %mod
ans ... | p02685 |
n,m,k=list(map(int,input().split()))
mod=998244353
ans=0
def mfact(n,mod):
f=[1]
for i in range(1,n+1):
f.append(f[-1]*i%mod)
return f
f=mfact(n,mod)
for i in range(k+1):
ans=(ans+(m*pow(m-1,n-i-1,mod)*f[n-1]*pow(f[n-1-i],mod-2,mod)*pow(f[i],mod-2,mod)))%mod
print(ans) | n,m,k=list(map(int,input().split()))
mod=998244353
ans=0
def mfact(n,mod):
f=[1]
for i in range(1,n+1):
f.append(f[-1]*i%mod)
return f
f=mfact(n,mod)
for i in range(k+1):
ans+=(m*pow(m-1,n-i-1,mod)*(f[n-1]*pow(f[n-1-i],mod-2,mod)*pow(f[i],mod-2,mod))%mod)%mod
print((ans%mod))
| p02685 |
M=998244353
n,m,k=list(map(int,input().split()))
a=m*pow(m-1,n-1,M)
c=1
for i in range(1,k+1):
t=m*pow(m-1,n-i-1,M)
c=c*(n-i)*pow(i,M-2,M)
a+=t*c%M
print((a%M)) | M=998244353
n,m,k=list(map(int,input().split()))
p,c=[m]*n,[1]*n
for i in range(1,n):
p[i]=p[i-1]*(m-1)%M
c[i]=c[i-1]*(n-i)*pow(i,M-2,M)%M
print((sum(p[n-i-1]*c[i]%M for i in range(k+1))%M)) | p02685 |
M=998244353
n,m,k=list(map(int,input().split()))
a=0
c=1
for i in range(k+1):
a+=c*m*pow(m-1,n-i-1,M)
c=c*(n-i-1)*pow(i+1,M-2,M)%M
print((a%M)) | M=998244353
n,m,k=list(map(int,input().split()))
a,c=0,1
for i in range(k+1):
a+=c*m*pow(m-1,n+~i,M)
c=c*(n+~i)*pow(i+1,-1,M)%M
print((a%M)) | p02685 |
# E - Colorful Blocks
import sys
readline = sys.stdin.readline
MOD = 998244353
N, M, K = list(map(int, readline().split()))
def pow_mod(x, n, mod):
ans = 1
while n>0:
if n&1==1:
ans = (ans * x)%mod
x = (x * x)%mod
n >>= 1
return ans
f = [1]
for i in ra... | # E - Colorful Blocks
import sys
readline = sys.stdin.readline
MOD = 998244353
N, M, K = list(map(int, readline().split()))
# 予め階乗を計算しておく
f = [1]
for i in range(N):
f.append(f[i] * (i+1) % MOD)
f_inv = [1] * N
f_inv[N-1] = pow(f[N-1], MOD-2, MOD)
for i in range(N-1)[::-1]:
f_inv[i] = f_inv[i+1... | p02685 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.