Datasets:

TnT

/

CodeNet4Repair

like 0

s411607127

p03644

u790877102

Wrong Answer

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 be divided by 2 without remainder. For example, * 6 can be divided by 2 once: 6 -> 3. * 8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1. * 3 can be divided by 2 zero times.

N = int(input()) a = 0 while N%(2**a)==0: a += 1 b = 2**(a-1) print(b)

s060038973

Accepted

import math N = int(input()) M = math.floor(math.log2(N)) print(2**M)

s977999044

p03543

u203995947

Wrong Answer

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**?

n = list(input()) print(n) if n[1] != n[2]: print('No') elif n[0] == n[1] or n[2] == n[3]: print('Yes') else: print('No')

s705429025

Accepted

n = list(input()) #print(n) if n[1] != n[2]: print('No') elif n[0] == n[1] or n[2] == n[3]: print('Yes') else: print('No')

s862620787

p03719

u708211626

Wrong Answer

You are given three integers A, B and C. Determine whether C is not less than A and not greater than B.

a=list(map(int,input().split())) if a[2]>=a[0] and a[2]<=a[1]: print('YES') else: print('NO')

s628556772

Accepted

a=list(map(int,input().split())) if (a[2]>=a[0]) and (a[2]<=a[1]): print('Yes') else: print('No')

s944056482

p03434

u602158689

Wrong Answer

We have N cards. A number a_i is written on the i-th card. Alice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first. The game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.

n = int(input()) alice = 0 bob = 0 cards = [int(val) for val in input().split()] cards = sorted(cards, reverse=True) print(cards) for i in range(n): if i % 2 == 0: alice += int(cards[i]) else: bob += int(cards[i]) print(alice - bob)

s341894914

Accepted

n = int(input()) a,b = 0,0 cards = [int(val) for val in input().split()] cards = sorted(cards, reverse=True) for i in range(n): if i % 2 == 0: a += cards[i] else: b += cards[i] print(a - b)

s275170279

p02613

u304590784

Wrong Answer

Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A. The problem has N test cases. For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively. See the Output section for the output format.

N = int(input()) S = [input() for i in range(N)] print("AC × "+str( S.count("AC"))) print("WA × "+str( S.count("WA"))) print("TLE × "+str( S.count("TLE"))) print("RE × "+str( S.count("RE")))

s156505191

Accepted

N = int(input()) S = [input() for i in range(N)] print("AC x "+str( S.count("AC"))) print("WA x "+str( S.count("WA"))) print("TLE x "+str( S.count("TLE"))) print("RE x "+str( S.count("RE")))

s624222019

p03606

u136090046

Wrong Answer

Joisino is working as a receptionist at a theater. The theater has 100000 seats, numbered from 1 to 100000. According to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive). How many people are sitting at the theater now?

value = int(input()) seat_list = [] people = 0 while True: try: seat = input() seat_list.append(seat.split(" ")) except EOFError: break def aaa(seat_list, people): people = seat_list[len(seat_list)-1] - seat_list[0] print(people)

s606517915

Accepted

n = int(input()) cnt = 0 for i in range(n): l, r = map(int, input().split()) cnt += (r-l+1) print(cnt)

s716679984

p03438

u619819312

Wrong Answer

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 actions **simultaneously** : * Add 2 to a_i. * Add 1 to b_j.

n=int(input()) a=list(map(int,input().split())) b=list(map(int,input().split())) c=0 d=0 for i in range(n): if b[i]<a[i]: d+=b[i]-a[i] else: k=b[i]-a[i] if k%2==1: d+=1 c+=(k+1)//2 else: c+=k//2 print("Yes" if d>=c else"No")

s078957168

Accepted

n=int(input()) a=list(map(int,input().split())) b=list(map(int,input().split())) c=0 d=0 for i in range(n): if b[i]<=a[i]: d+=a[i]-b[i] else: k=b[i]-a[i] if k%2==1: d+=1 c+=(k+1)//2 else: c+=k//2 print("Yes" if c>=d else"No")

s660741282

p03673

u839857256

Wrong Answer

You are given an integer sequence of length n, a_1, ..., a_n. Let us consider performing the following n operations on an empty sequence b. The i-th operation is as follows: 1. Append a_i to the end of b. 2. Reverse the order of the elements in b. Find the sequence b obtained after these n operations.

n = int(input()) n_list = list(map(int, input().split())) new_list = [] for i in range(n): tmp = int(n_list[0]) n_list.pop(0) new_list.append(tmp) new_list.reverse() print(new_list)

s304503678

Accepted

from collections import deque n = int(input()) a_list = list(map(int, input().split())) q = deque([]) if n%2 == 0: for i in range(n): if i%2 == 0: q.append(a_list[i]) else: q.appendleft(a_list[i]) else: for i in range(n): if i%2 == 1: q.append(a_list[i]) else: q.appendleft(a_list[i]) b = map(str, list(q)) print(' '.join(b))

s481346288

p03338

u172873334

Wrong Answer

You are given a string S of length N consisting of lowercase English letters. We will cut this string at one position into two strings X and Y. Here, we would like to maximize the number of different letters contained in both X and Y. Find the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.

alpha = [chr(i) for i in range(97,97 + 26)] def Count(s,t): ret = 0 for i in alpha: if i in s and i in t:ret+=1 return ret n = int(input()) s = input() ans = 0 for i in range(1,n): print(s[:i],s[i:]) print(ans)

s645351200

Accepted

alpha = [chr(i) for i in range(97,97 + 26)] def Count(s,t): ret = 0 for i in alpha: if i in s and i in t:ret+=1 return ret n = int(input()) s = input() ans = 0 for i in range(1,n): ans = max(ans,Count(s[:i],s[i:])) print(ans)

s964209386

p03605

u734485933

Wrong Answer

It is September 9 in Japan now. You are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?

s = input() pos = s.find('9') if pos != -1: print("YES") else: print("NO")

s323080794

Accepted

s = input() pos = s.find('9') if pos != -1: print("Yes") else: print("No")

s953576678

p03455

u371702445

Wrong Answer

AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

a, b = [int(x) for x in input().split()] c = a * b print("Yes" if c % 2 == 0 else "No")

s595938342

Accepted

a, b = [int(x) for x in input().split()] c = a * b print("Even" if c % 2 == 0 else "Odd")

s223728136

p03478

u808259266

Wrong Answer

Find the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).

n, a, b = map(int, input().split()) ans = 0 for i in range(n): if a <= sum(list(map(int, list(str(i+1))))) <= b: ans += 1 print(ans)

s499086683

Accepted

n, a, b = map(int, input().split()) ans = 0 for i in range(n+1): if a <= sum(list(map(int, list(str(i))))) <= b: ans += i print(ans)

s004989911

p03337

u341543478

Wrong Answer

You are given two integers A and B. Find the largest value among A+B, A-B and A \times B.

a, b = map(int, input().split()) max(a + b, a - b, a * b)

s170415572

Accepted

a, b = map(int, input().split()) print(max(a + b, a - b, a * b))

s598789668

p03140

u550943777

Wrong Answer

You are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters. Our objective is to make all these three strings equal. For that, you can repeatedly perform the following operation: * Operation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter. What is the minimum number of operations required to achieve the objective?

n = int(input()) a = input() b = input() c = input() count = 0 for i in range(n): if a[i] == b[i] and b[i] == c[i]: continue elif a[i] == b[i] or b[i] == c[i]: count += 1 else: count += 2 print(count)

s616655739

Accepted

n = int(input()) a = input() b = input() c = input() count = 0 for i in range(n): if a[i] == b[i] and b[i] == c[i]: continue elif a[i] == b[i] or b[i] == c[i] or a[i] == c[i]: count += 1 else: count += 2 print(count)

s743812310

p03861

u027675217

Wrong Answer

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()) ans=(b-a+1)/x print(round(ans))

s562266973

Accepted

a,b,x=map(int,input().split()) ans_a=(a-1)//x ans_b=b//x print(ans_b-ans_a)

s321675133

p03456

u674588203

Wrong Answer

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) print(num) ans=num**0.5 if ans//1==ans: print('Yes') else: print('No')

s243881504

Accepted

