message stringlengths 2 28.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 21 109k | cluster float64 7 7 | __index_level_0__ int64 42 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,937 | 7 | 155,874 |
Yes | output | 1 | 77,937 | 7 | 155,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,938 | 7 | 155,876 |
Yes | output | 1 | 77,938 | 7 | 155,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,939 | 7 | 155,878 |
Yes | output | 1 | 77,939 | 7 | 155,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,940 | 7 | 155,880 |
Yes | output | 1 | 77,940 | 7 | 155,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,941 | 7 | 155,882 |
No | output | 1 | 77,941 | 7 | 155,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,942 | 7 | 155,884 |
No | output | 1 | 77,942 | 7 | 155,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,943 | 7 | 155,886 |
No | output | 1 | 77,943 | 7 | 155,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!... | instruction | 0 | 77,944 | 7 | 155,888 |
No | output | 1 | 77,944 | 7 | 155,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,956 | 7 | 155,912 |
Tags: data structures, greedy, implementation
Correct Solution:
```
import sys
from collections import defaultdict as di
color = input()
n = len(color)
lnei = [-1]*n
rnei = [-1]*n
to_be_deleted = []
deleted = [False]*n
iters = 0
for i in range(n):
if i-1>=0:
lnei[i]=i-1
if color[i]!=color[i-1]:
... | output | 1 | 77,956 | 7 | 155,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,957 | 7 | 155,914 |
Tags: data structures, greedy, implementation
Correct Solution:
```
s=input()
a=[[s[0],1]]
for i in s[1:]:
if(a[-1][0]==i):
a[-1][1]+=1
else:
a.append([i,1])
turns=0
while((len(a)>1)):
turns+=1
temp=[]
if(a[0][1]>1):
temp.append([a[0][0],a[0][1]-1])
for i in a[1:-1]:
... | output | 1 | 77,957 | 7 | 155,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,958 | 7 | 155,916 |
Tags: data structures, greedy, implementation
Correct Solution:
```
s = input()
n = 1
for i in range(1, len(s)):
if s[i] != s[i-1]:
n += 1
mas = [0] * n
col = [0] * n
count = 1
idx = 0
c = s[0]
for i in range(1, len(s)):
if s[i] == s[i-1]:
count += 1
else:
mas[idx] = count
col[idx] = c
... | output | 1 | 77,958 | 7 | 155,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,959 | 7 | 155,918 |
Tags: data structures, greedy, implementation
Correct Solution:
```
s = input()
cur_len = 1
a = []
char = []
for i in range(1, len(s)):
if s[i] == s[i-1]: cur_len += 1
else:
a.append(cur_len)
char.append(s[i-1])
cur_len = 1
a.append(cur_len)
char.append(s[len(s)-1])
ans = 0
while len(... | output | 1 | 77,959 | 7 | 155,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,960 | 7 | 155,920 |
Tags: data structures, greedy, implementation
Correct Solution:
```
# https://codeforces.com/problemset/problem/909/D
def process(a):
assert len(a) >= 2
n = len(a)
min_ = float('inf')
for i, [cnt, c] in enumerate(a):
if i == 0 or i == n-1:
min_ = min(min_, cnt)
else:... | output | 1 | 77,960 | 7 | 155,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,961 | 7 | 155,922 |
Tags: data structures, greedy, implementation
Correct Solution:
```
name = input()
blocks = []
now = name[0]
counter = 1
for x in range(1, len(name)):
if name[x] != now:
blocks.append((now, counter))
now = name[x]
counter = 1
else:
counter += 1
blocks.append((now, counter))
cou... | output | 1 | 77,961 | 7 | 155,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left... | instruction | 0 | 77,962 | 7 | 155,924 |
Tags: data structures, greedy, implementation
Correct Solution:
```
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
points = read().strip()
lst = [[points[0], 1]]
for p in points[1:]:
if p == lst[-1][0]:
lst[-1][1] += 1
else:
lst += [[p, 1]]
ans = 0
while len(lst) > 1:
... | output | 1 | 77,962 | 7 | 155,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each poin... | instruction | 0 | 77,963 | 7 | 155,926 |
No | output | 1 | 77,963 | 7 | 155,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each poin... | instruction | 0 | 77,966 | 7 | 155,932 |
No | output | 1 | 77,966 | 7 | 155,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,347 | 7 | 156,694 |
Yes | output | 1 | 78,347 | 7 | 156,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,348 | 7 | 156,696 |
Yes | output | 1 | 78,348 | 7 | 156,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,349 | 7 | 156,698 |
Yes | output | 1 | 78,349 | 7 | 156,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,350 | 7 | 156,700 |
Yes | output | 1 | 78,350 | 7 | 156,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,351 | 7 | 156,702 |
No | output | 1 | 78,351 | 7 | 156,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,352 | 7 | 156,704 |
No | output | 1 | 78,352 | 7 | 156,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,353 | 7 | 156,706 |
No | output | 1 | 78,353 | 7 | 156,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are given two strings l and r, both of length n. ... | instruction | 0 | 78,354 | 7 | 156,708 |
No | output | 1 | 78,354 | 7 | 156,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n lanterns in a row. The lantern i is placed in position i and has power equal to p_i.
Each lantern can be directed to illuminate either some lanterns to the left or some lanterns to the right. If the i-th lantern is turned to the... | instruction | 0 | 78,497 | 7 | 156,994 |
Tags: binary search, data structures, dp
Correct Solution:
```
from bisect import *
from collections import *
from math import gcd,ceil,sqrt,floor,inf
from heapq import *
from itertools import *
from operator import add,mul,sub,xor,truediv,floordiv
from functools import *
#---------------------------------------------... | output | 1 | 78,497 | 7 | 156,995 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n lanterns in a row. The lantern i is placed in position i and has power equal to p_i.
Each lantern can be directed to illuminate either some lanterns to the left or some lanterns to the right. If the i-th lantern is turned to the... | instruction | 0 | 78,498 | 7 | 156,996 |
Tags: binary search, data structures, dp
Correct Solution:
```
from bisect import bisect_left;from math import inf
class ST:
def __init__(self,arr):
n=len(arr);mx=n.bit_length();self.st=[[0]*mx for i in range(n)]
for i in range(n):self.st[i][0]=arr[i]
for j in range(1,mx):
for i ... | output | 1 | 78,498 | 7 | 156,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n lanterns in a row. The lantern i is placed in position i and has power equal to p_i.
Each lantern can be directed to illuminate either some lanterns to the left or some lanterns to the right. If the i-th lantern is turned to the... | instruction | 0 | 78,499 | 7 | 156,998 |
Tags: binary search, data structures, dp
Correct Solution:
```
from bisect import *
from collections import *
from math import gcd,ceil,sqrt,floor,inf
from heapq import *
from itertools import *
from operator import add,mul,sub,xor,truediv,floordiv
from functools import *
#--------------------------------------------... | output | 1 | 78,499 | 7 | 156,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n lanterns in a row. The lantern i is placed in position i and has power equal to p_i.
Each lantern can be directed to illuminate either some lanterns to the left or some lanterns to ... | instruction | 0 | 78,501 | 7 | 157,002 |
No | output | 1 | 78,501 | 7 | 157,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n lanterns in a row. The lantern i is placed in position i and has power equal to p_i.
Each lantern can be directed to illuminate either some lanterns to the left or some lanterns to ... | instruction | 0 | 78,503 | 7 | 157,006 |
No | output | 1 | 78,503 | 7 | 157,007 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,846 | 7 | 157,692 |
"Correct Solution:
```
n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if... | output | 1 | 78,846 | 7 | 157,693 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,847 | 7 | 157,694 |
"Correct Solution:
```
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
w = []
r = []
o = []
s = input()
for i in range(n):
if s[i] == 'O':
o.append(a[i])
if s[i] == 'R':
r.append(a[i])
if s[i] == 'W':
w.append(a[i])
o.sort(), w.sort(), r.sort()
w = w[::-1... | output | 1 | 78,847 | 7 | 157,695 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,848 | 7 | 157,696 |
"Correct Solution:
```
n,k = map(int, input().split())
b = list(map(int,input().split()))
SSSSSSSSSS = input()
INF = 1000*1000*1000+123
RRRR = [];
WWWWWWW = [];
OOOOOOOOO = [];
for i in range(n):
if SSSSSSSSSS[i] == 'R':
RRRR.append(b[i])
elif SSSSSSSSSS[i] == 'W':
WWWWWWW.append(b[i])
el... | output | 1 | 78,848 | 7 | 157,697 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,849 | 7 | 157,698 |
"Correct Solution:
```
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
a=[]
if k==1:
print(-1)
exit()
for i in range(n):
a.append((b[i],s[i]))
a.sort(reverse=True)
i=0
j=0
m1=0
q1=False
q2=False
while i!=k:
if a[j][1]!='R':
m1+=a[j][0]
g=j+0
if a[j][1]=='W... | output | 1 | 78,849 | 7 | 157,699 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,850 | 7 | 157,700 |
"Correct Solution:
```
n,k=map(int,input().split())
cost=list(map(int,input().split()))
s=input()
#exit(0)
a=[]
b=[]
c=[]
#print(n,k,cost)
kek1=0
kek2=0
kek3=0
for i in range(n):
if (s[i]==chr(ord("W"))):
kek1+=1
a.append(cost[i])
if (s[i]==chr(ord("O"))):
kek2+=1
b.append(cost[i... | output | 1 | 78,850 | 7 | 157,701 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,851 | 7 | 157,702 |
"Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
s = input()
if k == 1:
print(-1)
exit(0)
have = [[] for i in range(3)]
for i in range(n):
if s[i] == 'R':
have[0].append(a[i])
elif s[i] == 'O':
have[1].append(a[i])
else:
have[2].appe... | output | 1 | 78,851 | 7 | 157,703 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,852 | 7 | 157,704 |
"Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()... | output | 1 | 78,852 | 7 | 157,705 |
Provide a correct Python 3 solution for this coding contest problem.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white roses, so he won't buy a bouquet containing both red and ... | instruction | 0 | 78,853 | 7 | 157,706 |
"Correct Solution:
```
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
r=sorted(r)
w=sorted(w)
o=sor... | output | 1 | 78,853 | 7 | 157,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white r... | instruction | 0 | 78,854 | 7 | 157,708 |
No | output | 1 | 78,854 | 7 | 157,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white r... | instruction | 0 | 78,855 | 7 | 157,710 |
No | output | 1 | 78,855 | 7 | 157,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white r... | instruction | 0 | 78,856 | 7 | 157,712 |
No | output | 1 | 78,856 | 7 | 157,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady decided to buy roses for his girlfriend.
A flower shop has white, orange and red roses, and the total amount of them is n. Arkady thinks that red roses are not good together with white r... | instruction | 0 | 78,857 | 7 | 157,714 |
No | output | 1 | 78,857 | 7 | 157,715 |
Provide a correct Python 3 solution for this coding contest problem.
The tablet interface technology, which can be operated by touching the screen with a finger, has also been applied in the field of games, and various types of games with new operability have been created. The game currently being developed by AZ is o... | instruction | 0 | 79,041 | 7 | 158,082 |
"Correct Solution:
```
def paintout_graph(s, g, color):
cnt, pre_color = 0, s[0]
que = [0]
for pos in que:
if s[pos] == pre_color:
s[pos] = color
cnt +=1
que.extend(g[pos])
return cnt
def bfs(s, graph):
que = deque([(s,0,0)])
while True:
s,pre_... | output | 1 | 79,041 | 7 | 158,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The tablet interface technology, which can be operated by touching the screen with a finger, has also been applied in the field of games, and various types of games with new operability have bee... | instruction | 0 | 79,042 | 7 | 158,084 |
No | output | 1 | 79,042 | 7 | 158,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The tablet interface technology, which can be operated by touching the screen with a finger, has also been applied in the field of games, and various types of games with new operability have bee... | instruction | 0 | 79,043 | 7 | 158,086 |
No | output | 1 | 79,043 | 7 | 158,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The tablet interface technology, which can be operated by touching the screen with a finger, has also been applied in the field of games, and various types of games with new operability have bee... | instruction | 0 | 79,044 | 7 | 158,088 |
No | output | 1 | 79,044 | 7 | 158,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The tablet interface technology, which can be operated by touching the screen with a finger, has also been applied in the field of games, and various types of games with new operability have bee... | instruction | 0 | 79,045 | 7 | 158,090 |
No | output | 1 | 79,045 | 7 | 158,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya writes his own library for building graphical user interface. Vasya called his creation VTK (VasyaToolKit). One of the interesting aspects of this library is that widgets are packed in each other.
A widget is some element of graphica... | instruction | 0 | 79,648 | 7 | 159,296 |
Tags: dp, expression parsing, graphs, implementation
Correct Solution:
```
import sys
from array import array # noqa: F401
import re
def input():
return sys.stdin.buffer.readline().decode('utf-8')
class Widget(object):
def __init__(self, x, y):
self.x = x
self.y = y
class Box(object):
... | output | 1 | 79,648 | 7 | 159,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Ivan the Fool decided to become smarter and study the probability theory. He thinks that he understands the subject fairly well, and so he began to behave like he already got PhD in that area.
To prove his skills, Ivan decided to d... | instruction | 0 | 80,023 | 7 | 160,046 |
Tags: combinatorics, dp, math
Correct Solution:
```
mod = 10 ** 9 + 7
def getAns(maxSide):
if maxSide == 1:
return 2
if maxSide == 2:
return 4
dpSide = [0] * maxSide
for i in range(len(dpSide)):
dpSide[i] = [0, 0]
dpSide[0] = [1, 1]
dpSide[1] = [2, 2]
f = True
... | output | 1 | 80,023 | 7 | 160,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Ivan the Fool decided to become smarter and study the probability theory. He thinks that he understands the subject fairly well, and so he began to behave like he already got PhD in that area.
To prove his skills, Ivan decided to d... | instruction | 0 | 80,024 | 7 | 160,048 |
Tags: combinatorics, dp, math
Correct Solution:
```
if __name__ == '__main__':
arr = [int(0)] * 100005
n, m = map(int, input().strip().split())
N = max(n, m)
arr[1], arr[2] = 2, 4
Mod = 10 ** 9 + 7
for i in range(3, N + 1):
arr[i] = (arr[i - 1] + arr[i - 2]) % Mod
ans = arr[n]
fo... | output | 1 | 80,024 | 7 | 160,049 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.