message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,400 | 1 | 186,800 |
Yes | output | 1 | 93,400 | 1 | 186,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,401 | 1 | 186,802 |
Yes | output | 1 | 93,401 | 1 | 186,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,402 | 1 | 186,804 |
Yes | output | 1 | 93,402 | 1 | 186,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,403 | 1 | 186,806 |
No | output | 1 | 93,403 | 1 | 186,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,404 | 1 | 186,808 |
No | output | 1 | 93,404 | 1 | 186,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,405 | 1 | 186,810 |
No | output | 1 | 93,405 | 1 | 186,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification numb... | instruction | 0 | 93,406 | 1 | 186,812 |
No | output | 1 | 93,406 | 1 | 186,813 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,463 | 1 | 186,926 |
"Correct Solution:
```
INF=10**5
while True:
n=int(input())
if n==0:break
imos=[0 for i_ in range(INF)]
for _ in range(n):
a,b=input().split()
s1=list(map(int,a.split(':')))
s2=list(map(int,b.split(':')))
s1=s1[0]*3600+s1[1]*60+s1[2]
s2=s2[0]*3600+s2[1]*60+s2[2]
imos[s1]+=1
imos[s2]-... | output | 1 | 93,463 | 1 | 186,927 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,464 | 1 | 186,928 |
"Correct Solution:
```
from itertools import accumulate
def get_second(time_str):
return int(time_str[:2]) * 3600 + int(time_str[3:5]) * 60 + int(time_str[6:])
while True:
n = int(input())
if n == 0:
break
cnt = [0] * 86400
for _ in range(n):
dep_str, arr_str = input().strip().sp... | output | 1 | 93,464 | 1 | 186,929 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,465 | 1 | 186,930 |
"Correct Solution:
```
def solve():
while True:
N = int(input())
if N==0:
return
firsts = [0]*(86401)
lasts = [0]*(86401)
for i in range(N):
a,b = input().split()
h,m,s = a.split(':')
t = 0
for i,n in enumerate([h,m,... | output | 1 | 93,465 | 1 | 186,931 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,466 | 1 | 186,932 |
"Correct Solution:
```
# 山手線は34.5Km
# 一周一時間かかる
# 駅は29駅ある
import itertools
while True:
n = int(input()) # n <= 10000
if n == 0:
break
timestamps = [0 for _ in range(24 * 60 * 60 + 1)]
for _ in range(n):
start, end = input().split()
start_h, start_m, start_s = map(int, start.split... | output | 1 | 93,466 | 1 | 186,933 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,467 | 1 | 186,934 |
"Correct Solution:
```
import sys
# import math
# import bisect
# import copy
# import heapq
# from collections import deque
# import decimal
# sys.setrecursionlimit(100001)
# INF = sys.maxsize
# MOD = 10 ** 9 + 7
# ===CODE===
def main():
while True:
n = int(input())
if n == 0:
exit... | output | 1 | 93,467 | 1 | 186,935 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,468 | 1 | 186,936 |
"Correct Solution:
```
while True:
n=int(input())
if n==0:break
ans=0
k=0
l1=[]
l2=[]
for i in range(n):
a=input()
l1.append(int(3600*int(a[0:2])+60*int(a[3:5])+int(a[6:8])))
l2.append(int(3600*int(a[9:11])+60*int(a[12:14])+int(a[15:17])))
l1.sort()
l2.sort()
... | output | 1 | 93,468 | 1 | 186,937 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,469 | 1 | 186,938 |
"Correct Solution:
```
import sys
import itertools
# import numpy as np
import time
import math
import heapq
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 ** 9 + 7
# map(int, inp... | output | 1 | 93,469 | 1 | 186,939 |
Provide a correct Python 3 solution for this coding contest problem.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap takes about one hour. There are 29 stations in total. T... | instruction | 0 | 93,470 | 1 | 186,940 |
"Correct Solution:
```
while(1):
n = int(input())
if n==0: break
table = [0 for i in range(24*60*60)]
for i in range(n):
s,g=input().split()
s=list(map(int,s.split(':')))
x=(s[0]*60+s[1])*60+s[2]
g=list(map(int,g.split(':')))
y=(g[0]*60+g[1])*60+g[2]
table... | output | 1 | 93,470 | 1 | 186,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,471 | 1 | 186,942 |
Yes | output | 1 | 93,471 | 1 | 186,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,472 | 1 | 186,944 |
Yes | output | 1 | 93,472 | 1 | 186,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,473 | 1 | 186,946 |
Yes | output | 1 | 93,473 | 1 | 186,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,474 | 1 | 186,948 |
Yes | output | 1 | 93,474 | 1 | 186,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,475 | 1 | 186,950 |
No | output | 1 | 93,475 | 1 | 186,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,476 | 1 | 186,952 |
No | output | 1 | 93,476 | 1 | 186,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Osaki
Osaki
English text is not available in this practice contest.
The Yamanote Line is a circular railway line laid in the 23 wards of Tokyo. The total route distance is 34.5km, and one lap... | instruction | 0 | 93,477 | 1 | 186,954 |
No | output | 1 | 93,477 | 1 | 186,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Greg and his friends were walking in the forest. Overall there were n people walking, including Greg. Soon he found himself in front of a river. The guys immediately decided to get across the river. Luckily, there was a boat by the r... | instruction | 0 | 93,805 | 1 | 187,610 |
Tags: combinatorics, dp, graphs, shortest paths
Correct Solution:
```
from collections import deque
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
c50 = sum([1 for i in a if i == 50])
c100 = sum([1 for i in a if i == 100])
c = [[0] * 51 for i in range(51)]
c[0][0] = 1
c[1][0] = 1
c[1][1... | output | 1 | 93,805 | 1 | 187,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Greg and his friends were walking in the forest. Overall there were n people walking, including Greg. Soon he found himself in front of a river. The guys immediately decided to get acros... | instruction | 0 | 93,806 | 1 | 187,612 |
No | output | 1 | 93,806 | 1 | 187,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Johnny drives a truck and must deliver a package from his hometown to the district center. His hometown is located at point 0 on a number line, and the district center is located at the point d.
Johnny's truck has a gas tank that holds exac... | instruction | 0 | 93,957 | 1 | 187,914 |
Tags: data structures, divide and conquer, greedy
Correct Solution:
```
destination, max_gas_tank_volume, gas_prices_number = map(int, input().split())
start_point = 0
gas_prices = {start_point:0}
for i in range(gas_prices_number):
coordinate, price = map(int, input().split())
gas_prices[coordinate] = price
poi... | output | 1 | 93,957 | 1 | 187,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Johnny drives a truck and must deliver a package from his hometown to the district center. His hometown is located at point 0 on a number line, and the district center is located at the point d.... | instruction | 0 | 93,958 | 1 | 187,916 |
No | output | 1 | 93,958 | 1 | 187,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Johnny drives a truck and must deliver a package from his hometown to the district center. His hometown is located at point 0 on a number line, and the district center is located at the point d.... | instruction | 0 | 93,959 | 1 | 187,918 |
No | output | 1 | 93,959 | 1 | 187,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Johnny drives a truck and must deliver a package from his hometown to the district center. His hometown is located at point 0 on a number line, and the district center is located at the point d.... | instruction | 0 | 93,960 | 1 | 187,920 |
No | output | 1 | 93,960 | 1 | 187,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Johnny drives a truck and must deliver a package from his hometown to the district center. His hometown is located at point 0 on a number line, and the district center is located at the point d.... | instruction | 0 | 93,961 | 1 | 187,922 |
No | output | 1 | 93,961 | 1 | 187,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,010 | 1 | 188,020 |
Tags: dp, graphs
Correct Solution:
```
n, m, T = map(int, input().split())
graph_a = [[] for _ in range(n+1)]
graph_b = [[] for _ in range(n+1)]
double_graph_a = [[0 for _ in range(n+1)] for _ in range(n+1)]
double_graph_b = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(m):
u, v, t = map(int, inpu... | output | 1 | 94,010 | 1 | 188,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,011 | 1 | 188,022 |
Tags: dp, graphs
Correct Solution:
```
n, m, T = map(int, input().split())
graph_a = [[] for _ in range(n+1)]
graph_b = [[] for _ in range(n+1)]
double_graph_a = [[0 for _ in range(n+1)] for _ in range(n+1)]
double_graph_b = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(m):
u, v, t = map(int, inpu... | output | 1 | 94,011 | 1 | 188,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,012 | 1 | 188,024 |
Tags: dp, graphs
Correct Solution:
```
n, m, T = map(int, input().split())
adj = [[] for _ in range(n+1)]
ad_w = [[] for _ in range(n+1)]
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
pv = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(m):
a, b, t = map(int, input().split())
# matrix[b][a] ... | output | 1 | 94,012 | 1 | 188,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,013 | 1 | 188,026 |
Tags: dp, graphs
Correct Solution:
```
from sys import stdin, stdout
# LinkedList.py
class LLNode:
def __init__(self, value = None, nextNode = None):
self.value, self.nextNode = value, nextNode
class LinkedList:
def __init__(self, rootNode = None):
self.rootNode = rootNode
def FindBestPat... | output | 1 | 94,013 | 1 | 188,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,014 | 1 | 188,028 |
Tags: dp, graphs
Correct Solution:
```
n, m, T = map(int, input().split())
graph_a = [[] for _ in range(n+1)]
graph_b = [[] for _ in range(n+1)]
double_graph_a = [[0 for _ in range(n+1)] for _ in range(n+1)]
double_graph_b = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(m):
u, v, t = map(int, inpu... | output | 1 | 94,014 | 1 | 188,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,015 | 1 | 188,030 |
Tags: dp, graphs
Correct Solution:
```
n, m, T = map(int, input().split())
graph_a = [[] for _ in range(n+1)]
graph_b = [[] for _ in range(n+1)]
double_graph_a = [[0 for _ in range(n+1)] for _ in range(n+1)]
double_graph_b = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(m):
u, v, t = map(int, inpu... | output | 1 | 94,015 | 1 | 188,031 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,016 | 1 | 188,032 |
Tags: dp, graphs
Correct Solution:
```
n, m, T = map(int, input().split())
graph_a = [[] for _ in range(n+1)]
graph_b = [[] for _ in range(n+1)]
double_graph_a = [[0 for _ in range(n+1)] for _ in range(n+1)]
double_graph_b = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(m):
u, v, t = map(int, inpu... | output | 1 | 94,016 | 1 | 188,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in ... | instruction | 0 | 94,017 | 1 | 188,034 |
Tags: dp, graphs
Correct Solution:
```
if __name__=='__main__':
n, m, t = map(int, input().split())
edge = {i:{} for i in range(n)}
income = [0 for i in range(n)]
for i in range(m):
u, v, ti = map(int, input().split())
edge[v-1][u-1] = ti
income[u-1] += 1
stat = [{} for _ in range(n)]
stat[n-1] = {1 : (0, ... | output | 1 | 94,017 | 1 | 188,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,018 | 1 | 188,036 |
Yes | output | 1 | 94,018 | 1 | 188,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,019 | 1 | 188,038 |
Yes | output | 1 | 94,019 | 1 | 188,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,020 | 1 | 188,040 |
Yes | output | 1 | 94,020 | 1 | 188,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,021 | 1 | 188,042 |
Yes | output | 1 | 94,021 | 1 | 188,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,022 | 1 | 188,044 |
No | output | 1 | 94,022 | 1 | 188,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,023 | 1 | 188,046 |
No | output | 1 | 94,023 | 1 | 188,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,024 | 1 | 188,048 |
No | output | 1 | 94,024 | 1 | 188,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directiona... | instruction | 0 | 94,025 | 1 | 188,050 |
No | output | 1 | 94,025 | 1 | 188,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the question Vladik face now is to find the cheapest way to get to the olympiad.
Vladik knows n ... | instruction | 0 | 94,026 | 1 | 188,052 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
#!/usr/bin/python
from sys import argv,exit
def get_str():
return input()
def get_int():
return int(input())
def get_ints(sep=' '):
if not sep:
return [int(c) for c in input()]
return [int(i) for i in input().split(s... | output | 1 | 94,026 | 1 | 188,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the question Vladik face now is to find the cheapest way to get to the olympiad.
Vladik knows n ... | instruction | 0 | 94,027 | 1 | 188,054 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
(a, b, _), owners = sorted(map(int, input().split())), '_' + input()
print(int(owners[a] != owners[b]))
``` | output | 1 | 94,027 | 1 | 188,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the question Vladik face now is to find the cheapest way to get to the olympiad.
Vladik knows n ... | instruction | 0 | 94,028 | 1 | 188,056 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
val= input()
store=val.split()
n=int(store[0])
a=int(store[1])
b= int(store[2])
airport_code = input()
if airport_code[a-1]==airport_code[b-1]:
print(0)
else:
print(1)
``` | output | 1 | 94,028 | 1 | 188,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the question Vladik face now is to find the cheapest way to get to the olympiad.
Vladik knows n ... | instruction | 0 | 94,029 | 1 | 188,058 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n,a,b=map(int,input().split())
d=[int(x) for x in input()]
if d[a-1]==d[b-1]:
print(0)
else:
print(1)
``` | output | 1 | 94,029 | 1 | 188,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vladik is a competitive programmer. This year he is going to win the International Olympiad in Informatics. But it is not as easy as it sounds: the question Vladik face now is to find the cheapest way to get to the olympiad.
Vladik knows n ... | instruction | 0 | 94,030 | 1 | 188,060 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
def vla_air(n,a,b,s):
x=s[a-1]
y=s[b-1]
if x==y:
return 0
if a==b:
return 0
if a>b or a<b:
return 1
n,a,b=list(map(int,input().strip().split()))
s=str(input())
print(vla_air(n,a,b,s))
``` | output | 1 | 94,030 | 1 | 188,061 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.