a,b=map(str,input().split()) num=int(a+b) ans=num**0.5 if (ans//1)**2==num: print('Yes') else: print('No')

s423859812

p03471

u405832869

Wrong Answer

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 situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.

N,Y = map(int,input().split()) ans = 0 for a in range(N+1): for b in range(N+1-a): c = N-a-b if a*10000+b*5000+c*1000 == Y: z = a y = b x = c ans = 1 break if ans == 1: print(x,y,z) else: print(-1,-1,-1)

s495492115

Accepted

N,Y = map(int,input().split()) ans = 0 for a in range(N+1): for b in range(N+1-a): c = N-a-b if a*10000+b*5000+c*1000 == Y: z = a y = b x = c ans = 1 break if ans == 1: print(z,y,x) else: print(-1,-1,-1)

s127103004

p03555

u278143034

Wrong Answer

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.

C1 = str(input()) C2 = str(input()) ori_str = C1 + C2 rev_str = ori_str[-1::-1] if ori_str == rev_str: print("Yes") else: print("No")

s167958170

Accepted

C1 = str(input()) C2 = str(input()) ori_str = C1 + C2 rev_str = ori_str[-1::-1] if ori_str == rev_str: print("YES") else: print("NO")

s058139683

p03475

u047197186

Wrong Answer

A railroad running from west to east in Atcoder Kingdom is now complete. There are N stations on the railroad, numbered 1 through N from west to east. Tomorrow, the opening ceremony of the railroad will take place. On this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated. The first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds. Here, it is guaranteed that F_i divides S_i. That is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains. For each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.

n = int(input()) res = [0] * n for i in range(1, n): c, s, f = map(int, input().split()) res[i-1] += s + c for j in range(i-1): if res[j] < s: res[j] = s + c elif res[j] == s: res[j] += c else: if (res[j] - s) % f == 0: res[j] += c else: res[j] += f + c print(res)

s078360143

Accepted

n = int(input()) res = [0] * n for i in range(1, n): c, s, f = map(int, input().split()) res[i-1] += s + c for j in range(i-1): if res[j] < s: res[j] = s + c elif res[j] == s: res[j] += c else: if (res[j] - s) % f == 0: res[j] += c else: res[j] = s + (((res[j] - s) // f) + 1) * f + c for elem in res: print(elem)

s628930874

p03474

u794910686

Wrong Answer

The postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen `-`, and the other characters are digits from `0` through `9`. You are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.

a,b = map(int,input().split()) s = input() if s[:a].isdecimal()==True and s[-b:]==True and s[a]=='-': print("Yes") else: print("No")

s671285478

Accepted

a,b=map(int,input().split()) s=input() if 1<=a<=5 and 1<=b<=5: if s[a]=="-": if s[0:a].isdecimal() and s[a+1:a+b+1].isdecimal(): print("Yes") exit() print("No")

s098360747

p03568

u103902792

Wrong Answer

We will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are _similar_ when |x_i - y_i| \leq 1 holds for all i (1 \leq i \leq N). In particular, any integer sequence is similar to itself. You are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N. How many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?

n = int(input()) A = list(map(int,input().split())) even = odd = 0 for a in A: if a%2: odd += 1 else: even += 1 print(3**n - (odd+(even*2)**n))

s588296033

Accepted

n = int(input()) A = list(map(int,input().split())) even = odd = 0 for a in A: if a%2: odd += 1 else: even += 1 print(3**n - 2**even)

s856218283

p03556

u835482198

Wrong Answer

Find the largest square number not exceeding N. Here, a _square number_ is an integer that can be represented as the square of an integer.

n = int(input()) print(int(n ** 0.5))

s075257427

Accepted

n = int(input()) print(int(n ** 0.5) ** 2)

s166846640

p03999

u521696407

Wrong Answer

You are given a string S consisting of digits between `1` and `9`, inclusive. You can insert the letter `+` into some of the positions (possibly none) between two letters in this string. Here, `+` must not occur consecutively after insertion. All strings that can be obtained in this way can be evaluated as formulas. Evaluate all possible formulas, and print the sum of the results.

import itertools def sum_strlong(strlong): ans = int(strlong) for i in range(1, len(strlong)): for comb in itertools.combinations(range(len(strlong)-1), i): integer = '' for j, digit in enumerate(strlong): integer += digit if j in comb: integer += '+' ans += eval(integer) return ans if __name__ == '__main__': print(sum_strlong('9'*10))

s819525342

Accepted

import itertools def sum_strlong(strlong): ans = int(strlong) for i in range(1, len(strlong)): for comb in itertools.combinations(range(len(strlong)-1), i): integer = '' for j, digit in enumerate(strlong): integer += digit if j in comb: integer += '+' ans += eval(integer) return ans def main(): print(sum_strlong(input())) main()

s178327913

p03457

u400596590

Wrong Answer

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,y), (x,y+1) and (x,y-1). Note that **he cannot stay at his place**. Determine whether he can carry out his plan.

n = int(input()) for i in range(n): t, x, y = map(int, input().split()) if x+y>t or (x+y-t)%2 !=0: print('NO') exit() print('YES')

s174307773

Accepted

n = int(input()) for i in range(n): t, x, y = map(int, input().split()) if x+y>t or (x+y-t)%2 ==1: print('No') exit() print('Yes')

s938366292

p03564

u417798683

Wrong Answer

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 minimum possible value displayed in the board after N operations.

def bin(a): return 2*a def ten(a): return a+10 N = int(input()) K = int(input()) value = 1 for i in range(N): if bin(value) <= ten(value) : value = bin(value) else: value = ten(value) print(value)

s308799827

Accepted

def bin(a): return 2*a def ten(a): return a+K N = int(input()) K = int(input()) value = 1 for i in range(N): if bin(value) <= ten(value) : value = bin(value) else: value = ten(value) print(value)

s280492310

p03110

u033606236

Wrong Answer

Takahashi received _otoshidama_ (New Year's money gifts) from N of his relatives. You are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either `JPY` or `BTC`, and x_i and u_i represent the content of the otoshidama from the i-th relative. For example, if x_1 = `10000` and u_1 = `JPY`, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = `0.10000000` and u_2 = `BTC`, the otoshidama from the second relative is 0.1 bitcoins. If we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?

n = int(input()) result= 0 a = [input().split() for _ in range(n)] print(float(a[1][0])) for i in range(n): if "JPY" in a[i]: result += float(a[i][0]) else: result += float(a[i][0]) * 380000 print(result)

s187606138

Accepted

n = int(input()) result = 0 for i in range(n): x,y = input().split() if y == "BTC":x = float(x) * 380000 result += float(x) print(result)

s730654242

p00006

u071010747

Wrong Answer

Write a program which reverses a given string str.

def main(): while True: try: IN=input() if IN=='': break print(IN[::-1]) except: break

s813130997

Accepted

IN=input() print(IN[::-1])

s288918350

p03555

u093033848

Wrong Answer

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.

c1 = input() c2 = input() if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0] : print("Yes") else : print("No")

s375880879

Accepted

c1 = input() c2 = input() if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0] : print("YES") else : print("NO")

s447862250

p03399

u518556834

Wrong Answer

You planned a trip using trains and buses. The train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket. Similarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket. Find the minimum total fare when the optimal choices are made for trains and buses.

s = [input() for i in range(4)] print(min(s[0],s[1])+min(s[2],s[3]))

s773206553

Accepted

a = int(input()) b = int(input()) c = int(input()) d = int(input()) print(min(a,b)+min(c,d))

s903021633

p03131

u858428199

Wrong Answer

Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes: * Hit his pocket, which magically increases the number of biscuits by one. * Exchange A biscuits to 1 yen. * Exchange 1 yen to B biscuits. Find the maximum possible number of biscuits in Snuke's pocket after K operations.

k,a,b = map(int, input().split()) ans1 = k + 1 ans2 = (k + 1) // (a + 2) print(ans2) ans2 *= b print(ans2) ans2 += (k + 1) % (a + 2) print(ans2) print(max(ans1,ans2))

s438139671

Accepted

k,a,b = map(int, input().split()) ans1 = k+1 cnt = (k-(a-1)) // 2 mod = (k-(a-1)) % 2 ans2 = cnt * (b - a) + a + mod print(max(ans1,ans2))

s148336356

p03997

u749770850

Wrong Answer

You are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively. An example of a trapezoid Find the area of this trapezoid.

a = [int(input()) for _ in range(3)] if a[0] == a[1]: print(a[0] ** 2) else: print((a[0] + a[1]) * a[2] / 2)

s513798411

Accepted

a = [int(input()) for _ in range(3)] print(int((a[0] + a[1]) * a[2] / 2))

s039569358

p02416

u966110132

Wrong Answer

Write a program which reads an integer and prints sum of its digits.

a = int(input()) alist = [] if a/1000 >=1: alist.append(int(a/1000)) if (a-int(a/1000)*1000) / 100 >= 1: alist.append(int((a-int(a/1000)*1000) / 100)) if (a-int(a/100)) / 10 >= 1: alist.append(int((a-(int(a/100)*100)) / 10)) alist.append(a-(int(a/10)*10)) a2 = 0 for i in alist: a2 += i print(i) print(a2)

s574642041

Accepted

go = 1 while go == 1: a = str(input()) alist = list(a) if a == "0": go = 0 exit sum = 0 for i in alist: i = int(i) sum += i if go == 1: print(sum)

s299921707

p03110

u788137651

Wrong Answer

Takahashi received _otoshidama_ (New Year's money gifts) from N of his relatives. You are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either `JPY` or `BTC`, and x_i and u_i represent the content of the otoshidama from the i-th relative. For example, if x_1 = `10000` and u_1 = `JPY`, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = `0.10000000` and u_2 = `BTC`, the otoshidama from the second relative is 0.1 bitcoins. If we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?

N = int(input()) yen = [] for i in range(N): xi, ui = input().split() xi = float(xi) if ui == "BTC": ui = 380000 else: ui = 1 yen.append(xi*ui) print(int(sum(yen)))

s557194346

Accepted

N = int(input()) yen = [] for i in range(N): xi, ui = input().split() xi = float(xi) if ui == "BTC": ui = 380000 else: ui = 1 yen.append(xi*ui) print(sum(yen))

s673504504

p02618

u583285098

Wrong Answer

AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows. * The satisfaction at the beginning of day 1 is 0. Satisfaction can be negative. * Holding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}. * If a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \sum _{i=1}^{26}c_i \times (d-\mathrm{last}(d,i)). Please schedule contests on behalf of AtCoder. If the satisfaction at the end of day D is S, you will get a score of \max(10^6 + S, 0). There are 50 test cases, and the score of a submission is the total scores for each test case. You can make submissions multiple times, and the highest score among your submissions will be your score.

import numpy as np D = int(input()) c = np.array(list(map(int, input().split()))) s = [list(map(int, input().split())) for _ in range(D)] last_d = np.array([0]*len(c)) ans = 0 for i in range(D): cc = c*(last_d+i+1) max_c = max(cc) index = np.argmax(cc) print(index + 1) last_d[index] = -(i+1) ans += s[i][index] cc[index] = 0 for j in cc: ans -= j print(ans)

s750930236

Accepted

import numpy as np D = int(input()) c = np.array(list(map(int, input().split()))) s = [list(map(int, input().split())) for _ in range(D)] last_d = np.array([0] * len(c)) ans = 0 for i in range(D): cc = c * (last_d + i + 1) most = 0 index = 0 for j in range(len(c)): tmp = s[i][j] + cc[j]*(D-i-1) if most < tmp: index = j most = tmp print(index + 1) last_d[index] = -(i + 1) ans += s[i][index] cc[index] = 0 for j in cc: ans -= j

s741226565

p03448

u390793752

Wrong Answer

You have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan). In how many ways can we select some of these coins so that they are X yen in total? Coins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.

