Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02922 (python)

Fixed submission:
#!/usr/local/bin/python3
# coding: utf-8


hairu = input()
sockets = 0
plugs = 1
ab = hairu.split()

while True:
    if int(ab[1]) == 1:
        print(0)
        break

    sockets += 1
    plugs -= 1
    plugs += int(ab[0])
    if int(ab[1]) <= plugs:
        print(sockets)
        break

Buggy submission (verdict: Runtime Error):
#!/usr/local/bin/python3
# coding: utf-8


hairu = input()
sockets = 0
plugs = 1
ab = hairu.split()

while True:
    sockets += 1
    plugs -= 1
    plugs += int(ab[0])
    if int(ab[1]) < plugs:
        print(sockets)
        exit(1)
Problem p02720 (python)

Fixed submission:
K = int(input())

LLs = []

def dfs(d, num):
    LLs.append(num)
    
    if d == 10: return

    a = num % 10
    for i in [-1, 0, 1]:
        b = a + i
        if  0 <= b < 10:
            dfs(d+1, num * 10 + b)

d = 1
for i in range(1, 10):
    dfs(d, i)

print(sorted(LLs)[K-1])

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3

from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

K = int(input())

LLs = []

def dfs(d, num):
    LLs.append(num)
    
    if d == 10: return

    a = num % 10
    for i in [-1, 0, 1]:
        b = a + i
        if  0 <= b < 10:
            dfs(d+1, num * 10 + b)

d = 1
for i in range(1, 10):
    dfs(d, i)

print(sorted(LLs)[K-1])

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3

from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

K = int(input())

d = 10000

LLs = []

def dfs(d, num):
    LLs.append(num)
    
    if d == 10: return

    a = num % 10
    for i in [-1, 0, 1]:
        b = a + i
        if  0 <= b < 10:
            dfs(d+1, num * 10 + b)

d = 1
for i in range(1, 10):
    dfs(d, i)

print(sorted(LLs)[K-1])
Problem p02741 (python)

Fixed submission:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

N = int(input())

a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

def solve(N, a):
    return a[N-1]

print(solve(N, a))

Buggy submission (verdict: Runtime Error):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

N = int(input())

a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

def solve(N, a):
    return a[N]

print(solve(N, a))

Buggy submission (verdict: Runtime Error):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

N = int(input())

a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

def solve(N, a):
    return a[N]

print(solve(N, S))
Problem p02742 (python)

Fixed submission:
from math import floor

N = [int(_) for _ in input().split()]

H, W = N[0], N[1]


def solve(H, W):
    acnt = floor(W / 2) + 1
    bcnt = W - acnt
    
    if H == 1 or W == 1:
        return 1
    else:
        return floor((H * W + 1) / 2)
    
    # if H % 2 == 0:
    #     cnt = acnt * floor(H/2) + bcnt * floor(H/2)
    # else:
    #     cnt = acnt * (floor(H/2) + 1) + bcnt * floor(H/2)
    # return cnt

print(solve(H, W))

Buggy submission (verdict: Runtime Error):
N = [int(_) for _ in input().split()]

H, W = N[0], N[1]


def solve(H, W):
    acnt = floor(W / 2) + 1
    bcnt = W - acnt
    
    if H == 1 or W == 1:
        return 1
    
    if H % 2 == 0:
        cnt = acnt * floor(H/2) + bcnt * floor(H/2)
    else:
        cnt = acnt * (floor(H/2) + 1) + bcnt * floor(H/2)
    return cnt

print(solve(H, W))
Problem p02743 (python)

Fixed submission:
N = [int(_) for _ in input().split()]

def solve(a, b, c):
    
    # if c < a or c < b:
    #     return "No"

    # if a + 2*sqrt(a*b) + b - c < 0.0:
    #     return "Yes"
    # else:
    #     return "No"
    
    d = c-a-b
    if  0 < d and 4*a*b < d * d:
        return "Yes"
    else:
        return "No"

print(solve(N[0], N[1], N[2]))

Buggy submission (verdict: Runtime Error):
N = [int(_) for _ in input().split()]

def solve(a, b, c):
    
    # if c < a or c < b:
    #     return "No"

    # if a + 2*sqrt(a*b) + b - c < 0.0:
    #     return "Yes"
    # else:
    #     return "No"
    
    d = c-a-b
    if  0 < d and 4ab < d * d:
        return "Yes"
    else:
        return "No"

print(solve(N[0], N[1], N[2]))
Problem p02755 (python)

Fixed submission:
A, B = [int(_) for _ in input().split()]

for i in range(0, 1250+1):

    if int(i * 0.08) == A and int(i * 0.1) == B:
        print(i)
        exit()
