message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,343 | 10 | 96,686 |
Yes | output | 1 | 48,343 | 10 | 96,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,344 | 10 | 96,688 |
Yes | output | 1 | 48,344 | 10 | 96,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,345 | 10 | 96,690 |
Yes | output | 1 | 48,345 | 10 | 96,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,346 | 10 | 96,692 |
No | output | 1 | 48,346 | 10 | 96,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,347 | 10 | 96,694 |
No | output | 1 | 48,347 | 10 | 96,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,348 | 10 | 96,696 |
No | output | 1 | 48,348 | 10 | 96,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,349 | 10 | 96,698 |
No | output | 1 | 48,349 | 10 | 96,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,498 | 10 | 96,996 |
Tags: brute force, implementation, number theory
Correct Solution:
```
def read():
return [int(v) for v in input().split()]
def main():
n = read()[0]
a = read()[0]
b = read()[0]
for x in range(0, n // a + 2):
y = int((n - a * x) / b)
if y >= 0 and a * x + b * y == n:
p... | output | 1 | 48,498 | 10 | 96,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,499 | 10 | 96,998 |
Tags: brute force, implementation, number theory
Correct Solution:
```
import sys,math,string,bisect
input=sys.stdin.readline
from collections import deque
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
n=I()
a=I()
b=I()
if(n%math.g... | output | 1 | 48,499 | 10 | 96,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,500 | 10 | 97,000 |
Tags: brute force, implementation, number theory
Correct Solution:
```
'''input
10000000
3
999999
'''
n, a, b = int(input()), int(input()), int(input())
for x in range(n//a+1):
if (n - x*a) % b == 0:
print("YES")
print(x, (n- x*a) // b)
break
else:
print("NO")
``` | output | 1 | 48,500 | 10 | 97,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,501 | 10 | 97,002 |
Tags: brute force, implementation, number theory
Correct Solution:
```
mod = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
n=ii()
n1=n
n2=n
a=ii()
b=ii()
... | output | 1 | 48,501 | 10 | 97,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,502 | 10 | 97,004 |
Tags: brute force, implementation, number theory
Correct Solution:
```
import bisect
import collections
import copy
import functools
import heapq
import itertools
import math
import random
import re
import sys
import time
import string
from typing import List, Mapping
sys.setrecursionlimit(999999)
n = int(input())
a =... | output | 1 | 48,502 | 10 | 97,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,503 | 10 | 97,006 |
Tags: brute force, implementation, number theory
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Sat Dec 16 14:43:34 2017
@author: ms
"""
def main():
n = int(input())
a = int(input())
b = int(input())
if(n%a == 0):
print('YES')
print(int(n/a), 0)
return
if... | output | 1 | 48,503 | 10 | 97,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,504 | 10 | 97,008 |
Tags: brute force, implementation, number theory
Correct Solution:
```
from sys import stdin
n = int(stdin.readline())
a = int(stdin.readline())
b = int(stdin.readline())
def get_anwser(n, a, b):
answer = ('NO', -1, -1)
for i in range(0, 10**7 + 1):
if (n - a*i) >= 0 and (n - a*i) % b == 0:
... | output | 1 | 48,504 | 10 | 97,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number of Bars bars.
Find out if it's possible to buy ... | instruction | 0 | 48,505 | 10 | 97,010 |
Tags: brute force, implementation, number theory
Correct Solution:
```
n, a, b = [int(input()) for i in range(3)]
if a > b:
x = 0
y = -1
while x * a <= n:
if (n - x * a ) % b == 0:
y = (n - x * a) // b
break
x += 1
print("YES\n{} {}".format(x, y) if y != -1 else "... | output | 1 | 48,505 | 10 | 97,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,506 | 10 | 97,012 |
Yes | output | 1 | 48,506 | 10 | 97,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,507 | 10 | 97,014 |
Yes | output | 1 | 48,507 | 10 | 97,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,508 | 10 | 97,016 |
Yes | output | 1 | 48,508 | 10 | 97,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,509 | 10 | 97,018 |
Yes | output | 1 | 48,509 | 10 | 97,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,510 | 10 | 97,020 |
No | output | 1 | 48,510 | 10 | 97,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,511 | 10 | 97,022 |
No | output | 1 | 48,511 | 10 | 97,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,512 | 10 | 97,024 |
No | output | 1 | 48,512 | 10 | 97,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n burles. One bottle of Ber-Cola costs a burles and one Bars bar costs b burles. He can buy any non-negative integer number of bottles of Ber-Cola and any non-negative integer number o... | instruction | 0 | 48,513 | 10 | 97,026 |
No | output | 1 | 48,513 | 10 | 97,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You need a TV to watch a TV show and you can't watc... | instruction | 0 | 48,847 | 10 | 97,694 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
from bisect import bisect_right
n, x, y = map(int, input().split(' '))
s=[0]*n
e=[0]*n
v=[0]*n
c=0
for i in range(n):
s[i],e[i]=map(int, input().split(' '))
c+=x+(e[i]-s[i])*y
s.sort()
e.sort()
for i in range(n-2,-1,-1):
k=bisect_... | output | 1 | 48,847 | 10 | 97,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You need a TV to watch a TV show and you can't watc... | instruction | 0 | 48,848 | 10 | 97,696 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
from heapq import *
def main():
n,x,y=map(int,input().split())
a,b=[],[]
for i in range(n):
u,v=map(int,in... | output | 1 | 48,848 | 10 | 97,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You need a TV to watch a TV show and you can't watc... | instruction | 0 | 48,849 | 10 | 97,698 |
Tags: data structures, greedy, implementation, sortings
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
fr... | output | 1 | 48,849 | 10 | 97,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You need a TV to watch a TV show and you can't watc... | instruction | 0 | 48,850 | 10 | 97,700 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
from bisect import bisect_right,bisect_left
n,c_tv,c_es=map(int,input().split())
start=[]
end=[]
add=0
for _ in range(n):
l,r=map(int,input().split())
add+=(r-l)
start.append(l)
end.append(r)
start.sort()
end.sort()
ans=add*c_... | output | 1 | 48,850 | 10 | 97,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You need a TV to watch a TV show and you can't watc... | instruction | 0 | 48,851 | 10 | 97,702 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.m... | output | 1 | 48,851 | 10 | 97,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,128 | 10 | 98,256 |
Tags: greedy, sortings
Correct Solution:
```
if __name__ == '__main__':
m = int(input())
carts = [int(x) for x in input().split()]
n = int(input())
cost = [int(x) for x in input().split()]
x = min(carts)
bought = 0
free = 0
cost = sorted(cost, reverse = True)
amt = 0
for i in cost:
if free > 0:
free -=... | output | 1 | 49,128 | 10 | 98,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,129 | 10 | 98,258 |
Tags: greedy, sortings
Correct Solution:
```
def main():
input()
q = min(map(int, input().split()))
input()
aa = sorted(map(int, input().split()), reverse=True)
print(sum(aa) - sum(aa[q::q + 2]) - sum(aa[q + 1::q + 2]))
if __name__ == "__main__":
main()
``` | output | 1 | 49,129 | 10 | 98,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,130 | 10 | 98,260 |
Tags: greedy, sortings
Correct Solution:
```
import bisect
from itertools import accumulate
import os
import sys
import math
from decimal import *
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer ... | output | 1 | 49,130 | 10 | 98,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,131 | 10 | 98,262 |
Tags: greedy, sortings
Correct Solution:
```
m = int(input())
q = list(map(int, input().split()))
n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
q.sort()
ans = 0
mm = q[0]
i = 0
while i<n:
j = i
if j+mm <= n:
while i < j+mm:
ans+=a[i]
i+=1
i+... | output | 1 | 49,131 | 10 | 98,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,132 | 10 | 98,264 |
Tags: greedy, sortings
Correct Solution:
```
m=int(input())
q=[int(i) for i in input().split()]
q.sort()
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
ans=0
i=n-1
while(i>=0):
d=0
while(i>=0 and d<q[0]):
ans+=a[i]
i-=1
d+=1
d=0
while(i>=0 and d<2):
d+=1
... | output | 1 | 49,132 | 10 | 98,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,133 | 10 | 98,266 |
Tags: greedy, sortings
Correct Solution:
```
#!/usr/bin/env python
from __future__ import division, print_function
import math
import os
import sys
from fractions import *
from sys import *
from decimal import *
from io import BytesIO, IOBase
from itertools import *
from collections import *
# sys.setrecursionlimit(10... | output | 1 | 49,133 | 10 | 98,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,134 | 10 | 98,268 |
Tags: greedy, sortings
Correct Solution:
```
I=lambda:map(int,input().split())
m,q,n,a,r,k=int(input()),min(I()),int(input())-1,sorted(I()),0,0
while n>-1:
r+=a[n]
k+=1
if k==q:n-=3;k=0
else:n-=1
print(r)
``` | output | 1 | 49,134 | 10 | 98,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 to m. To use the discount number i, the customer... | instruction | 0 | 49,135 | 10 | 98,270 |
Tags: greedy, sortings
Correct Solution:
```
import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
input = sys.stdin.readline
m = int(input())
q = list(map(int, input().split()))
n = int(input())
a = list(map(int, input().split()))
discount = min(q)
a.sort(reverse=True)
ans = 0
fo... | output | 1 | 49,135 | 10 | 98,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,136 | 10 | 98,272 |
Yes | output | 1 | 49,136 | 10 | 98,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,137 | 10 | 98,274 |
Yes | output | 1 | 49,137 | 10 | 98,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,138 | 10 | 98,276 |
Yes | output | 1 | 49,138 | 10 | 98,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,139 | 10 | 98,278 |
Yes | output | 1 | 49,139 | 10 | 98,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,140 | 10 | 98,280 |
No | output | 1 | 49,140 | 10 | 98,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,141 | 10 | 98,282 |
No | output | 1 | 49,141 | 10 | 98,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,142 | 10 | 98,284 |
No | output | 1 | 49,142 | 10 | 98,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Maxim always goes to the supermarket on Sundays. Today the supermarket has a special offer of discount systems.
There are m types of discounts. We assume that the discounts are indexed from 1 t... | instruction | 0 | 49,143 | 10 | 98,286 |
No | output | 1 | 49,143 | 10 | 98,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.
The store contains k items. n customers have already used the above service. Each user paid fo... | instruction | 0 | 49,284 | 10 | 98,568 |
Tags: brute force
Correct Solution:
```
#import sys
#sys.stdin = open('in', 'r')
#n = int(input())
#a = [int(x) for x in input().split()]
n,m,k = map(int, input().split())
p = [int(x) for x in input().split()]
inds = [-1 for i in range(k + 1)]
for i in range(k):
inds[p[i]] = i
res = 0
for i in range(n):
a = [i... | output | 1 | 49,284 | 10 | 98,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.
The store contains k items. n customers have already used the above service. Each user paid fo... | instruction | 0 | 49,285 | 10 | 98,570 |
Tags: brute force
Correct Solution:
```
n, m, k = map(int, input().split())
v = list(map(int, input().split()))
place = 0
s = 0
for l in range(n):
a = list(map(int, input().split()))
for i in a:
for j in range(k):
if v[j] == i:
place = j
break
s += pla... | output | 1 | 49,285 | 10 | 98,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.
The store contains k items. n customers have already used the above service. Each user paid fo... | instruction | 0 | 49,286 | 10 | 98,572 |
Tags: brute force
Correct Solution:
```
[n,m,k]=[int(i) for i in input().split()]
a=[0]*(k+1)
temp=[int(i) for i in input().split()]
for i in range(0,k):
a[temp[i]]=i+1
answer=0
for z in range(0,n):
temp=[int(i) for i in input().split()]
for i in temp:
answer+=a[i]
for l in range(1,k+1):
... | output | 1 | 49,286 | 10 | 98,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.
The store contains k items. n customers have already used the above service. Each user paid fo... | instruction | 0 | 49,287 | 10 | 98,574 |
Tags: brute force
Correct Solution:
```
#### IMPORTANT LIBRARY ####
############################
### DO NOT USE import random --> 250ms to load the library
############################
### In case of extra libraries: https://github.com/cheran-senthil/PyRival
######################
####### IMPORT #######
#########... | output | 1 | 49,287 | 10 | 98,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.
The store contains k items. n customers have already used the above service. Each user paid fo... | instruction | 0 | 49,288 | 10 | 98,576 |
Tags: brute force
Correct Solution:
```
ln=input().split(" ")
n=int(ln[0])
m=int(ln[1])
k=int(ln[2])
x=0
pila=input().split(" ")
for i in range(n):
cus=input().split(" ")
for j in range(m):
ind=pila.index(cus[j])
x=x+ind+1
pila.insert(0,pila.pop(ind))
print(x)
``` | output | 1 | 49,288 | 10 | 98,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.
The store contains k items. n customers have already used the above service. Each user paid fo... | instruction | 0 | 49,289 | 10 | 98,578 |
Tags: brute force
Correct Solution:
```
number = int(input().split()[0])
#orders = int(input())
array = input().split()
sum = 0
for i in range(0,number):
items = input().split()
for j in items:
buffer = []
sum = sum + int(array.index(j)) +1
buffer.append(j)
array.remove(j)
... | output | 1 | 49,289 | 10 | 98,579 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.