def coins(): fivehund = int(input()) onehund = int(input()) fifty = int(input()) target = int(input()) result_count = 0 for count500 in range(0,fivehund): for count100 in range(0,onehund): for count50 in range(0,fifty): current = 500*count500 + 100*count100 + 50*count50 if target == current: result_count += 1 print(result_count) if __name__ == '__main__': coins()

s614790179

Accepted

def coins(): fivehund = int(input()) onehund = int(input()) fifty = int(input()) target = int(input()) result_count = 0 for count500 in range(0,fivehund+1): for count100 in range(0,onehund+1): for count50 in range(0,fifty+1): current = 500*count500 + 100*count100 + 50*count50 if target == current: result_count += 1 print(result_count) if __name__ == '__main__': coins()

s842396216

p03455

u255943004

Wrong Answer

AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

N = [int(i) for i in input().split()] if N[0]%2==1 or N[1]%2==1: print("Odd") else: print("Even")

s699067789

Accepted

N = [int(i) for i in input().split()] if N[0]%2==1 and N[1]%2==1: print("Odd") else: print("Even")

s665388782

p03719

u692632484

Wrong Answer

You are given three integers A, B and C. Determine whether C is not less than A and not greater than B.

temp=input().split() A=int(temp[0]) B=int(temp[1]) C=int(temp[2]) if(A<=B<=C): print("Yes") else: print("No")

s858908336

Accepted

temp=input().split() A=int(temp[0]) B=int(temp[1]) C=int(temp[2]) if(A<=C<=B): print("Yes") else: print("No")

s068151679

p03635

u860002137

Wrong Answer

In _K-city_ , there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?

n, m = map(int, input().split()) print(n * m)

s399795326

Accepted

n, m = map(int, input().split()) print((n - 1) * (m - 1))

s059279341

p03494

u113255362

Time Limit Exceeded

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.

N =int(input()) List = list(map(int, input().split())) flag = True res = 0 while flag: for i in range(N): if List[i] & 2 == 1: flag = False break if not flag: res += 1 print(res)

s151348591

Accepted

N =int(input()) List = list(map(int, input().split())) flag = True res = 0 while flag: for i in range(N): if List[i] % 2 == 1: flag = False break else: List[i] = List[i]//2 if flag: res += 1 print(res)

s090944047

p03494

u626468554

Time Limit Exceeded

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.

n = int(input()) a = list(map(int,input().split())) cnt = 0 for i in range(n): memo = 0 while(a[i]%2==0): a[i]%=2 memo += 1 cnt = max(memo,cnt) print(cnt)

s920344181

Accepted

n = int(input()) a = list(map(int,input().split())) cnt = 10**10 for i in range(n): memo = 0 while(a[i]%2==0): a[i]/=2 memo += 1 cnt = min(memo,cnt) print(cnt)

s185991979

p03131

u908662255

Wrong Answer

Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes: * Hit his pocket, which magically increases the number of biscuits by one. * Exchange A biscuits to 1 yen. * Exchange 1 yen to B biscuits. Find the maximum possible number of biscuits in Snuke's pocket after K operations.

k, a, b = [int(i) for i in input().split()] sum = 0 if a >= b: sum = k + 1 else: diff = b - a if diff == 1: sum = k + 1 elif diff == 2: sum = k + 1 else: print("a") k = 1 + k - a if k % 2 == 0: sum = a + ((diff) * (k / 2)) else: print("b") sum = a + ((diff) * ((k - 1) / 2)) + 1 print(sum)

s125218044

Accepted

k, a, b = [int(i) for i in input().split()] sum = 0 if a >= b: sum = k + 1 else: diff = b - a if diff == 1: sum = k + 1 elif diff == 2: sum = k + 1 elif diff >= 3: rest = 1 + k - a # print("K:{}".format(rest)) if rest >= 0: if rest % 2 == 0: sum = a + ((diff) * int(rest / 2)) # print("diff:{}, k/2:{}".format(diff, rest / 2)) else: sum = a + ((diff) * int((rest - 1) / 2)) + 1 # print("diff:{}, k/2:{}".format(diff, (rest - 1) / 2)) else: sum = k + 1 print(int(sum))

s209955512

p03485

u835482198

Wrong Answer

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.

a, b = map(int, input().split()) print(int((a + b - 1) / 2))

s759302736

Accepted

a, b = map(int, input().split()) print(int((a + b + 2 - 1) / 2))

s716627556

p03067

u864273141

Wrong Answer

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()) if (a<c and c<b) or (a>c and c>b): print("yes") else: print("no")

s433047998

Accepted

a,b,c=map(int,input().split()) if (a<c and c<b) or (a>c and c>b): print("Yes") else: print("No")

s170582449

p03673

u077003677

Wrong Answer

You are given an integer sequence of length n, a_1, ..., a_n. Let us consider performing the following n operations on an empty sequence b. The i-th operation is as follows: 1. Append a_i to the end of b. 2. Reverse the order of the elements in b. Find the sequence b obtained after these n operations.

import sys import os def file_input(): f = open('ABC066/input.txt', 'r') sys.stdin = f def main(): #file_input() n=int(input()) a=list(map(int, input().split())) out=[] for i in range(n): if i%2==0: out.append(str(a[i])) else: out.insert(0,str(a[i])) if n%2!=0: out.reverse() print("".join(out)) if __name__ == '__main__': main()

s847174963

Accepted

import sys import os def file_input(): f = open('ABC066/input.txt', 'r') sys.stdin = f def main(): #file_input() n=int(input()) a=list(map(int, input().split())) out=[""]*n for i in range(n): if i%2==0: out[n//2+i//2]=str(a[i]) else: out[n//2-(-(-i//2))]=str(a[i]) if n%2!=0: out.reverse() print(*out) if __name__ == '__main__': main()

s001431315

p03546

u309141201

