wrong_submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 131k 1.05M | wrong_status stringclasses 2
values | wrong_cpu_time float64 10 40k | wrong_memory float64 2.94k 3.37M | wrong_code_size int64 1 15.5k | problem_description stringlengths 1 4.75k | wrong_code stringlengths 1 6.92k | acc_submission_id stringlengths 10 10 | acc_status stringclasses 1
value | acc_cpu_time float64 10 27.8k | acc_memory float64 2.94k 960k | acc_code_size int64 19 14.9k | acc_code stringlengths 19 14.9k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s205571599 | p02279 | u533883485 | 2,000 | 131,072 | Wrong Answer | 30 | 7,688 | 1,116 | A graph _G_ = ( _V_ , _E_ ) is a data structure where _V_ is a finite set of vertices and _E_ is a binary relation on _V_ represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs). **Fig. 1** A free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one... | # coding=utf-8
class Node:
def __init__(self, idx, degree, children=None):
self.id = idx
self.parent = -1 #??????
self.depth = 0 #??????
self.type = None #??????
self.children = children
n = int(input())
data = [list(map(int, input().split())) for x in range(n)]
node_list =... | s714758956 | Accepted | 1,160 | 68,488 | 1,124 | # coding=utf-8
class Node:
def __init__(self, idx, degree, children=None):
self.id = idx
self.parent = -1 #??????
self.depth = 0 #??????
self.type = None #??????
self.children = children
n = int(input())
data = [list(map(int, input().split())) for x in range(n)]
node_list =... |
s923549533 | p03351 | u280552586 | 2,000 | 1,048,576 | Wrong Answer | 17 | 2,940 | 79 | Three people, A, B and C, are trying to communicate using transceivers. They are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively. Two people can directly communicate when the distance between them is at most d meters. Determine if A and C can communicate, either ... | a, b, c, d = map(int, input().split())
print('Yes' if abs(a-c) <= d else 'No')
| s795901899 | Accepted | 18 | 2,940 | 114 | a, b, c, d = map(int, input().split())
print('Yes' if abs(a-b) <= d and abs(b-c) <= d or abs(a-c) <= d else 'No')
|
s006195873 | p03456 | u502200133 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 142 | AtCoDeer the deer has found two positive integers, a and b. Determine whether the concatenation of a and b in this order is a square number. | a, b = map(str, input().split())
num = int(a + b)
num1 = num ** 0.5
num2 = num1 * num1
if num1 == num2:
print("Yes")
else:
print("No") | s068899356 | Accepted | 17 | 2,940 | 146 | a, b = map(str, input().split())
num = int(a + b)
num1 = int(num ** 0.5)
num2 = num1 * num1
if num == num2:
print("Yes")
else:
print("No") |
s060010027 | p02694 | u919235786 | 2,000 | 1,048,576 | Time Limit Exceeded | 2,206 | 9,068 | 84 | Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank. The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.) Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or abo... | x=float(input())
a=float(100)
y=0
while a<x:
a*=1.01
a=a%1
y+=1
print(y) | s283539824 | Accepted | 23 | 9,092 | 107 | x=float(input())
a=float(100)
y=0
import math
while a<x:
a=a*1.01
a=math.floor(a)
y+=1
print(y) |
s132059796 | p03149 | u095021077 | 2,000 | 1,048,576 | Wrong Answer | 17 | 3,060 | 149 | You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974". | n=list(map(int, input().split()))+[1, 9, 7, 4]
if n.index(1)<4 and n.index(9)<4 and n.index(7)<4 and n.index(4)<4:
print('Yes')
else:
print('No') | s135644264 | Accepted | 17 | 3,060 | 149 | n=list(map(int, input().split()))+[1, 9, 7, 4]
if n.index(1)<4 and n.index(9)<4 and n.index(7)<4 and n.index(4)<4:
print('YES')
else:
print('NO') |
s358256842 | p02612 | u081714930 | 2,000 | 1,048,576 | Wrong Answer | 30 | 9,148 | 60 | We will buy a product for N yen (the currency of Japan) at a shop. If we use only 1000-yen bills to pay the price, how much change will we receive? Assume we use the minimum number of bills required. | n=int(input())
if n>=1000:
print(0)
else:
print(1000-n) | s793833771 | Accepted | 27 | 9,096 | 79 | n=int(input())
while n>=0:
if 0<n<=1000:
print(1000-n)
n-=1000 |
s753146281 | p03860 | u806392288 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 97 | Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters. Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppe... | AtCoder,s,Contest = map(str, input().split())
print(AtCoder[0] + " " + s[0] + " " + Contest[0]) | s243721739 | Accepted | 17 | 2,940 | 85 | AtCoder,s,Contest = map(str, input().split())
print(AtCoder[0] + s[0] + Contest[0]) |
s080729688 | p03943 | u757274384 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 144 | Two students of AtCoder Kindergarten are fighting over candy packs. There are three candy packs, each of which contains a, b, and c candies, respectively. Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible. Not... | a,b,c = map(int ,input().split())
if a+b == c :
print("YES")
elif a+c == b:
print("YES")
elif b+c == a:
print("YES")
else :
print("NO") | s136837493 | Accepted | 17 | 2,940 | 107 | a,b,c = map(int ,input().split())
if a == b+c or b == a+c or c == a+b:
print("Yes")
else :
print("No") |
s823813239 | p03943 | u470359972 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 124 | Two students of AtCoder Kindergarten are fighting over candy packs. There are three candy packs, each of which contains a, b, and c candies, respectively. Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible. Not... | a,b,c=map(int,input().split())
#print(a,b,c)
#print(max(a,b,c))
if max(a,b,c)==(a+b+c)/2:
print("YES")
else:
print("NO") | s175304174 | Accepted | 17 | 2,940 | 124 | a,b,c=map(int,input().split())
#print(a,b,c)
#print(max(a,b,c))
if max(a,b,c)==(a+b+c)/2:
print("Yes")
else:
print("No") |
s477910299 | p03712 | u744898490 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 260 | You are given a image with a height of H pixels and a width of W pixels. Each pixel is represented by a lowercase English letter. The pixel at the i-th row from the top and j-th column from the left is a_{ij}. Put a box around this image and output the result. The box should consist of `#` and have a thickness of 1. |
mat_small = []
xy = input().split(' ')
for i in range(int(xy[0])):
mat_small.append(input())
big = [(int(xy[0])+ 2)* '#' for a in range(int(xy[0])+ 2) ]
for s in range(1, (int(xy[0])+ 1)):
big[s] = '#' + mat_small[s-1] + '#'
print( big)
| s611655165 | Accepted | 17 | 3,064 | 272 |
mat_small = []
xy = input().split(' ')
for i in range(int(xy[0])):
mat_small.append(input())
big = [(int(xy[1])+ 2)* '#' for a in range(int(xy[0])+ 2) ]
for s in range(1, (int(xy[0])+ 1)):
big[s] = '#' + mat_small[s-1] + '#'
for v in big:
print(v) |
s044241809 | p03476 | u810787773 | 2,000 | 262,144 | Time Limit Exceeded | 2,206 | 31,368 | 890 | We say that a odd number N is _similar to 2017_ when both N and (N+1)/2 are prime. You are given Q queries. In the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i. | import numpy as np
def seachPrimeNum(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
re... | s553281476 | Accepted | 568 | 32,424 | 1,139 | import numpy as np
def seachPrimeNum(N):
max = int(np.sqrt(N))
seachList = [i for i in range(2,N+1)]
primeNum = []
while seachList[0] <= max:
primeNum.append(seachList[0])
tmp = seachList[0]
seachList = [i for i in seachList if i % tmp != 0]
primeNum.extend(seachList)
re... |
s564794065 | p04044 | u263933075 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 46 | Iroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L. She will concatenate all of the strings in some order, to produce a long string. Among all strings that she can produce in this way, find the lexicographically smallest one. Here, a string s=s_1s_2s_3...s_n is _lexicographically sm... | a = input().split()
a.sort()
print("".join(a)) | s377354642 | Accepted | 17 | 3,060 | 106 | a=list(map(int,input().split()))
b=[]
for i in range(a[0]):
b.append(input())
b.sort()
print("".join(b)) |
s960583643 | p03644 | u742899538 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 157 | Takahashi loves numbers divisible by 2. You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique. Here, the number of times an integer can be divisible by 2, is how many times the integer can... | nums = [1, 2, 4, 8, 16, 32, 64]
N = int(input())
result = nums[0]
for num in nums:
if N > num:
reuslt = num
else:
break
print(result) | s035390216 | Accepted | 17 | 2,940 | 158 | nums = [1, 2, 4, 8, 16, 32, 64]
N = int(input())
result = nums[0]
for num in nums:
if N >= num:
result = num
else:
break
print(result) |
s912778667 | p02607 | u674588203 | 2,000 | 1,048,576 | Wrong Answer | 28 | 9,060 | 155 | We have N squares assigned the numbers 1,2,3,\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i. How many squares i satisfy both of the following conditions? * The assigned number, i, is odd. * The written integer is odd. | N=int(input())
ai=list(map(int,input().split()))
ans=0
for i in range(N):
if i%2==0:
pass
if ai[i] %2==1:
ans+=1
print(ans)
| s377800815 | Accepted | 24 | 9,096 | 155 | N=int(input())
ai=list(map(int,input().split()))
ans=0
for i in range(N):
if i%2==1:
continue
if ai[i] %2==1:
ans+=1
print(ans)
|
s056068077 | p02678 | u285891772 | 2,000 | 1,048,576 | Wrong Answer | 831 | 50,604 | 1,237 | There is a cave. The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 is a special room with an entrance from the outside. It is dark in th... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | s521326346 | Accepted | 733 | 45,148 | 1,238 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... |
s411249295 | p00718 | u328199937 | 1,000 | 131,072 | Wrong Answer | 60 | 6,300 | 1,237 | Prof. Hachioji has devised a new numeral system of integral numbers with four lowercase letters "m", "c", "x", "i" and with eight digits "2", "3", "4", "5", "6", "7", "8", "9". He doesn't use digit "0" nor digit "1" in this system. The letters "m", "c", "x" and "i" correspond to 1000, 100, 10 and 1, respectively, and ... | ans_list = []
n = int(input())
def mcxl2digit(s):
ans = 0
dig = 1
for i in range(len(s)):
if "2" <= s[i] <= "9":
dig = int(s[i])
else:
if s[i] == "m":
key = 100
elif s[i] == "c":
key = 100
elif s[i] == "x":
... | s141270628 | Accepted | 60 | 6,296 | 1,301 | ans_list = []
n = int(input())
def mcxl2digit(s):
ans = 0
dig = 1
for i in range(len(s)):
if "2" <= s[i] <= "9":
dig = int(s[i])
else:
if s[i] == "m":
key = 1000
elif s[i] == "c":
key = 100
elif s[i] == "x":
... |
s756098286 | p03943 | u410118019 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 46 | Two students of AtCoder Kindergarten are fighting over candy packs. There are three candy packs, each of which contains a, b, and c candies, respectively. Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible. Not... | a=list(map(int,input().split()))
print(sum(a)) | s887205742 | Accepted | 17 | 2,940 | 96 | a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
print("Yes")
else:
print("No") |
s175400759 | p02410 | u587193722 | 1,000 | 131,072 | Wrong Answer | 20 | 7,656 | 345 | Write a program which reads a $ n \times m$ matrix $A$ and a $m \times 1$ vector $b$, and prints their product $Ab$. A column vector with m elements is represented by the following equation. \\[ b = \left( \begin{array}{c} b_1 \\\ b_2 \\\ : \\\ b_m \\\ \end{array} \right) \\] A $n \times m$ matrix with $m$ column ve... | x, y = [int(i) for i in input().split()]
date = [[int(i) for i in input().split()]for i in range(1,x+1)]
date2 =[int(input())for i in range(1,y+1)]
date3 =[]
for k in range(x):
print(date[k])
print(date2)
for a in range(0,x):
for b in range(0,y):
date3 += [date2[b]*date[a][b]]
for h in range(0,len(date3... | s112182578 | Accepted | 20 | 8,492 | 304 | x, y = [int(i) for i in input().split()]
date = [[int(i) for i in input().split()]for i in range(1,x+1)]
date2 =[int(input())for i in range(1,y+1)]
date3 =[]
for a in range(0,x):
for b in range(0,y,):
date3 += [date2[b]*date[a][b]]
for d in range(0,len(date3),y):
print(sum(date3[d:d+y])) |
s524551212 | p03386 | u064408584 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 134 | Print all the integers that satisfies the following in ascending order: * Among the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers. | a,b,k =map(int, input().split())
c=list(range(a,a+k))
d=list(range(b-k+1,b+1))
e=set(c+d)
for i in e:
if a<=i<=b:
print(i) | s871288382 | Accepted | 17 | 3,060 | 149 | a,b,k =map(int, input().split())
c=list(range(a,a+k))
d=list(range(b-k+1,b+1))
e=list(set(c+d))
e.sort()
for i in e:
if a<=i<=b:
print(i) |
s079733774 | p03544 | u244836567 | 2,000 | 262,144 | Wrong Answer | 29 | 9,192 | 92 | It is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers. You are given an integer N. Find the N-th Lucas number. Here, the i-th Lucas number L_i is defined as follows: * L_0=2 * L_1=1 * L_i=L_{i-1}+L_{i-2} (i≥2) | n=int(input())
a=2
b=1
c=3
i=0
while i<n:
d=a
e=b
a=b
b=c
c=a+b+c
i=i+1
print(a) | s637804976 | Accepted | 29 | 9,164 | 74 | n=int(input())
a=2
b=1
i=0
while i<n:
d=a
a=b
b=d+b
i=i+1
print(a) |
s886621805 | p03711 | u516447519 | 2,000 | 262,144 | Wrong Answer | 28 | 9,216 | 386 | Based on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below. Given two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group. | H,W = [int(i) for i in input().split()]
if H % 3 == 0 or W % 3 == 0:
print(0)
else:
s = []
for i in range(1,H//2 +1):
j = W//2
a = [i*W,j*(H-i),(W-j)*(H-i)]
b = max(a) - min(a)
s.append(b)
for i in range(1,W//2+1):
j = H//2
a = [H*i,(W-i)*j,(W-i)*(H-j)]
... | s407839595 | Accepted | 23 | 9,160 | 181 | A = [1,3,5,7,8,10,12]
B = [4,6,9,11]
a,b = [int(i) for i in input().split()]
if a in A and b in A:
print('Yes')
elif a in B and b in B:
print('Yes')
else:
print('No')
|
s701200680 | p03024 | u883203948 | 2,000 | 1,048,576 | Wrong Answer | 18 | 2,940 | 100 | Takahashi is competing in a sumo tournament. The tournament lasts for 15 days, during which he performs in one match per day. If he wins 8 or more matches, he can also participate in the next tournament. The matches for the first k days have finished. You are given the results of Takahashi's matches as a string S cons... | data = input()
x = data.count("o")
if x + 15-len(data) >= 8:
print("yes")
else:
print("no")
| s767858881 | Accepted | 18 | 3,064 | 100 | data = input()
x = data.count("o")
if x + 15-len(data) >= 8:
print("YES")
else:
print("NO")
|
s099344722 | p03730 | u790012205 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 147 | We ask you to select some number of positive integers, and calculate the sum of them. It is allowed to select as many integers as you like, and as large integers as you wish. You have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer. Your objecti... | import sys
A, B, C = map(int, input().split())
for i in range(1, B - 1):
if i * A % B == C:
print('Yes')
sys.exit()
print('No') | s694705150 | Accepted | 25 | 9,168 | 151 | import sys
A, B, C = map(int, input().split())
N = A
while N < A * B:
if N % B == C:
print('YES')
sys.exit()
N += A
print('NO') |
s986620735 | p03485 | u017415492 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 64 | You are given two positive integers a and b. Let x be the average of a and b. Print x rounded up to the nearest integer. | import math
a,b=map(int,input().split())
print(math.ceil(a+b/2)) | s478590746 | Accepted | 29 | 9,060 | 66 | import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2)) |
s103990365 | p03486 | u329706129 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 135 | You are given strings s and t, consisting of lowercase English letters. You will create a string s' by freely rearranging the characters in s. You will also create a string t' by freely rearranging the characters in t. Determine whether it is possible to satisfy s' < t' for the lexicographic order. | s = input()
t = input()
s = ''.join(sorted(s))
t = ''.join(sorted(t, reverse=True))
print(s, t)
print('Yes') if s < t else print('No')
| s024824104 | Accepted | 18 | 2,940 | 123 | s = input()
t = input()
s = ''.join(sorted(s))
t = ''.join(sorted(t, reverse=True))
print('Yes') if s < t else print('No')
|
s500587993 | p03501 | u808569469 | 2,000 | 262,144 | Wrong Answer | 25 | 8,976 | 77 | You are parking at a parking lot. You can choose from the following two fee plans: * Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours. * Plan 2: The fee will be B yen, regardless of the duration. Find the minimum fee when you park for N hours. | n, a, b = map(int, input().split())
price = [a * n] + [b]
print(max(price))
| s262084635 | Accepted | 29 | 8,964 | 58 | n, a, b = map(int, input().split())
print(min(a * n, b))
|
s283154969 | p03814 | u702996070 | 2,000 | 262,144 | Wrong Answer | 57 | 3,816 | 231 | Snuke has decided to construct a string that starts with `A` and ends with `Z`, by taking out a substring of a string s (that is, a consecutive part of s). Find the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with `A` and ends w... | #!/usr/bin/env python3
if __name__ == '__main__':
s = str(input())
L = len(s)
beg = -1
end = -1
for i in range(0,L):
if s[i]=='A' and beg==-1:
beg = i
elif s[i]=='Z':
end = i
print(s[beg:end-beg+1])
| s076225766 | Accepted | 60 | 3,516 | 224 | #!/usr/bin/env python3
if __name__ == '__main__':
s = str(input())
L = len(s)
beg = -1
end = -1
for i in range(0,L):
if s[i]=='A' and beg==-1:
beg = i
elif s[i]=='Z':
end = i
print(end-beg+1)
|
s411506070 | p02678 | u863433366 | 2,000 | 1,048,576 | Wrong Answer | 632 | 34,136 | 408 | There is a cave. The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 is a special room with an entrance from the outside. It is dark in th... | from collections import deque
n, m = map(int, input().split())
ab = [[] for i in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
ab[a].append(b)
ab[b].append(a)
ans = [-1]*(n+1)
que = deque([1])
while que:
q = que.popleft()
for i in ab[q]:
if ans[i] == -1:
que.... | s849125441 | Accepted | 661 | 33,900 | 379 | from collections import deque
n, m = map(int, input().split())
ab = [[] for i in range(n+1)]
for i in range(m):
a, b = map(int,input().split())
ab[a].append(b)
ab[b].append(a)
ans = [-1]*(n+1)
que = deque([1])
while que:
q = que.popleft()
for i in ab[q]:
if ans[i] == -1:
que.append(i)
ans[i... |
s247025542 | p04043 | u580404776 | 2,000 | 262,144 | Wrong Answer | 21 | 3,316 | 90 | Iroha loves _Haiku_. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order. To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each ... | A=list(map(int,input().split()))
print("Yes" if A.count(5)==2 and A.count(7)==1 else "No") | s376339221 | Accepted | 17 | 2,940 | 90 | A=list(map(int,input().split()))
print("YES" if A.count(5)==2 and A.count(7)==1 else "NO") |
s258896926 | p03495 | u633914031 | 2,000 | 262,144 | Wrong Answer | 148 | 33,312 | 284 | Takahashi has N balls. Initially, an integer A_i is written on the i-th ball. He would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls. Find the minimum number of balls that Takahashi needs to rewrite the integers on them. | N,K=map(int, input().split())
A=list(map(int, input().split()))
ball={}
result=0
for i in range(N):
if A[i] in ball.keys():
ball[A[i]]+=1
else:
ball[A[i]]=1
sorted_ball = sorted(list(ball.values()))
if len(sorted_ball) > K:
for i in range(K):
result+=1
print(result) | s645824363 | Accepted | 168 | 33,152 | 314 | N,K=map(int, input().split())
A=list(map(int, input().split()))
ball={}
result=0
for i in range(N):
if A[i] in ball.keys():
ball[A[i]]+=1
else:
ball[A[i]]=1
sorted_ball = sorted(list(ball.values()))
if len(sorted_ball) > K:
for i in range(len(sorted_ball)-K):
result+=sorted_ball[i]
print(result) |
s725327555 | p03658 | u808373096 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 104 | Snuke has N sticks. The length of the i-th stick is l_i. Snuke is making a snake toy by joining K of the sticks together. The length of the toy is represented by the sum of the individual sticks that compose it. Find the maximum possible length of the toy. | N, K = map(int, input().split())
L = sorted([int(_) for _ in range(N)], reverse=True)
print(sum(L[:K])) | s264036714 | Accepted | 21 | 3,316 | 110 | N, K = map(int, input().split())
L = sorted(list(map(int, input().split())), reverse=True)
print(sum(L[:K]))
|
s062123458 | p03005 | u030726788 | 2,000 | 1,048,576 | Wrong Answer | 18 | 2,940 | 98 | Takahashi is distributing N balls to K persons. If each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls? | n,k = map(int,input().split())
mi = 1
ma = 1 + k-n
if(k==1):
print(0)
else:
print(ma-mi) | s193532360 | Accepted | 17 | 2,940 | 99 | n,k = map(int,input().split())
mi = 1
ma = 1 + n-k
if(k==1):
print(0)
else:
print(ma-mi)
|
s190109060 | p02747 | u701638736 | 2,000 | 1,048,576 | Wrong Answer | 17 | 2,940 | 304 | A Hitachi string is a concatenation of one or more copies of the string `hi`. For example, `hi` and `hihi` are Hitachi strings, while `ha` and `hii` are not. Given a string S, determine whether S is a Hitachi string. | hitachi = input(' please input > ')
j = 0
tmp = 0
def check_hit(a,b):
if a == b:
return 1
return 0
for i in hitachi:
if j % 2 == 0:
tmp += int(check_hit(i,"h"))
else:
tmp += int(check_hit(i,"i"))
if tmp == len(hitachi):
print("Yse")
else:
print("No")
| s243368228 | Accepted | 19 | 3,060 | 318 | hitachi = input()
j = 0
tmp = 0
def check_hit(a,b):
if a == b:
return 1
return 0
for i in hitachi:
if j % 2 == 0:
tmp += int(check_hit(i,"h"))
else:
tmp += int(check_hit(i,"i"))
j+=1
if tmp == len(hitachi) and j%2==0 and tmp > 0:
print("Yes")
else:
print("No")
|
s106154486 | p03447 | u143492911 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 57 | You went shopping to buy cakes and donuts with X yen (the currency of Japan). First, you bought one cake for A yen at a cake shop. Then, you bought as many donuts as possible for B yen each, at a donut shop. How much do you have left after shopping? | x=int(input())
a=int(input())
b=int(input())
print(x-a-b) | s396622176 | Accepted | 18 | 2,940 | 72 | x=int(input())
a=int(input())
b=int(input())
v=x-a
c=v//b
print(v-(c*b)) |
s210307042 | p03433 | u183976155 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 89 | E869120 has A 1-yen coins and infinitely many 500-yen coins. Determine if he can pay exactly N yen using only these coins. | N = int(input())
A = int(input())
if N % 500 <= A:
print("YES")
else:
print("NO") | s566445648 | Accepted | 17 | 2,940 | 89 | N = int(input())
A = int(input())
if N % 500 <= A:
print("Yes")
else:
print("No") |
s563095421 | p03067 | u973013625 | 2,000 | 1,048,576 | Wrong Answer | 17 | 2,940 | 93 | There are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively. Print `Yes` if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print `No` otherwise. | a, b, c = map(int, input().split())
print('Yes' if (a>c and b<c) or (a<c and b<c) else 'No' ) | s389482968 | Accepted | 17 | 2,940 | 93 | a, b, c = map(int, input().split())
print('Yes' if (a>c and b<c) or (a<c and b>c) else 'No' ) |
s703775981 | p03471 | u845937249 | 2,000 | 262,144 | Wrong Answer | 780 | 3,064 | 458 | The commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word "bill" refers to only these. According to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situat... |
n, y = map(int, input().split())
#a
#b
#c
i = 0
j = 0
k = 0
l = [-1,-1,-1]
#print(l)
for i in reversed(range(0,n+1)):
#print('i= %d' % i)
if y >= i*10000:
for j in reversed(range(0,n-i+1)):
#print('j= %d' % j)
k = n - i - j
#print('k= %d' % k)
if y... | s222797450 | Accepted | 724 | 3,064 | 637 |
n, y = map(int, input().split())
i = 0
j = 0
k = 0
l = [-1,-1,-1]
#print(l)
for i in reversed(range(0,n+1)):
#print('i= %d' % i)
if y >= i*10000:
for j in reversed(range(0,n-i+1)):
#print('j= %d' % j)
k = n - i - j
#print('k= %d' % k)
if y == i*1000... |
s784231363 | p04014 | u368796742 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 210 | For integers b (b \geq 2) and n (n \geq 1), let the function f(b,n) be defined as follows: * f(b,n) = n, when n < b * f(b,n) = f(b,\,{\rm floor}(n / b)) + (n \ {\rm mod} \ b), when n \geq b Here, {\rm floor}(n / b) denotes the largest integer not exceeding n / b, and n \ {\rm mod} \ b denotes the remainder of n d... | n = int(input())
s = int(input())
if s == 1:
print(n)
exit()
if s == n:
print(n+1)
exit()
if n%2 == 0 and s > n//2:
print(-1)
exit()
if n%2 == 1 and s > n//2+1:
print(-1)
exit()
| s844833669 | Accepted | 642 | 3,064 | 654 | n = int(input())
s = int(input())
if s == n:
print(n+1)
exit()
if s > n%2+n//2:
print(-1)
exit()
ans = float("INF")
for i in range(2,int(n**0.5)+1):
x = n
count = 0
while x >= i:
count += x%i
x //= i
if count + x == s:
print(i)
exit()
now = 2
li = in... |
s342644162 | p03815 | u163320134 | 2,000 | 262,144 | Wrong Answer | 17 | 3,064 | 104 | Snuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7. Snuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation: * Operation: Rotate the die 90° t... | n=int(input())
ans=2*n//11
n-=11*(n//11)
if n==0:
ans+=0
elif n<=6:
ans+=1
else:
ans+=2
print(ans) | s779918393 | Accepted | 17 | 2,940 | 100 | n=int(input())
ans=2*(n//11)
n=n%11
if n==0:
ans+=0
elif n<=6:
ans+=1
else:
ans+=2
print(ans)
|
s431066965 | p03547 | u556589653 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 123 | In programming, hexadecimal notation is often used. In hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters `A`, `B`, `C`, `D`, `E` and `F` are used to represent the values 10, 11, 12, 13, 14 and 15, respectively. In this problem, you are given two letters X and Y. Each X and Y is `A`, `B`, `C`,... | S = input().split()
X = int(S[0],16)
Y = int(S[1],16)
if X<Y:
print("<")
if X == Y:
print("=")
else:
print(">") | s592921874 | Accepted | 17 | 3,060 | 125 | S = input().split()
X = int(S[0],16)
Y = int(S[1],16)
if X<Y:
print("<")
elif X == Y:
print("=")
else:
print(">") |
s916563561 | p03998 | u790048565 | 2,000 | 262,144 | Wrong Answer | 18 | 3,064 | 299 | Alice, Bob and Charlie are playing _Card Game for Three_ , as below: * At first, each of the three players has a deck consisting of some number of cards. Each card has a letter `a`, `b` or `c` written on it. The orders of the cards in the decks cannot be rearranged. * The players take turns. Alice goes first. * ... | Sa = input()
Sb = input()
Sc = input()
dic = {'a':Sa, 'b':Sb, 'c':Sc}
doCont = True
person = 'a'
result = ''
while doCont:
drop_card = dic[person][0]
dic[person] = dic[person][1:]
if (len(dic[person]) == 0):
doCont = False
result = person.upper()
person = drop_card
print(result) | s482798284 | Accepted | 17 | 3,064 | 309 | Sa = input()
Sb = input()
Sc = input()
dic = {'a':Sa, 'b':Sb, 'c':Sc}
doCont = True
person = 'a'
result = ''
while doCont:
if (len(dic[person]) == 0):
doCont = False
result = person.upper()
break
drop_card = dic[person][0]
dic[person] = dic[person][1:]
person = drop_card
print(result) |
s089140421 | p03623 | u347397127 | 2,000 | 262,144 | Wrong Answer | 26 | 9,016 | 84 | Snuke lives at position x on a number line. On this line, there are two stores A and B, respectively at position a and b, that offer food for delivery. Snuke decided to get food delivery from the closer of stores A and B. Find out which store is closer to Snuke's residence. Here, the distance between two points s and... | a,b,c=map(int,input().split())
if abs(a-b)>abs(a-c):
print("A")
else:
print("B") | s095497236 | Accepted | 26 | 9,092 | 85 | a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):
print("A")
else:
print("B")
|
s194785241 | p02608 | u807315165 | 2,000 | 1,048,576 | Wrong Answer | 918 | 98,264 | 515 | Let f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions: * 1 \leq x,y,z * x^2 + y^2 + z^2 + xy + yz + zx = n Given an integer N, find each of f(1),f(2),f(3),\ldots,f(N). | # this is the third task
from collections import defaultdict
N=int(input())
n=1
s=3
brkLoop=False
while True :
r=(s)**2-(1)-(1)-(n)
if ( r >= N ):
break;
else:
n=n+1
s=s+1
out=defaultdict(list)
for (x,y,z) in tuple((i,j,k) for i in range(1, n+1) for j in range (1,n+1) for k in ... | s596833785 | Accepted | 874 | 98,180 | 519 | # this is the third task
from collections import defaultdict
N=int(input())
n=1
s=3
brkLoop=False
while True :
r=(s)**2-(1)-(1)-(n)
if ( r >= N ):
break;
else:
n=n+1
s=s+1
out=defaultdict(list)
for (x,y,z) in tuple((i,j,k) for i in range(1, n+1) for j in range (1,n+1) for k in ... |
s336939080 | p02608 | u021019433 | 2,000 | 1,048,576 | Wrong Answer | 160 | 9,332 | 279 | Let f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions: * 1 \leq x,y,z * x^2 + y^2 + z^2 + xy + yz + zx = n Given an integer N, find each of f(1),f(2),f(3),\ldots,f(N). | f = lambda x, y, z: (x + y + z) ** 2 - x * y - y * z - z * x - 1
n = int(input())
a = [0] * n
z = 1
while f(1, 1, z) < n:
y = 1
while y < z and f(1, y, z) < n:
x = 1
while f(x, y, z) < n:
a[f(x, y, z)] += 1
x += 1
y += 1
z += 1
print(*a, sep='\n')
| s622377954 | Accepted | 281 | 9,384 | 269 | f = lambda x, y, z: (x + y + z) ** 2 - x * y - y * z - z * x - 1
n = int(input())
a = [0] * n
z = 1
while f(1, 1, z) < n:
y = 1
while f(1, y, z) < n:
x = 1
while f(x, y, z) < n:
a[f(x, y, z)] += 1
x += 1
y += 1
z += 1
print(*a, sep='\n')
|
s773308839 | p02678 | u985972698 | 2,000 | 1,048,576 | Wrong Answer | 2,206 | 25,404 | 625 | There is a cave. The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 is a special room with an entrance from the outside. It is dark in th... | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
N,M = input_multiple_number()
A = [0]*M
B = [0]*M
ans = [0]*(N-1)
for i in range(M):
A[i],B[i... | s329299949 | Accepted | 1,412 | 34,356 | 614 | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
N,M = input_multiple_number()
shilve = [-1]*(N+1)
michi = [[] for _i in range(N+1)]
for i in ran... |
s782323964 | p03545 | u275812163 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 224 | Sitting in a station waiting room, Joisino is gazing at her train ticket. The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive). In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with `+` or `-` so that the formula holds. The given in... | I = input()
for param in range(2**(len(I)-1)):
ans = ""
for i in range(len(I)):
ans += I[i] + ["+","-",""][((param >> i) & 1) if i != len(I) - 1 else 2]
if eval(ans) == 7:
print(ans)
break | s663440031 | Accepted | 17 | 3,060 | 230 | I = input()
for param in range(2**(len(I)-1)):
ans = ""
for i in range(len(I)):
ans += I[i] + ["+","-",""][((param >> i) & 1) if i != len(I) - 1 else 2]
if eval(ans) == 7:
print(ans+"=7")
break
|
s679562377 | p03737 | u865413330 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 72 | You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between. Print the acronym formed from the uppercased initial letters of the words. | s1, s2, s3 = input().split()
print((s1[0] + s2[0] + s3[0]).capitalize()) | s731901545 | Accepted | 18 | 2,940 | 67 | s1, s2, s3 = input().split()
print((s1[0] + s2[0] + s3[0]).upper()) |
s636218241 | p02255 | u929141425 | 1,000 | 131,072 | Wrong Answer | 20 | 5,592 | 235 | Write a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode: for i = 1 to A.length-1 key = A[i] /* insert A[i] into the sorted sequence A[0,...,j-1] */ j = i - 1 while j >= 0 and A[j] > key ... | N = int(input())
A = list(map(int, input().split()))
for i in range(N):
print("----------")
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j+1] = A[j]
j -= 1
print(*A)
A[j+1] = v
print(*A)
| s431981198 | Accepted | 20 | 5,980 | 197 | N = int(input())
A = list(map(int, input().split()))
for i in range(N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j+1] = A[j]
j -= 1
A[j+1] = v
print(*A)
|
s841423192 | p03844 | u064408584 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 79 | Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her. | a,b,c=input().split()
if b=='+0':print(int(a)+int(c))
else:print(int(a)-int(c)) | s703216812 | Accepted | 17 | 2,940 | 78 | a,b,c=input().split()
if b=='+':print(int(a)+int(c))
else:print(int(a)-int(c)) |
s067376052 | p00007 | u028347703 | 1,000 | 131,072 | Wrong Answer | 20 | 5,672 | 114 | Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week. Write a program which computes the amount of the debt in n weeks. | import math
n = int(input())
b = 100
for i in range(n):
b += b * 0.05
b = math.ceil(b)
print("%d" % b * 1000) | s910513924 | Accepted | 20 | 5,660 | 117 | import math
n = int(input())
b = 100
for i in range(n):
b += b * 0.05
b = math.ceil(b)
b *= 1000
print("%d" % b) |
s643109181 | p03795 | u339199690 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 69 | Snuke has a favorite restaurant. The price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer. So far, Snuke has ordered N meals at the restaurant. Let the amount of money Snuke has paid to the restaurant ... | import math
n = int(input())
print(math.factorial(n) % (10**9 + 7))
| s444039459 | Accepted | 25 | 9,100 | 61 | N = int(input())
x = 800 * N
y = 200 * (N // 15)
print(x - y) |
s400364667 | p04043 | u277641173 | 2,000 | 262,144 | Wrong Answer | 17 | 3,064 | 194 | Iroha loves _Haiku_. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order. To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each ... | a,b,c=map(str,input().split())
if (len(a)==5 and len(b)==5 and len(c)==7) or(len(a)==5 and len(c)==5 and len(b)==7) or (len(c)==5 and len(b)==5 and len(a)==7):
print("YES")
else:
print("NO") | s072941743 | Accepted | 18 | 2,940 | 149 | a,b,c=map(int,input().split())
if (a==5 and b==5 and c==7) or(a==5 and c==5 and b==7) or (c==5 and b==5 and a==7):
print("YES")
else:
print("NO") |
s394036528 | p03679 | u484856305 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 140 | Takahashi has a strong stomach. He never gets a stomachache from eating something whose "best-by" date is at most X days earlier. He gets a stomachache if the "best-by" date of the food is X+1 or more days earlier, though. Other than that, he finds the food delicious if he eats it not later than the "best-by" date. Ot... | a,b,c=map(int,input().split())
l=abs(b-c)
print(l)
if a+1<l:
print("dangerous")
elif a>l:
print("delicious")
else:
print("safe") | s443929621 | Accepted | 17 | 2,940 | 116 | x,a,b=map(int,input().split())
if a>=b:
print("delicious")
elif a+x>=b:
print("safe")
else:
print("dangerous") |
s991133900 | p02291 | u426534722 | 1,000 | 131,072 | Wrong Answer | 20 | 7,724 | 733 | For given three points p1, p2, p, find the reflection point x of p onto p1p2. | import sys
from itertools import starmap
readline = sys.stdin.readline
class Segment(object):
__slots__ = ('fi', 'se')
def __init__(self, fi, se):
self.fi = fi
self.se = se
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
d... | s579501599 | Accepted | 30 | 7,904 | 763 | import sys
from itertools import starmap
readline = sys.stdin.readline
class Segment(object):
__slots__ = ('fi', 'se')
def __init__(self, fi, se):
self.fi = fi
self.se = se
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
d... |
s957967014 | p03495 | u412563426 | 2,000 | 262,144 | Wrong Answer | 305 | 55,056 | 302 | Takahashi has N balls. Initially, an integer A_i is written on the i-th ball. He would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls. Find the minimum number of balls that Takahashi needs to rewrite the integers on them. | from collections import Counter
n, k = map(int, input().split())
a = list(map(int, input().split()))
B = set(a)
d = Counter(a)
num = len(B) - k
c = d.most_common()
print(c)
ans = 0
for i in range(1, num+1):
ans += c[-i][1]
print(ans) | s428115386 | Accepted | 225 | 50,484 | 293 | from collections import Counter
n, k = map(int, input().split())
a = list(map(int, input().split()))
B = set(a)
d = Counter(a)
num = len(B) - k
c = d.most_common()
ans = 0
for i in range(1, num+1):
ans += c[-i][1]
print(ans) |
s835070122 | p03626 | u982762220 | 2,000 | 262,144 | Wrong Answer | 18 | 3,064 | 507 | We have a board with a 2 \times N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1 \times 2 or 2 \times 1 square. Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors... | N = int(input())
S1 = input()
S2 = input()
res = 6
idx = 0
s = []
mod = 1000000007
while idx < N:
if S1[idx] == S2[idx]:
s.append(0)
else:
s.append(1)
idx += 1
idx += 1
res = 3 if s[0] == 0 else 6
for idx in range(1, len(s)):
prev, cur = s[idx-1], s[idx]
if prev == 0:
... | s949315330 | Accepted | 17 | 3,064 | 503 | N = int(input())
S1 = input()
S2 = input()
res = 6
idx = 0
s = []
mod = 1000000007
while idx < N:
if S1[idx] == S2[idx]:
s.append(0)
else:
s.append(1)
idx += 1
idx += 1
res = 3 if s[0] == 0 else 6
for idx in range(1, len(s)):
prev, cur = s[idx-1], s[idx]
if prev == 0:
... |
s787178069 | p03486 | u685263709 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 133 | You are given strings s and t, consisting of lowercase English letters. You will create a string s' by freely rearranging the characters in s. You will also create a string t' by freely rearranging the characters in t. Determine whether it is possible to satisfy s' < t' for the lexicographic order. | S = ''.join(sorted(list(input())))
T = ''.join(sorted(list(input()), reverse=True))
if S < T:
print('YES')
else:
print('NO') | s534063302 | Accepted | 17 | 2,940 | 133 | S = ''.join(sorted(list(input())))
T = ''.join(sorted(list(input()), reverse=True))
if S < T:
print('Yes')
else:
print('No') |
s854189742 | p03598 | u882370611 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 162 | There are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i). Thus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N. In order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B. Then, he placed the i-th type-A robot at coordinates (0, i), and the i-th t... | n = int(input())
k = int(input())
x = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += 2 * min(x[i], k-x[i]) + max(x[i], k-x[i])
print(ans) | s181159037 | Accepted | 17 | 3,060 | 142 | n = int(input())
k = int(input())
x = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += 2 * min(x[i], k-x[i])
print(ans) |
s030518823 | p03457 | u612261372 | 2,000 | 262,144 | Wrong Answer | 410 | 27,380 | 303 | AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i. If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1... | N = int(input())
P = [list(map(int, input().split())) for i in range(N)]
P.insert(0,[0,0,0])
ans = "YES"
for i in range(N):
norm = abs(P[i+1][1]-P[i][1])+abs(P[i+1][2]-P[i][2])
if (P[i+1][0]-P[i][0])%2 != norm%2:
ans = "NO"
break
#else:
# if norm %2 == 0:
# break
print(ans) | s367169401 | Accepted | 410 | 27,380 | 284 | N = int(input())
P = [list(map(int, input().split())) for i in range(N)]
P.insert(0,[0,0,0])
ans = "Yes"
for i in range(N):
norm = abs(P[i+1][1]-P[i][1])+abs(P[i+1][2]-P[i][2])
move = (P[i+1][0]-P[i][0]) - norm
if ((move%2 != 0) or (move < 0)):
ans = "No"
break
print(ans) |
s973522106 | p03477 | u865413330 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 147 | A balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R. Takahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and pl... | a, b, c, d = map(int, input().split())
if (a + b) > (c + d):
print("Left")
if (a + b) < (c + d):
print("Right")
else:
print("Balanced") | s542731782 | Accepted | 18 | 3,060 | 149 | a, b, c, d = map(int, input().split())
if (a + b) > (c + d):
print("Left")
elif (a + b) < (c + d):
print("Right")
else:
print("Balanced") |
s448339963 | p03543 | u274615057 | 2,000 | 262,144 | Wrong Answer | 27 | 8,824 | 155 | We call a 4-digit integer with three or more consecutive same digits, such as 1118, **good**. You are given a 4-digit integer N. Answer the question: Is N **good**? |
def main():
n = input()
if len(n) == 1 or len(n) == 2:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
| s078671434 | Accepted | 27 | 9,072 | 356 |
def main():
n = input()
cnt = 0
if n[0] == n[1]:
cnt += 1
else:
cnt = 0
for i in range(2, 4):
if n[i-1] == n[i]:
cnt += 1
else:
cnt -= 1
if cnt >= 2:
print('Yes')
break
if cnt < 2:
print('No')
if... |
s247991460 | p03360 | u267325300 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 95 | There are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times: * Choose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n. What is the largest possible sum of the integers written on the blackboard after... | A, B, C = map(int, input().split())
K = int(input())
m = max(A, B, C)
print(A + B + C + 3 * m)
| s370349426 | Accepted | 17 | 3,064 | 104 | A, B, C = map(int, input().split())
K = int(input())
m = max(A, B, C)
print(A + B + C + (2**K - 1) * m)
|
s871652427 | p02408 | u792747184 | 1,000 | 131,072 | Wrong Answer | 20 | 5,592 | 745 | Taro is going to play a card game. However, now he has only n cards, even though there should be 52 cards (he has no Jokers). The 52 cards include 13 ranks of each of the four suits: spade, heart, club and diamond. | n = int(input())
for i in range(n):
k = input().split()
if k[0] == 'S':
for i in range(1,14):
if int(k[1])==i:
continue
else:
print('S {0}'.format(i))
if k[0] == 'H':
for i in range(1,14):
if int(k[1])==i:
co... | s435319535 | Accepted | 20 | 5,616 | 691 | n = int(input())
S = [1,2,3,4,5,6,7,8,9,10,11,12,13]
C = [1,2,3,4,5,6,7,8,9,10,11,12,13]
H = [1,2,3,4,5,6,7,8,9,10,11,12,13]
D = [1,2,3,4,5,6,7,8,9,10,11,12,13]
for i in range(n):
variations,number = input().split()
if variations == 'S':
S.remove(int(number))
if variations == 'C':
C.remove(... |
s835528006 | p03557 | u803848678 | 2,000 | 262,144 | Wrong Answer | 2,105 | 28,568 | 463 | The season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower. He has N parts for each of the three categories. The size of the i-th upper ... | N = int(input())
ue = list(set(list(map(int, input().split()))))
mid = list(set(list(map(int, input().split()))))
bot = list(set(list(map(int, input().split()))))
ue.sort()
mid.sort()
bot.sort()
ans = 0
for i in ue:
for j in mid:
if j <= i:
continue
else:
for k in range(len... | s674247167 | Accepted | 319 | 23,360 | 323 | import bisect
N = int(input())
ue = (list(map(int, input().split())))
mid = (list(map(int, input().split())))
bot = (list(map(int, input().split())))
ue.sort()
mid.sort()
bot.sort()
ans = 0
for i in mid:
ans += bisect.bisect_left(ue, i) * (len(bot) - bisect.bisect_right(bot, i))
print(ans)
|
s779638791 | p03555 | u945359338 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 74 | You are given a grid with 2 rows and 3 columns of squares. The color of the square at the i-th row and j-th column is represented by the character C_{ij}. Write a program that prints `YES` if this grid remains the same when rotated 180 degrees, and prints `NO` otherwise. | A = input()
B = input()
if A == B[::-1]:
print("Yes")
else:
print("No") | s569013783 | Accepted | 17 | 2,940 | 71 | A = input()
B = input()
print("YES") if A == B[::-1] else print("NO") |
s142939560 | p00001 | u538041865 | 1,000 | 131,072 | Wrong Answer | 20 | 7,644 | 209 | There is a data which provides heights (in meter) of mountains. The data is only for ten mountains. Write a program which prints heights of the top three mountains in descending order. | inputList = []
while True:
try:
num = int(input())
except EOFError:
break
inputList.append(num)
inputList.sort()
for x in range(len(inputList) - 1, -1, -1):
print(inputList[x]) | s911321383 | Accepted | 20 | 7,632 | 221 | inputList = []
while True:
try:
num = int(input())
except EOFError:
break
inputList.append(num)
inputList.sort()
length = len(inputList)
for i in range(3):
print(inputList[length - i - 1]) |
s094316228 | p03469 | u835482198 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 32 | On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as `2018/01/23`. After finishing the document, she noticed that she had mistakenly wrote `2017` at the beginning of the date col... | s = input()
print('2017/s[4:]')
| s112501781 | Accepted | 17 | 2,940 | 42 | s = input()
print('2018{}'.format(s[4:]))
|
s802646904 | p03861 | u792512290 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 54 | You are given nonnegative integers a and b (a ≤ b), and a positive integer x. Among the integers between a and b, inclusive, how many are divisible by x? | a, b, x = map(int, input().split(" "))
print((b-a)//x) | s390672752 | Accepted | 17 | 2,940 | 74 | a, b, x = map(int, input().split(" "))
ans = b//x - (a - 1)//x
print(ans) |
s412575676 | p03779 | u934868410 | 2,000 | 262,144 | Wrong Answer | 28 | 2,940 | 66 | There is a kangaroo at coordinate 0 on an infinite number line that runs from left to right, at time 0. During the period between time i-1 and time i, the kangaroo can either stay at his position, or perform a jump of length exactly i to the left or to the right. That is, if his coordinate at time i-1 is x, he can be a... | x=int(input())
s = 0
t = 0
while s < x:
s += t
t += 1
print(t) | s130496047 | Accepted | 28 | 2,940 | 98 | x=int(input())
s = 0
t = 0
while True:
s += t
if s >= x:
break
t += 1
print(t) |
s203461786 | p03943 | u235066013 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 105 | Two students of AtCoder Kindergarten are fighting over candy packs. There are three candy packs, each of which contains a, b, and c candies, respectively. Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible. Not... | a,b,c=[int(i) for i in input().split()]
if a+b==c or b+c==a or c+a==b:
print('YES')
else:
print('NO') | s729940869 | Accepted | 17 | 2,940 | 111 | a,b,c=[int(i) for i in input().split()]
if (a+b)==c or (b+c)==a or (c+a)==b:
print('Yes')
else:
print('No') |
s141191320 | p02612 | u038404105 | 2,000 | 1,048,576 | Wrong Answer | 31 | 9,144 | 30 | We will buy a product for N yen (the currency of Japan) at a shop. If we use only 1000-yen bills to pay the price, how much change will we receive? Assume we use the minimum number of bills required. | n = int(input())
print(n%1000) | s747688290 | Accepted | 24 | 9,148 | 77 | n = int(input())
if n%1000 == 0:
print(0)
else:
print(1000 - n%1000) |
s701496519 | p03079 | u646130340 | 2,000 | 1,048,576 | Wrong Answer | 18 | 2,940 | 97 | You are given three integers A, B and C. Determine if there exists an equilateral triangle whose sides have lengths A, B and C. | A, B, C = map(int, input().split())
if A == B and B == C:
print('YES')
else:
print('NO')
| s430984312 | Accepted | 17 | 2,940 | 96 | A, B, C = map(int, input().split())
if A == B and B == C:
print('Yes')
else:
print('No') |
s432030937 | p03814 | u033606236 | 2,000 | 262,144 | Wrong Answer | 39 | 3,516 | 269 | Snuke has decided to construct a string that starts with `A` and ends with `Z`, by taking out a substring of a string s (that is, a consecutive part of s). Find the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with `A` and ends w... | Strings = input()
for i in range(0,len(Strings)):
if Strings[i] == "A":
length = i
print(i)
break
for i in range(len(Strings))[::-1]:
if Strings[i] == "Z":
length2 = i
print(i)
break
print(length2 - length +1 ) | s188233818 | Accepted | 36 | 3,512 | 235 | Strings = input()
for i in range(0,len(Strings)):
if Strings[i] == "A":
length = i
break
for i in range(len(Strings))[::-1]:
if Strings[i] == "Z":
length2 = i
break
print(length2 - length +1 ) |
s597441281 | p03545 | u098572984 | 2,000 | 262,144 | Wrong Answer | 18 | 3,060 | 387 | Sitting in a station waiting room, Joisino is gazing at her train ticket. The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive). In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with `+` or `-` so that the formula holds. The given in... | from itertools import product
s = tuple(map(int, tuple(input())))
options = (-1, 1)
for op1, op2, op3 in product(options, repeat=3):
if (s[0] + s[1] * op1 + s[2] * op2 + s[3] * op3) == 7:
_op1 = "+" if op1 == 1 else "-"
_op2 = "+" if op2 == 1 else "-"
_op3 = "+" if op3 == 1 else "-"
... | s936861007 | Accepted | 18 | 3,064 | 401 | from itertools import product
s = tuple(map(int, tuple(input())))
options = (-1, 1)
for op1, op2, op3 in product(options, repeat=3):
if (s[0] + s[1] * op1 + s[2] * op2 + s[3] * op3) == 7:
_op1 = "+" if op1 == 1 else "-"
_op2 = "+" if op2 == 1 else "-"
_op3 = "+" if op3 == 1 else "-"
... |
s920124021 | p03129 | u849756457 | 2,000 | 1,048,576 | Wrong Answer | 27 | 9,104 | 97 | Determine if we can choose K different integers between 1 and N (inclusive) so that no two of them differ by 1. | N, K = [int(i) for i in input().split()]
if K < (N - 1) // 2:
print("YES")
else:
print("NO") | s889654031 | Accepted | 30 | 9,156 | 105 | N, K = [int(i) for i in input().split()]
if (K - 1) <= (N - 1) // 2:
print("YES")
else:
print("NO") |
s229855636 | p03564 | u880277518 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 115 | Square1001 has seen an electric bulletin board displaying the integer 1. He can perform the following operations A and B to change this value: * Operation A: The displayed value is doubled. * Operation B: The displayed value increases by K. Square1001 needs to perform these operations N times in total. Find the m... | n=int(input())
k=int(input())
s=1
for i in range(n):
if (2*s)<k:
s=2*s
else:
s+=k
print(s) | s546785422 | Accepted | 17 | 2,940 | 94 | N=int(input())
K=int(input())
n=1
for i in range(N):
n=min(n*2,n+K)
#print(n)
print(n) |
s681236318 | p03912 | u223904637 | 2,000 | 262,144 | Wrong Answer | 184 | 21,808 | 659 | Takahashi is playing with N cards. The i-th card has an integer X_i on it. Takahashi is trying to create as many pairs of cards as possible satisfying one of the following conditions: * The integers on the two cards are the same. * The sum of the integers on the two cards is a multiple of M. Find the maximum nu... | n,m=map(int,input().split())
p=[0]*m
pp=[[] for i in range(m)]
l=list(map(int,input().split()))
l.sort()
for i in l:
p[i%m]+=1
ans=0
if m%2==0:
ans+=p[m//2]//2
p[m//2]=0
ans+=p[0]//2
p[0]=0
for i in range(1,m//2):
if p[i]>=p[m-i]:
ans+=p[m-i]
p[i]-=p[m-i]
p[m-i]=0
else:
... | s135750411 | Accepted | 200 | 14,072 | 712 | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
x = list(map(int,input().split()))
x.sort()
p = [0]*m
q = [0]*m
cnt = 1
for i in range(n):
q[x[i]%m] += 1
if i == n-1 or x[i] != x[i+1]:
p[x[i]%m] += cnt//2
cnt = 1
else:
cnt += 1
res = 0
for i in range(m):
... |
s498332007 | p03730 | u396890425 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 121 | We ask you to select some number of positive integers, and calculate the sum of them. It is allowed to select as many integers as you like, and as large integers as you wish. You have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer. Your objecti... | a,b,c=map(int, input().split())
list=[]
for i in range(b):
list.append(a*(i+1)%b)
print('Yes' if c in list else 'No') | s915961692 | Accepted | 17 | 2,940 | 121 | a,b,c=map(int, input().split())
list=[]
for i in range(b):
list.append(a*(i+1)%b)
print('YES' if c in list else 'NO') |
s795271362 | p03693 | u403551852 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 80 | AtCoDeer has three cards, one red, one green and one blue. An integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card. We will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer. Is this i... | r,g,b = map(int,input().split())
print('Yes' if (r*100+g*10+b)%4 == 0 else 'No') | s492124132 | Accepted | 17 | 2,940 | 80 | r,g,b = map(int,input().split())
print('YES' if (r*100+g*10+b)%4 == 0 else 'NO') |
s823116067 | p03672 | u928784113 | 2,000 | 262,144 | Wrong Answer | 17 | 3,060 | 211 | We will call a string that can be obtained by concatenating two equal strings an _even_ string. For example, `xyzxyz` and `aaaaaa` are even, while `ababab` and `xyzxy` are not. You are given an even string S consisting of lowercase English letters. Find the length of the longest even string that can be obtained by del... | S = input()
for i in range(len(S)):
S = S[:-1]
if len(S) % 2 == 1:
continue
else:
if S[:len(S)//2] == S[len(S)//2:len(S)]:
print(len(S))
else:
continue | s414727021 | Accepted | 17 | 3,060 | 251 | S = input()
S = S[:-1]
def cutstring(s):
n = len(s)
if n % 2 == 1:
return cutstring(s[:-1])
else:
if s[:n//2] == s[n//2:]:
return n
else:
return cutstring(s[:-1])
ans = cutstring(S)
print(ans) |
s320118741 | p03610 | u493491792 | 2,000 | 262,144 | Wrong Answer | 39 | 3,316 | 101 | You are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1. | n=input()
print(len(n))
word=""
for i in range(len(n)):
if i%2==0:
word+=n[i]
print(word) | s485151565 | Accepted | 40 | 3,188 | 87 | n=input()
word=""
for i in range(len(n)):
if i%2==0:
word+=n[i]
print(word) |
s097181408 | p03544 | u731368968 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 91 | It is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers. You are given an integer N. Find the N-th Lucas number. Here, the i-th Lucas number L_i is defined as follows: * L_0=2 * L_1=1 * L_i=L_{i-1}+L_{i-2} (i≥2) | n = int(input())
l = [2, 0]
for i in range(2, n):
l.append(l[-1] + l[-2])
print(l[-1])
| s752697547 | Accepted | 18 | 2,940 | 92 | n = int(input())
l = [2, 1]
for i in range(2, n+1):
l.append(l[-1] + l[-2])
print(l[n])
|
s807858810 | p03962 | u014333473 | 2,000 | 262,144 | Wrong Answer | 33 | 9,064 | 24 | AtCoDeer the deer recently bought three paint cans. The color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c. Here, the color of each paint can is represented by an integer between 1 and 100, inclusive. Since he is forgetful, he migh... | print(len(set(input()))) | s263805884 | Accepted | 25 | 9,020 | 32 | print(len(set(input().split()))) |
s027102348 | p03455 | u874081738 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 99 | AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd. | a, b = map(int,input().split())
if (a*b)%2 == 0:
print("Odd")
else:
print("Even")
| s766896239 | Accepted | 17 | 3,064 | 95 | a, b = map(int,input().split())
if (a*b)%2 :
print("Odd")
else:
print("Even")
|
s947495744 | p03251 | u911575040 | 2,000 | 1,048,576 | Wrong Answer | 309 | 2,940 | 258 | Our world is one-dimensional, and ruled by two empires called Empire A and Empire B. The capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y. One day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes incli... | n,m,x,y=map(int,input().split())
ans="No War"
a=list(map(int,input().split()))
b=list(map(int,input().split()))
for i in range(x+1,y+1):
for j in range(n):
for k in range(m):
if a[j]>=i or i>b[k]:
ans="War"
print(ans)
| s679923170 | Accepted | 21 | 3,060 | 266 | N, M, X, Y = map(int, input().split())
list_x = [int(i) for i in input().split()]
list_y = [int(j) for j in input().split()]
if max(list_x) >= min(list_y):
print('War')
else:
if X < max(list_x) + 1 <= Y:
print('No War')
else:
print('War') |
s942702828 | p04029 | u032798323 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 60 | There are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total? | N = int(input())
a = 0
for i in range(N):
a+= i
print(a) | s542354061 | Accepted | 17 | 2,940 | 62 | N = int(input())
a = 0
for i in range(N):
a+= i+1
print(a) |
s769385084 | p03719 | u443736699 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 101 | You are given three integers A, B and C. Determine whether C is not less than A and not greater than B. | a,b,c = list(map(int,input().strip().split()))
if c>=a and c<=b:
print("YES")
exit()
print("NO") | s769520495 | Accepted | 17 | 2,940 | 103 | a,b,c = list(map(int,input().strip().split()))
if c >= a and c <=b:
print("Yes")
else:
print("No") |
s015116374 | p03438 | u838644735 | 2,000 | 262,144 | Wrong Answer | 24 | 4,596 | 517 | You are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N. Determine if we can repeat the following operation zero or more times so that the sequences a and b become equal. Operation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two ac... | def main():
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
expected = sum(B) - sum(A)
if expected < 0:
print('NO')
return
add_a, add_b = 0, 0
for i in range(N):
a, b = A[i], B[i]
if a > b:
add_b += a -... | s155921420 | Accepted | 24 | 4,596 | 535 | def main():
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
expected = sum(B) - sum(A)
if expected < 0:
print('No')
return
add_a, add_b = 0, 0
for i in range(N):
a, b = A[i], B[i]
if a > b:
add_b += a -... |
s844633422 | p00016 | u957840591 | 1,000 | 131,072 | Wrong Answer | 40 | 7,900 | 302 | When a boy was cleaning up after his grand father passing, he found an old paper: In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the second integer". His grand mother says that Sanbonmatsu was standing at t... | from math import *
x = 0
y = 0
D = []
A = []
while True:
d, a = map(int, input().split(","))
if a == 0 and d == 0:
break
else:
D.append(d)
A.append(a)
for i in range(len(A)):
x = x + D[i] * cos(A[i] * pi / 180)
y = y + D[i] * sin(A[i] * pi / 180)
print(x,y) | s663548685 | Accepted | 30 | 7,856 | 551 | from math import *
x = 0
y = 0
D = []
A = []
sum_a = -90
while True:
d, a = map(int, input().split(","))
if a == 0 and d == 0:
break
else:
D.append(d)
A.append(a)
for i in range(len(A)):
x = x + D[i] * cos(sum_a * pi / 180)
y = y - D[i] * sin(sum_a * pi / 180)
if abs(x-r... |
s424202397 | p00711 | u741801763 | 1,000 | 131,072 | Wrong Answer | 310 | 7,652 | 1,035 | There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles. Write a program to count the number of black tiles which he can r... | if __name__ == "__main__":
while 1:
w,h = list(map(int,input().strip().split()))
if w == h == 0:break
data = []
data = []
for _ in range(h):data.append(list(input()))
visited = []
for i in range(h):
if '@'in data[i]:stack= [(i,data[i].index('@'))]
... | s050711682 | Accepted | 300 | 7,736 | 1,099 |
if __name__ == "__main__":
while 1:
w,h = list(map(int,input().strip().split()))
if w == h == 0:break
data = []
data = []
for _ in range(h):data.append(list(input()))
visited = []
for i in range(h):
if '@'in data[i]:stack= [(i,data[i].index('@'))... |
s099889214 | p03048 | u593567568 | 2,000 | 1,048,576 | Wrong Answer | 1,723 | 2,940 | 171 | Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes: * Red boxes, each containing R red balls * Green boxes, each containing G green balls * Blue boxes, each containing B blue balls Snuke wants to get a total of exactly N balls by buying r red boxes, g... | R,G,B,N = map(int,input().split())
ans = 0
for r in range(R):
if N < r:
continue
for g in range(G):
if (N - r - g) <= B:
ans += 1
print(ans) | s515730448 | Accepted | 1,912 | 2,940 | 260 | R,G,B,N = map(int,input().split())
ans = 0
for r in range(3010):
red = r * R
if N < red:
break
for g in range(3010):
green = g * G
blue = N - red - green
if blue < 0:
break
if blue % B == 0:
ans += 1
print(ans)
|
s216429949 | p02390 | u064313887 | 1,000 | 131,072 | Wrong Answer | 20 | 5,592 | 93 | Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively. | S = int(input())
h = S / 3600
m = (S % 3600) / 60
s = (S % 3600) % 60
print(h,":",m,":",s)
| s291464243 | Accepted | 20 | 5,584 | 85 | x = int(input())
h = x // 3600
m = x % 3600 // 60
s = x % 60
print(h,m,s,sep=':')
|
s365873461 | p03455 | u889564559 | 2,000 | 262,144 | Wrong Answer | 148 | 12,504 | 194 | AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd. | import numpy as np
a, b = map(str,input().split())
target = int(a + b)
target_full = np.sqrt(target)
target_resid = target_full % 1
if target_resid == 0:
print("Yes")
else:
print("No")
| s673755590 | Accepted | 17 | 2,940 | 108 | a, b = map(int,input().split())
target = a * b
if target % 2 == 1:
print("Odd")
else:
print("Even")
|
s645959709 | p03636 | u187205913 | 2,000 | 262,144 | Wrong Answer | 18 | 2,940 | 56 | The word `internationalization` is sometimes abbreviated to `i18n`. This comes from the fact that there are 18 letters between the first `i` and the last `n`. You are given a string s of length at least 3 consisting of lowercase English letters. Abbreviate s in the same way. | s = input()
print('{}{}{}'.format(s[1],len(s)-2,s[-1]))
| s696774369 | Accepted | 18 | 2,940 | 55 | s = input()
print('{}{}{}'.format(s[0],len(s)-2,s[-1])) |
s745752342 | p03494 | u296463304 | 2,000 | 262,144 | Wrong Answer | 27 | 9,112 | 222 | There are N positive integers written on a blackboard: A_1, ..., A_N. Snuke can perform the following operation when all integers on the blackboard are even: * Replace each integer X on the blackboard by X divided by 2. Find the maximum possible number of operations that Snuke can perform. | # coding = utf-8
f=input("")
ra=input("")
a=ra.split()
lista=[int(s) for s in a]
mix=1
base=0
for num in lista:
for n in range(9):
if num % 2**n :
pass
else:
break
if base<n:
bace=n
print(n) | s221781657 | Accepted | 27 | 9,128 | 207 | # coding = utf-8
n=input("")
a=input("")
a=a.split(" ")
a=[int(s) for s in a]
a.sort()
base=100000
n=1
for num in a:
while num%2**n==0:
n=n+1
n=n-1
if n < base:
base=n
print(base) |
s542307038 | p03361 | u679888753 | 2,000 | 262,144 | Wrong Answer | 20 | 3,064 | 409 | We have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j). Initially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i... | H, W = map(int, input().split())
S = [['.']*(W + 2)] + [list('.' + input() + '.') for _ in range(H)] + [['.']*(W + 2)]
# print(S)
for i in range(1, H):
for k in range(1, W):
if S[i][k] == '#' and S[i][k - 1] != '#' and S[i - 1][k] != '#' and S[i][k + 1] != '#' and S[i + 1][k] != '#':
print('Yes... | s950152637 | Accepted | 18 | 3,064 | 409 | H, W = map(int, input().split())
S = [['.']*(W + 2)] + [list('.' + input() + '.') for _ in range(H)] + [['.']*(W + 2)]
# print(S)
for i in range(1, H):
for k in range(1, W):
if S[i][k] == '#' and S[i][k - 1] != '#' and S[i - 1][k] != '#' and S[i][k + 1] != '#' and S[i + 1][k] != '#':
print('No'... |
s834914520 | p03729 | u739721456 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 100 | You are given three strings A, B and C. Check whether they form a _word chain_. More formally, determine whether both of the following are true: * The last character in A and the initial character in B are the same. * The last character in B and the initial character in C are the same. If both are true, print `Y... | w=input().split()
if w[0][-1]==w[1][0] and w[1][-1]==w[2][0]:
print("Yes")
else:
print("No") | s543831561 | Accepted | 17 | 2,940 | 100 | w=input().split()
if w[0][-1]==w[1][0] and w[1][-1]==w[2][0]:
print("YES")
else:
print("NO") |
s360623357 | p02603 | u462329577 | 2,000 | 1,048,576 | Wrong Answer | 30 | 9,240 | 761 | To become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives. He is famous across the country for his ability to foresee the future. He already knows that the price of one stock in the n... | #!/usr/bin/env python3
n = int(input())
a = list(map(int, input().split()))
# init
tmp = a[0]
bit_buy = 1
init_bit = 1
money = 1000
ans = money
stock_num = 0
for i in range(1, n):
if bit_buy and a[i] > a[i - 1]:
stock_num = money // a[i - 1]
money = money - stock_num * a[i - 1]
... | s991644993 | Accepted | 29 | 9,172 | 237 | #!/usr/bin/env python3
n = int(input())
a = list(map(int, input().split()))
soko = a[0]
urine = 0
ans = 1000
for i in range(len(a) - 1):
if a[i] < a[i + 1]:
ans += (ans // a[i]) * (a[i + 1] - a[i])
#print(ans)
print(ans)
|
s969731517 | p03555 | u218494572 | 2,000 | 262,144 | Wrong Answer | 17 | 2,940 | 113 | You are given a grid with 2 rows and 3 columns of squares. The color of the square at the i-th row and j-th column is represented by the character C_{ij}. Write a program that prints `YES` if this grid remains the same when rotated 180 degrees, and prints `NO` otherwise. | s = input()
t = input()
if s[0] == t[2] and s[1] == t[2] and s[2] == t[0]:
print('YES')
else:
print('NO') | s184960542 | Accepted | 17 | 2,940 | 114 | s = input()
t = input()
if s[0] == t[2] and s[1] == t[1] and s[2] == t[0]:
print('YES')
else:
print('NO')
|
s089591736 | p03854 | u248670337 | 2,000 | 262,144 | Wrong Answer | 23 | 6,516 | 87 | You are given a string S consisting of lowercase English letters. Another string T is initially empty. Determine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times: * Append one of the following at the end of T: `dream`, `dreamer`, `erase` and `eraser`. | import re
print('Yes' if re.match('^(dream|dreamer|erase|eraser)+$',input()) else 'No') | s814154062 | Accepted | 23 | 6,516 | 87 | import re
print('YES' if re.match('^(dream|dreamer|erase|eraser)+$',input()) else 'NO') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.