problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03210 | s302798245 | Wrong Answer | a=int(input())
print('Yes' if a=='5' or a=='3' or a=='7' else 'No') |
p02935 | s370170980 | Accepted | n=int(input())
v = [int(_) for _ in input().split()]
v.sort()
for i in range(n - 1):
v[i+1] = (v[i] + v[i + 1]) / 2
print(v[-1]) |
p03449 | s815388471 | Wrong Answer | N = int(input())
A1 =list(map(int, input().split()))
A2 =list(map(int, input().split()))
candy = []
def sum_A1(x):
cnt = 0
for i in range(x):
cnt += A1[i]
return cnt
def sum_A2(x):
cnt = 0
for i in range(x-1,N):
cnt += A2[i]
return cnt
for i in range(N):
candy.append(sum_A1(i) + sum_A2(i))
... |
p03359 | s863201668 | Accepted | a, b = map(int, input().split())
if a > b:
print(a-1)
else:
print(a) |
p03285 | s153145318 | Wrong Answer | #105_B
N=int(input())
flg=False
for i in range(0,N//7+1):
x=N
x=x-7*i
if N%4==0:
flg=True
break
print('Yes' if flg else 'No') |
p02987 | s017088356 | Accepted | S=list(input())
S.sort()
if S[0]==S[1] and S[1]!=S[2] and S[2]==S[3]:
print("Yes")
else:
print("No")
|
p03556 | s904382474 | Accepted | import math
n=int(input())
print(int(math.sqrt(n))**2) |
p02778 | s512914847 | Wrong Answer | S = [input()]
# 問題文の通りに実装する
n = len(S)
for i in range(n):
S[i] = 'x'
ans = ''
for i in range(n):
ans += S[i] |
p03479 | s192923486 | Accepted | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import collections
x,y = map(int,input().split())
cnt = 0
while True:
a = x*2**cnt
if a>y:
break
cnt+=1
print(cnt) |
p03241 | s928114257 | Accepted | def make_divisors(n):
divisors=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
divisors.append(i)
if i!=n//i:
divisors.append(n//i)
divisors.sort()
return divisors
N,M=map(int,input().split())
divisors=make_divisors(M)
ans=0
for d in divisors:
if N*d<=... |
p02860 | s005113580 | Wrong Answer | import math
N = int(input())
S = str(input())
if N == 1:
print('No')
exit()
n = math.floor(N/2)
j = True
for i in range(n):
if S[i] != S[i + n]:
j = False
if j:
print('Yes')
else:
print('No')
|
p03795 | s742425271 | Accepted | #a,b=map(int,input().split())
n=int(input())
#s=input()
if n<15:
print(n*800)
else:
print(n*800-(n//15)*200) |
p03644 | s330259908 | Accepted |
def actual(N):
max_count = 0
max_number = 1
for i in range(1, N + 1):
num = i
count = 0
while num % 2 == 0:
num = num // 2
count += 1
if count >= max_count:
max_number = i
max_count = count
return max_number
N = int... |
p03795 | s686894049 | Accepted | N = int(input())
back = 0
x = 800 * N
y = N // 15 * 200
back = x - y
print(back) |
p03103 | s548514328 | Wrong Answer | n, m = map(int, input().split())
C = {}
ans = 0
for _ in range(n):
a, b = map(int, input().split())
C[a] = b
for k, v in sorted(C.items()):
if m > v:
ans += k*v
m -= v
else:
ans += k*m
print(ans)
exit() |
p02615 | s920334319 | Accepted | n = int(input())-2
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = A[0]
for i in range(n//2):
ans += 2*A[i+1]
if n%2 != 0:
ans += A[n//2+1]
print(ans) |
p02818 | s404685600 | Wrong Answer | A,B,K = map(int , input().split())
if A > K:
A = A - K
else:
B = B + A - K
A = 0
print(str(A) + ' ' + str(B)) |
p03243 | s715928453 | Accepted | n = int(input())
if n%111==0: print(n)
else: print(n+111-(n%111)) |
p03035 | s723957758 | Accepted | A,B = map(int,input().split())
if A>=13:
print(B)
elif A>=6:
print(B//2)
else:
print(0) |
p03319 | s746733906 | Wrong Answer | import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
l = a.index(1)
r = n - l - 1
if n == k:
print(1)
else:
print(math.ceil(l / (k - 1)) + math.ceil(r / (k - 1)))
|
p03327 | s476581240 | Wrong Answer | if int(input())<999:
print('ABC')
else:
print('ABD') |
p02790 | s252356434 | Accepted | a, b = map(int, input().split())
print(str(min(a, b)) * max(a, b))
|
p03433 | s933858990 | Accepted | n = int(input())
a = int(input())
m = n % 500
if m <= a:
print('Yes')
else:
print('No')
|
p03804 | s948142493 | Wrong Answer | import numpy as np
N, M = map(int, input().split())
As = np.array([["." for n in range(N)] for nn in range(N)])
for n in range(N):
As[n,:] = np.array(list(input()))
Bs = np.array([["." for n in range(M)] for nn in range(M)])
for m in range(M):
Bs[m,:] = np.array(list(input()))
ok = False
for i in range(N-M)... |
p02866 | s055514850 | Accepted |
from collections import Counter
N = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
print(0)
exit()
MOD = 998244353
c = Counter(D)
if c[0] != 1:
print(0)
exit()
key = list(c.keys())
key.sort()
ans = 1
for k in key:
if k >= 1:
if k-1 not in c:
print(0)
... |
p02690 | s949929376 | Wrong Answer | X = int(input())
go = [i**5 for i in range(1000)]
def foo():
for i in range(1000):
for j in range(i, 1000):
if go[i] - go[j] == X:
return i, j
for j in range(1000):
if go[i] + go[j] == X:
return i, -j
return 0, 0
A, B = foo()
print(A,... |
p02842 | s449368356 | Accepted | # B - Tax Rate
from math import ceil, floor
def main():
N = int(input())
x = ceil(N / 1.08)
is_possible = floor(x * 1.08) == N
print(x if is_possible else ":(")
if __name__ == "__main__":
main()
|
p03836 | s226839519 | Accepted | def addRoute(i, c):
t = ''
for _ in range(i):
t += c
return t
pos=list(map(int, input().split()))
ud = pos[3] - pos[1]
rl = pos[2] - pos[0]
s = ''
s += addRoute(ud, 'U')
s += addRoute(rl, 'R')
s += addRoute(ud, 'D')
s += addRoute(rl, 'L')
s += 'L'
s += addRoute(ud+1, 'U')
s += addRoute(rl+1, 'R')
s += 'DR'
... |
p03723 | s324064148 | Accepted | A, B, C = [int(i) for i in input().split()]
t, a, s = [A, B, C]
ans = 0
while A % 2 == 0 and B % 2 == 0 and C % 2 == 0:
if A == B == C:
ans = -1
break
t = B / 2 + C / 2
a = A / 2 + C / 2
s = A / 2 + B / 2
A = t
B = a
C = s
ans += 1
print(ans) |
p03524 | s016455548 | Accepted | s = input()
char = [0, 0, 0]
for i in range(len(s)):
if s[i] == "a":
char[0] += 1
elif s[i] == "b":
char[1] += 1
else:
char[2] += 1
char.sort()
char[2] -= char[0]
char[1] -= char[0]
char[0] = 0
if char[1]<=1 and char[2]<=1:
print("YES")
else:
print("NO") |
p04019 | s300918676 | Accepted | s=input()
if (('W' in s)+('E' in s))%2:
print('No')
elif (('N' in s)+('S' in s))%2:
print('No')
else:
print('Yes') |
p03386 | s887698761 | Wrong Answer | data = input().split()
a,b,c = int(data[0]), int(data[1]), int(data[2])
for i in range (a, a + c):
if (i < a + c or i > b - c):
print(i)
for i in range (max(a + c + 1, b - c + 1), b + 1):
if (i < a + c or i > b - c):
print(i)
|
p02916 | s456067479 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(n):
if i > 0 and a[i] == a[i-1]+1:
print(i)
print(a[i], a[i-1]+1)
ans += c[a[i-1]-1]
ans += sum(b)
print(ans) |
p02835 | s754736554 | Wrong Answer | data = input().split()
a = int(data[0])
b = int(data[1])
c = int(data[2])
if a + b + c == 21:
print("win")
else:
print("bust")
|
p02909 | s830769269 | Accepted | s = input()
if s == "Sunny":
print("Cloudy")
elif s == "Cloudy":
print("Rainy")
else:
print("Sunny") |
p02576 | s018814811 | Accepted | import math
n,x,t = map(int, input().split())
ans = math.ceil(n/x) * t
print(ans) |
p03250 | s571943115 | Accepted | abc = list(map(int, input().split()))
abc.sort()
print(abc[2] * 10 + abc[0] + abc[1])
|
p03474 | s414975707 | Accepted | A, B = map(int, input().split())
S = input()
try:
int(S[:A]+S[A+1:])
try:
int(S)
print("No")
except:
print("Yes")
except:
print("No") |
p02811 | s760757884 | Accepted | K, X = map(int, input().split())
if 500*K >= X:
print("Yes")
else:
print("No") |
p03705 | s311636768 | Accepted | n,a,b = map(int,input().split())
print((b-a)*(n-2)+1 if (b-a)*(n-2)+1 >= 0 else 0) |
p02952 | s108682995 | Wrong Answer | N=list(input())
ans=0
for i in range(len(N)):
if i==len(N)-1:
if len(N)%2==1:
s=""
for num in N:
s=s+num
s=int(s)-10**i
if len(N)>=2:
s+=1
ans+=s
else:
if i%2==0:
ans+=10**(i+1)-10**i
print(an... |
p03109 | s323778523 | Accepted | S = input()
if S[5] == "1":
print("TBD")
elif int(S[6]) > 4:
print("TBD")
else:
print("Heisei")
|
p02838 | s850800761 | Accepted | import sys
input = sys.stdin.readline
N=int(input().rstrip('\n'))
A=[int(x) for x in input().rstrip('\n').split()]
res = 0
t=1
for _ in range(60):
n = sum(x%2 for x in A)
A = [x//2 for x in A]
res += n*(N-n)*t
t = t*2
res = res%(7+10**9)
if all(x==0 for x in A):
break
print(res) |
p03944 | s634810428 | Accepted | w,h,n = map(int, input().split())
wl=0
hb=0
for i in range(n):
x,y,a = map(int, input().split())
if a==1:
if x>wl:
wl=x
if a==2:
if x<w:
w=x
if a==3:
if y>hb:
hb=y
if a==4:
if y<h:
h=y
if h>=hb and w>=wl:
ans=(h-hb)*... |
p03745 | s574893146 | Wrong Answer | import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
v = A[1:] - A[:-1]
# print(v)
cnt = 0
i = 0
while i < len(v) - 1:
# print('i', i)
if v[i] * v[i + 1] < 0:
cnt += 1
i += 1
i += 1
ans = cnt + 1
print(ans)
# 単調非減少 : v[i + 1] - v[i] >= 0
# 単調非増加 : v[i + 1] - v... |
p02546 | s603605237 | Wrong Answer | S=input()
if S[-1:]=="s":
print("S"+"es")
else:
print("S"+"s") |
p03386 | s274043424 | Accepted | a,b,k = map(int,input().split())
for i in range(k):
if a+i <= b:
print(a+i)
for i in range(k)[::-1]:
if a+k <= b-i:
print(b-i) |
p02663 | s286811461 | Wrong Answer | H1, M1, H2, M2, K = map(int, input().split())
A=60*H2+M1 - K
print(A-60*H1-M1) |
p03475 | s220688256 | Wrong Answer | N = int(input())
CC = [0] * (N-1)
SS = [0] * (N-1)
FF = [0] * (N-1)
for i in range(N-1):
C, S, F = map(int,input().split())
CC[i] = C
FF[i] = F
SS[i] = S
for i in range(N-1):
T = 0
Max = 0
for k in range(i,N-1):
Max = max(T, SS[k])
U = Max % FF[k]
T = Max - U + FF[k... |
p03438 | s970610092 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort(), b.sort()
tmp = sum(b) - sum(a)
if tmp < 0:
print('No')
exit()
total = 0
for i in range(N):
if a[i] <= b[i]:
total += b[i] - a[i]
if tmp == total:
print('Yes')
else:
print('No') |
p03862 | s433326341 | Wrong Answer | n,k = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
if n==2:
print(A[0]+A[1]-k)
exit()
for i in range(1, n):
if A[i]+A[i-1]<=k:
continue
ans += (A[i]+A[i-1])-k
A[i] = k-A[i-1]
print(ans) |
p03385 | s402439238 | Wrong Answer | char = input()
if char in "a" and "b" and "c":
print("Yes")
else:
print("No") |
p02597 | s911310529 | Accepted | N = int(input())
C = input()
nw = C.count('W')
nr = N - nw
if nw == N or nr == N:
print(0)
else:
a = C[:nr]
b = C[nr:]
nw = a.count('W')
nr = b.count('R')
n = min(nw, nr)
m = max(nw, nr) - n
print(n + m) |
p02601 | s853884378 | Accepted | k = 0
A,B,C = map(int,input().split( ))
K = int(input())
while (B <= A) and (k < K):
B *= 2
k += 1
while (C <= B) and (k < K):
C *= 2
k += 1
if A < B < C:
print('Yes')
else:
print('No') |
p02771 | s380703378 | Accepted | if __name__ == '__main__':
a,b,c = map(int, input().split())
l = [b,c]
if a in l:
if b == c:
print('No')
else:
print('Yes')
else:
if b == c:
print('Yes')
else:
print('No') |
p02775 | s210070885 | Accepted | N = [int(_) for _ in list(input())]
a, b = 0, 1
for n in N:
a, b = min(a+n, b+10-n), min(a+(n+1), b+10-(n+1))
print(a)
|
p03645 | s691856379 | Accepted | N,M = map(int,input().split())
x = [False for i in range(N+1)]
y = [False for i in range(N+1)]
for i in range(M):
a,b = map(int,input().split())
a,b = min(a,b), max(a,b)
if a == 1:
x[b] = True
if b == N:
y[a] = True
ans = 'IMPOSSIBLE'
for i in range(N+1):
if x[i] and y[i]:
... |
p02813 | s221736914 | Accepted | from itertools import permutations
n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
cnt_p = 1
for case in permutations(range(1, n+1)):
if p == list(case):
p_n = cnt_p
cnt_p += 1
cnt_q = 1
for case in permutations(range(1, n+1)):
if q == list(case):
... |
p03910 | s253521857 | Accepted | N = int(input())
left = 0
right = 10 ** 7 + 1
while right - left > 1:
mid = (left + right) // 2
if mid * (mid + 1) // 2 < N:
left = mid
else:
right = mid
ans = {i for i in range(1, right + 1)}
rem = N - right
except_n = right * (right - 1) // 2 - N + right
ans -= {except_n}
[print(i) for i i... |
p02639 | s142028235 | Accepted | import sys
x = input().split()
for i in range(len(x)):
if x[i] == '0':
print(i + 1)
break |
p02917 | s778636321 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
B = list(map(int, input().split()))
C = [None] * N
C[0] = B[0]
C[-1] = B[-1]
for i in range(1, N - 1):
C[i] = min(B[i - 1], B[i])
print(sum(C)) |
p02817 | s008562750 | Wrong Answer | S,T =input().split()
print("T"+"S") |
p02731 | s540103707 | Accepted | def maxvolume( s ):
# finding length
length = (s / 3)
s -= length
# finding breadth
breadth = s / 2
# finding height
height = s - breadth
return (length * breadth * height)
l=int(input())
print(maxvolume(l)) |
p03331 | s315743739 | Wrong Answer |
n=int(input())
def digitSum(n):
s = str(n)
array = list(map(int, list(s)))
return sum(array)
min=9999999
#b= n-a
for a in range(0,n):
b=n-a
sum_a=digitSum(a)
sum_b=digitSum(b)
sum_ab=int(sum_a)+int(sum_b)
if sum_ab < min:
min=sum_ab
print(min)
|
p03457 | s730313200 | Wrong Answer | n = int(input())
now = [0, 0]
time = 0
for i in range(n):
array = list(map(int, input().split()))
dist = abs(now[0] - array[1]) + abs(now[1] - array[2])
time_diff = array[0] - time
if time_diff < dist:
print('No')
exit()
else:
if dist%2 == time_diff%2:
continue
... |
p02646 | s707309590 | Accepted | import sys
input = sys.stdin.readline
def main():
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A <= B:
r = (B+ W*T) - (A + V*T)
if r <= 0:
print("YES")
else:
print("NO")
else:
r = (B- W*T)-(A - V*T)
... |
p02546 | s674624575 | Accepted | s = str(input())
if s[-1]=='s':
print(s+'es')
else:
print(s+'s')
|
p02729 | s988968507 | Accepted | #ABC159A
import sys
n, m = map(int, sys.stdin.readline().split())
#print(n, m)
print(n*(n-1)//2 + m*(m-1)//2) #偶偶or 奇奇
|
p02761 | s569300855 | Accepted | n, m = map(int, input().split())
s = [0]*m
c = [0]*m
for i in range(m):
s[i], c[i] = map(int, input().split())
ans = -1
for num in range(0, 1000):
num_car = str(num)
con1 = len(num_car) == n
con2 = True
for i in range(m):
if con1 and num_car[s[i] - 1] != str(c[i]):
con2 = Fal... |
p02630 | s977894024 | Accepted | def main():
n = int(input())
a = list(map(int, input().split()))
s = [0 for i in range(10**5+1)]
sa = sum(a)
for i in a:
s[i] += 1
q = int(input())
for _ in range(q):
b, c = map(int, input().split())
s[c] += s[b]
sa += (c-b)*s[b]
s[b] = 0
print... |
p02829 | s782390844 | Accepted | result = [1,2,3]
first_input = int(input())
second_input = int(input())
result.remove(first_input)
result.remove(second_input)
print(result[0])
|
p02918 | s894813665 | Accepted | def main():
N, K = map(int, input().split())
S = input()
S = 'R' + S + 'L'
a = S[0]
b = S[1]
s = 0
for c in S[2:]:
if c == 'R' and b == 'R':
s += 1
if b == 'L' and a == 'L':
s += 1
a = b
b = c
print(min(N-1, s + 2 * K))
main()
|
p02630 | s568887654 | Accepted | n = int(input())
b_list = list(map(int, input().split()))
q = int(input())
a_list=[0]*100000
for i in b_list :
a_list[i-1]+=1
count=sum(b_list)
for i in range(q):
b, c = map(int, input().split())
count+=(c-b)*a_list[b-1]
print(count)
a_list[c - 1] +=a_list[b-1]
a_list[b - 1] = 0 |
p02947 | s777280657 | Accepted | # -*- coding: utf-8 -*-
from collections import defaultdict
from scipy.special import comb
n = int(input())
d = defaultdict(int)
for _ in range(n):
d[''.join(sorted((list(input()))))] += 1
print(sum([comb(i, 2, exact=True) for i in d.values()]))
|
p03095 | s417017064 | Wrong Answer | N = int(input())
S = list(input())
al = [chr(ord("a") + i ) for i in range(26)]
cntAl = [ S.count(chr(ord("a") + i )) for i in range(26)]
ans = 1
for a in cntAl:
if a != 0:ans *= (a+1)
print(ans-1) |
p03723 | s781207186 | Accepted | a, b, c = map(int, input().split())
if a % 2 != 0 or b % 2 != 0 or c % 2 != 0:
print(0)
exit()
if a == b == c:
print(-1)
exit()
cnt = 0
while (a % 2 == 0 and b % 2 == 0 and c % 2 == 0):
a, b, c = (b+c)//2, (a+c)//2, (a+b)//2
cnt += 1
print(cnt) |
p04045 | s713118313 | Accepted | N,K = map(int,(input().split()))
D = list(map(int,(input().split())))
for i in range(N,100000):
for j in D:
if str(j) in str(i):
break
else:
print(i)
break |
p02880 | s569161554 | Wrong Answer | n = int(input())
k = 0
for i in range(1, 10):
for j in range(i, 10):
seki = i * j
if n == seki:
print("Yes")
k += 82
else:
k += -1
if k < -1:
print("No") |
p03723 | s437619390 | Accepted | a = list(map(int,input().split()))
cna = cnb = 0
a.sort()
x = a[2]-a[1]
y = a[1]-a[0]
if a[0]*a[1]*a[2]%2 != 0:
print(0)
exit()
while True:
if x%2 == 0 and x != 0:
cna += 1
x //= 2
else:
break
while True:
if y%2 == 0 and y != 0:
cnb += 1
y //= 2
else:
... |
p03852 | s017916862 | Accepted | c = input()
if c in "aeiou":
print("vowel")
else:
print("consonant") |
p03317 | s879130252 | Accepted | from math import ceil
N, K = map(int, input().split())
print(ceil((N - 1) / (K - 1))) |
p02756 | s415940942 | Wrong Answer | from collections import deque
d=deque(map(str,input().split()))
q=int(input())
for _ in range(q):
ss=input().split()
if ss[0]==str(1):
d.reverse()
else:
if ss[1]==str(1):
d.appendleft(ss[2])
else:
d.append(ss[2])
for j in d:
print(j,end='')
|
p03495 | s928446381 | Wrong Answer | from collections import OrderedDict
N, K =map(int, input().split())
a = list(map(int, input().split()))
p = OrderedDict()
for i in a:
if i not in p:
p[i] = 1
else:
p[i] +=1
#print(p)
p_rev = OrderedDict(
sorted(p.items(), key=lambda x: x[1])
)
#print(p_rev)
#print(len(p_rev))
count = 0
sum = 0
for i in... |
p03797 | s340819680 | Wrong Answer | def resolve():
n, m = map(int, input().split())
if m < n:
print(m // 2)
else:
t = m - (n*2)
print(n + t//4)
resolve() |
p03243 | s042806380 | Accepted | def main():
n = int(input())
print(n if n % 111 == 0 else (n // 111 + 1) * 111)
if __name__ == '__main__':
main()
|
p02972 | s197598896 | Accepted | N = int(input())
a = [0]
a.extend(list(map(int, input().split())))
b = [0 for _ in range(N+1)]
for i in reversed(range(1, N+1)):
total = 0
for j in range(i+i, N+1, i):
total ^= b[j]
b[i] = total ^ a[i]
ans_n = 0
ans_l = []
for i in range(N+1):
if b[i]:
ans_n += 1
ans_l.append(s... |
p03951 | s515845461 | Accepted | N = int(input())
s = input()
t = input()
if s == t:
print(N)
exit(0)
ans = 2*N
for k in range(1,N+1):
if s[k:] == t[:-k]:
ans = min(ans,2*N-len(s[k:]))
print(ans)
|
p02771 | s518249659 | Accepted | a=list(map(int,input().split()))
a.sort()
if (a[0]==a[1] and a[1]!=a[2]) or (a[1]==a[2] and a[1]!=a[0]):
print("Yes")
else:
print("No") |
p03719 | s761887352 | Accepted | a,b,c = map(int,input().split())
print('Yes' if a <= c <= b else 'No') |
p03699 | s230605150 | Accepted | # C - Bugged
# https://atcoder.jp/contests/abc063/tasks/arc075_a
n = int(input())
S = [int(input()) for _ in range(n)]
S.sort()
score = sum(S)
if score % 10 != 0:
print(score)
else:
for s in S:
if s % 10 != 0:
print(score - s)
exit()
print(0) |
p02988 | s861390142 | Wrong Answer | a=int(input())
seqS=input().split(" ")
num=[]
for q in seqS:
num.append(int(q))
contador=0
#primeiro
#if num[0] > num[1]:
#contador+=1
for i in range(1,len(num)-1):
if num[i-1] > num[i] and num[i] > num[i+1] or num[i-1] < num[i] and num[i] < num[i+1]:
contador+=1
print(num[i-1],num[i],num[... |
p02779 | s824781596 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = set(a)
if b == a:
print("YES")
else:
print("NO") |
p03471 | s841610054 | Accepted | N, Y = map(int, input().split())
for i in range(0, N+1):
for j in range(0, N+1-i):
k = N-i-j
if 1000*i+5000*j+10000*k == Y:
print(k, j, i)
exit(0)
print(-1, -1, -1)
|
p02983 | s042706377 | Accepted | l,r = map(int,input().split())
ans = 2018
if r-l >= 2019:
ans = 0
else:
for i in range(l,r):
for j in range(l+1,r+1):
ans = min(i * j % 2019,ans)
print(ans)
|
p02603 | s107346790 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
a = 0
b = 0
Money = 1000
for i in range(len(A)):
if a == 0:
a = A[i]
continue
if b <= A[i]:
b = A[i]
continue
else:
if a < b:
Money = Money // a * b + Money % a
a = b = A[i]
if a < b:
Money = Money // a * b + Money % a... |
p02791 | s250133460 | Accepted | # -*- coding: utf-8 -*-
# C - Low Elements
import sys
def solve152C(N, plist):
count = 1
maxnumber = plist[0]
minnumber = plist[0]
isFound = True
for i in range(2, N+1):
p = plist[i-1]
if p < maxnumber and p < minnumber:
count += 1
if p > maxnumber:
maxnumber = p
if p < minnumber:
minnumber... |
p02838 | s724110572 | Accepted | import sys
import numpy as np
MOD = 10**9+7
n = int(sys.stdin.buffer.readline())
a = np.fromstring(sys.stdin.buffer.readline(), dtype = np.int64, sep = ' ')
ans = 0
for i in range(60):
s = int((a&1).sum())
ans += s*(n-s) * 2**i
ans %= MOD
a >>= 1
print(ans)
|
p03017 | s343552260 | Accepted | int1 = lambda x: int(x) - 1
N, A, B, C, D = map(int1, input().split())
S = input()
if "##" not in S[A:B+1] and "##" not in S[C:D+1]:
if C > D and "..." not in S[B-1:D+2]:
print("No")
else:
print("Yes")
else:
print("No")
|
p03221 | s591447775 | Accepted | from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
PY = [tuple([i] + list(map(int, input().split()))) for i in range(M)]
result = []
p_city = defaultdict(int)
for py in sorted(PY, key = lambda x: x[2]):
p_city[py[1]] += 1
... |
p03720 | s333748150 | Accepted | n, m = map(int, input().split())
dicts = {i+1:0 for i in range(n)}
for i in range(m):
a, b = map(int, input().split())
dicts[a] += 1
dicts[b] += 1
for i in range(n):
print(dicts[i + 1])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.