message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 219 108k | cluster float64 11 11 | __index_level_0__ int64 438 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those with rating 1899 or lower belong to the second d... | instruction | 0 | 63,583 | 11 | 127,166 |
Tags: binary search, greedy, math
Correct Solution:
```
q=int(input())
q-=1
a,s=map(int,input().split())
if s==1:
z=1900
x=9000000000
else:
z=-9000000000
x=1899
z+=a
x+=a
for j in range(0,q):
a,s=map(int,input().split())
if s==1:
z=max(1900,z)
else:
x=min(1899,x)
z+=a
... | output | 1 | 63,583 | 11 | 127,167 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those with rating 1899 or lower belong to the second d... | instruction | 0 | 63,584 | 11 | 127,168 |
Tags: binary search, greedy, math
Correct Solution:
```
n=int(input())
INF=10**18
l=-INF
r=INF
s=0
for _ in range(n):
c,d=map(int,input().split())
if d==1 and l+s<1900:
l=1900-s
if d==2 and r+s>=1900:
r=1899-s
s+=c
if l<-INF:
l=-INF
if r>INF:
r=INF
if l>r:
print("Impossible")
elif r>10**15... | output | 1 | 63,584 | 11 | 127,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,585 | 11 | 127,170 |
Yes | output | 1 | 63,585 | 11 | 127,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,586 | 11 | 127,172 |
Yes | output | 1 | 63,586 | 11 | 127,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,587 | 11 | 127,174 |
Yes | output | 1 | 63,587 | 11 | 127,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,588 | 11 | 127,176 |
Yes | output | 1 | 63,588 | 11 | 127,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,589 | 11 | 127,178 |
No | output | 1 | 63,589 | 11 | 127,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,590 | 11 | 127,180 |
No | output | 1 | 63,590 | 11 | 127,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,591 | 11 | 127,182 |
No | output | 1 | 63,591 | 11 | 127,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating 1900 or higher. Those w... | instruction | 0 | 63,592 | 11 | 127,184 |
No | output | 1 | 63,592 | 11 | 127,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,672 | 11 | 127,344 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
from collections import deque
import heapq
import sys
def input():
return sys.stdin.readline().rstrip()
n, T = map(int, input().split())
problems = [tuple(map(int, input().split())) for i in range(n)]
def possible(K):
... | output | 1 | 63,672 | 11 | 127,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,673 | 11 | 127,346 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
import os
import collections
def ints():
bytes = bytearray()
while True:
buffer = os.read(0, 1024)
if len(buffer) == 0:
break
bytes.extend(buffer)
array = collections.deque(map(int, bytes.split()))
return array
def ... | output | 1 | 63,673 | 11 | 127,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,674 | 11 | 127,348 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
import sys
import math
from collections import defaultdict,deque
import heapq
def search(arr,points,t):
l=[]
n=len(arr)
cnt=0
for i in range(n):
if arr[i][0]>=points:
l.append(arr[i][1])
... | output | 1 | 63,674 | 11 | 127,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,675 | 11 | 127,350 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 12 18:46:09 2018
@author: Sand Boa
"""
import itertools
if __name__ == "__main__":
n:int
T:int
n, T = list(map(int,input().split()))
listi:list = []
tsum:int = 0... | output | 1 | 63,675 | 11 | 127,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,676 | 11 | 127,352 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 12 18:46:09 2018
@author: Sand Boa
"""
import itertools
if __name__ == "__main__":
n:int
T:int
n, T = list(map(int,input().split()))
listi:list = []
tsum:int = 0... | output | 1 | 63,676 | 11 | 127,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,677 | 11 | 127,354 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
def fun(k):
global li,t
tem=[]
count=0
for i in li:
if(i[0]>=k):
tem.append(i)
count+=1
if(count>=k):
ans=0
for i in range(k):... | output | 1 | 63,677 | 11 | 127,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,678 | 11 | 127,356 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
# https://codeforces.com/contest/913/problem/D
import heapq
from heapq import heappush as push_
from heapq import heappop as pop_
class heapT():
def __init__(self, T):
self.Q = []
self.curT = 0
s... | output | 1 | 63,678 | 11 | 127,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time t... | instruction | 0 | 63,679 | 11 | 127,358 |
Tags: binary search, brute force, data structures, greedy, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 12 18:46:09 2018
@author: Sand Boa
"""
import sys
import operator # itemgetter
import itertools # islice
if __name__ == "__main__":
n, T = list(map(int,input().split()))
... | output | 1 | 63,679 | 11 | 127,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,680 | 11 | 127,360 |
Yes | output | 1 | 63,680 | 11 | 127,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,681 | 11 | 127,362 |
Yes | output | 1 | 63,681 | 11 | 127,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,682 | 11 | 127,364 |
Yes | output | 1 | 63,682 | 11 | 127,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,683 | 11 | 127,366 |
Yes | output | 1 | 63,683 | 11 | 127,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,684 | 11 | 127,368 |
No | output | 1 | 63,684 | 11 | 127,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,685 | 11 | 127,370 |
No | output | 1 | 63,685 | 11 | 127,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,686 | 11 | 127,372 |
No | output | 1 | 63,686 | 11 | 127,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ign... | instruction | 0 | 63,687 | 11 | 127,374 |
No | output | 1 | 63,687 | 11 | 127,375 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,736 | 11 | 127,472 |
"Correct Solution:
```
x = int(input())
a = x // 200
print(10 - a)
``` | output | 1 | 63,736 | 11 | 127,473 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,737 | 11 | 127,474 |
"Correct Solution:
```
X = int(input())
X = 2000 - (X+1)
X //= 200
print(X + 1)
``` | output | 1 | 63,737 | 11 | 127,475 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,738 | 11 | 127,476 |
"Correct Solution:
```
X=int(input())
kyu= 10 - X//200
print(kyu)
``` | output | 1 | 63,738 | 11 | 127,477 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,739 | 11 | 127,478 |
"Correct Solution:
```
rating = int(input())
print(10 - rating // 200)
``` | output | 1 | 63,739 | 11 | 127,479 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,740 | 11 | 127,480 |
"Correct Solution:
```
s = int(input())
print(10 - s//200)
``` | output | 1 | 63,740 | 11 | 127,481 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,741 | 11 | 127,482 |
"Correct Solution:
```
XX = int(input())
Kyu = 10-int(XX/200)
print(Kyu)
``` | output | 1 | 63,741 | 11 | 127,483 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,742 | 11 | 127,484 |
"Correct Solution:
```
n=(int(input())-400)//200
print(8-n)
``` | output | 1 | 63,742 | 11 | 127,485 |
Provide a correct Python 3 solution for this coding contest problem.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:
* From 400 through 599: 8-kyu
* From... | instruction | 0 | 63,743 | 11 | 127,486 |
"Correct Solution:
```
# 入力
X = int(input())
print(10 - X // 200 )
``` | output | 1 | 63,743 | 11 | 127,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,744 | 11 | 127,488 |
Yes | output | 1 | 63,744 | 11 | 127,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,745 | 11 | 127,490 |
Yes | output | 1 | 63,745 | 11 | 127,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,746 | 11 | 127,492 |
Yes | output | 1 | 63,746 | 11 | 127,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,747 | 11 | 127,494 |
Yes | output | 1 | 63,747 | 11 | 127,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,748 | 11 | 127,496 |
No | output | 1 | 63,748 | 11 | 127,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,749 | 11 | 127,498 |
No | output | 1 | 63,749 | 11 | 127,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,750 | 11 | 127,500 |
No | output | 1 | 63,750 | 11 | 127,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
M-kun is a competitor in AtCoder, whose highest rating is X.
In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the followi... | instruction | 0 | 63,751 | 11 | 127,502 |
No | output | 1 | 63,751 | 11 | 127,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,824 | 11 | 127,648 |
Yes | output | 1 | 63,824 | 11 | 127,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,825 | 11 | 127,650 |
Yes | output | 1 | 63,825 | 11 | 127,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,826 | 11 | 127,652 |
Yes | output | 1 | 63,826 | 11 | 127,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,827 | 11 | 127,654 |
Yes | output | 1 | 63,827 | 11 | 127,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,828 | 11 | 127,656 |
No | output | 1 | 63,828 | 11 | 127,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,829 | 11 | 127,658 |
No | output | 1 | 63,829 | 11 | 127,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,830 | 11 | 127,660 |
No | output | 1 | 63,830 | 11 | 127,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the lar... | instruction | 0 | 63,831 | 11 | 127,662 |
No | output | 1 | 63,831 | 11 | 127,663 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.