problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03632 | s726042916 | Wrong Answer | A, B, C, D = map(int, input().split())
M1 = max(A, C)
M2 = min(B, D)
if B >= C:
print(M2 - M1)
else:
print(0)
|
p02866 | s012071225 | Wrong Answer | from collections import Counter
n = int(input())
d = list(map(int, input().split()))
dist = Counter(d)
mod = 998244353
if d[0] != 0 and dist[0] != 1:
print(0)
exit()
ans = 1
for i in range(n-1):
ans = (ans * pow(dist[i], dist[i + 1], mod)) % mod
print(ans)
|
p03997 | s743389002 | Accepted | a=int(input())
b=int(input())
c=int(input())
print(int(((a+b)*c)/2))
|
p02723 | s013512395 | Accepted | s = input()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
|
p02793 | s973288167 | Accepted | import fractions
from functools import reduce
d = 10**9+7
n = int(input())
A = list(map(int, input().split()))
def lcm(l):
return reduce(lambda x, y: (x * y) // fractions.gcd(x, y), l, 1)
base = lcm(A)
print(sum(map(lambda n: base // n, A))%d) |
p03210 | s044473492 | Accepted | print(['NO', 'YES'][int(int(input()) in [3, 5, 7])]) |
p02684 | s648288984 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
A = [i-1 for i in A]
doubling = [[0] * N for _ in range(61)]
for i in range(N):
doubling[0][i] = A[i]
for i in range(1,61):
for j in range(N):
doubling[i][j] = doubling[i-1][doubling[i-1][j]]
now = 0
i = 0
while K!=0:
if K&1==1:
no... |
p03555 | s490365573 | Wrong Answer |
c = input()
d = input()
print("YES" if c==c[::-1] and d==d[::-1] else "NO")
|
p02755 | s825970370 | Accepted | A,B = map(int,input().split())
for i in range(B*10,(B+1)*10):
if i*8//100 == A:
print(i)
exit()
print(-1)
|
p02601 | s657181222 | Accepted | a = list(map(int, input().split()))
num = int(input())
k = 0
for i in range(num): #num回２倍を繰り返す。でなければNoをprint
if a[0] == max(a) or a[1] == max(a): #リストaの中のmaxよりも青が小さいならば青を二倍する
a[2] = a[2] * 2
k += 1
elif a[1] == min(a) and k < num:
a[1] = a[1] * 2
k += 1
else:
pass
if a[0] < a[1] and a[1... |
p02697 | s657171475 | Wrong Answer | i = list(map(int, input().split()))
k=int(i[0]/2)
if i[0]%2==1:
for j in range(i[1]):
print(k-j, k+1+j)
else:
for j in range(i[1]):
print(k-j-1, k+1+j) |
p03239 | s226241711 | Accepted | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------... |
p03243 | s130639004 | Wrong Answer | n = int(input())
a = -(-n//111)
if a == 9:
print(1111)
else:
print(a*111) |
p03250 | s812865354 | Accepted | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [... |
p03210 | s092448380 | Accepted | x = input()
if x in "753":
print("YES")
else:
print("NO")
|
p03433 | s223050161 | Accepted | n = int(input())
a = int(input())
print('Yes' if ((n%500)-a)<=0 else 'No') |
p03672 | s828568859 | Accepted | s=input()
cnt=0
while(1):
if cnt>=1 and len(s)%2==0 and s[:(len(s)//2)]==s[(len(s)//2):]:
print(len(s))
break
s=s[:-1]
cnt+=1 |
p03434 | s715503191 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=sorted(a)
alice=sum(a[::2])
Bob=sum(a[1::2])
print(alice-Bob) |
p03803 | s817467092 | Accepted | a, b = map(int, input().split())
if a == 1:
a = 14
if b == 1:
b = 14
if a > b:
print('Alice')
elif a < b:
print('Bob')
else:
print('Draw')
|
p02786 | s826817143 | Accepted | def two_int():
N, K = map(int, input().split())
return N,K
def one_int():
return int(input())
def one_str():
return input()
def many_int():
return list(map(int, input().split()))
import math
H=one_int()
beki = int(math.log2(H))+1
print(2**beki -1 ) |
p02571 | s886785336 | Wrong Answer | str = input()
part = input()
flg = False
for i in range(len(part)):
for j in range(i + 1):
target = str[j: len(str) - (i - j)]
search = part[j: len(part) - (i - j)]
# print(f'target {target}, search {search}')
if search in target:
print(i)
flg = True
break
if flg:
break
i... |
p03910 | s928028897 | Accepted | n = int(input())
x = 0
ans = []
for i in range(1,10000000):
x += i
ans.append(i)
if x >= n:
break
if x != n:
ans.remove(x-n)
for i in ans:
print(i) |
p02577 | s246738604 | Wrong Answer | print("Yws"if int(input())%9==0 else"No") |
p03073 | s779063650 | Wrong Answer | import collections
s = input()
c1 = s.count("1")
c0 = s.count("0")
print(min(c1,c0)) |
p03043 | s547301973 | Accepted | N, K = map(int, input().split())
import math
ans = 0
for n in range(1, N+1):
continue_num = max(math.ceil(math.log(K, 2) - math.log(n, 2)), 0)
ans += (1/N) * (1/2)**continue_num
print(ans) |
p03986 | s765822570 | Wrong Answer | s=input() ; n=len(s)
for i in range(100):
s=s.replace("ST","")
print(len(s)) |
p02957 | s431028341 | Wrong Answer | a,b=map(int,input().split())
print((a+b)/2 if (a+b)%2==0 else "IMPOSSIBLE") |
p03286 | s186968630 | Accepted | N = int(input())
if N == 0:
print(0)
exit()
ans = []
while N:
ans.append(N % 2)
N = N // 2
N *= -1
print("".join(map(str, ans[::-1]))) |
p03469 | s646422274 | Accepted | s = input()
print('2018'+s[4:]) |
p02811 | s643438587 | Accepted | k, x = map(int, input().split())
if 500 * k >= x:
print('Yes')
else:
print('No')
|
p04033 | s547547209 | Accepted | a,b = map(int,input().split())
if a>0:
print('Positive')
elif b<0:
if (a-b+1)%2==0:
print('Positive')
else:
print('Negative')
else:
print('Zero') |
p02996 | s534725934 | Wrong Answer | n = int(input())
a = [0] * n
b = [0] * n
sa = [0] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
sa[i] = b[i] - a[i]
# so = sa.copy()
# sa.sort()
c = b.copy()
c.sort()
# print(sa)
# print(so)
# print(su)
wa = 0
for i in c:
wa += a[b.index(i)]
# print(wa, b[c.index(i)])
if wa > b[b.ind... |
p03359 | s870003145 | Wrong Answer | a,b = map(int, input().split())
print(a) if a<=b else a-1 |
p03481 | s532059847 | Wrong Answer | import math
x,y = map(int,input().split(" "))
n = int(math.log2(y)-math.log2(x))
print(n+1)
|
p02571 | s550347791 | Accepted | S=input()
T=input()
ans=0
for i in range(len(S)-len(T)+1):
temp=S[i:i+len(T)]
cnt=0
for j in range(len(T)):
if T[j]==temp[j]:
cnt+=1
else:
ans=max(ans,cnt)
print(len(T)-ans) |
p02689 | s134846210 | Accepted | import sys
input = sys.stdin.readline
def ppp(n,m,h,ab):
g = [1] * n
for l,r in ab:
if h[l-1] >= h[r-1]:
g[r-1] = 0
if h[l-1] <= h[r-1]:
g[l-1] = 0
print(sum(g))
if __name__ == "__main__":
n,m = map(int,input().split())
h = list(map(int,input().split()))
... |
p02779 | s678295703 | Accepted | """
int(input())
map(int,input().split())
list(map(int,input().split()))
"""
n=int(input())
s=list(map(int,input().split()))
if(len(s)==len(list(set(s)))):
print("YES")
else:
print("NO") |
p03417 | s273272690 | Accepted | n, m = map(int, input().split())
if n>=2 and m>=2:
print(n*m - (n-2)*2 - (m-2)*2 - 4)
elif n==1 and m==1:
print(1)
elif n==1 and m>=2:
print(m-2)
else:
print(n-2) |
p02681 | s518081172 | Wrong Answer | s =input()
t = list(input())
t.remove(t[-1])
t= ''.join(t)
if s == t:
print('Yes')
else:
print('No')
|
p03548 | s763226229 | Wrong Answer | x,y,z = map(int,input().split())
print((x-1)//(y+z)) |
p03086 | s238564695 | Wrong Answer | S = input()
ACGT = ['A', 'C', 'G', 'T']
count_list = [0]
count = 0
max_count = 0
for s in S:
if s in ACGT:
count += 1
else:
count_list.append(count)
# max_count = max(max_count, count)
count = 0
print(max(count_list)) |
p02917 | s019588392 | Accepted | n =int(input())
b = list(map(int, input().split()))
a = [b[0]]
for i in range(1,n-1):
a.append(min(b[i-1],b[i]))
a.append(b[-1])
print(sum(a)) |
p03146 | s212683658 | Accepted | S = int(input())
S_lst = [S]
for i in range(10**5):
if S_lst[i] % 2 == 0:
S_lst.append(S_lst[i] / 2)
else:
S_lst.append(3 * S_lst[i] + 1)
if S_lst[i+1] in S_lst[:-1]:
print(i+2)
break |
p02832 | s259946881 | Wrong Answer | # coding: utf-8
N = int(input())
a = list(map(int, input().split()))
num = 1
while len(a) >= 1:
if num in a:
a = a[a.index(num) +1 :]
num += 1
else:
print(-1)
exit()
else:
print(N - num + 1) |
p03037 | s250664006 | Accepted | n, m, *lr = list(map(int, open(0).read().split()))
print(max(0, min(lr[1::2]) - max(lr[::2]) + 1))
|
p03137 | s626831590 | Accepted | n, m = map(int, input().split())
x = [int(i) for i in input().split()]
x.sort()
dif = []
for i in range(1,len(x)):
dif.append(x[i] - x[i-1])
dif.sort()
dif.reverse()
print(sum(dif[n-1:])) |
p02948 | s281769111 | Accepted | from heapq import heapify, heappop, heappush
N,M = map(int, input().split())
AB = []
for i in range(N):
a,b = map(int, input().split())
if a<=M:
AB.append((a,-b))
else:
N-=1
AB.sort()
Q = []
heapify(Q)
ans = 0
i = 0
for day in range(M):
while i<N and AB[i][0] == day+1:
heappush... |
p02613 | s876033836 | Wrong Answer | data = {'AC':0,'WA':0,'TLE':0,'RE':0}
N = int(input())
for i in range(N):
inputSTR = input()
data[inputSTR] = data[inputSTR] + 1
for key,value in data.items():
print(key + ' × ' + str(value))
|
p03262 | s072341166 | Wrong Answer | from fractions import gcd
N, X = map(int, input().split())
Xs = [int(i) for i in input().split()]
Xs.append(X)
dist = sorted(Xs)
i = dist[0]
# gcdは２数の最大公約数しか求めることができない。gcd(手前の２数の最大公約数,距離の値)とすれば全ての距離の最大公倍数が求められる。
for j in range(1, len(dist)):
i = gcd(i, j)
print(i) |
p02833 | s264450785 | Accepted | N = int(input())
ans = 0
if N % 2 == 1:
pass
else:
two = 0
five = 0
tmp = 2
while tmp <= N:
two += N // tmp
tmp *= 2
tmp = 10
while tmp <= N:
five += N // tmp
tmp *= 5
ans = min(two, five)
print(ans) |
p03854 | s988935369 | Accepted | S = input()
dp = [0] * (len(S) + 1)
dp[0] = 1
words = ["dream", "dreamer", "erase", "eraser"]
done = 'NO'
for i in range(len(S)):
if dp[i] == 0:
continue
for w in words:
if S[i:i+len(w)] == w:
dp[i+len(w)] = 1
if dp[len(S)] == 1:
done = 'YES'
break
print(d... |
p03617 | s912320471 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
q, h, s, d = map(int, readline().split())
n = int(readline())
ans = min(8 * q, 4 * h, 2 * s, d) * (n // 2) + min(4 * q, 2 * h, s) * (n % 2)
print(ans)
if __name__ == '__main__':
... |
p03264 | s867406806 | Accepted | k = int(input())
n = k // 2
if k % 2 == 0:
print(n**2)
if k % 2 == 1:
o = n + 1
print(o*n) |
p02683 | s702486234 | Wrong Answer | import itertools
import numpy as np
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
l = np.array(l)
ans = np.sum(l, 0)[0]
ans_s = np.sum(l, 0)
if np.any(ans_s[1:] < x):
print(-1)
exit()
for i in range(1, m + 1):
for j in itertools.combinations(l, i):
tot =... |
p03605 | s838387732 | Accepted | s = input()
if s[0] == '9' or s[1] == '9':
print('Yes')
else:
print('No') |
p03035 | s897542168 | Accepted | a, b = map(int,input().split())
if a < 6:
b = 0
elif a < 13:
b //= 2
print(b) |
p02796 | s396415723 | Accepted | rs = [(x - l, x + l) for x, l in (map(int, input().split()) for _ in range(int(input())))]
rs.sort(key=lambda x: x[1])
last = - 10 ** 9
ans = 0
for l, r in rs:
if last <= l:
ans += 1
last = r
print(ans) |
p02576 | s569684843 | Wrong Answer | N, X, T = list(map(int, input().split()))
ans = ((N // X) + int(N % X) ) * T
print(ans) |
p02983 | s176042814 | Accepted | l, r = map(int, input().split())
a = []
if r - l > 2019:
for i in range(l, l + 2019):
for j in range(i + 1, min(r + 1, l + 2020)):
a.append((i * j) % 2019)
else:
for i in range(l, r):
for j in range(i + 1, r + 1):
a.append((i * j) % 2019)
ans = min(a)
print(ans) |
p02548 | s730056424 | Accepted | n = int(input())
dp = [1]*(n)
dp[0] = 0
for i in range(2, n):
for j in range(i, n, i):
dp[j] += 1
print(sum(dp)) |
p03479 | s805048133 | Wrong Answer | a,b = map(int,input().split())
print(b//a) |
p03103 | s548647857 | Accepted | # C - Energy Drink cntlector
import heapq
N, M = map(int, input().split())
AB = []
for i in range(N):
heapq.heappush(AB, list(map(int, input().split())))
cnt = 0
ans = 0
for i in range(N):
price, bottles = heapq.heappop(AB)
cnt = min(M, bottles)
M -= cnt
ans += price * cnt
if M==0:
bre... |
p02659 | s393444714 | Accepted | a,b=map(int,input().replace(".","").split())
print(a*b//100)
|
p03160 | s319390939 | Accepted | n = int(input())
lst = list(map(int, input().split()))
cst = [float('inf')] * n
cst[0] = 0
for _ in range(0, n-2):
cst[_+1] = min(cst[_] + abs(lst[_+1] - lst[_]),cst[_+1])
cst[_+2] = min(cst[_] + abs(lst[_+2] - lst[_]),cst[_+2])
cst[n-1] = min(cst[n-2] + abs(lst[n-1] - lst[n-2]),cst[n-1])
print(cst[n-1]) |
p03345 | s181027303 | Accepted | a,b,c,k=map(int,input().split())
if k%2==0:
print(a-b)
else:
print(b-a)
|
p03380 | s926099583 | Wrong Answer | from bisect import bisect_left
N = int(input())
A = list(map(int,input().split()))
A.sort()
n = A.pop()
index = bisect_left(A, n//2+1)
if index == 0:
r = A[0]
elif index == N-1:
r = A[N-2]
else:
if abs(n//2+1-A[index]) <= abs(n//2+1-A[index-1]):
r = A[index]
else:
r = A[index - 1]
print(... |
p03795 | s290313655 | Accepted | # １食８００円をN食食べた
N = int( input() )
x = int( 800 * N )
# １５食食べるごとに２００円もらえる
y = N // 15 * 200
print( x - y ) |
p02880 | s245178036 | Accepted | import sys
N = int(input())
for i in range(1,10):
for j in range(1,10):
if i*j == N:
print("Yes")
sys.exit()
print("No") |
p03627 | s093612480 | Accepted | from collections import Counter
n=int(input())
a=Counter(list(map(int,input().split())))
x=[0,0]
for i in a.keys():
if a[i]>1:
x.append(i)
if a[i]>3:
x.append(i)
x.sort()
print(x[-1]*x[-2]) |
p03069 | s621062104 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
S = input()[:-1]
acc = [0]
for Si in S:
if Si=='#':
acc.append(acc[-1]+1)
else:
acc.append(acc[-1])
ans = 10**18
for i in range(N+1):
ans = min(ans, acc[i]+N-i-(acc[N]-acc[i]))
print(ans) |
p02973 | s222820663 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
import bisect
from collections import deque
lis = deque()
for i in range(n):
ind = bisect.bisect_left(lis,a[i])
if ind==0:
lis.appendleft(a[i])
else:
lis[ind-1... |
p02594 | s140731681 | Accepted | # coding: utf-8
# Your code here!
temp = int(input())
if temp >= 30 :
print("Yes")
else :
print("No") |
p02847 | s482284857 | Accepted | n = str(input())
list = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
x = 7
for item in list:
if(n == item):
print(x)
x -= 1 |
p03285 | s710517003 | Accepted | n = int(input())
aru = 0
for i in range(25):
for j in range(14):
if i*4 + j*7 == n:
aru = 1
if aru == 1:
print('Yes')
else:
print('No') |
p02744 | s195309811 | Wrong Answer | num = int(input())
base = ["a","b","c","d","e","f","g","h","j","k"]
if num == 1:
print("a")
elif num == 2:
print("aa")
print("ab")
elif num == 3:
print("aaa")
print("aab")
print("aba")
print("abb")
print("abc")
|
p03281 | s830170857 | Wrong Answer | n = int(input())
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8:
print(1)
else:
print(0)
|
p03633 | s231338671 | Accepted | import sys
n = int(input())
t_ls = []
for i in range(n):
t_ls.append(int(sys.stdin.readline().strip()))
def gcd(a, b):
while a and b:
if a < b:
b %= a
else:
a %= b
return max(a, b)
def scm(a, b):
_gcd = gcd(a, b)
return a * b // _gcd
res = 1
for t in t_ls:
... |
p02747 | s936420177 | Accepted | import math
text = input()
if text == "hi" or text == "hihi" or text == "hihihi" or text == "hihihihi" or text == "hihihihihi":
print("Yes")
else:
print("No")
|
p02767 | s171909438 | Accepted | n = int(input())
x = list(map(int, input().split()))
ans = 10 ** 9
x_min = min(x)
x_max = max(x)
for i in range(x_min, x_max+1):
tmp = sum([(i-j)*(i-j) for j in x])
if ans > tmp:
ans = tmp
print(ans)
|
p02576 | s361913894 | Accepted | N, X, T = map(int,input().split())
if N % X == 0:
print((N//X)*T)
else:
print((N//X+1)*T) |
p03696 | s938175597 | Wrong Answer | n=int(input())
s=input()
l=[]
for i in s:
if i==')':
if len(l)>0:
if l[-1]=='(':
l.pop()
else:
l.append(i)
else:
l.append(i)
print(len(l)*'(' + s) |
p02753 | s991794755 | Accepted | s = input()
if len(list(set(s))) == 2:
print('Yes')
else:
print('No') |
p03474 | s778366110 | Accepted | a, b = map(int, input().split())
s = input()
def is_int(s):
try:
int(s)
return True
except ValueError:
return False
if is_int(s[0:a]) and is_int(s[a+1:a+b+2]) and s[a] == "-":
print("Yes")
else:
print("No")
|
p03067 | s943733171 | Wrong Answer | a,b,c=map(int,input().split())
if c<=b and a<=c:
print("Yes")
else:
print("No") |
p03814 | s573290555 | Accepted | s = list(input())
count = 0
for i in s:
if (i == 'A'):
break
count += 1
for i in s[::-1]:
if (i == 'Z'):
break
count += 1
print(len(s) - count) |
p04020 | s129415547 | Wrong Answer | N, *A = map(int, open(0).read().split())
ans = sum(c//2 for c in A)
A = [c%2 for c in A]
for i in range(N-2):
if A[i]==A[i+1]==1:
A[i+1] = 0
ans += 1
print(ans) |
p02577 | s014992897 | Accepted | N = input()
a = 0
for s in N:
a+=(int(s)%9)
if a%9==0:
print('Yes')
else:
print('No') |
p03309 | s309903804 | Wrong Answer | sousuu = int(input())
listnum = list(map(int, input().split()))
posinum = sousuu // 2 if sousuu % 2 == 0 else sousuu // 2 + 1
posival = sum(listnum) // len(listnum)
dst = 99999
for p in range(posinum - 3, posinum + 3):
_dst = 0
for i, s in enumerate(range(p - sousuu//2, p - sousuu//2 + sousuu)):
_dst +=... |
p02873 | s323463950 | Accepted | S = input()
ans = [0 for i in range(len(S) + 1)]
for i in range(len(S)):
if "<" == S[i]:
ans[i + 1] = ans[i] + 1
for i in range(len(S) - 1, -1, -1):
if ">" == S[i]:
ans[i] = max(ans[i], ans[i + 1] + 1)
print(sum(ans))
|
p02660 | s692409545 | Accepted | n = int(input())
cnt=0
factor=[]
for i in range(2, int(n**.5)+1):
j=1
while n%i==0:
n//=i
factor.append(i)
if n>1:
cnt+=1
# 1->1, 3->2, 6->3, 10->4 ...を返す
def f(x):
i=1
cnt=0
while x>=i:
x-=i
i+=1
cnt+=1
return cnt
from itertools import groupby
for k,v ... |
p03797 | s846818540 | Wrong Answer | N,M=map(int,input().split())
if N>=2*M:
print(M//2)
else:
answer=0
k=(M-2*N)//4
N+=k
M-=2*k
#print(k,N,M)
print(N) |
p03730 | s299967916 | Accepted | A,B,C = map(int,input().split())
flag = False
for i in range(B):
tmp = i*A%B
if tmp == C:
flag = True
if flag:
print("YES")
else:
print("NO")
|
p03817 | s999594726 | Accepted | n=int(input())
if n<7:
print(1);exit()
print(n//11*2+(n%11>0)+(n%11>6)) |
p02946 | s042763384 | Wrong Answer | a,b = map(int, input().split())
for i in (b-(a-1),b+(a-1)+1):
print(i,' ',end='') |
p03796 | s159919816 | Accepted | import sys
N = int(sys.stdin.readline())
ans = 1
MOD = 10 ** 9 + 7
for i in range(1, N + 1):
ans = ans * i % MOD
print(ans) |
p03625 | s797633600 | Wrong Answer | n=int(input())
a = list(map(int,input().split()))
b = list(set(a))
b.sort(reverse=True)
b_dict={}
for i in b:
b_dict[i]=a.count(i)
h_max=0
for i in b:
if b_dict[i]>=4:
print(i**2)
exit()
elif b_dict[i]>=2:
if h_max==0:
h_max=i
else:
print(h_max*i)
exit()
print(0)
|
p02577 | s822864524 | Accepted | N = int(input())
if(N%9 == 0):
print("Yes")
else:
print("No") |
p03836 | s427734846 | Wrong Answer | sx, sy, tx, ty = map(int, input().split())
ans = ""
gx, gy = (tx - sx, ty - sy)
# go
ans += "R" * gx + "U" * gy
ans += "R" + "D" * (gy + 1) + "L" * (gx + 1) + "U"
# return
ans += "U" * gx + "R" * gy
ans += "U" + "L" * (gx + 1) + "D" * (gy + 1) + "R"
print(ans)
|
p02948 | s876669785 | Wrong Answer | def main():
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from heapq import heappush, heappop
N, M = map(int, input().split())
AB = [ [] for _ in range(100000) ]
for _ in range(N):
a, b = map(int, input().split())
AB[a-1].append(-b)
ans = 0
hea... |
p03037 | s266185512 | Wrong Answer | N, M = map(int, input().split())
L = list(list(map(int,input().split())) for i in range(M))
l = 0
r = N
for i in range(M):
l = max(l,L[i][0])
r = min(r,L[i][1])
print(l-r+1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.