message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 450 109k | cluster float64 2 2 | __index_level_0__ int64 900 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if the strength of the white walker equals his stren... | instruction | 0 | 70,367 | 2 | 140,734 |
Tags: brute force, dp, implementation, sortings
Correct Solution:
```
def main():
first_line = input()
second_line = input()
n, k, x = map(int, first_line.split())
rangers = list(map(int, second_line.split()))
xor_results = get_xor_results(x)
rangers = snow(n, k, xor_results, rangers)
print... | output | 1 | 70,367 | 2 | 140,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if the strength of the white walker equals his stren... | instruction | 0 | 70,368 | 2 | 140,736 |
Tags: brute force, dp, implementation, sortings
Correct Solution:
```
import sys
from random import *
from bisect import *
#from collections import deque
pl=1
from math import gcd,sqrt
from copy import *
sys.setrecursionlimit(10**5)
if pl:
input=sys.stdin.readline
else:
sys.stdin=open('input.txt', 'r')
sys.stdout=o... | output | 1 | 70,368 | 2 | 140,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,369 | 2 | 140,738 |
Yes | output | 1 | 70,369 | 2 | 140,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,370 | 2 | 140,740 |
Yes | output | 1 | 70,370 | 2 | 140,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,371 | 2 | 140,742 |
Yes | output | 1 | 70,371 | 2 | 140,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,372 | 2 | 140,744 |
Yes | output | 1 | 70,372 | 2 | 140,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,373 | 2 | 140,746 |
No | output | 1 | 70,373 | 2 | 140,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,374 | 2 | 140,748 |
No | output | 1 | 70,374 | 2 | 140,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,375 | 2 | 140,750 |
No | output | 1 | 70,375 | 2 | 140,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if th... | instruction | 0 | 70,376 | 2 | 140,752 |
No | output | 1 | 70,376 | 2 | 140,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma is playing a new expansion for his favorite game World of Darkraft. He made a new character and is going for his first grind.
Roma has a choice to buy exactly one of n different weapons and exactly one of m different armor sets. Weapon... | instruction | 0 | 70,878 | 2 | 141,756 |
Tags: brute force, data structures, sortings
Correct Solution:
```
from bisect import bisect_right
from operator import itemgetter
# quick input by @pajenegod
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
class SegmTree:
def __init__(self, size):
N = 1
h = 0
whi... | output | 1 | 70,878 | 2 | 141,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma is playing a new expansion for his favorite game World of Darkraft. He made a new character and is going for his first grind.
Roma has a choice to buy exactly one of n different weapons and exactly one of m different armor sets. Weapon... | instruction | 0 | 70,879 | 2 | 141,758 |
Tags: brute force, data structures, sortings
Correct Solution:
```
# quick input by @c1729 and @pajenegod
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from bisect import bisect_right
from operator import itemgetter
class SegmTree:
'''
- increment on interval
- get max on inter... | output | 1 | 70,879 | 2 | 141,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma is playing a new expansion for his favorite game World of Darkraft. He made a new character and is going for his first grind.
Roma has a choice to buy exactly one of n different weapons an... | instruction | 0 | 70,880 | 2 | 141,760 |
No | output | 1 | 70,880 | 2 | 141,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,340 | 2 | 142,680 |
Tags: brute force
Correct Solution:
```
import io
import os
import math
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n = int(input())
def validtriangle(a, b, c):
if c < a+b and a < c+b and b < c+a:
return True
return False
def herons(a, b, c):
s = (a + b + c) / 2
area = (math.... | output | 1 | 71,340 | 2 | 142,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,341 | 2 | 142,682 |
Tags: brute force
Correct Solution:
```
l = [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 5, 7, 10, 10, 10, 10, 11, 11, 14, 16, 19, 19, 26, 32, 39, 43, 52, 58, 65, 65, 65, 65, 66, 66, 69, 71, 74, 74, 81, 87, 94, 98, 107, 113, 120, 120, 135, 149, 164, 176, 193, 207, 222, 230, 251, 269, 288, 300, 321, 335, 350, 350, 350, 350, 351... | output | 1 | 71,341 | 2 | 142,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,342 | 2 | 142,684 |
Tags: brute force
Correct Solution:
```
n = int(input())
cnt = 0
for a in range(n+1):
for b in range(a, n+1):
c = a ^ b
if c == 0 or c > n or a >= c or b >= c or a + b <= c:
continue
cnt += 1
print(cnt)
``` | output | 1 | 71,342 | 2 | 142,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,343 | 2 | 142,686 |
Tags: brute force
Correct Solution:
```
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i+1,n+1):
k = i^j
if k>j and (i+j)>k and k<=n:
ans+=1
print(ans)
``` | output | 1 | 71,343 | 2 | 142,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,344 | 2 | 142,688 |
Tags: brute force
Correct Solution:
```
n=int(input())
counter=0
for a in range(1,n+1):
for b in range(1,a+1):
t=a^b
if t>0 and t<=n:
if a+b>t and a+t>b and b+t>a:counter+=1
print(counter//3)
``` | output | 1 | 71,344 | 2 | 142,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,345 | 2 | 142,690 |
Tags: brute force
Correct Solution:
```
n=int(input())
kmsafpjgfaerjgigjefgjaelrgjerlkgjergljadfklgjgjergmaegjegne=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
#print(i,j,i^j)
kmsafpjgfaerjgigjefgjaelrgjerlkgjergljadfklgjgjergmaegjegne+=1
print(kmsafpjg... | output | 1 | 71,345 | 2 | 142,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,346 | 2 | 142,692 |
Tags: brute force
Correct Solution:
```
x = int(input().strip())
def test_4(n):
count = 0
for i in range(n):
for j in range(i+1, n):
temp = i^j
if (temp <= n and temp > j and (i + j) > temp):
count += 1
return count
aa = test_4(x)
print(aa)
... | output | 1 | 71,346 | 2 | 142,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum of the lengths is equal to zero. Imp has to coun... | instruction | 0 | 71,347 | 2 | 142,694 |
Tags: brute force
Correct Solution:
```
n = int(input())
ans = 0
for i in range(1, n):
for j in range(i, n):
if n >= i ^ j > j and i + j > i ^ j:
ans += 1
print(ans)
``` | output | 1 | 71,347 | 2 | 142,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,348 | 2 | 142,696 |
Yes | output | 1 | 71,348 | 2 | 142,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,349 | 2 | 142,698 |
Yes | output | 1 | 71,349 | 2 | 142,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,350 | 2 | 142,700 |
Yes | output | 1 | 71,350 | 2 | 142,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,351 | 2 | 142,702 |
Yes | output | 1 | 71,351 | 2 | 142,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,352 | 2 | 142,704 |
No | output | 1 | 71,352 | 2 | 142,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,353 | 2 | 142,706 |
No | output | 1 | 71,353 | 2 | 142,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,354 | 2 | 142,708 |
No | output | 1 | 71,354 | 2 | 142,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is in a magic forest, where xorangles grow (wut?)
<image>
A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-sum o... | instruction | 0 | 71,355 | 2 | 142,710 |
No | output | 1 | 71,355 | 2 | 142,711 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,399 | 2 | 142,798 |
"Correct Solution:
```
h = int(input())
binary = len(bin(h))-2
print(2**binary-1)
``` | output | 1 | 71,399 | 2 | 142,799 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,400 | 2 | 142,800 |
"Correct Solution:
```
import math
print(2 ** (math.floor(math.log2(int(input())))+1) - 1)
``` | output | 1 | 71,400 | 2 | 142,801 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,401 | 2 | 142,802 |
"Correct Solution:
```
H = int(input())
print(2 ** H.bit_length() - 1)
``` | output | 1 | 71,401 | 2 | 142,803 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,402 | 2 | 142,804 |
"Correct Solution:
```
H=int(input())
a=0
t=1
while H:
H//=2
a+=t
t*=2
print(a)
``` | output | 1 | 71,402 | 2 | 142,805 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,403 | 2 | 142,806 |
"Correct Solution:
```
h=int(input())
cnt=0
while h:
h//=2
cnt+=1
print(2**cnt-1)
``` | output | 1 | 71,403 | 2 | 142,807 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,404 | 2 | 142,808 |
"Correct Solution:
```
H = int(input())
i = 1
while ( i * 2 <= H):
i *= 2
print(i*2-1)
``` | output | 1 | 71,404 | 2 | 142,809 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,405 | 2 | 142,810 |
"Correct Solution:
```
h=int(input())
x=0
while h>0:
x+=1
h=h//2
print(2**x -1)
``` | output | 1 | 71,405 | 2 | 142,811 |
Provide a correct Python 3 solution for this coding contest problem.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:
* If the monster's health is 1, it drops to 0.
*... | instruction | 0 | 71,406 | 2 | 142,812 |
"Correct Solution:
```
h=int(input())
H=bin(h)
k=len(H)-2
A=2**k-1
print(A)
``` | output | 1 | 71,406 | 2 | 142,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,407 | 2 | 142,814 |
Yes | output | 1 | 71,407 | 2 | 142,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,408 | 2 | 142,816 |
Yes | output | 1 | 71,408 | 2 | 142,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,409 | 2 | 142,818 |
Yes | output | 1 | 71,409 | 2 | 142,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,410 | 2 | 142,820 |
Yes | output | 1 | 71,410 | 2 | 142,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,411 | 2 | 142,822 |
No | output | 1 | 71,411 | 2 | 142,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,412 | 2 | 142,824 |
No | output | 1 | 71,412 | 2 | 142,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,413 | 2 | 142,826 |
No | output | 1 | 71,413 | 2 | 142,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caracal is fighting with a monster.
The health of the monster is H.
Caracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following ha... | instruction | 0 | 71,414 | 2 | 142,828 |
No | output | 1 | 71,414 | 2 | 142,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅ m different seals, denoted by distinct numbers. All of them were written in an n× m table.
The table is lost now... | instruction | 0 | 71,838 | 2 | 143,676 |
Tags: implementation
Correct Solution:
```
from math import *
import os, sys
from io import BytesIO
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline
#sys.stdin = open("input.txt", "r")
#sys.stdout = open("output.txt", "w")
for _ in range(int(input())):
n, m = map(int, input().split())
x = {}... | output | 1 | 71,838 | 2 | 143,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅ m different seals, denoted by distinct numbers. All of them were written in an n× m table.
The table is lost now... | instruction | 0 | 71,839 | 2 | 143,678 |
Tags: implementation
Correct Solution:
```
import sys
def taskb():
count = int(sys.stdin.readline())
for i in range(count):
n, m = map(int, sys.stdin.readline().split())
a = [0] * n
r = [0] * (m * n + 1)
for j in range(n):
a[j] = list(map(int, sys.stdin.readline().s... | output | 1 | 71,839 | 2 | 143,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅ m different seals, denoted by distinct numbers. All of them were written in an n× m table.
The table is lost now... | instruction | 0 | 71,840 | 2 | 143,680 |
Tags: implementation
Correct Solution:
```
from sys import stdin, stdout
from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque
from heapq import merge, heapify, heappop, heappush, nsmallest
from bisect import bisect_left as bl, bisect_right as br, bisect
mod... | output | 1 | 71,840 | 2 | 143,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅ m different seals, denoted by distinct numbers. All of them were written in an n× m table.
The table is lost now... | instruction | 0 | 71,841 | 2 | 143,682 |
Tags: implementation
Correct Solution:
```
rez = []
for i in range(int(input())):
n, m = map(int, input().split())
s_stroku = [list(map(int, input().split())) for _ in range(n)]
s_stolb = [list(map(int, input().split())) for _ in range(m)]
b = 0
while s_stroku[0][0] not in s_stolb[b]:
b+=1
... | output | 1 | 71,841 | 2 | 143,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of n⋅ m different seals, denoted by distinct numbers. All of them were written in an n× m table.
The table is lost now... | instruction | 0 | 71,842 | 2 | 143,684 |
Tags: implementation
Correct Solution:
```
import sys
for _ in range(int(input())):
n, m = map(int,sys.stdin.readline().split())
d = { }
for i in range(n):
m2 = list(map(int,sys.stdin.readline().split()))
d[m2[0]] = m2
for i in range(m):
m1 = list(map(int,sys.stdin.readline().... | output | 1 | 71,842 | 2 | 143,685 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.