message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,359 | 14 | 74,718 |
Tags: implementation
Correct Solution:
```
l, b = list(map(int,input().strip().split(' ')))
years = 0
while l <= b:
l = l * 3
b = b * 2
years+=1
print(years)
``` | output | 1 | 37,359 | 14 | 74,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,360 | 14 | 74,720 |
Tags: implementation
Correct Solution:
```
a, b = map(int, input().split())
count = 0
while a <= b:
b, a = b * 2, a * 3
count += 1
print(count)
``` | output | 1 | 37,360 | 14 | 74,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,361 | 14 | 74,722 |
Tags: implementation
Correct Solution:
```
a, b = map(int, input().split())
i = 0
while True:
if a > b:
break
a *= 3
b *= 2
i += 1
print(i)
``` | output | 1 | 37,361 | 14 | 74,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,362 | 14 | 74,724 |
Tags: implementation
Correct Solution:
```
x=[int(y) for y in input().split()]
f=0
while(True):
if(x[0]>x[1]):
break
x[0]=x[0]*3
x[1]=x[1]*2
f+=1
print(f)
``` | output | 1 | 37,362 | 14 | 74,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,363 | 14 | 74,726 |
Tags: implementation
Correct Solution:
```
'''3**x*a > 2**x*b => (3/2)**x > (b/a) => x > log (3/2) (b/a)'''
import math
a,b=(int(x) for x in input().split())
print(math.floor(math.log(b/a,3/2)+1)) #Need +1 since its possible math.log(b/a,3/2) is integer in which case we need
#year... | output | 1 | 37,363 | 14 | 74,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,364 | 14 | 74,728 |
Tags: implementation
Correct Solution:
```
l,b=map(int,input().split())
c = 0
if(l == b or l >= b):
print("1")
elif(l <= b):
while(l <= b):
l *= 3
b *= 2
c += 1
print(c)
``` | output | 1 | 37,364 | 14 | 74,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,365 | 14 | 74,730 |
Tags: implementation
Correct Solution:
```
l, b = map(int,input().split())
x = 0
while l<=b:
l *= 3
b *= 2
x += 1
print(x)
``` | output | 1 | 37,365 | 14 | 74,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.
... | instruction | 0 | 37,366 | 14 | 74,732 |
Tags: implementation
Correct Solution:
```
from math import floor
from math import log
a=input().split()
l=int(a[0])
b=int(a[1])
print(floor(log(b/l,1.5))+1)
``` | output | 1 | 37,366 | 14 | 74,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,367 | 14 | 74,734 |
Yes | output | 1 | 37,367 | 14 | 74,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,368 | 14 | 74,736 |
Yes | output | 1 | 37,368 | 14 | 74,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,369 | 14 | 74,738 |
Yes | output | 1 | 37,369 | 14 | 74,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,370 | 14 | 74,740 |
Yes | output | 1 | 37,370 | 14 | 74,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,371 | 14 | 74,742 |
No | output | 1 | 37,371 | 14 | 74,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,372 | 14 | 74,744 |
No | output | 1 | 37,372 | 14 | 74,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,373 | 14 | 74,746 |
No | output | 1 | 37,373 | 14 | 74,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.
Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is s... | instruction | 0 | 37,374 | 14 | 74,748 |
No | output | 1 | 37,374 | 14 | 74,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,475 | 14 | 74,950 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
s = input()
if s == "1" or ("000" not in s and "11" not in s and (len(s) > 1 and not(s[0] == "0" and s[1] == "0") and not(s[-1] == "0" and s[-2] == "0"))):
print("YES")
else:
print("NO")
``` | output | 1 | 37,475 | 14 | 74,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,476 | 14 | 74,952 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
result = "Yes"
seat = input()
if n == 1:
if seat[0] == "0":
result = "No"
else:
if seat[0] == "1":
if seat[1] == 1:
result = "No"
else:
if seat[1] == "0":
result = "No"
if s... | output | 1 | 37,476 | 14 | 74,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,477 | 14 | 74,954 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
c = input()
for i in range(1,n):
if c[i] == c[i - 1] and c[i] != "0":
print("No")
exit()
for i in range(n):
if c[i] == '0' and (i == 0 or c[i - 1] == '0') and (i == n - 1 or c[i + 1] == '0'):
print("No")
... | output | 1 | 37,477 | 14 | 74,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,478 | 14 | 74,956 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
s = input()
flag = True
if(n==1 and not s=='1'):
flag = False
else:
temp = [0 for i in range(n)]
for i in range(n):
if(s[i]=='1'):
temp[i]+=2
if(i-1>=0):
temp[i-1]+=1
if(i+1<n):
temp[i+1]+=1
# print(temp)
for i in ... | output | 1 | 37,478 | 14 | 74,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,479 | 14 | 74,958 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n=int(input())
a=str(input())
flag=0
if(len(a)==1):
if(a[0]=='1'):
print('YES')
else:
print('NO')
elif(len(a)==2):
if(a[0]==a[1]=='1' or (a[0]==a[1]=='0')):
print('NO')
else:
print('YES')
else:
for i in ... | output | 1 | 37,479 | 14 | 74,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,480 | 14 | 74,960 |
Tags: brute force, constructive algorithms
Correct Solution:
```
def main():
n = int(input())
print(proc(maxk(input())))
def maxk(inp):
if inp == "0":
return False
if "11" in inp:
return False
if "000" in inp:
return False
if inp[0:2] == "00":
return False
n =... | output | 1 | 37,480 | 14 | 74,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,481 | 14 | 74,962 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
s = input()
i = 0
res = True
count = 0
while(i<n):
if s[i]=='1':
if count>2 or (i!=0 and count==0):
res = False
break
count=0
else:
count+=1
i+=1
if (n==1 and s[0]=='0') or (n>1 and s[0]=='0' and s[1]=='0'):
... | output | 1 | 37,481 | 14 | 74,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to seat one more person without violating the first r... | instruction | 0 | 37,482 | 14 | 74,964 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
s = input()
if n == 1:
if s == '0':
print('No')
else:
print('Yes')
elif n == 2:
if s == '00' or s == '11':
print('No')
else:
print('Yes')
else:
if s.find('11') + 1 or s.find('000') + 1:
... | output | 1 | 37,482 | 14 | 74,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,483 | 14 | 74,966 |
Yes | output | 1 | 37,483 | 14 | 74,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,484 | 14 | 74,968 |
Yes | output | 1 | 37,484 | 14 | 74,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,485 | 14 | 74,970 |
Yes | output | 1 | 37,485 | 14 | 74,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,486 | 14 | 74,972 |
Yes | output | 1 | 37,486 | 14 | 74,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,487 | 14 | 74,974 |
No | output | 1 | 37,487 | 14 | 74,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,488 | 14 | 74,976 |
No | output | 1 | 37,488 | 14 | 74,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,489 | 14 | 74,978 |
No | output | 1 | 37,489 | 14 | 74,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a row with n chairs. We call a seating of people "maximal" if the two following conditions hold:
1. There are no neighbors adjacent to anyone seated.
2. It's impossible to sea... | instruction | 0 | 37,490 | 14 | 74,980 |
No | output | 1 | 37,490 | 14 | 74,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,751 | 14 | 75,502 |
Tags: greedy, math
Correct Solution:
```
a = [[], []]
_ = ([[a[i].append(int(x)) for i, x in enumerate(input().split())] for _ in range(int(input()))], [x.sort() for x in a], print(len(a[0]) + sum(max(x, y) for x, y in zip(*a))))
``` | output | 1 | 37,751 | 14 | 75,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,752 | 14 | 75,504 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
a = []
b = []
for _ in range(n):
x = list(map(int,input().split(' ')))
a.append(x[0])
b.append(x[1])
a.sort()
b.sort()
sum = 0
for _ in range(n):
sum += max(a[_],b[_])
print(sum+n)
``` | output | 1 | 37,752 | 14 | 75,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,753 | 14 | 75,506 |
Tags: greedy, math
Correct Solution:
```
#!/usr/bin/env python3
import sys
def rint():
return map(int, sys.stdin.readline().split())
#lines = stdin.readlines()
n = int(input())
r = [0]*n
l = [0]*n
for i in range(n):
r[i], l[i] = rint()
r.sort()
l.sort()
ans = 0
for i in range(n):
ans += max(r[i], l[i]... | output | 1 | 37,753 | 14 | 75,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,754 | 14 | 75,508 |
Tags: greedy, math
Correct Solution:
```
n=int(input())
ans=n
l=[]
r=[]
for i in range(n):
x,y=map(int,input().split())
l.append(x)
r.append(y)
l.sort()
r.sort()
for i in range(n):
ans+=max(l[i],r[i])
print(ans)
``` | output | 1 | 37,754 | 14 | 75,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,755 | 14 | 75,510 |
Tags: greedy, math
Correct Solution:
```
from collections import defaultdict, deque
from heapq import heappush, heappop
from math import inf
ri = lambda : map(int, input().split())
def solve():
n = int(input())
left = []
right = []
for _ in range(n):
l , r = ri()
left.append(l)
... | output | 1 | 37,755 | 14 | 75,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,756 | 14 | 75,512 |
Tags: greedy, math
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
fro... | output | 1 | 37,756 | 14 | 75,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,757 | 14 | 75,514 |
Tags: greedy, math
Correct Solution:
```
n=int(input())
x=[]
r=0
for i in range(n):
a,b=map(int,input().split())
x.append((a,b))
x1=sorted(x,key=lambda y:y[0],reverse=True)
x2=sorted(x,key=lambda y:y[1],reverse=True)
for i in range(n):
r+=max(x1[i][0],x2[i][1])+1
print(r)
``` | output | 1 | 37,757 | 14 | 75,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,758 | 14 | 75,516 |
Tags: greedy, math
Correct Solution:
```
from collections import defaultdict
import io, os, math
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
rr = lambda: input()
rri = lambda: int(input())
rrm = lambda: list(map(int, input().split()))
INF=float('inf')
def solve(N, pairs):
chairs = N
left = [v[0] f... | output | 1 | 37,758 | 14 | 75,517 |
Provide tags and a correct Python 2 solution for this coding contest problem.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your guests happen to be a little bit shy, so the i... | instruction | 0 | 37,759 | 14 | 75,518 |
Tags: greedy, math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def in_arr():
return map(int,raw_input().split())
def pr_num(n):
stdout.write(str(n)+'\n')
def p... | output | 1 | 37,759 | 14 | 75,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,760 | 14 | 75,520 |
Yes | output | 1 | 37,760 | 14 | 75,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,761 | 14 | 75,522 |
Yes | output | 1 | 37,761 | 14 | 75,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,762 | 14 | 75,524 |
Yes | output | 1 | 37,762 | 14 | 75,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,763 | 14 | 75,526 |
Yes | output | 1 | 37,763 | 14 | 75,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,764 | 14 | 75,528 |
No | output | 1 | 37,764 | 14 | 75,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,765 | 14 | 75,530 |
No | output | 1 | 37,765 | 14 | 75,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,766 | 14 | 75,532 |
No | output | 1 | 37,766 | 14 | 75,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You invited n guests to dinner! You plan to arrange one or more circles of chairs. Each chair is going to be either occupied by one guest, or be empty. You can make any number of circles.
Your... | instruction | 0 | 37,767 | 14 | 75,534 |
No | output | 1 | 37,767 | 14 | 75,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova has won n trophies in different competitions. Each trophy is either golden or silver. The trophies are arranged in a row.
The beauty of the arrangement is the length of the longest subsegment consisting of golden trophies. Vova wants t... | instruction | 0 | 37,769 | 14 | 75,538 |
Tags: greedy
Correct Solution:
```
n = int(input())
s = input()
l = []
d = []
gcnt = scnt = 0
g = False
if s[0] == 'G':
g = True
gcnt = 1
else:
g = False
scnt = 1
a = s[1:]
for i in a:
if i == 'G':
if g:
gcnt += 1
else:
d.append(scnt)
scnt = 0
... | output | 1 | 37,769 | 14 | 75,539 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.