print(-1)

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3

from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

A, B = [int(_) for _ in input().split()]

for i in range(100+1):

    if int(i * 0.08) == A and int(i * 0.1) == B:
        print(i)
        exit()
print(-1)
Problem p03069 (python)

Fixed submission:
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
from collections import Counter, deque, defaultdict

N = int(input())
S = input()

mi = 10000000

c = Counter(S)
A = N - c["#"]
B = N - c["."]

l = 0
r = c["."]

for i in range(0, N):

    if S[i] == "#":
        l += 1
    else:
        r -= 1
    a = l + r
    if mi > a:
        mi = a

print(min(mi, A, B))

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3

# from fractions import gcd
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
from collections import Counter, deque, defaultdict

N = int(input())
S = input()

mi = 10000000

c = Counter(S)
A = N - c["#"]
B = N - c["."]

for i in range(1, N):
    l = S[:i]
    r = S[i:]
    a = l.count("#") + r.count(".")
    if mi > a:
        mi = a

print(min(mi, A, B))

Buggy submission (verdict: Runtime Error):
# from fractions import gcd
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
from collections import Counter, deque, defaultdict

N = int(input())
S = input()

mi = 10000000

c = Counter(S)
A = N - c["#"]
B = N - c["."]

for i in range(1, N):
    l = S[:i]
    r = S[i:]
    a = l.count("#") + r.count(".")
    if mi > a:
        mi = a

print(min(mi, A, B))

Buggy submission (verdict: Runtime Error):
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

N = int(input())
S = input()

c = Counter(S)
print(max(0, c["#"] - 1))

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3

# from fractions import gcd
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

N = int(input())
S = input()

c = Counter(S)
print(max(0, c["#"] - 1))

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()

c = Counter(S)
print(max(0, c["#"] - 1))
Problem p03944 (python)

Fixed submission:
W, H, N = [int(_) for _ in input().split()]
xya = [[int(_) for _ in input().split()] for i in range(N)]

d = [[0], [W], [0], [H]]

for x, y, a in xya:
    if a == 1 or a == 2:
        d[a-1] += [x]
    else:
        d[a-1] += [y]

if min(d[1]) - max(d[0]) > 0 and min(d[3]) - max(d[2]) > 0:
    ret = (min(d[1]) - max(d[0])) * ( min(d[3]) - max(d[2]))
    print(max(ret, 0))
else:
    print(0)

Buggy submission (verdict: Runtime Error):
W, H, N = [int(_) for _ in input().split()]
xya = [[int(_) for _ in input().split()] for i in range(N)]

d = [[0], [W], [0], [H]]

for x, y, a in xya:
    if a == 1 or a == 2:
        d[a-1] += [x]
    else:
        d[a-1] += [y]

