problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02744 | s331542978 | Wrong Answer |
n = int(input())
data = ["a"] * n
ans = ["".join(data)]
def print_str(ans, data, i):
if i == n:
return
data[i] = "a"
ans.append("".join(data))
while ord(data[i]) + 1 <= ord(data[i - 1]) + 1:
data[i] = chr(ord(data[i]) + 1)
ans.append("".join(data))
print_str(ans, data, i + 1)
data = ["a"] * n
print_str(ans, data, i + 1)
print_str(ans, data, 1)
ans = sorted(set(ans))
for i in range(len(ans)):
print(ans[i]) |
p03319 | s128869167 | Accepted | n, k, *_ = map(int, open(0).read().split())
print((n - 2) // (k - 1) + 1) |
p03861 | s639849454 | Accepted | a, b, c = map(int, input().split())
print((b // c) - (a - 1) // c) |
p02678 | s841641531 | Wrong Answer | print("Yes") |
p02748 | s970436829 | Accepted | def main():
a, b, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = min(A) + min(B)
for _ in range(m):
x, y, c = map(int, input().split())
ans = min(ans, A[x - 1] + B[y - 1] - c)
print(ans)
if __name__ == '__main__':
main() |
p02759 | s999942321 | Accepted | import math
a=int(input())
print(math.ceil(a/2)) |
p03131 | s535327383 | Accepted | def main():
K,A,B = map(int,input().split())
if B-A<=2:
print(1+K)
exit()
now = 1
K -= (A-1)
now = A
if K%2==0:
now += (B-A)*(K//2)
else:
now += (B-A)*((K-1)//2)
now += 1
print(now)
if __name__ == '__main__':
main() |
p02744 | s557449644 | Wrong Answer | n = int(input())
ans = []
start = "a"
stack = []
stack.append(start)
num = ord("a")
while stack:
v = stack.pop()
if len(v) == n:
ans.append(v)
continue
nex_num = ord(v[-1])
for i in range(num, nex_num + 2):
tuika = chr(i)
stack.append(v + tuika)
print(*ans[::-1], sep="\n")
|
p02602 | s212044727 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N-K):
if A[i] < A[i+K]:
print('Yes')
else:
print('No') |
p02601 | s613054017 | Accepted | a, b, c = map(int, input().split())
k = int(input())
cnt = 0
while b <= a:
b *= 2
cnt += 1
while c <= b:
c *= 2
cnt += 1
if cnt <= k:
print ('Yes')
else:
print ('No') |
p02973 | s714465367 | Wrong Answer | count=1
n=int(input())
mina=int(input())
for _ in range(n-1):
a=int(input())
if mina>=a:
count+=1
mina=a
print(count) |
p03698 | s565750631 | Accepted | from collections import Counter
s = list(input())
ans = Counter(s)
flag = True
for i in ans.values():
if i>1:
flag = False
print('yes' if flag else 'no') |
p02597 | s931986531 | Accepted | N = int(input())
c = input()
l = 0
r = N-1
cnt = 0
while(l<r):
if c[l] == "W" and c[r] == "R":
cnt += 1
l += 1
r -= 1
elif c[l] == "R":
l += 1
elif c[r] == "W":
r -= 1
print(cnt) |
p03472 | s033151339 | Accepted | import math
n,h=map(int,input().split())
A=[]
B=[]
for i in range(n):
a,b=map(int,input().split())
A.append(a)
B.append(b)
A.sort(reverse=True)
B.sort(reverse=True)
amax=A[0]
while B[-1]<amax:
B.pop()
S=0
if sum(B)>=h:
for i in range(n):
S+=B[i]
if S>=h:
print(i+1)
break
else:
h-=sum(B)
print(math.ceil(h/amax)+len(B))
|
p03345 | s391798827 | Accepted | A, B, C, K = map(int, input().split())
if K%2==0:
ans = A-B
else:
ans = B-A
if abs(ans)>10**18:
ans = 'unfair'
print(ans) |
p03211 | s207145317 | Wrong Answer | S = input()
min = 1000
for i in range(len(S) - 2):
x = int(S[i:i+3])
print(x)
x = abs(753 - x)
if min > x:
min = x
print(min) |
p02694 | s220971337 | Wrong Answer | X = int(input())
money = 100
year = 0
while X > money:
year += 1
money += money * 101 // 100
print(year)
|
p02708 | s538468937 | Wrong Answer | import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
a, b = map(int, input().split())
sum = 0
for i in range(b, a+1):
sum += combinations_count(a+1, i)
print(sum) |
p02608 | s750179039 | Accepted | n = int(input())
li = [0]*(10001)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = x*x+y*y+z*z+x*y+y*z+z*x
if tmp>10000:
continue
li[tmp] += 1
for i in range(1, n+1):
print(li[i]) |
p02697 | s351550739 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, m = map(int, input().split())
aa = n//2
bb = aa+1
for i in range(m):
print(aa,bb)
aa-=1
bb+=1 |
p03137 | s829272727 | Accepted | n,m = map(int,input().split())
x = sorted(map(int,input().split()))
if n >= m:
print(0)
else:
d = sorted([x[i]-x[i-1] for i in range(1,m)])
print(sum(d[:m-1-(n-1)]))
|
p03943 | s407704248 | Wrong Answer | list = input().split()
list.sort(reverse=True)
list = [int(n) for n in list]
if list[0] == list[1] + list[2]:
print('Yes')
else:
print('No') |
p03284 | s987642224 | Accepted | n,k=map(int,input().split())
if n%k==0:
print(0)
else:
print(1) |
p02554 | s989108485 | Accepted | N = int(input())
ans = (10 ** N - 2 * 9 ** N + 8 ** N) % (10 ** 9 + 7)
print(ans) |
p03317 | s682182508 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
now = k
res = 1
while now < n:
now += k-1
res += 1
print(res) |
p03448 | s340046311 | Wrong Answer | A=int(input())
B=int(input())
C=int(input())
x=int(input())
s=0
for i in range(A+1):
for t in range(B+1):
if x<0: break
elif 50*C>=x:
s+=1
x-=100
else: x-=100
x-=500
print(s) |
p02900 | s356442105 | Wrong Answer | from fractions import gcd
N, M = map(int, input().split())
n = gcd(N, M)
# print(n)
ans = 1
for i in range(2, int(n**(1/2))+2):
flag = 0
# print("i", i)
while True:
if n%i == 0:
n //= i
# print(n)
flag = 1
else:
break
ans += flag
print(ans) |
p03705 | s880062855 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
INF = float('inf')
n, a, b = LI()
min_s = a * (n - 1) + b
max_s = a + (n - 1) * b
print(f'{min_s=}, {max_s=}')
ans = max_s - min_s + 1
if ans < 0:
ans = 0
print(ans)
|
p03284 | s313752316 | Accepted | N,K=map(int,input().split())
if (N%K==0):
print("0")
else:
print("1") |
p02982 | s605303534 | Accepted | import math
n,d = map(int,input().split())
l = []
for i in range(n):
l.append(list(map(int,input().split())))
count = 0
for i in range(n-1):
for j in range(i+1,n):
ans = 0
for k in range(d):
ans += (int(l[i][k])-int(l[j][k]))**2
if float.is_integer(math.sqrt(ans)) == True:
count += 1
print(count)
|
p02665 | s117043166 | Wrong Answer | N = int(input())
A = [int(a) for a in input().split()]
ans = 1
L = [0]*(N+2)
for i in range(N+1):
L[i+1] = L[i]+A[i]
v = 1
for i in range(1, N+1):
v = min(2*v, L[-1]-L[i])
ans += v
v -= A[i]
if v < 0:
ans = -1
break
if A[0] > 0 or A[-1] == 0:
ans = -1
print(ans) |
p03836 | s599064322 | Accepted | sx,sy,tx,ty = map(int,input().split())
root = ''
dx = tx-sx
dy = ty-sy
for i in range(dy):
root += 'U'
for j in range(dx):
root += 'R'
for k in range(dy):
root += 'D'
for j in range(dx):
root += 'L'
root += 'L'
for i in range(dy+1):
root += 'U'
for j in range(dx+1):
root += 'R'
root += 'D'
root += 'R'
for k in range(dy+1):
root += 'D'
for j in range(dx+1):
root += 'L'
root += 'U'
print(root) |
p02843 | s160312043 | Accepted | num=(int)(input())
n=num//100
amari=num%100
if num <= 99 or amari / n > 5:
print(0)
else:
print(1) |
p02570 | s644876888 | Accepted | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
D,T,S =map(int,input().split())
if D <=T*S:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p03665 | s105634305 | Wrong Answer | n,p=map(int,input().split())
A=[i%2 for i in map(int,input().split())]
A0=A.count(0)
A1=A.count(1)
if p==1 and A1==0:
print(0)
elif p==1 and A1==0:
print(2**A0)
else:
print((2**A0)*(2**A1)//2)
|
p03338 | s199477260 | Wrong Answer | def CutandCount(n , s):
ans = 0
for i in range(1 , n + 1):
count = 0
for w in range(ord('a'), ord('z') + 1):
if s[:i] in chr(w) and s[i:] in chr(w):
count += 1
ans = max(ans , count)
return ans
def main():
n = int(input())
s = str(input())
print(CutandCount(n , s))
if __name__ == '__main__':
main() |
p03449 | s040102420 | Accepted | n=int(input())
l=[list(map(int,input().split()))for _ in range(2)]
a=0
for i in range(n):
a=max(a,sum(l[0][:i+1])+sum(l[1][i:]))
print(a)
|
p02697 | s583831739 | Accepted | n,m=map(int,input().split())
j = 0
if n % 2 == 1:
for i in range(m):
print(1+i, n-i-j)
else:
for i in range(m):
if 2*((n-i) - (1+i)) - n >= 2:
print(1+i, n-i-j)
else:
j = 1
print(1+i, n-i-j) |
p02613 | s497389165 | Accepted | from collections import *
n = int(input())
a = []
for i in range(n):
a.append(input())
c = Counter(a)
for i in ['AC', 'WA', 'TLE', 'RE']:
if(i not in c): c[i] = 0
print(i,'x',c[i])
|
p03456 | s054106855 | Accepted | import math
a,b=input().split()
n=int(a+b)
if math.sqrt(n)==math.sqrt(n)//1:
print("Yes")
else:
print("No") |
p03281 | s888634255 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
if N < 105:
print(0)
elif N < 135:
print(1)
elif N < 165:
print(2)
elif N < 189:
print(3)
elif N < 195:
print(4)
else:
print(5) |
p02598 | s920007631 | Wrong Answer | # にぶたん 二分探索
n, k = map(int, input().split())
A = list(map(int, input().split()))
ok = 1
ng = max(A)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
cnt = 0
for a in A:
cnt += (a - 1) // mid
if cnt <= k:
ng = mid
else:
ok = mid
print(ng)
|
p04011 | s045846881 | Accepted | n = int(input())
k = int(input())
x = int(input())
y = int(input())
if k <= n:
print(k*x+(n-k)*y)
else:
print(n*x) |
p02663 | s659263432 | Accepted | a,b,c,d,e = map(int,input().split())
kis = a * 60 + b
nel = c * 60 + d
print(nel - e - kis) |
p03162 | s003552327 | Wrong Answer | n=int(input())
dp={}
l1=list(map(int,input().split()))
dp[1]=[max(l1),l1.index(max(l1))+1]
for val in range(2,n+1):
dp[val]=[0,4]
for val2 in range(2,n+1):
l=list(map(int,input().split()))
l[dp[val2-1][1]-1]=0
dp[val2]=[max(dp[val2][0],dp[val2-1][0]+max(l)),l.index(max(l))+1]
print(dp[n][0]) |
p03359 | s442254271 | Accepted | a, b = map(int, input().split())
if a > b:
print(a - 1)
elif a <= b:
print(a) |
p02994 | s595574863 | Accepted | n,l=map(int,input().split())
aji = []
m = 100000
flg = 0
for i in range(n):
aji.append((l+i))
if abs(aji[i]) <= m:
m = abs(aji[i])
if aji[i] <= 0:
flg = 1
else:
flg = 0
print(sum(aji)- m if flg==0 else sum(aji) +m)
|
p03994 | s014724910 | Accepted | s = list(input())
k = int(input())
n = len(s)
for i in range(n):
if k <= 0 or s[i] == 'a':
continue
if 123 - ord(s[i]) <= k:
k -= 123 - ord(s[i])
s[i] = 'a'
# print(k)
# print(s)
k %= 26
# print(ord(s[-1])+k)
if ord(s[-1])+k > 122:
s[-1] = chr(97+(122-ord(s[-1])+k))
else:
s[-1] = chr(ord(s[-1])+k)
# print(k)
print(*s, sep='')
|
p03427 | s486617712 | Accepted | n = input()
k = len(n)
a = 9 * (k - 1) + int(n[0]) - 1
b = 0
for i in range(k):
b += int(n[i])
c = 0
m = ''
if k > 2 and n[-2] != '0':
m = str(int(n))[:k - 2] + str(int(n[-2]) - 1) + '9'
elif k > 2 and n[-2] == '0':
m = str(int(n) - (int(n[-1]) + 1))
for i in range(len(m)):
c += int(m[i])
ans = max(a, b, c)
print(ans) |
p03001 | s465258186 | Accepted | w, h, x, y = map(int, input().split())
area = w * h / 2
if x == w / 2 and y == h / 2:
print(area, 1)
else:
print(area, 0)
|
p03126 | s360841776 | Wrong Answer | N, M = map(int, input().split())
A = []
for i in range(N):
A.append(list(map(int, input().split())))
s = set(A[0])
for i in range(1,N):
_s = set(A[i])
s &= _s
print(len(s)-1) |
p03852 | s103430954 | Wrong Answer | c = input()
if c in "aeiou":
print("vowel")
else:
print("constant") |
p02548 | s764688624 | Accepted | N=int(input())
s=0
for k in range(1,N):
s+=(N-1)//k
k+=1
print(s) |
p04020 | s902824113 | Accepted | n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
for i in range(n):
if i > 0:
if a[i-1] == 1 and a[i] > 0:
ans += 1
a[i] -= 1
ans += a[i] // 2
a[i] %= 2
print(ans) |
p02600 | s392784238 | Accepted | print(10-int(input())//200) |
p03434 | s385765907 | Accepted | N=int(input())
table=list(map(int,input().split()))
alice_num=0
bob_num=0
table=sorted(table)
for i in range(N-1,-1,-1):
if N%2==0:
if i%2==1:
alice_num+=table[i]
else:
bob_num+=table[i]
else:
if i%2==1:
bob_num+=table[i]
else:
alice_num+=table[i]
print((alice_num)-(bob_num))
|
p02630 | s180115802 | Accepted | n = int(input())
a = list(map(int,input().split()))
s = sum(a)
x = [0 for _ in range(10**5+1)]
for ai in a:
x[ai] += 1
q = int(input())
for _ in range(q):
b,c = map(int,input().split())
xb = x[b]
x[b] = 0
s+= xb*(c-b)
x[c] += xb
print(s) |
p03836 | s170128821 | Accepted | def resolve():
sx, sy, tx, ty = list(map(int, input().split()))
dx = tx - sx
dy = ty - sy
res = "U"*dy+"R"*dx+"D"*dy+"L"*dx+"L"+"U"*(dy+1)+"R"*(dx+1)+"D"+"R"+"D"*(dy+1)+"L"*(dx+1)+"U"
print(res)
if '__main__' == __name__:
resolve()
|
p02731 | s396107772 | Accepted | f = int(input()) / 3.0
print("{:.9f}".format(f * f * f))
|
p02995 | s210515907 | Accepted | import math
a, b, c, d = map(int, input().split())
gcd = (c * d) // math.gcd(c, d)
r = b // c + b // d - b // gcd
l = (a - 1) // c + (a - 1) // d - (a - 1) // gcd
print((b - a) - (r - l) + 1)
|
p02701 | s246826546 | Wrong Answer | import math
import collections
import fractions
import itertools
def solve():
n = int(input())
s = [input() for i in range(n)]
print(len(s))
return 0
if __name__ == '__main__':
solve() |
p03962 | s843778363 | Accepted | url = "https://atcoder.jp/contests/abc046/tasks/abc046_a"
def main():
li = list(input().split())
print(len(set(li)))
if __name__ == '__main__':
main()
|
p03042 | s571192124 | Accepted | S = input()
S1 = int(S[:2])
S2 = int(S[2:])
if 1<=S1<=12 and 1<=S2<=12:
print('AMBIGUOUS')
elif 1<=S1<=12:
print('MMYY')
elif 1<=S2<=12:
print('YYMM')
else:
print('NA') |
p02547 | s709998689 | Accepted | N=int(input())
flag = 0
for i in range(N):
d1,d2 = map(int,input().split())
if d1==d2:
if flag<2:
flag+=1
else:
print("Yes")
exit()
else:
flag = 0
print("No") |
p02973 | s079885939 | Accepted | from bisect import bisect_left
from collections import deque
n = int(input())
ans = []
ans.append(int(input()))
ans = deque(ans)
for i in range(n-1):
temp = int(input())
if temp <= ans[0]:
ans.appendleft(temp)
else:
ans[bisect_left(ans, temp)-1]=temp
print(len(ans))
|
p03627 | s016605181 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
from collections import Counter
c = Counter(A)
x = 0
y = 0
for k, v in sorted(c.items(), key=lambda x: -x[0]):
if v >= 2:
if x == 0:
x = k
elif y == 0:
y = k
print(x*y) |
p02622 | s461431666 | Accepted | a = str(input())
b = str(input())
res = 0
for i in range(len(a)) :
if a[i] != b[i] :
res += 1
print(res)
|
p02729 | s540252132 | Accepted | n, m = map(int, input().split(' '))
print((n * (n - 1) + m * (m - 1)) // 2) |
p03059 | s215518482 | Wrong Answer | A, B, T = map(int, input().split())
print(int(((B/A)*T))) |
p02631 | s868545101 | Accepted | N = int(input())
A = [int(a) for a in input().split()]
s = 0
for a in A:
s ^= a
print(*[a^s for a in A]) |
p02748 | s468879639 | Accepted | A,B,M = map(int,input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
XYC = [[int(i) for i in input().split()] for j in range(M)]
res = 10**9
for x,y,c in XYC:
res = min(res,a[x-1]+b[y-1]-c)
res = min(res,min(a)+min(b))
print(res) |
p03836 | s498208915 | Wrong Answer | #coding: utf-8
sx, sy, tx, ty = map(int,input().split())
ans = ''
for i in range(tx-sx):
ans += 'R'
for i in range(ty-tx):
ans += 'U'
for i in range(tx-sx):
ans += 'L'
for i in range(ty-tx):
ans += 'D'
ans += 'D'
for i in range(tx-sx+1):
ans += 'R'
for i in range(ty-tx+1):
ans += 'U'
ans += 'L'
ans += 'U'
for i in range(tx-sx+1):
ans += 'L'
for i in range(ty-tx+1):
ans += 'D'
ans += 'R'
print(ans) |
p03796 | s918316768 | Wrong Answer | N = int(input())
double = 1
for i in range(1, N):
double = double*i
print(double%(10**9+7)) |
p03565 | s303043894 | Accepted | def solve(s, t):
length = len(t)
ans = []
i = 0
flg = False
while i < len(s):
tmp = s[i:i+length]
count = len([i for i, j in zip(tmp, t) if i == j or i == "?"])
if length == count:
a = s[:i] + t + s[i+length:]
ans.append(a.replace("?", "a"))
i += 1
return min(ans) if len(ans) > 0 else "UNRESTORABLE"
if __name__ == "__main__":
s = input()
t = input()
print(solve(s, t)) |
p03261 | s729489305 | Wrong Answer | n=int(input())
a=input()
l=[a]
ans="Yes"
for i in range(n-1):
w=input()
a=w
if (a[-1]!=w[0]) or (w in l ):
ans="No"
l.append(w)
print(ans) |
p02688 | s997108708 | Wrong Answer | N,K=map(int,input().split())
a=[list(map(int,input().split()))for i in range(2*K)]
sunuke=[]
for i in range(2*K):
if i%2==1:
d=sum(a[i-1])
for n in range(d):
sunuke.append(a[i][n])
print(sunuke)
sunuke=set(sunuke)
print(N-len(sunuke)) |
p03721 | s286459890 | Accepted | n,k=map(int,input().split())
ab=[]
for _ in range(n):
a,b=map(int,input().split())
ab.append((a,b))
ab.sort()
for i,j in ab:
k-=j
if k<=0:
print(i)
exit() |
p02608 | s446521269 | Wrong Answer | N = int(input())
def Main(N):
B = 41
ans = [0]*(6*B*B+1)
for i in range(1, B+1):
for j in range(1, B+1):
for k in range(1, B+1):
a = i*i+j*j+k*k+i*j+j*k+k*i
ans[a] += 1
return ans
out = Main(N)
for i in range(1, N+1):
print(out[i]) |
p03206 | s675792837 | Wrong Answer | print("Chistmas"+" Eve"*(25-int(input()))) |
p03146 | s515266360 | Wrong Answer | s=int(input())
cnt=0
while True:
cnt+=1
if s==4:
print(cnt+3)
break
if s%2==0:
s=s//2
else:
s=3*s+1 |
p02663 | s396287259 | Wrong Answer | h1,m1,h2,m2,k = map(int,input().split())
t1 = h1*60+m1
t2 = h2*60+m1
d = t2-t1
print(d-k) |
p03071 | s566771654 | Accepted | a, b = map(int, input().split())
if abs(a - b) > 0:
m = max(a, b)
ans = m + m - 1
else:
ans = a + b
print(ans)
|
p02720 | s446102488 | Wrong Answer | K=int(input())
A=[1,2,3,4,5,6,7,8,9]
I=0
while I<=K:
if not A[I]%10==0:
A.append(A[I]%10+10*A[I]-1)
A.append(A[I]%10+10*A[I])
if not A[I]%10==9:
A.append(A[I]%10+10*A[I]+1)
I+=1
if len(A)>=K:
break
print(A[I]) |
p02918 | s720956845 | Accepted | N, K = map(int, input().split(' '))
S = input()
happy = sum([1 for i in range(N - 1) if S[i] == S[i + 1]])
print(min(N - 1, happy + 2 * K)) |
p02910 | s037370208 | Accepted | s=input()
o=["R","U","D"]
e=["L","U","D"]
for i in range(len(s)):
if i%2==0:
if s[i] in o:
pass
else:
print("No")
break
else:
if s[i] in e:
pass
else:
print("No")
break
else:
print("Yes") |
p03645 | s296024256 | Accepted | island, fune = map(int, input().split(" "))
route = []
for i in range(fune):
route.append(list(map(int, input().split(" "))))
temp = []
for i in range(fune):
if route[i][0] == 1:
temp.append(route[i][1])
for j in range(fune):
if route[j][1] == island:
temp.append(route[j][0])
print("POSSIBLE") if len(temp) != len(list(set(temp))) else print("IMPOSSIBLE") |
p04005 | s068535738 | Wrong Answer | # n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
A, B, C = map(int, input().split())
ans = 0
if C % 2 != 0:
ans = A * B
elif B % 2 != 0:
ans = A * C
elif A % 2 != 0:
ans = B * C
print(ans)
|
p03730 | s006676057 | Wrong Answer | A,B,C=map(int,input().split())
for i in range(1,10**5):
if (B*i+C)%A==0:
print('Yes')
break
else:
print('No') |
p03556 | s000615787 | Accepted | n = int(input())
i = 1
while i ** 2 <= n:
i += 1
print((i - 1) ** 2) |
p03206 | s402617972 | Accepted | print("Christmas"+" Eve"*(25-int(input()))) |
p02963 | s325930523 | Wrong Answer | s=int(input())
if s+1<=10**9:
b=str(s+1)
a=['0','0',b,'1','1','1']
else:
x2=int(s**(1/2))
y3=int(s**(1/2))+1
if x2*y3<s:
x2+=1
x2=str(x2)
y3=str(y3)
y2=str(1)
x3=str(int(x2)*int(y3)-s)
x1=str(0)
y1=str(0)
a=[x1,y1,x2,y2,x3,y3]
print((' ').join(a))
|
p03319 | s066056567 | Wrong Answer | n,k=map(int,input().split())
if (n-1)%(k-1)==0:
print((n-1)/(k-1))
else:
print((n-1)//(k-1)+1)
|
p02622 | s285098073 | Accepted | S = input()
T = input()
ans = 0
for i in range(len(S)):
if S[i]!=T[i]:
ans+=1
print(ans) |
p02779 | s244169594 | Accepted | n = int(input())
a = map(int,input().split())
if len(set(a)) == n:
print("YES")
else:
print("NO") |
p03419 | s336839681 | Accepted | N,M = map(int,input().split())
ans = 0
if N == 1 and M == 1:
ans = 1
elif N == 1:
ans = M-2
elif M == 1:
ans = N-2
else:
ans = (N-2)*(M-2)
print(ans) |
p03632 | s645026448 | Accepted | # ABC070_B
A,B,C,D = map(int, input().split())
f = []
s = []
# 先にボタンを押し始めたほうをfに格納する
if A <= C:
f = [A, B]
s = [C, D]
else:
s = [A, B]
f = [C, D]
ans = 0
if f[1] <= s[0]:
ans = 0
elif s[1] <= f[1]:
ans = s[1] - s[0]
elif f[1] <= s[1]:
ans = f[1] - s[0]
print(ans)
|
p03221 | s219861945 | Accepted | n, m = map(int, input().split())
p_y = []
for i in range(m):
p, y = map(int, input().split())
p_y.append([p, y, i])
p_y_sorted = sorted(p_y)
li_id = []
prev_p = -1
cnt = 1
for i in p_y_sorted:
if(prev_p != i[0]):
prev_p = i[0]
cnt = 1
id = str(i[0]).zfill(6) + str(cnt).zfill(6)
li_id.append([i[2], id])
cnt += 1
li_id_sorted = sorted(li_id)
for i in li_id_sorted:
print(i[1])
|
p03548 | s177188139 | Accepted | import math
x, y, z = map(int, input().split(" "))
ans = math.floor((x - z) / (y + z))
print(ans)
|
p02795 | s945140126 | Accepted | # coding: utf-8
H = int(input())
W = int(input())
N = int(input())
cnt = 0
painted = 0
while painted < N:
if H < W:
painted += W
cnt += 1
H -= 1
else:
painted += H
cnt += 1
W -= 1
print(cnt) |
p02948 | s774383493 | Accepted | import heapq
N,M = map(int,input().split())
AB = sorted([list(map(int,input().split())) for _ in range(N)])
option = []
ans = 0
j = 0
for i in range(1,M+1):
while j != N and AB[j][0] <= i:
heapq.heappush(option,-AB[j][1])
j += 1
if len(option) != 0:
ans -= heapq.heappop(option)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.