Wrong Answer

Joisino the magical girl has decided to turn every single digit that exists on this world into 1. Rewriting a digit i with j (0≤i,j≤9) costs c_{i,j} MP (Magic Points). She is now standing before a wall. The wall is divided into HW squares in H rows and W columns, and at least one square contains a digit between 0 and 9 (inclusive). You are given A_{i,j} that describes the square at the i-th row from the top and j-th column from the left, as follows: * If A_{i,j}≠-1, the square contains a digit A_{i,j}. * If A_{i,j}=-1, the square does not contain a digit. Find the minimum total amount of MP required to turn every digit on this wall into 1 in the end.

from scipy.sparse.csgraph import floyd_warshall H, W = map(int, input().split()) c = [list(map(int, input().split())) for _ in range(10)] A = [list(map(int, input().split())) for _ in range(H)] ans = 0 # print(*c, sep='\n') # print(*A, sep='\n') cost = floyd_warshall(c) # print(*cost, sep='\n') for i in range(H): for j in range(W): if A[i][j] == -1: continue ans += cost[A[i][j]][1] # print(ans) print(ans)

s231621836

Accepted

from scipy.sparse.csgraph import floyd_warshall H, W = map(int, input().split()) c = [list(map(int, input().split())) for _ in range(10)] A = [list(map(int, input().split())) for _ in range(H)] ans = 0 # print(*c, sep='\n') # print(*A, sep='\n') cost = floyd_warshall(c) # print(*cost, sep='\n') for i in range(H): for j in range(W): if A[i][j] == -1: continue ans += cost[A[i][j]][1] # print(ans) print(int(ans))

s392410427

p03387

u487594898

Wrong Answer

You are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order: * Choose two among A, B and C, then increase both by 1. * Choose one among A, B and C, then increase it by 2. It can be proved that we can always make A, B and C all equal by repeatedly performing these operations.