if (max(d[0]) - min(d[1])) > 0 and (max(d[2]) - min(d[3]) > 0:
    ret = (max(d[0]) - min(d[1])) * (max(d[2]) - min(d[3]))
    print(max(ret, 0))
else:
    print(0)
Problem p03998 (python)

Fixed submission:
#! /usr/bin/env python3

from fractions import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

A = input()
B = input()
C = input()

ABC = {"a":deque(A), "b":deque(B), "c":deque(C)}
ABC_H = {"a":"A", "b":"B", "c":"C"}

ind = A[0]
while True:

    if len(ABC[ind]) == 0:
        break 
    ind = ABC[ind].popleft()

print(ABC_H[ind])

Buggy submission (verdict: Runtime Error):
A = input()
B = input()
C = input()

ABC = {"a":deque(A), "b":deque(B), "c":deque(C)}
ABC_H = {"a":"A", "b":"B", "c":"C"}

ind = A[0]
while True:

    if len(ABC[ind]) == 0:
        break 
    ind = ABC[ind].popleft()

print(ABC_H[ind])
Problem p04012 (python)

Fixed submission:
#! /usr/bin/env python3

from fractions import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

S = input()

c = Counter(S)

for i in c:
    if c[i] % 2 != 0:
        print("No")
        exit()
print("Yes")

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3

# from fractions import gcd
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

S = input()

c = Counter(S)

for i in c:
    if c[i] % 2 != 0:
        print("No")
        exit()
print("Yes")
Problem p02882 (python)

Fixed submission:

import math


def submit():
    a, b, x = map(int, input().split())

    if x >= a*a*b/2:
        c = (2*x - a*a*b)/(a*a)
        if b == c:
            beta = 90
        else:
            beta = math.degrees(math.atan(a/(b-c)))
    else:
        d = 2*x/(a*b*b)
        beta = math.degrees(math.atan(d))
    
    print(90 - beta)
    

if __name__ == "__main__":
    submit()

Buggy submission (verdict: Runtime Error):

import math


def submit():
    a, b, x = map(int, input().split())

    if x >= a*a*b/2:
        c = (2*x - a*a*b)/(a*a)
        beta = math.degrees(math.atan(a/(b-c)))
    else:
        d = 2*x/(a*b*b)
        beta = math.degrees(math.atan(d))
    
    print(90 - beta)
    

if __name__ == "__main__":
    submit()
Problem p02900 (python)

Fixed submission:

import math


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def prime_fact(x):
    prime_pow = {}
    check_ceil = math.ceil(math.sqrt(x))
    for p in range(2, check_ceil + 1):
        p_cnt = 0
        while x % p == 0:
            x //= p
            p_cnt += 1
        if p_cnt:
            prime_pow[p] = p_cnt
    if x > 1:
        prime_pow[x] = 1
    return prime_pow


def submit():
    a, b = map(int, input().split())
    g = gcd(a, b)
    # gcdの素因数分解して素因数の数を求める
    p = prime_fact(g)
    print(len(p) + 1)


if __name__ == "__main__":
    submit()

Buggy submission (verdict: Runtime Error):


def submit():
    a, b = map(int, input().split())
    s = min(a, b)
    l = max(a, b)

    # 公約数を求める
    divisors = []
    for x in range(2, math.ceil(math.sqrt(s)) + 1):
        if x >= s:
            break

        if s % x == 0 and l % x == 0:
            divisors.append(x)
    if l % s == 0:
        divisors.append(s)

    # ふるいにかけて素数のみ数える
    ans = 0
    lst = divisors[-1]
    unprime = set()
    for d in divisors:
        if d == 1:
            continue 

        if d not in unprime:
            ans += 1
            c = 2*d
            while c <= lst:
                unprime.add(c)
                c += d
    print(ans + 1)

        
if __name__ == "__main__":
    submit()

Buggy submission (verdict: Runtime Error):

from collections import OrderedDict
import math


def submit():
    a, b = map(int, input().split())
    s = min(a, b)
    l = max(a, b)

    if s == 1:
        print(1)
        return

    # 公約数を求める
    divisors = OrderedDict()
    for x in range(2, math.ceil(math.sqrt(s)) + 1):
        if s % x == 0 and l % x == 0:
            divisors[x] = True
    if l % s == 0:
        divisors[s] = True

    # ふるいにかけて素数のみ数える
    ans = 0
    lst = next(reversed(divisors))
    unprime = {}
    for d, v in divisors.items():
        if d not in unprime.keys():
            ans += 1
            c = 2*d
            while c <= lst:
                unprime[c] = 1
                c += d
    print(ans + 1)

        
if __name__ == "__main__":
    submit()

Buggy submission (verdict: Runtime Error):

from collections import OrderedDict
import math


def submit():
    a, b = map(int, input().split())
    s = min(a, b)
    l = max(a, b)

    if s == 1:
        print(1)
        return

    # 公約数を求める
    divisors = OrderedDict()
    for x in range(2, math.ceil(math.sqrt(s)) + 1):
        if s % x == 0 and l % x == 0:
            divisors[x] = True
    if l % s == 0:
        divisors[s] = True

    # ふるいにかけて素数のみ数える
    ans = 0
    lst = next(reversed(divisors))
    for d, v in divisors.items():
        if v:
            ans += 1
            c = 2*d
            while c <= lst:
                if c in divisors.keys():
                    divisors[c] = False
                c += d
    print(ans + 1)

        
if __name__ == "__main__":
    submit()
Problem p03031 (python)

Fixed submission:


def read_input():
    n, m = map(int, input().split())

    slist = []
    for i in range(m):
        temp = list(map(int, input().split()))
        k = temp[0]
        s = temp[1:]
        slist.append((k, s))

    p = list(map(int, input().split()))

    return n, m, slist, p


def switch_gen(n):
    curr = 0

    while True:
        bincurr = bin(curr)[2:]

        if len(bincurr) > n:
            return None
        bincurr = [int(c) for c in bincurr]
        t = [0] * (n - len(bincurr))
        t.extend(bincurr)
        yield t

        curr += 1


def check_condition(switch, slist, plist):
    for s, p in zip(slist, plist):
        count = 0
        for i in s[1]:
            if switch[i - 1] == 1:
                count += 1

        if count % 2 != p:
            return False

    return True


def submit():
    n, m, slist, p = read_input()

    count = 0
    for switch in switch_gen(n):
        if check_condition(switch, slist, p):
            count += 1

    print(count)




if __name__ == '__main__':
    submit()

Buggy submission (verdict: Runtime Error):


def read_input():
    n, m = map(int, input().split())

    slist = []
    for i in range(m):
        temp = list(map(int, input().split()))
        k = temp[0]
        s = temp[1:]
        slist.append((k, s))

    p = list(map(int, input().split()))

    return n, m, slist, p


def switch_gen(n):
    curr = 0

    while True:
        bincurr = bin(curr)[2:]

        if len(bincurr) > n:
            return None
        bincurr = [int(c) for c in bincurr]
        t = [0] * (n - len(bincurr))
        t.extend(bincurr)
        yield t

        curr += 1


def check_condition(switch, slist, plist):
    for s, p in zip(slist, plist):
        count = 0
        for i in s[1]:
            if switch[i - 1] == 1:
                count += 1

        if count % 2 != p:
            return False

    return True


def submit():
    n, m, slist, p = read_input()

    count = 0
    for switch in switch_gen(n):
        if check_condition(switch, slist, p):
            count += 1

    print(count)




if __name__ == '__main__':
    submit()
Problem p03032 (python)

Fixed submission:
from collections import deque

def read_input():
    n, k = map(int, input().split())
    vlist = list(map(int, input().split()))

    return n, k, vlist


def submit():
    n, k, vlist = read_input()

    maxvalue = 0
    for kk in range(1, k + 1):
        # 左からi回宝石を取得する
        # 右からkk-i回宝石を取得する
        for i in range(kk + 1):
            getv = []
            minusv = []
            vq_temp = deque()

            for v in vlist:
                vq_temp.append(v)

            for j in range(i):
                if len(vq_temp) > 0:
                    vl = vq_temp.popleft()
                    if vl < 0:
                        minusv.append(vl)
                    else:
                        getv.append(vl)
                else:
                    break

            for j in range(kk - i):
                if len(vq_temp) > 0:
                    vr = vq_temp.pop()
                    if vr < 0:
                        minusv.append(vr)
                    else:
                        getv.append(vr)
                else:
                    break


            # k - kk回はminusを削除できる
            minusv.sort()
            for m in range(k - kk):
                if minusv:
                    minusv.remove(minusv[0])
                else:
                    break

            currvalue = sum(getv) + sum(minusv)

            if currvalue > maxvalue:
                maxvalue = currvalue

    print(maxvalue)

if __name__ == '__main__':
    submit()

Buggy submission (verdict: Runtime Error):
from collections import deque

def read_input():
    n, k = map(int, input().split())
    vlist = list(map(int, input().split()))
    vq = deque()

    for v in vlist:
        vq.append(v)

    return n, k, vq


def submit():
    n, k, vq = read_input()

    maxvalue = 0
    for kk in range(1, k):
        # 左からi回宝石を取得する
        # 右からkk-i回宝石を取得する
        for i in range(kk + 1):
            getv = []
            minusv = []
            vq_temp = vq.copy()
            for j in range(i):
                if len(vq_temp) > 0:
                    vl = vq_temp.popleft()
                    if vl < 0:
                        minusv.append(vl)
                    else:
                        getv.append(vl)
                else:
                    break

            for j in range(kk - i):
                if len(vq_temp) > 0:
                    vr = vq_temp.pop()
                    if vr < 0:
                        minusv.append(vr)
                    else:
                        getv.append(vr)
                else:
                    break


            # k - kk回はminusを削除できる
            minusv.sort()
            for m in range(k - kk):
                if minusv:
                    minusv.remove(minusv[0])
                else:
                    break

            currvalue = sum(getv) + sum(minusv)

            if currvalue > maxvalue:
                maxvalue = currvalue

    print(maxvalue)







if __name__ == '__main__':
    submit()
Problem p03043 (python)

Fixed submission:
import math

def read_input():
    n, k = map(int, input().split())
    return n, k


# x*2^d >= k となる最小のkを求める
def calc_d(x, k):
    return int(math.ceil(math.log2(k/x)))


def submit():
    n, k = read_input()

    result = 0
    for i in range(1, n + 1):
        if i < k:
            result += math.pow((1/2), calc_d(i, k))
        else:
            result += 1.0

    print(result/n)


if __name__ == '__main__':
    submit()

Buggy submission (verdict: Runtime Error):
import math

def read_input():
    n, k = map(int, input().split())
    return n, k


# x*2^d >= k となる最小のkを求める
def calc_d(x, k):
    return int(math.ceil(math.log2(k/x)))


def submit():
    n, k = read_input()

    result = 0
    for i in range(1, n + 1):
        if i < k:
            result += math.pow((1/2), calc_d(i, k))
        else:
            result += 1.0

    print(result/n)


if __name__ == '__main__':
    submit()