problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02664
|
s319465360
|
Wrong Answer
|
T = input()
k = 0
for i in range(len(T)):
if T[i] == '?':
T[i] == 'D'
print(T)
|
p03607
|
s690674284
|
Wrong Answer
|
#!/usr/bin/env python3
N = int(input())
d = {}
for i in range(N):
a = int(input())
if a in d:
d[a] = 0
else:
d[a] = 1
cnt = 0
for a in d:
if d[a]:
cnt += 1
print(cnt)
|
p02598
|
s949842057
|
Accepted
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
l,r = 1,max(A)
while l<r:
m = (l+r)//2
s = sum([a//m+(not a%m==0)-1 for a in A])
if s <= K:
r = m
else:
l = m+1
print(r)
|
p02760
|
s483404713
|
Accepted
|
c = []
for _ in range(3):
l = list(map(int, input().split()))
c += l
n = int(input())
for _ in range(n):
m = int(input())
if m in c:
c[c.index(m)]=0
if c[0]==c[1]==c[2]==0 or c[3]==c[4]==c[5]==0 or c[6]==c[7]==c[8]==0 or c[0]==c[3]==c[6]==0 or c[1]==c[4]==c[7]==0 or c[5]==c[8]==c[2]==0 or c[0]==c[4]==c[8]==0 or c[2]==c[4]==c[6]==0:
print('Yes')
else:
print('No')
|
p03767
|
s405465871
|
Accepted
|
n = int(input())
a = sorted(map(int,input().split()),reverse=True)
ans = 0
t = (n*3)//3
cnt = 0
i = 1
while cnt<t:
cnt += 1
ans += a[i]
i += 2
print(ans)
|
p04020
|
s177354837
|
Accepted
|
N=int(input())
former=0
ans=0
for i in range(0,N):
a=int(input())
if former==0:
former=a%2
ans+=a//2
else:
if a%2==0:
if a!=0:
former=1
ans+=a//2
else:
former=0
else:
former=0
ans+=a//2+1
print(ans)
|
p03986
|
s138816544
|
Accepted
|
s = input()
ans = 0
cnt = 0
for i in s:
if i == "S":
cnt += 1
else:
if cnt:
ans += 1
cnt -= 1
print(len(s) - (2*ans))
|
p02554
|
s673361954
|
Accepted
|
MOD = 10 ** 9 + 7
n = int(input())
print((pow(10, n, MOD) - pow(9, n, MOD) - pow(9, n, MOD) + pow(8, n, MOD)) % MOD)
|
p03210
|
s288785312
|
Wrong Answer
|
x=int(input())
if x==7 or x==5 or x==3:
print("Yes")
else:
print("No")
|
p02663
|
s233594761
|
Accepted
|
H,M,h,m,K=map(int,input().split())
print((h-H)*60+m-M-K)
|
p02910
|
s951996119
|
Accepted
|
S = input()
# L = len(S) % 2
youtube = 0
for i in range(len(S)):
if i % 2 == 0: # 奇数
if S[i] == "L":
youtube += 1
else:#偶数
if S[i] == "R":
youtube += 1
if youtube > 0:
print("No")
else:
print("Yes")
|
p03681
|
s216992011
|
Wrong Answer
|
n,m=map(int,input().split())
MOD=10**9+7
ans = 1
if abs(n-m) > 1:
print(0)
else:
if abs(n-m) == 0:
for i in range(1,n+1):
ans = ans*i%MOD
for i in range(1,m+1):
ans = ans*i%MOD
ans = ans*2%MOD
else:
for i in range(1,n+1):
ans = ans*i%MOD
for i in range(1,m+1):
ans = ans*i%MOD
print(ans)
|
p02777
|
s410035712
|
Wrong Answer
|
S, T =map(str, input().split())
A, B =map(int, input().split())
U = input("")
if U == "red":
A += -1
else:
B += -1
print(A, B)
|
p02970
|
s644337120
|
Accepted
|
import math
n, d = map(int, input().split())
ans = math.ceil(n / (2*d+1))
print(ans)
|
p03469
|
s817382349
|
Accepted
|
S = str(input())
print(S.replace('7', '8', 1))
|
p03377
|
s403748062
|
Accepted
|
def actual(a, b, x):
if a <= x <= a + b:
return 'YES'
return 'NO'
a, b, x = map(int, input().split())
print(actual(a, b, x))
|
p02553
|
s520293619
|
Wrong Answer
|
a = list(map(int,input().split()))
max = a[0]*a[2]
if max < a[0]*a[3]:
max = a[0]*a[3]
if max < a[1]*a[2]:
max = a[1]*a[2]
if max < a[1]*a[3]:
max < a[1]*a[3]
print(max)
|
p03254
|
s220569799
|
Wrong Answer
|
N,x = map(int,input().split())
a = list(map(int,input().split()))
count = 0
#昇順に並べ替える
sort_a = sorted(a)
for i in range(len(a)):
if x >= sort_a[i]:
count += 1
x -= sort_a[i]
continue
else:
continue
break
print(count)
|
p02790
|
s168308221
|
Wrong Answer
|
a,b = list(map(int, input().split()))
ans = min(a,b)
for i in range(ans):
print(str(ans),end="")
|
p02842
|
s265873001
|
Wrong Answer
|
import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)
def main():
n = ni()
x = round(n / 1.08)
y = x+1
z = x -1
# print(x * 1.08, y*1.08, z*1.08)
# print(x, y, z)
if x == n:
print(x)
elif y == n:
print(y)
elif z == n:
print(z)
else:
print(":(")
if __name__ == '__main__':
main()
|
p02661
|
s022125182
|
Wrong Answer
|
from sys import stdin
input = stdin.readline
N = int(input())
ab = [list(map(int, input().split())) for _ in range(N)]
ab.sort()
ran = []
for a, b in ab:
ran.append(b - a + 1)
ran.sort()
if N % 2 == 0:
a1, b1 = ab[N // 2 - 1]
a2, b2 = ab[N // 2]
xa = (a2 + a1) / 2
xb = (b2 + b1) / 2
print(xa, xb)
print(int((xb - xa) * 2 + 1))
else:
xa, xb = ab[N // 2]
print(xb - xa + 1)
|
p03408
|
s682812537
|
Accepted
|
N = int(input())
S = [input() for _ in range(N)]
S_set = set(S)
M = int(input())
T = [input() for _ in range(M)]
m = 0
for s in S_set:
m = max(m, S.count(s)-T.count(s))
print(m)
|
p02792
|
s825379467
|
Wrong Answer
|
count=0
n=int(input())
for a in range(1,n):
for b in range(1,n):
aa=str(a)
bb=str(b)
fa=int(aa[0])
fb=int(bb[0])
la=a%10
lb=b%10
if fa==lb and fb==la:
count+=1
print(count)
|
p02819
|
s731650311
|
Accepted
|
import math
x = int(input())
def is_prime(n):
if n < 2:
return False
if n % 2 == 0 and n > 2:
return False
return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
for n in range(100005):
if n >= x and is_prime(n):
print(n)
break
|
p03293
|
s836655383
|
Wrong Answer
|
s = list(input())
t = list(input())
s.sort()
t.sort()
if s == t:
print("Yes")
else:
print("No")
|
p03455
|
s142513298
|
Accepted
|
x, y = map(int, input().split())
if x * y % 2 == 0:
print("Even")
else:
print("Odd")
|
p03162
|
s151882707
|
Wrong Answer
|
N=int(input())
ABC=[]
for i in range(N):
ABC+=[[int(i) for i in input().split()]]
DP=[[0,0,0] for i in range(N)]
for i in range(N):
for j in range(3):
DP[i][j]=ABC[i][j]+max(DP[i-1][(j+1)%3],DP[i-1][(j+2)%3])
print(max(DP[N-1]))
|
p03836
|
s299670918
|
Accepted
|
sx, sy, gx, gy = map(int, input().split(' '))
route = []
dy = gy - sy
dx = gx - sx
route.append('U' * dy)
route.append('R' * dx)
route.append('D' * dy)
route.append('L' * (dx + 1))
route.append('U' * (dy + 1))
route.append('R' * (dx + 1))
route.append('DR')
route.append('D' * (dy + 1))
route.append('L' * (dx + 1))
route.append('U')
print(''.join(route))
|
p03681
|
s729441034
|
Accepted
|
#79 C - Reconciled?
N,M = map(int,input().split())
MOD = 10**9 + 7
if abs(N-M) >= 2:
ans = 0
else:
# M! * N!
Mfact = 1
for m in range(1,M+1):
Mfact = (Mfact * m)%MOD
Nfact = 1
for n in range(1,N+1):
Nfact = (Nfact * n)%MOD
ans = (Nfact*Mfact)%MOD
if abs(N-M) == 0:
ans = (ans * 2)%MOD
print(ans)
|
p03456
|
s008971713
|
Wrong Answer
|
a,b=input().split()
c = int(a+b)
for i in range(1, 110):
if c == i*i:
print('Yes')
exit()
print('No')
|
p02797
|
s776124567
|
Wrong Answer
|
import sys
input = sys.stdin.readline
n,k,s=map(int,input().split())
if k==0:
if s<10**9:
a=s+1
else:
a=s-1
ans=[]
for i in range(n):
ans.append(a)
print(*ans)
exit()
ans=[]
for i in range(n-k):
ans.append(1 if s!=1 else 2)
for j in range(k):
ans.append(s)
print(*ans)
|
p03773
|
s217886459
|
Accepted
|
a, b = map(int, input().split())
if a+b >= 24:
print(a+b-24)
else:
print(a+b)
|
p03778
|
s488162657
|
Accepted
|
W,a,b=list(map(int,input().split()))
ans=0
if a<b:
ans=max(0, b-(a+W))
if a>=b:
ans=max(0, a-(b+W))
print(ans)
|
p03126
|
s045841164
|
Accepted
|
N, M = map(int,input().split())
KA = [list(map(int,input().split())) for i in range(N)]
dic = {}
for i in range(N):
for j in range(len(KA[i])-1):
if KA[i][1+j] not in dic.keys():
dic[KA[i][1+j]] = 1
else:
dic[KA[i][1+j]] += 1
ans = 0
for i in dic:
if dic[i] == N:
ans += 1
print(ans)
|
p02987
|
s411688230
|
Wrong Answer
|
s=sorted(input())
if s[0]==s[1]:
if s[0]!=s[2] and s[2]==s[3]:
print("Yes")
else:
print("No")
|
p02701
|
s433730427
|
Wrong Answer
|
N = int(input())
list = [input()]
for i in range(N-1):
s = input()
for j in list:
if s == j:
break
list.append(s)
print(len(list))
|
p03779
|
s468742776
|
Accepted
|
X = int(input())
sm=0
for k in range(X+1):
sm +=k
if sm>=X:
print(k)
break
|
p02912
|
s592798078
|
Wrong Answer
|
# -*- coding: utf-8 -*-
"""
Created on Wed Sep 16 12:35:58 2020
@author: liang
"""
N, M = map(int, input().split())
A = [int(x) for x in input().split()]
A.sort(reverse=True)
#print(A)
count = 0
while count != M:
A[0] //= 2
count += 1
tmp = A[0]
for i in range(1,N):
if count == M:
break
if A[i] > tmp:
A[i] //= 2
count += 1
## break
ans = sum(A)
#print(A)
print(ans)
|
p02835
|
s589414740
|
Wrong Answer
|
a,b,c = map(int,input().split())
if a+b+c == 22:
print("bust")
else:
print("win")
|
p03475
|
s546551993
|
Wrong Answer
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
csf = [tuple(map(int, readline().split())) for _ in range(n-1)]
for i in range(n):
now = 0
for c, s, f in csf[i::]:
if now <= s:
now += s - now + c
else:
now += (now-s) % f + c
print(now)
|
p02726
|
s283014884
|
Accepted
|
n, x, y = map(int, input().split())
x = min(x - 1, y - 1)
y = max(x - 1, y - 1)
length = [0] * (n - 1)
for i in range(n - 1):
for j in range(i, n):
l = min(abs(i - j), abs(i - x) + 1 + abs(j - y), abs(i - y) + 1 + abs(j - x))
if l != 0:
length[l - 1] += 1
for l in length:
print(l)
|
p02576
|
s194611630
|
Wrong Answer
|
n, x, t = map(int, input().split())
print((n//x + 1) * t)
|
p03486
|
s934927520
|
Accepted
|
s, t = input(), input()
s = ''.join(sorted(s))
t = ''.join(sorted(t, reverse=True))
if s < t:
print('Yes')
else:
print('No')
|
p02971
|
s834941841
|
Accepted
|
#!/usr/bin/env python
# coding: utf-8
# In[1]:
N = int(input())
A = []
for _ in range(N):
A.append(int(input()))
# In[6]:
idx_max = A.index(max(A))
tmp = [x for x in A]
del tmp[idx_max]
most_max = max(A)
second_max = max(tmp)
for i in range(N):
if i == idx_max:
print(second_max)
else:
print(most_max)
# In[ ]:
|
p03067
|
s037182727
|
Accepted
|
a,b,c=map(int,input().split())
if a<=c<=b or a>c>b:
print("Yes")
else:
print("No")
|
p02988
|
s315661023
|
Wrong Answer
|
n = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if p[i-1]<p[i]<p[i+1]:
ans += 1
print(ans)
|
p03328
|
s996022625
|
Accepted
|
a,b=map(int,input().split())
print(int((b-a)*(b-a+1)/2-b))
|
p03437
|
s072099921
|
Accepted
|
x,y = map(int, input().split())
print(-1 if x % y == 0 else x*y - x)
|
p02994
|
s948819695
|
Accepted
|
def main():
n, l = map(int, input().split())
a_score = list()
for i in range(n):
# りんごiはl+i-1。indexがずれるので-1しない
a_score.append(l+i)
a_sum = sum(a_score)
if 0 in a_score:
print(a_sum - 0)
elif min(a_score) < 0:
print(a_sum - max(a_score))
else:
print(a_sum - min(a_score))
if __name__ == '__main__':
main()
|
p02987
|
s381538496
|
Wrong Answer
|
if len(input())==2:
print("Yes")
else:
print("No")
|
p03252
|
s520663536
|
Accepted
|
alp = 'abcdefghijklmnopqrstuvwxyz'
def f(s):
new_s = ''
i = 0
is_used = [-1]*26
for si in s:
idx = ord(si) - 97
if is_used[idx] < 0:
is_used[idx] = i
new_s += alp[i]
i += 1
else:
new_s += alp[is_used[idx]]
return new_s
S = f(input())
T = f(input())
if S == T:
print('Yes')
else:
print('No')
|
p02724
|
s777713791
|
Wrong Answer
|
# -*- coding: <encoding name> -*-
x = int(input())
print(1000 * (x // 500) + (x % 500))
|
p03061
|
s041691318
|
Accepted
|
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
def gcd(x,y):
while y:
x, y = y, x%y
return x
ll, lr = [0]*n, [0]*n
ll[0], lr[n-1] = a[0], a[n-1]
for i in range(1,n):
ll[i] = gcd(ll[i-1], a[i])
lr[n-i-1] = gcd(lr[n-i], a[n-i-1])
print(max(ll[n-2], lr[1], *[gcd(l,r) for l,r in zip(ll[:n-2], lr[2:])]))
|
p02572
|
s911734711
|
Accepted
|
from itertools import accumulate
n=int(input())
A=[int(i) for i in input().split()]
B=list(accumulate(A))
s = 0
for i in range(n):
s += A[i]*(B[-1]-B[i])
s %= (10**9+7)
print(s)
|
p03339
|
s638046726
|
Wrong Answer
|
import numpy as np
n = int(input())
s = input()
s_W = [0]
s_E = [0]
for i in range(n):
if s[i] == "W":
s_W.append(1)
s_E.append(0)
else:
s_W.append(0)
s_E.append(1)
W_l = np.cumsum(np.array(s_W))
E_l = np.cumsum(np.array(s_E))
ans = []
for j in range(n):
num = W_l[j]+E_l[-1]-E_l[j]
ans.append(num)
print(min(ans))
|
p03672
|
s969892626
|
Wrong Answer
|
s=list(input())
from copy import copy
t=s.copy()
for i in range(len(t)):
if len(s)%2==0 and s[:len(s)%2]==s[len(s)%2:]:
print(len(s))
exit()
else:
s.pop(-1)
|
p02756
|
s504096207
|
Accepted
|
s = input()
q = int(input())
qs = [input().split() for i in range(q)]
n = False
left= right = ""
for operation in qs:
if operation[0] == '1':
n = not n
if operation[0] == '2':
t , f, c = operation
f = int(f)
if n:
f = 1 if f != 1 else 2
if f == 1:
left=c+left
elif f == 2:
right+=c
s = left+s+right
print(s[::-1] if n else s)
|
p03943
|
s002811367
|
Accepted
|
lis = list(map(int,input().split()))
if max(lis) == sum(lis)-max(lis):
print("Yes")
else:
print("No")
|
p03017
|
s009896470
|
Wrong Answer
|
N,A,B,C,D = map(int,input().split())
S=input()
ans="Yes"
if D<C:
triple = S[B-1:D].count("...")
if triple ==0:
ans="No"
double= S[A-1:].count("##")
if double > 0:
ans="No"
print(ans)
|
p02801
|
s861711324
|
Wrong Answer
|
C = input()
alpha = ["a","b","c","d""e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
j = 0
for i in alpha:
if i == C:
print(alpha[j+1])
j += 1
|
p03625
|
s694158690
|
Wrong Answer
|
n=int(input())
a=list(map(int,input().split(' ')))
x=0
y=0
a.sort()
a.reverse()
for i in range(len(a)-1):
if a[i]==a[i+1]:
x=a[i]
break
if x!=0:
for i in range(len(a)-1):
if a[i]!=x and a[i]==a[i+1]:
y=a[i]
break
print(x*y)
|
p03281
|
s552590974
|
Wrong Answer
|
n = int(input())
if 189 <= n:
print(4)
elif 165 <= n:
print(3)
elif 135 <= n:
print(2)
elif 105 <= n:
print(1)
else:
print(0)
|
p03861
|
s202990680
|
Accepted
|
a, b, x = map(int, input().split())
if a%x==0:
ax = a//x-1
else:
ax = a//x
bx = b//x
print(bx-ax)
|
p03323
|
s333987477
|
Accepted
|
a,b = map(int,input().split())
if a>8 or b>8:
print(":(")
else:
print("Yay!")
|
p02706
|
s959708805
|
Wrong Answer
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
study_sum = sum(a)
print(n-study_sum)
|
p02613
|
s601930761
|
Wrong Answer
|
n = int(input())
a = 0
b = 0
c = 0
d = 0
for i in range(n):
s = input()
if s == 'AC':
a += 1
elif s == 'WA':
b += 1
elif s == 'TLE':
c += 1
else:
d += 1
print('AC ×', a)
print('WA ×', b)
print('TLE ×', c)
print('RE ×', d)
|
p03672
|
s841528553
|
Accepted
|
S = input()
N = len(S)
for i in range(N-1, -1, -2):
if S[:i//2] == S[i//2:i-1]:
print(i-1)
exit(0)
|
p04005
|
s111392396
|
Wrong Answer
|
a, b, c = map(int, input().split())
if a%2 == b%2 == c%2 == 0:
print(0)
else:
print(min(a*b, b*c, b*c))
|
p03778
|
s150500721
|
Accepted
|
w, a, b = map(int, input().split())
print(max(0, b - a - w, a - b - w))
|
p03385
|
s870319141
|
Wrong Answer
|
s=input()
if set(s)=='abc':
print('Yes')
else:
print('No')
|
p02785
|
s280168563
|
Accepted
|
n,k=map(int,input().split())
A=list(map(int,input().split()))
A=sorted(A)
if(k>=n):
print(0)
else:
print(sum(A[:n-k]))
|
p02645
|
s301496277
|
Wrong Answer
|
S=input()
A="S[0]"+"S[1]"+"S[2]"
print(A)
|
p02555
|
s131397538
|
Accepted
|
s=int(input())
if s<3:print(0);exit()
n=s//3
mod=10**9+7
fact=[1]*(2*s+1)
inv=[1]*(2*s+1)
for i in range(2,2*s+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],-1,mod)
for i in range(2*s,1,-1):
inv[i-1]=inv[i]*i%mod
def comb(x,y):return fact[x]*inv[y]%mod*inv[x-y]%mod if x>=y>=0 else 0
ans=0
for i in range(1,s+1):
ans=(ans+comb(s-3*i+i-1,i-1))%mod
print(ans)
|
p02702
|
s722967294
|
Accepted
|
def main():
S=input()
P=2019
ans=0
count=[0]*P
count[0]=1
u=0
for i,s in enumerate(reversed(S)):
u=(int(s)*pow(10,i,P)+u)%P
ans+=count[u]
count[u]+=1
print(ans)
if __name__=="__main__":
main()
|
p03632
|
s080731484
|
Accepted
|
a,b,c,d=map(int,input().split())
left=max(a,c)
right=min(b,d)
ans = right-left
if ans < 0:
print(0)
else:
print(ans)
|
p02571
|
s538460379
|
Accepted
|
S = input()
T = input()
ls = len(S)
lt = len(T)
ans = 1<<60
for i in range(ls-lt+1):
cnt = 0
X = S[i:i+lt]
for x, t in zip(X, T):
if x != t:
cnt += 1
ans = min(ans, cnt)
print(ans)
|
p02629
|
s452249176
|
Wrong Answer
|
in1 = input()
ind = int(in1)
alpha = "abcdefghijklmnopqrstuvwxyz"
twosix = []
while True:
if (ind < 26):
twosix.append(ind)
break
twosix.append(ind % 26)
ind //= 26
#print(twosix)
ans = ""
twosix.reverse()
#print(twosix)
for i in twosix:
ans += alpha[i-1]
print(ans)
|
p04031
|
s139452196
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
ans = 1000000
a = sorted(a)
for i in range(a[0],a[n-1]+1):
counter = 0
for j in range(n):
dif = abs(a[j] - i)
dif *= dif
counter += dif
ans = min(ans,counter)
print(ans)
|
p03680
|
s414728879
|
Accepted
|
n = int(input())
A = [int(input()) for i in range(n)]
T = {}
k = 1
cnt = 0
while True:
if k == 2:
print(cnt)
exit()
if k not in T: T[k]=1
else:
print(-1)
exit()
k = A[k-1]
cnt+=1
|
p03665
|
s107807026
|
Accepted
|
import math
n, p = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [a[i] % 2 for i in range(n)]
z = b.count(0)
o = b.count(1)
c = 0
for i in range(o+1):
if i % 2 == 0:
c += math.factorial(o)/(math.factorial(i)*math.factorial(o-i))
ans = int(c *( 2 **z))
if p == 0:
print(ans)
else:
print(str(2**n-ans))
|
p02900
|
s558536390
|
Accepted
|
a,b = map(int, input().split())
#from math import gcd
from fractions import gcd
g = gcd(a,b)
pf = {}
for i in range(2,int(g**0.5)+1):
while g % i == 0:
pf[i] = pf.get(i,0) + 1
g //= i
if g > 1: pf[g] = 1
ans = 1 + len(pf.keys()) # 1は素数ではないが答えには入る
print(ans)
|
p02577
|
s037758005
|
Accepted
|
N = int(input())
count = sum(list(map(int, str(N))))
if count % 9 == 0:
print("Yes")
else:
print("No")
|
p02631
|
s402082010
|
Accepted
|
def main():
n = int(input())
a = tuple(map(int, input().split()))
ar = a[0]
for i1 in range(1, n):
ar ^= a[i1]
res = []
for i1 in range(n):
rt = ar ^ a[i1]
res.append(rt)
print(*res)
if __name__ == '__main__':
main()
|
p03817
|
s591034774
|
Accepted
|
x = int(input())
#6と5を繰り返す
if x%11==0: print(x//11*2)
elif x%11 <= 6: print(x//11*2+1)
else: print(x//11*2+2)
|
p02909
|
s058936286
|
Wrong Answer
|
a=input()
b=['Sunny','Cloudy','Rainy']
for i in range(3):
if i==2:
print('Sunny')
break
if b[i]==a:
print(b[i+1])
|
p03377
|
s692905295
|
Accepted
|
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
def main():
a, b, x = MII()
if x < a: print('NO')
elif x <= a+b: print('YES')
else: print('NO')
if __name__ == '__main__':
main()
|
p02584
|
s930469109
|
Accepted
|
X,K,D = [int(x) for x in input().split()]
if D * K < abs(X):
print(abs(X) - D * K)
else:
if (K - abs(X) // D) % 2 == 0:
print(abs(X) % D)
else:
print(D - abs(X) % D)
|
p02719
|
s223062999
|
Wrong Answer
|
n,k = map(int,input().split())
while True:
if n < k:
print(n)
break
n = n % k
if n == 0:
print(0)
break
ans = n - k
next_ans = abs(ans) - k
if abs(next_ans) > abs(ans):
print(abs(ans))
break
else:
print(abs(next_ans))
break
|
p03545
|
s410751454
|
Accepted
|
import sys
*S, = input()
op = ['-', '+']
for i in op:
for j in op:
for k in op:
e = f'{S[0]}{i}{S[1]}{j}{S[2]}{k}{S[3]}'
if eval(e) == 7:
print(f'{e}=7')
sys.exit()
|
p03351
|
s965109584
|
Accepted
|
a, b, c, d = map(int, input().split())
if abs(c - a) <= d:
print('Yes')
elif abs(b - a) <= d and abs(c - b) <= d:
print('Yes')
else:
print('No')
|
p02811
|
s381045360
|
Accepted
|
k, x = map(int, input().split())
print("Yes" if x <= 500*k else "No")
|
p02753
|
s115492102
|
Wrong Answer
|
S=map(str,input())
if "A" in S:
print("yes")
else :
print("no")
|
p03557
|
s159540108
|
Wrong Answer
|
import bisect
n=input()
a=sorted(list(map(int,input().split())))
b=sorted(list(map(int,input().split())))
c=sorted(list(map(int,input().split())))
ans=0
for B in b:
ans+=(bisect.bisect_left(a,B))*(len(c)-(bisect.bisect_left(c,B)))
print(ans)
|
p02995
|
s012481673
|
Wrong Answer
|
import math
A, B, C, D = map(int, input().split())
def lec(a, b):
# aとbの最小公倍数
return a * b // math.gcd(a, b)
CD = lec(C, D)
C_num = math.floor(B / C) - math.ceil(A / C) + 1
D_num = math.floor(B / D) - math.ceil(A / D) + 1
CD_num = math.floor(B / CD) - math.ceil(A / CD) + 1
answer = B - A + 1 - C_num - D_num + CD_num
print(answer)
|
p03136
|
s101665298
|
Accepted
|
n=int(input())
l=list(map(int,input().split()))
if max(l)<sum(l)-max(l):
print('Yes')
else:
print('No')
|
p04033
|
s098184878
|
Accepted
|
a, b = map(int, input().split())
if a > 0 and b > 0:
print("Positive")
elif a < 0 and b < 0:
if (b-a+1)%2 == 0:
print("Positive")
else:
print("Negative")
else:
print("Zero")
|
p02912
|
s591873277
|
Accepted
|
import heapq
n, m = map(int, input().split())
a = list(map(lambda x: -1*int(x), input().split()))
heapq.heapify(a)
for _ in range(m):
heapq.heappush(a, -(-heapq.heappop(a)//2))
print(-sum(a))
|
p02957
|
s925993918
|
Wrong Answer
|
A,B=map(int,input().split())
K=(A+B)/2
Kint=(A+B)//2
if (K==Kint):
print (K)
else:
print ('IMPOSSIBLE')
|
p02777
|
s772486578
|
Wrong Answer
|
import sys
readline = sys.stdin.readline
s, t = readline().split()
a, b = list(map(int, readline().split()))
if s == readline():
print(a-1,b)
else:
print(a,b-1)
|
p03815
|
s727389607
|
Accepted
|
x = int(input())
ans = int(x/11)*2
tmp = x%11
if tmp > 6:
ans+=2
elif tmp > 0:
ans+=1
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.