import numpy as np A =np.array(sorted(list(map(int,input().split())))) a = max(A) b = a -A print(A,a,b) if abs(b[1]-b[0]) %2 == 0: print(sum(b)//2) else : print(sum(b)//2 + 1)

s406673437

Accepted

import numpy as np A =np.array(sorted(list(map(int,input().split())))) a = max(A) b = a -A if abs(b[1]-b[0]) %2 == 0: print(sum(b)//2) else : print(sum(b)//2 + 2)

s804934162

p03721

u593063683

Wrong Answer

There is an empty array. The following N operations will be performed to insert integers into the array. In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array. Find the K-th smallest integer in the array after the N operations. For example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.

import numpy as np N, K = [int(x) for x in input().split()] list = [] for i in range(N): a,b = [int(x) for x in input().split()] for j in range(b): list.append(a) list.sort() print(list) print(list[K-1])

s453945367

Accepted

import numpy as np N, K = [int(x) for x in input().split()] list = [] for i in range(N): a,b = [int(x) for x in input().split()] list.append([a, b]) list.sort() #print(list) nth = 0 for i in range(N): a,b = list[i] nth += b if K<=nth: break # elif nth==K: # a,b = list[i-1] # break #print(a,b) print(a)

s434005987

p03417

u940102677

Wrong Answer

There is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region. The front and back sides of these cards can be distinguished, and initially every card faces up. We will perform the following operation once for each square contains a card: * For each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square. It can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed. Find the number of cards that face down after all the operations.

n,m = map(int, input().split()) if n == 1: s = abs(m-2) elif m == 1: s = abs(n-2) else: s = 4 print(s)

s870376801

Accepted

n,m = map(int, input().split()) print(abs((n-2)*(m-2)))

s427963513

p03005

u003501233

Wrong Answer

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?

x,y=map(int,input().split()) print(y-x)

s368675166

Accepted

n,k=map(int,input().split()) if k == 1: print(0) else: print(n-k)

s403007897

p03048

u196697332

Time Limit Exceeded

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 green boxes and b blue boxes. How many triples of non-negative integers (r,g,b) achieve this?

def combinations(R, G, B, N): R, G, B, N = int(R), int(G), int(B), int(N) number_combos = 0 for x in range(N + 1): N_modified_x = N - R * x for y in range(N_modified_x + 1): N_modified_y = N_modified_x - G * y for z in range(N_modified_y + 1): if B * z == N_modified_y: number_combos += 1 return number_combos print(combinations(13, 1, 4, 3000))

s142337341

Accepted

def combinations(R, G, B, N): R, G, B, N = int(R), int(G), int(B), int(N) sorted_tuple = sorted((R, G, B), reverse=True) R = sorted_tuple[0] G = sorted_tuple[1] B = sorted_tuple[2] number_combos = 0 for x in range(N // R + 1): for y in range((N - R * x) // G + 1): if (N - R * x - G * y) % B == 0: number_combos += 1 return number_combos R, G, B, N = input().split(' ') print(combinations(R, G, B, N))

s261314213

p03080

u070753468

Wrong Answer

There are N people numbered 1 to N. Each person wears a red hat or a blue hat. You are given a string s representing the colors of the people. Person i wears a red hat if s_i is `R`, and a blue hat if s_i is `B`. Determine if there are more people wearing a red hat than people wearing a blue hat.

n = int(input()) k = input() p = 0 r_count = 0 b_count = 0 for l in range(n): if str(k[p]) == "R": r_count += 1 p += 1 elif str(k[p]) == "B": b_count += 1 p += 1 else: pass print(r_count,b_count)

s824435629

Accepted

n = int(input()) k = input() p = 0 r_count = 0 b_count = 0 for l in range(n): if str(k[p]) == "R": r_count += 1 p += 1 elif str(k[p]) == "B": b_count += 1 p += 1 else: pass if r_count > b_count: print("Yes") else: print("No")

s832666678

p03049

u581511366

Wrong Answer

Snuke has N strings. The i-th string is s_i. Let us concatenate these strings into one string after arranging them in some order. Find the maximum possible number of occurrences of `AB` in the resulting string.

def c(strs): count = 0 count_a = 0 count_b = 0 flag = 1 for s in strs: count += s.count('AB') if s[0]=='B' and s[-1]=='A': count_a += 1 count_b += 1 elif s[0]=='B': count_b += 1 flag = 0 elif s[-1]=='A': count_a += 1 flag = 0 print(count,count_a,count_b) if count_a: return count + min(count_a,count_b) - flag return count if __name__=='__main__': n = int(input()) s = [] for _ in range(n): s.append(input()) print(c(s))

s210867412

Accepted

def c(strs): count = 0 count_a = 0 count_b = 0 flag = 1 for s in strs: count += s.count('AB') if s[0]=='B' and s[-1]=='A': count_a += 1 count_b += 1 elif s[0]=='B': count_b += 1 flag = 0 elif s[-1]=='A': count_a += 1 flag = 0 if count_a: return count + min(count_a,count_b) - flag return count if __name__=='__main__': n = int(input()) s = [] for _ in range(n): s.append(input()) print(c(s))

s053046278

p03971

u987164499

Wrong Answer

There are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these. Only Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests. * A Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B. * An overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students. A string S is assigned indicating attributes of all participants. If the i-th character of string S is `a`, this means the participant ranked i-th in the Qualification contests is a Japanese student; `b` means the participant ranked i-th is an overseas student; and `c` means the participant ranked i-th is neither of these. Write a program that outputs for all the participants in descending rank either `Yes` if they passed the Qualification contests or `No` if they did not pass.

N,A,B = map(int,input().split()) S = input() pass_human = 0 overseas = 0 for i in S: if i == "a": if pass_human < A+B: print("YES") pass_human += 1 else: print("NO") elif i == "b": if pass_human < A+B and overseas < B: print("YES") pass_human += 1 overseas += 1 else: print("NO") else: print("NO")

s408710782

Accepted

N,A,B = map(int,input().split()) S = input() pass_human = 0 overseas = 0 for i in S: if i == "a": if pass_human < A+B: print("Yes") pass_human += 1 else: print("No") elif i == "b": if pass_human < A+B and overseas < B: print("Yes") pass_human += 1 overseas += 1 else: print("No") else: print("No")

s565159949

p03698

u244836567

Wrong Answer

You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.

a=input() count=0 for i in range(len(a)): if a[i] in a: count=count+1 if count==0: print("yes") else: print("no")

s029627762

Accepted

a=input() b=[] c=0 for i in range(len(a)): b.append(a[i]) b.sort() for i in range(len(a)-1): if b[i]==b[i+1]: c=c+1 if c==0: print("yes") else: print("no")

s477615631

p03852

u845937249

Wrong Answer

Given a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: `a`, `e`, `i`, `o` and `u`.

s = input() s = s.replace("eraser","") s = s.replace("erase","") s = s.replace("dreamer","") s = s.replace("dream","") if len(s) == 0: print("YES") else: print("NO")

s530837240

Accepted

s = input() check = 0 if s == 'a': print('vowel') check = check + 1 if s == 'i': print('vowel') check = check + 1 if s == 'u': print('vowel') check = check + 1 if s == 'e': print('vowel') check = check + 1 if s == 'o': print('vowel') check = check + 1 if check == 0: print('consonant')

s350173100

p02612

u569989096

Wrong Answer

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.

#!/usr/bin/env python if __name__ == "__main__": a = input() a = int(a) print(a%1000)

s520556155

Accepted

#!/usr/bin/env python if __name__ == "__main__": a = input() a = int(a) if a%1000 == 0: print(0) else: print(1000-a%1000)

s381939135

p02394

u982618289

Wrong Answer

Write a program which reads a rectangle and a circle, and determines whether the circle is arranged inside the rectangle. As shown in the following figures, the upper right coordinate $(W, H)$ of the rectangle and the central coordinate $(x, y)$ and radius $r$ of the circle are given.

a = list(map(int, input().split())) w,h,x,y,r = a if(r<=x<=w-r and r<=y<=h-r): print("YES") else: print("NO")

s653161209

Accepted

a = list(map(int, input().split())) w,h,x,y,r = a if(r<=x<=w-r and r<=y<=h-r): print("Yes") else: print("No")

s370675557

p02742

u220114950

Wrong Answer

We have a board with H horizontal rows and W vertical columns of squares. There is a bishop at the top-left square on this board. How many squares can this bishop reach by zero or more movements? Here the bishop can only move diagonally. More formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds: * r_1 + c_1 = r_2 + c_2 * r_1 - c_1 = r_2 - c_2 For example, in the following figure, the bishop can move to any of the red squares in one move:

h,w=map(int,input().split()) print((w+1)//2*(h+1)//2+(w//2)*(h//2))

s237086304

Accepted

h,w=map(int,input().split()) if(h==1 or w==1): print(1) else: print(((w+1)//2)*((h+1)//2)+(w//2)*(h//2))

s268357616

p03399

u490992416

Wrong Answer

You planned a trip using trains and buses. The train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket. Similarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket. Find the minimum total fare when the optimal choices are made for trains and buses.

x = int(input()) a = int(input()) b = int(input()) print(x - a - (x-a)//b * b)

s847441582

Accepted

a = int(input()) b = int(input()) c = int(input()) d = int(input()) print(min(a,b) + min(c,d))

s966374627

p03997

u203962828

Wrong Answer

You are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively. An example of a trapezoid Find the area of this trapezoid.

a = int(input()) b = int(input()) h = int(input()) print((a + b) / 2 * h)

s191488263

Accepted

a = int(input()) b = int(input()) h = int(input()) print(int(((a + b) / 2 * h)))

s602797319

p02936

u485319545

Wrong Answer

Given is a rooted tree with N vertices numbered 1 to N. The root is Vertex 1, and the i-th edge (1 \leq i \leq N - 1) connects Vertex a_i and b_i. Each of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0. Now, the following Q operations will be performed: * Operation j (1 \leq j \leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j. Find the value of the counter on each vertex after all operations.

N,Q=map(int,input().split()) import numpy as np tree = np.array([-1]*N) cnt = np.array([0]*N) for i in range(N-1): a,b = map(int,input().split()) a-=1 b-=1 tree[b]=a for j in range(Q): p,x=map(int,input().split()) p-=1 if p!=0: cnt[p]+=x cnt[np.where(tree == p)] +=x else: cnt+=x print(cnt)

s762431165

Accepted

import sys sys.setrecursionlimit(500*500) n,q=map(int,input().split()) cost=[0]*n edge = [[] for _ in range(n)] for _ in range(n-1): a,b=map(int,input().split()) a,b=a-1,b-1 edge[a].append(b) edge[b].append(a) for _ in range(q): p,x=map(int,input().split()) cost[p-1]+=x visited=[-1]*n def dfs(n,c): cost[n]+=c tmp=cost[n] visited[n]=0 for v in edge[n]: if visited[v]==-1: dfs(v,tmp) dfs(0,0) print(*cost)

s471188583

p03369

u054717609

Wrong Answer

In "Takahashi-ya", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions). A customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is `o`, it means the ramen should be topped with boiled egg; if that character is `x`, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen. Write a program that, when S is given, prints the price of the corresponding bowl of ramen.

s=input() ct=0 if "o" in s: ct=ct+1 if(ct>0): f=700+100*ct else: f=700 print(f)

s798992893

Accepted

s=input() ct=0 for i in range(0,len(s)): if(s[i]=="o"): ct=ct+1 if(ct>0): f=700+100*ct else: f=700 print(f)

s827620279

p03997

u778348725

Wrong Answer

You are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively. An example of a trapezoid Find the area of this trapezoid.

a = float(input()) b = float(input()) h = float(input()) area = (a+b)*h/2 print(area)

s584222582

Accepted

a = int(input()) b = int(input()) h = int(input()) area = (a+b)*h/2 print(int(area))

s444798983

p03447

u201082459

Wrong Answer

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)

s228395489

Accepted

x = int(input()) a = int(input()) b = int(input()) print((x-a) % b)

s173197449

p03448

u680183386

Wrong Answer

You have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan). In how many ways can we select some of these coins so that they are X yen in total? Coins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.

li = [int(input()) for i in range(4)] counter = 0 for p in range(li[0]+1): for q in range(li[1]+1): for r in range(li[2]+1): if 500*p+100*q+r == li[3]: counter+=1 print(counter)

s584092785

Accepted

li = [int(input()) for i in range(4)] counter = 0 for p in range(li[0]+1): for q in range(li[1]+1): for r in range(li[2]+1): if 500*p+100*q+50*r == li[3]: counter+=1 print(counter)

s786847378

p03360

u186426563

Wrong Answer

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 K operations?

a = list(map(int, input().split())) k = int(input()) print(sum(a) + max(a)*2**k)

s783644169

Accepted

a = list(map(int, input().split())) k = int(input()) print(sum(a) + max(a)*(2**k - 1))

s268786377

p03407

u740284863

Wrong Answer

An elementary school student Takahashi has come to a variety store. He has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it? Note that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.

a,b,c= map(int,input().split()) if a+b >= c: print("YEs") else: print("No")

s496772515

Accepted

a,b, c = map(int,input().split()) if a+b >= c: print("Yes") else: print("No")

s161590947

p02406

u623827446

Wrong Answer

In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, you can implement, for example, loops. Note that use of goto statement is highly discouraged, because it is difficult to trace the control flow of a program which includes goto. Write a program which does precisely the same thing as the following program (this example is wrtten in C++). Let's try to write the program without goto statements. void call(int n){ int i = 1; CHECK_NUM: int x = i; if ( x % 3 == 0 ){ cout << " " << i; goto END_CHECK_NUM; } INCLUDE3: if ( x % 10 == 3 ){ cout << " " << i; goto END_CHECK_NUM; } x /= 10; if ( x ) goto INCLUDE3; END_CHECK_NUM: if ( ++i <= n ) goto CHECK_NUM; cout << endl; }

n=int(input()) for i in range(n+1): I=str(i) if i % 3 == 0: print(' {0}'.format(i), end='') elif I[len(I)-1] == '3': print(' {0}'.format(i), end='')

s160767861

Accepted

n=int(input()) for i in range(1,n+1): if i % 3 == 0 or '3' in str(i): print(' {0}'.format(i), end='') print('')

s721659395

p03730

u655761160

Wrong Answer

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 objective is to make the sum congruent to C modulo B. Determine whether this is possible. If the objective is achievable, print `YES`. Otherwise, print `NO`.

A, B, C = map(int, input().split()) ans = 'No' for k in range(1, B + 1): if (k * A % B == C): ans = 'Yes' print(ans)

s251057273

Accepted

def f(A, B, C): ans = 'NO' for k in range(1, B + 1): if (k * A % B == C): ans = 'YES' return ans if __name__ == "__main__": A, B, C = map(int, input().split()) print(f(A, B, C))

s857719076

p03493

u731436822

Wrong Answer

Snuke has a grid consisting of three squares numbered 1, 2 and 3. In each square, either `0` or `1` is written. The number written in Square i is s_i. Snuke will place a marble on each square that says `1`. Find the number of squares on which Snuke will place a marble.

S = list(map(int,input().split())) count = 0 for s in S: if s == 0: count += 1 print(count)

s740370920

Accepted

S = input() count = 0 for s in S: if s == "1": count += 1 print(count)

s746285162

p03448

u410201501

Wrong Answer

You have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan). In how many ways can we select some of these coins so that they are X yen in total? Coins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.

a, b, c, x = map(int, [input() for i in range(4)]) ans = 0 for i in range(a+1): for k in range(b+1): for j in range(c+1): if i * 500 + j * 100 + j * 50 == x: ans += 1 print(ans)

s892283582

Accepted

a, b, c, x = map(int, [input() for i in range(4)]) ans = 0 for i in range(a+1): for j in range(b+1): for k in range(c+1): if i * 500 + j * 100 + k * 50 == x: ans += 1 print(ans)

s575666519

p02833

u952669998

Wrong Answer

For an integer n not less than 0, let us define f(n) as follows: * f(n) = 1 (if n < 2) * f(n) = n f(n-2) (if n \geq 2) Given is an integer N. Find the number of trailing zeros in the decimal notation of f(N).

N = int(input()) if N%2!=0: print(0) else: b = 0 n = N/2 while(n): b += n//5 n //= 5 print(b)

s477204232

Accepted

N = int(input()) if N%2!=0: print(0) else: cnt = 0 n = N//2 k = 5 while(n//k != 0): cnt += n//k k*=5 print(cnt)

s558890010

p03435

u696197059

Wrong Answer

We have a 3 \times 3 grid. A number c_{i, j} is written in the square (i, j), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left. According to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3 whose values are fixed, and the number written in the square (i, j) is equal to a_i + b_j. Determine if he is correct.

y1_list = list(map(int,input().split())) y2_list = list(map(int,input().split())) y3_list = list(map(int,input().split())) a1 = list() a2 = list() for i in range(3): a1.append(y1_list[i] - y2_list[i]) a2.append(y2_list[i] - y3_list[i]) if a1[0] == a1[1] and a1[2] == a1[0]: if a2[0] == a1[1] and a2[2] == a1[0]: print("yes") else: print("no") else: print("no")

s689525204

Accepted

y1_list = list(map(int,input().split())) y2_list = list(map(int,input().split())) y3_list = list(map(int,input().split())) L = [y1_list,y2_list,y3_list] a1 = list() a2 = list() b1 = list() b2 = list() for i in range(3): a1.append(y1_list[i] - y2_list[i]) a2.append(y2_list[i] - y3_list[i]) if (a1[0] == a1[1] and a1[2] == a1[0]): if (a2[0] == a2[1] and a2[2] == a2[0]): print("Yes") else: print("No") else: print("No")

s811496877

p03227

u970809473

Wrong Answer

You are given a string S of length 2 or 3 consisting of lowercase English letters. If the length of the string is 2, print it as is; if the length is 3, print the string after reversing it.

s=input() if len(s) == 2: print(s) else: print(reversed(s))

s222806907

Accepted

s=input() if len(s) == 2: print(s) else: print(''.join(list(reversed(s))))

s399385820

p01554

u775586391

Wrong Answer

ある部屋ではICカードを用いて鍵を開け閉めする電子錠システムを用いている。 このシステムは以下のように動作する。 各ユーザーが持つICカードを扉にかざすと、そのICカードのIDがシステムに渡される。 システムはIDが登録されている時、施錠されているなら開錠し、そうでないのなら施錠し、それぞれメッセージが出力される。 IDが登録されていない場合は、登録されていないというメッセージを出力し、開錠及び施錠はおこなわれない。 さて、現在システムにはN個のID(U1, U2, ……, UN)が登録されており、施錠されている。 M回ICカードが扉にかざされ、そのIDはそれぞれ順番にT1, T2, ……, TMであるとする。 この時のシステムがどのようなメッセージを出力するか求めよ。

n = int(input()) l1 = [input() for i in range(n)] m = int(input()) c = 0 l = ["Opend","Closed"] for i in range(m): s = input() if s in l1: print(l[c%2]+" by "+ s) c += 1 else: print("Unknown "+ s)

s338005818

Accepted

n = int(input()) l1 = [input() for i in range(n)] m = int(input()) c = 0 l = ["Opened","Closed"] for i in range(m): s = input() if s in l1: print(l[c%2]+" by "+ s) c += 1 else: print("Unknown "+ s)

s802004708

p03494

u063614215

Wrong Answer

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.

N = int(input()) num_list = [int(i) for i in input().split(' ')] even_counter = 0 for n in range(N): if num_list[n]%2 != 0: print('0') break else: even_counter += 1 if even_counter == N: num_min = min(num_list) counter = 0 while num_min%2 == 0: counter += 1 num_min //= 2 print(counter)

s496801647

Accepted

N = int(input()) num_list = [int(i) for i in input().split(' ')] even_counter = 0 for n in range(N): if num_list[n]%2 != 0: print('0') break else: even_counter += 1 if even_counter == N: min_counter = float('inf') for i in range(N): num = num_list[i] counter = 0 while num%2 == 0: counter += 1 num //= 2 if counter <= min_counter: min_counter = counter print(min_counter)

s040559901

p03477

u143492911

Wrong Answer

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 placed a mass of weight C and a mass of weight D on the right pan. Print `Left` if the balance scale tips to the left; print `Balanced` if it balances; print `Right` if it tips to the right.

a,b,c,d=map(int,input().split()) right=a+b left=c+d if right==left: print("Balanced") elif right<left: print("Left") elif left<right: print("Right")

s500823779

Accepted

a,b,c,d=map(int,input().split()) left=a+b right=c+d if right==left: print("Balanced") elif right<left: print("Left") elif left<right: print("Right")

s703393622

p02678

u654590131

Wrong Answer

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 the cave, so we have decided to place a signpost in each room except Room 1. The signpost in each room will point to one of the rooms directly connected to that room with a passage. Since it is dangerous in the cave, our objective is to satisfy the condition below for each room except Room 1. * If you start in that room and repeatedly move to the room indicated by the signpost in the room you are in, you will reach Room 1 after traversing the minimum number of passages possible. Determine whether there is a way to place signposts satisfying our objective, and print one such way if it exists.

N, M = map(int, input().split()) AB = [] for _ in range(M): AB.append(list(map(int, input().split()))) list = [0] * (N+1) print(AB) print(list) saitan = [1] for _ in range(M): next = [] for i in range(len(AB)): if AB[i][0] in saitan: if list[AB[i][1]] == 0: list[AB[i][1]] = AB[i][0] next.append(AB[i][1]) if AB[i][1] in saitan: if list[AB[i][0]] == 0: list[AB[i][0]] = AB[i][1] next.append(AB[i][0]) saitan.extend(next) print("YES") for ele in list[2:]: print(ele)

s866079163

Accepted

from collections import deque N, M = map(int, input().split()) graph = [[] for _ in range(N+1)] for i in range(M): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a) dist = [-1] * (N+1) dist[0] = 0 dist[1] = 0 d = deque() d.append(1) ans = [0] * (N+1) while d: v = d.popleft() for i in graph[v]: if dist[i] != -1: continue dist[i] = dist[v]+1 d.append(i) ans[i] = v print("Yes") print(*ans[2:], sep='\n')

s345302504

p03597

u136090046

Wrong Answer

We have an N \times N square grid. We will paint each square in the grid either black or white. If we paint exactly A squares white, how many squares will be painted black?

value_list = [] number_of_test = int(input()) number_of_test2 = int(input()) print((number_of_test*number_of_test)-number_of_test)

s222041685

Accepted

number_of_test = int(input()) number_of_test2 = int(input()) print((number_of_test*number_of_test)-number_of_test2)

s960123259

p02614

u934119021

Wrong Answer

We have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \leq i \leq H, 1 \leq j \leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is `.`, and black if c_{i,j} is `#`. Consider doing the following operation: * Choose some number of rows (possibly zero), and some number of columns (possibly zero). Then, paint red all squares in the chosen rows and all squares in the chosen columns. You are given a positive integer K. How many choices of rows and columns result in exactly K black squares remaining after the operation? Here, we consider two choices different when there is a row or column chosen in only one of those choices.

import itertools import copy h, w, k = map(int, input().split()) c = [] for i in range(h): s = input() c.append(list(s)) f = ['0', '1'] c2 = [] ans = 0 for i in itertools.product(f, repeat=h): c2.clear() c2 += c for x in range(h): if i[x] == '1': c2[x] = ['x'] * w c3 = [] for j in itertools.product(f, repeat=w): c3.clear() c3 = copy.deepcopy(c2) for y in range(w): if j[y] == '1': for k in range(h): c3[k][y] = 'x' t = 0 for z in range(h): t += c3[z].count('#') if t == k: ans += 1 print(ans)

s283688358

Accepted

import itertools h, w, k = map(int, input().split()) c = [] ans = 0 for i in range(h): c.append(list(input())) for i in range(2 ** h - 1): c2 = [] x = str(bin(i))[2:].zfill(h) for a in range(h): if x[a] == '0': c2.append(c[a]) elif x[a] == '1': c2.append(['*'] * w) black = list(itertools.chain.from_iterable(c2)).count('#') for j in range(2 ** w - 1): black2 = black y = str(bin(j))[2:].zfill(w) for b in range(w): if y[b] == '1': for a in range(h): if c2[a][b] == '#': black2 -= 1 if black2 == k: ans += 1 print(ans)

s990296399

p04044

u467177102

Wrong Answer

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 smaller_ than another string t=t_1t_2t_3...t_m if and only if one of the following holds: * There exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i. * s_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.

i = input().split() if i.count("7") == 1 and i.count("5") == 2: print("YES") else: print("NO")

s982915285

Accepted

N,L = map(int, input().split()) string_list = [input() for i in range(N)] string_list.sort() print(''.join(string_list))

s145795519

p03067

u089142196

Wrong Answer

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()) maxi=max(A,B,C) mini=min(A,B,C) if B!=maxi and B!=mini: print("Yes") else: print("No")

s512905518

Accepted

A,B,C = map(int,input().split()) maxi=max(A,B,C) mini=min(A,B,C) if C!=maxi and C!=mini: print("Yes") else: print("No")

s667899634

p02268

u912143677

Wrong Answer

You are given a sequence of _n_ integers S and a sequence of different _q_ integers T. Write a program which outputs C, the number of integers in T which are also in the set S.

n = int(input()) s = list(map(int, input().split())) q = int(input()) t = list(map(int, input().split())) count = 0 for i in range(q): left = 0 right = n-1 while left < right: mid = (right + left) // 2 if t[i] == s[mid]: count += 1 break elif t[i] < s[mid]: right = mid elif t[i] > s[mid]: left = mid+1

s013382918

Accepted

n = int(input()) s = list(map(int, input().split())) q = int(input()) t = list(map(int, input().split())) count = 0 for i in range(q): left = 0 right = n while left < right: mid = (right + left) // 2 if t[i] == s[mid]: count += 1 break elif t[i] < s[mid]: right = mid elif t[i] > s[mid]: left = mid+1 print(count)

s265078719

p03048

u311636831

Wrong Answer

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 green boxes and b blue boxes. How many triples of non-negative integers (r,g,b) achieve this?

r,g,b,n=map(int,input().split()) tmp=0 for i in range(3000): if(r*i>3000):break for j in range(3000): if(r*i+g*j>3000):break if((n-r*i-g*j)<0):break if((((n-r*i-g*j)%b)==0)&(((n-r*i-g*j)/b)<3000)): print(i,j,((n-r*i-g*j)/b)) tmp+=1 print(tmp)

s072702103

Accepted

R, G, B, N = map(int, input().split()) ans = 0 for r in range(N//R + 1): for g in range((N - (R*r))//G + 1): if(N - (R*r) - (G*g)) % B == 0: ans += 1 print(ans)

s322487514

p03854

u848654125

Wrong Answer

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`.

def erase_end(string): if string.endswith("dream"): string = string.rstrip("dream") elif string.endswith("dreamer"): string = string.rstrip("dreamer") elif string.endswith("erase"): string = string.rstrip("erase") elif string.endswith("eraser"): string = string.rstrip("eraser") elif string == "": string = "YES" else: string = "NO" return string string = input() while True: string = erase_end(string) if string == "YES" or string == "NO": break print(string)

s892558546

Accepted

def erase_end(string): if string.endswith("dream"): string = string[:-5] elif string.endswith("dreamer"): string = string[:-7] elif string.endswith("erase"): string = string[:-5] elif string.endswith("eraser"): string = string[:-6] elif string == "": string = "YES" else: string = "NO" return string string = input() while True: if string == "YES" or string == "NO": break string = erase_end(string) print(string)

s713571002

p03150

u794173881

Wrong Answer

A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once. Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.

import fnmatch S=[] S.append(input()) if S == fnmatch.filter(S, "*keyence") or S == fnmatch.filter(S, "k*eyence") or S == fnmatch.filter(S, "ke*yence") or S == fnmatch.filter(S, "key*ence") or S == fnmatch.filter(S, "keye*nce") or S == fnmatch.filter(S, "keyen*ce") or S == fnmatch.filter(S, "keyenc*e") or S == fnmatch.filter(S, "keyence*"): print("Yes") else: print("No")

s724834013

Accepted

import fnmatch S=[] S.append(input()) if S == fnmatch.filter(S, "k*eyence") or S == fnmatch.filter(S, "ke*yence") or S == fnmatch.filter(S, "key*ence") or S == fnmatch.filter(S, "keye*nce") or S == fnmatch.filter(S, "keyen*ce") or S == fnmatch.filter(S, "keyenc*e") : print("YES") else: print("NO")

s253370132

p02690

u729133443

Wrong Answer

Give a pair of integers (A, B) such that A^5-B^5 = X. It is guaranteed that there exists such a pair for the given integer X.

x,r=int(input()),range(-99,130);[i**5-x-j**5or print(i,j)for i in r for j in r]

s917989472

Accepted

i=j=x=int(input()) while(i:=-~i%127)**5-j**5-x:j=j%257-i print(i,j)

s484744518

p02841

u399779657

Wrong Answer

In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019. Integers M_1, D_1, M_2, and D_2 will be given as input. It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1. Determine whether the date 2019-M_1-D_1 is the last day of a month.

import itertools N = input() S = input() l = [] l = [i for i in S] answer = [] answer = [i for i in itertools.combinations(l,3)] answer = set(answer) print(len(answer))

s455926362

Accepted

M1, D1 = input().split() M2, D2 = input().split() if M1 == M2: print(0) else: print(1)

s411870536

p04043

u989326345

Wrong Answer

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 of the phrases once, in some order.

s=str(input()) n5=s.count('5') n7=s.count('7') if n5==2 and n7==1: print('Yes') else: print('No')

s106379845

Accepted

s=str(input()) n5=s.count('5') n7=s.count('7') if n5==2 and n7==1: print('YES') else: print('NO')

s373409873

p03503

u437068347

Wrong Answer

Joisino is planning to open a shop in a shopping street. Each of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods. There are already N stores in the street, numbered 1 through N. You are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2. Let c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}. Find the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.

# -*- coding: utf-8 -*- import itertools def to_bool(i): if i == '1': return True return False n = int(input()) f = [] for i in range(n): f.append(list(to_bool(i) for i in input().split())) p = [] for i in range(n): p.append(list(int(i) for i in input().split())) print(f) print(p) result = -100 for eigyou in itertools.product((True,False), repeat=10): if sum(1 for a in zip(eigyou) if a) == 0: continue goukei = 0 for i in range(n): goukei += p[i][sum(1 for a,b in zip(eigyou,f[i]) if a and b)] if result < goukei: result = goukei print(result)

s726649212

Accepted

# -*- coding: utf-8 -*- import itertools def to_bool(i): if i == '1': return True return False n = int(input()) f = [] for i in range(n): f.append(list(to_bool(i) for i in input().split())) p = [] for i in range(n): p.append(list(int(i) for i in input().split())) result = None for eigyou in itertools.product((True,False), repeat=10): if sum(1 for a in eigyou if a) == 0: continue goukei = None for i in range(n): if goukei is None: goukei = p[i][sum(1 for a,b in zip(eigyou,f[i]) if a and b)] else: goukei += p[i][sum(1 for a,b in zip(eigyou,f[i]) if a and b)] if result is None: result = goukei if result < goukei: result = goukei print(result)

s753521715

p03139

u833543158

Wrong Answer

We conducted a survey on newspaper subscriptions. More specifically, we asked each of the N respondents the following two questions: * Question 1: Are you subscribing to Newspaper X? * Question 2: Are you subscribing to Newspaper Y? As the result, A respondents answered "yes" to Question 1, and B respondents answered "yes" to Question 2. What are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y? Write a program to answer this question.

N, A, B = map(int, input().split()) maxAns = min(A, B) minAns = max(0, abs(A+B-N)) print(maxAns, minAns)

s887822399

Accepted

N, A, B = map(int, input().split()) maxAns = min(A, B) minAns = max(0, A+B-N) print(maxAns, minAns)

s180828395

p03635

u879870653

Wrong Answer

In _K-city_ , there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?

n,m = map(int,input().split()) if n > 2 and m > 2 : print((n-2)*(m-2)) elif n == 2 and m == 2 : print(1) else : print(max(n,m)-1)

s557697877

Accepted

n,m = map(int,input().split()) print((n-1)*(m-1))

s720263721

p02261

u766163292

Wrong Answer

Let's arrange a deck of cards. There are totally 36 cards of 4 suits(S, H, C, D) and 9 values (1, 2, ... 9). For example, 'eight of heart' is represented by H8 and 'one of diamonds' is represented by D1. Your task is to write a program which sorts a given set of cards in ascending order by their values using the Bubble Sort algorithms and the Selection Sort algorithm respectively. These algorithms should be based on the following pseudocode: BubbleSort(C) 1 for i = 0 to C.length-1 2 for j = C.length-1 downto i+1 3 if C[j].value < C[j-1].value 4 swap C[j] and C[j-1] SelectionSort(C) 1 for i = 0 to C.length-1 2 mini = i 3 for j = i to C.length-1 4 if C[j].value < C[mini].value 5 mini = j 6 swap C[i] and C[mini] Note that, indices for array elements are based on 0-origin. For each algorithm, report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).

#!/usr/bin/env python3 # -*- coding: utf-8 -*- class Card(object): def __init__(self, card): self.card = card self.suit = card[0] self.value = int(card[1:]) def __str__(self): return str(self.card) def print_array(a): print(" ".join(map(str, a))) def bubblesort(cards, n): c = cards[:] for i in range(0, n): for j in range(n - 1, i - 1, -1): if c[j].value < c[j - 1].value: (c[j], c[j - 1]) = (c[j - 1], c[j]) return c def selectionsort(cards, n): c = cards[:] for i in range(0, n): minj = i for j in range(i, n): if c[j].value < c[minj].value: minj = j (c[i], c[minj]) = (c[minj], c[i]) return c def main(): n = int(input()) cards = list(map(Card, input().split())) b = bubblesort(cards, n) print_array(b) print("Stable") s = selectionsort(cards, n) print_array(s) if b == s: print("Stable") else: print("Not Stable") if __name__ == "__main__": main()

s540425072

Accepted

#!/usr/bin/env python3 # -*- coding: utf-8 -*- class Card(object): def __init__(self, card): self.card = card self.suit = card[0] self.value = int(card[1:]) def __str__(self): return str(self.card) def print_array(a): print(" ".join(map(str, a))) def bubblesort(cards, n): c = cards[::] for i in range(0, n): for j in range(n - 1, i, -1): if c[j].value < c[j - 1].value: (c[j], c[j - 1]) = (c[j - 1], c[j]) return c def selectionsort(cards, n): c = cards[::] for i in range(0, n): minj = i for j in range(i, n): if c[j].value < c[minj].value: minj = j (c[i], c[minj]) = (c[minj], c[i]) return c def main(): n = int(input()) cards = list(map(Card, input().split())) b = bubblesort(cards, n) print_array(b) print("Stable") s = selectionsort(cards, n) print_array(s) if b == s: print("Stable") else: print("Not stable") if __name__ == "__main__": main()

s416218792

p03149

u768896740

Wrong Answer

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".

a = list(map(int, input().split())) count_a = 0 count_b = 0 count_c = 0 count_d = 0 for i in range(4): if a[i] == 1: count_a += 1 if a[i] == 4: count_b += 1 if a[i] == 7: count_c += 1 if a[i] == 9: count_d += 1 if count_a == 1 and count_b == 1 and count_c == 1 and count_d == 1: print('Yes') else: print('No')

s106400741

Accepted

a = list(map(int, input().split())) count_a = 0 count_b = 0 count_c = 0 count_d = 0 for i in range(4): if a[i] == 1: count_a += 1 if a[i] == 4: count_b += 1 if a[i] == 7: count_c += 1 if a[i] == 9: count_d += 1 if count_a == 1 and count_b == 1 and count_c == 1 and count_d == 1: print('YES') else: print('NO')

s505696631

p03658

u200239931

Wrong Answer

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.

import math import sys def getinputdata(): array_result = [] data = input() array_result.append(data.split(" ")) flg = 1 try: while flg: data = input() array_temp = [] if(data != ""): array_result.append(data.split(" ")) flg = 1 else: flg = 0 finally: return array_result arr_data = getinputdata() n = int(arr_data[0][0]) k = int(arr_data[0][1]) arr01=arr_data[1] arr02=sorted(list(map(int, arr01)),reverse=True) print(n,k,arr02) mysum=0 for v in range(0,len(arr02)): if(v!=k): mysum+=arr02[v] else: break print(mysum)

s979404321

Accepted

import math import sys def getinputdata(): array_result = [] data = input() array_result.append(data.split(" ")) flg = 1 try: while flg: data = input() array_temp = [] if(data != ""): array_result.append(data.split(" ")) flg = 1 else: flg = 0 finally: return array_result arr_data = getinputdata() n = int(arr_data[0][0]) k = int(arr_data[0][1]) arr01=arr_data[1] arr02=sorted(list(map(int, arr01)),reverse=True) #print(n,k,arr02) mysum=0 for v in range(0,len(arr02)): if(v!=k): mysum+=arr02[v] else: break print(mysum)

s771228892

p02399

u315329386

Wrong Answer

Write a program which reads two integers a and b, and calculates the following values: * a ÷ b: d (in integer) * remainder of a ÷ b: r (in integer) * a ÷ b: f (in real number)

a, b = map(int, input().split()) print(a // b, a % b, a / b)

s348908161

Accepted

a, b = map(int, input().split()) print("{} {} {:.5f}".format(a // b, a % b, a / b))

s675044897

p04043

u799751074

Wrong Answer

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 of the phrases once, in some order.

from sys import stdin lis = stdin.readline().rstrip().split() a = lis[0] b = lis[1] c = lis[2] if a == 5: if b == 5 and c ==7: print("YES") elif b == 7 and c ==5: print("YES") else: print("NO") elif a == 7: if b == 5 and c == 5: print("YES") else: print("NO")

s878180230

Accepted

from sys import stdin lis = stdin.readline().rstrip().split() a = int(lis[0]) b = int(lis[1]) c = int(lis[2]) if a == 5 or a == 7: if a == 5: if b == 5 and c ==7: print("YES") elif b == 7 and c ==5: print("YES") else: print("NO") elif a == 7: if b == 5 and c == 5: print("YES") else: print("NO") else: print("NO")

s716108796

p03694

u780475861

Wrong Answer

It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts. There are N houses along _TopCoDeer street_. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses. Find the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.

lst = [int(i) for i in input().split()] print(max(lst) - min(lst))

s434596876

Accepted

_ = input() lst = [int(i) for i in input().split()] print(max(lst) - min(lst))

s793339048

p03361

u919633157

Wrong Answer

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, j}= `#`, and to make Square (i, j) white when s_{i, j}= `.`. However, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black. Determine if square1001 can achieve his objective.

h,w=map(int,input().split()) s=[['.']*(w+2)] for i in range(h): s+=[['.']+list(input())+['.']] s+=[['.']*(w+2)] for i in s: print(*i) dset=((-1,0),(0,1),(1,0),(0,-1)) for i in range(1,h+1): for j in range(1,w+2): if s[i][j]=='.':continue flag=False for y,x in dset: if s[i+y][j+x]=='#': flag=True break if not flag: print('No') exit() print('Yes')

s882261258

Accepted

h,w=map(int,input().split()) s=[['.']*(w+2)] for i in range(h): s+=[['.']+list(input())+['.']] s+=[['.']*(w+2)] dset=((-1,0),(0,1),(1,0),(0,-1)) for i in range(1,h+1): for j in range(1,w+2): if s[i][j]=='.':continue flag=False for y,x in dset: if s[i+y][j+x]=='#': flag=True break if not flag: print('No') exit() print('Yes')

s552244182

p03696

u133936772

Wrong Answer

You are given a string S of length N consisting of `(` and `)`. Your task is to insert some number of `(` and `)` into S to obtain a _correct bracket sequence_. Here, a correct bracket sequence is defined as follows: * `()` is a correct bracket sequence. * If X is a correct bracket sequence, the concatenation of `(`, X and `)` in this order is also a correct bracket sequence. * If X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence. * Every correct bracket sequence can be derived from the rules above. Find the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.

input() s=t=input() l,r=p='()' exec("t.replace(p,'');"*50) c=t.count print(l*c(r)+s+r*c(l))

s206269588

Accepted

input() s=t=input() l,r=p='()' exec("t=t.replace(p,'');"*50) c=t.count print(l*c(r)+s+r*c(l))