message stringlengths 2 20.2k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 757 108k | cluster float64 4 4 | __index_level_0__ int64 1.51k 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little X and Little Z are good friends. They always chat online. But both of them have schedules.
Little Z has fixed schedule. He always online at any moment of time between a1 and b1, between a2 and b2, ..., between ap and bp (all borders inclusive). But the schedule of Little X is quite strange, it depends on the time when he gets up. If he gets up at time 0, he will be online at any moment of time between c1 and d1, between c2 and d2, ..., between cq and dq (all borders inclusive). But if he gets up at time t, these segments will be shifted by t. They become [ci + t, di + t] (for all i).
If at a moment of time, both Little X and Little Z are online simultaneosly, they can chat online happily. You know that Little X can get up at an integer moment of time between l and r (both borders inclusive). Also you know that Little X wants to get up at the moment of time, that is suitable for chatting with Little Z (they must have at least one common moment of time in schedules). How many integer moments of time from the segment [l, r] suit for that?
Input
The first line contains four space-separated integers p, q, l, r (1 ≤ p, q ≤ 50; 0 ≤ l ≤ r ≤ 1000).
Each of the next p lines contains two space-separated integers ai, bi (0 ≤ ai < bi ≤ 1000). Each of the next q lines contains two space-separated integers cj, dj (0 ≤ cj < dj ≤ 1000).
It's guaranteed that bi < ai + 1 and dj < cj + 1 for all valid i and j.
Output
Output a single integer — the number of moments of time from the segment [l, r] which suit for online conversation.
Examples
Input
1 1 0 4
2 3
0 1
Output
3
Input
2 3 0 20
15 17
23 26
1 4
7 11
15 17
Output
20
Submitted Solution:
```
temparr = input()
temparr = temparr.split()
p = int(temparr[0])
q = int(temparr[1])
l = int(temparr[2])
r = int(temparr[3])
arrp = []
arrq = []
for i in range(p):
temparr = input()
temparr = temparr.split()
aa = int(temparr[0])
bb = int(temparr[1])
arrp.append([aa,bb])
for i in range(q):
temparr = input()
temparr = temparr.split()
aa = int(temparr[0])
bb = int(temparr[1])
arrq.append([aa,bb])
arrp = sorted(arrp)
arrq = sorted(arrq)
ans = 0
def swap(i,j):
return j, i
for time in range(l , r + 1):
flag = 0
for i in range(q):
qpair = arrq[i]
si = qpair[0] + time
ei = qpair[1] + time
for j in range(p):
ppair = arrp[j]
sj = ppair[0]
ej = ppair[1]
if si >= sj and si <= ej:
flag = 1
break
if ei >= sj and ei <= ej:
flag = 1
break
si,sj = swap(si,sj)
ei,ej = swap(ei,ej)
if si >= sj and si <= ej:
flag = 1
break
if ei >= sj and ei <= ej:
flag = 1
break
if flag == 1:
break
if flag == 1:
ans += 1
print(ans)
``` | instruction | 0 | 82,094 | 4 | 164,188 |
No | output | 1 | 82,094 | 4 | 164,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little X and Little Z are good friends. They always chat online. But both of them have schedules.
Little Z has fixed schedule. He always online at any moment of time between a1 and b1, between a2 and b2, ..., between ap and bp (all borders inclusive). But the schedule of Little X is quite strange, it depends on the time when he gets up. If he gets up at time 0, he will be online at any moment of time between c1 and d1, between c2 and d2, ..., between cq and dq (all borders inclusive). But if he gets up at time t, these segments will be shifted by t. They become [ci + t, di + t] (for all i).
If at a moment of time, both Little X and Little Z are online simultaneosly, they can chat online happily. You know that Little X can get up at an integer moment of time between l and r (both borders inclusive). Also you know that Little X wants to get up at the moment of time, that is suitable for chatting with Little Z (they must have at least one common moment of time in schedules). How many integer moments of time from the segment [l, r] suit for that?
Input
The first line contains four space-separated integers p, q, l, r (1 ≤ p, q ≤ 50; 0 ≤ l ≤ r ≤ 1000).
Each of the next p lines contains two space-separated integers ai, bi (0 ≤ ai < bi ≤ 1000). Each of the next q lines contains two space-separated integers cj, dj (0 ≤ cj < dj ≤ 1000).
It's guaranteed that bi < ai + 1 and dj < cj + 1 for all valid i and j.
Output
Output a single integer — the number of moments of time from the segment [l, r] which suit for online conversation.
Examples
Input
1 1 0 4
2 3
0 1
Output
3
Input
2 3 0 20
15 17
23 26
1 4
7 11
15 17
Output
20
Submitted Solution:
```
p, q, l, r = map(int,input().split())
z_schedule, x_schedule = [], []
for i in range(p):
a, b = map(int, input().split())
z_schedule.append((a, b))
for j in range(q):
c, d = map(int, input().split())
x_schedule.append((c, d))
count = 0
for ind in range(l, r+1):
for j in range(q):
c, d = x_schedule[j][0] + ind, x_schedule[j][1] + ind
for i in range(p):
a, b = z_schedule[i][0], z_schedule[i][1]
common_range = list(set(range(a,b+1)) & set(range(c, d+1)))
if len(common_range) != 0:
count += 1
print(count)
``` | instruction | 0 | 82,095 | 4 | 164,190 |
No | output | 1 | 82,095 | 4 | 164,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little X and Little Z are good friends. They always chat online. But both of them have schedules.
Little Z has fixed schedule. He always online at any moment of time between a1 and b1, between a2 and b2, ..., between ap and bp (all borders inclusive). But the schedule of Little X is quite strange, it depends on the time when he gets up. If he gets up at time 0, he will be online at any moment of time between c1 and d1, between c2 and d2, ..., between cq and dq (all borders inclusive). But if he gets up at time t, these segments will be shifted by t. They become [ci + t, di + t] (for all i).
If at a moment of time, both Little X and Little Z are online simultaneosly, they can chat online happily. You know that Little X can get up at an integer moment of time between l and r (both borders inclusive). Also you know that Little X wants to get up at the moment of time, that is suitable for chatting with Little Z (they must have at least one common moment of time in schedules). How many integer moments of time from the segment [l, r] suit for that?
Input
The first line contains four space-separated integers p, q, l, r (1 ≤ p, q ≤ 50; 0 ≤ l ≤ r ≤ 1000).
Each of the next p lines contains two space-separated integers ai, bi (0 ≤ ai < bi ≤ 1000). Each of the next q lines contains two space-separated integers cj, dj (0 ≤ cj < dj ≤ 1000).
It's guaranteed that bi < ai + 1 and dj < cj + 1 for all valid i and j.
Output
Output a single integer — the number of moments of time from the segment [l, r] which suit for online conversation.
Examples
Input
1 1 0 4
2 3
0 1
Output
3
Input
2 3 0 20
15 17
23 26
1 4
7 11
15 17
Output
20
Submitted Solution:
```
p, q, l, r = [int(x) for x in input().split()]
a = ''
b = ''
for i in range(p):
x, y = [int(x) for x in input().split()]
a += '0' * (x - len(a) - 1)
a += '1' * (y - x + 1)
for i in range(q):
x, y = [int(x) for x in input().split()]
b += '0' * (x - len(b) - 1)
b += '1' * (y - x + 1)
ans = 0
for i in range(l, r + 1):
ans += 1 if any(map(lambda x: x[0] == '1' and x[1] == '1', zip(a, '0' * i + b))) else 0
print(ans)
``` | instruction | 0 | 82,096 | 4 | 164,192 |
No | output | 1 | 82,096 | 4 | 164,193 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,544 | 4 | 165,088 |
"Correct Solution:
```
a=int(input());print(a//3600,a%3600//60,a%60,sep=':')
``` | output | 1 | 82,544 | 4 | 165,089 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,545 | 4 | 165,090 |
"Correct Solution:
```
t = int(input())
print("{0}:{1}:{2}".format(t//3600, (t%3600)//60, t%60))
``` | output | 1 | 82,545 | 4 | 165,091 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,546 | 4 | 165,092 |
"Correct Solution:
```
S = int(input())
print(S//3600,':',S%3600//60,':',S%60, sep='')
``` | output | 1 | 82,546 | 4 | 165,093 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,547 | 4 | 165,094 |
"Correct Solution:
```
s = int(input())
print("{}:{}:{}".format(s//3600, (s%3600)//60, s%60))
``` | output | 1 | 82,547 | 4 | 165,095 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,548 | 4 | 165,096 |
"Correct Solution:
```
s=int(input())
print("{0}:{1}:{2}".format(s//3600,s%3600//60,s%60))
``` | output | 1 | 82,548 | 4 | 165,097 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,549 | 4 | 165,098 |
"Correct Solution:
```
S=int(input())
print("%d:%d:%d"%(S/3600,(S%3600/60),(S%3600)%60))
``` | output | 1 | 82,549 | 4 | 165,099 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,550 | 4 | 165,100 |
"Correct Solution:
```
S = int(input())
print(f'{S//3600}:{S//60%60}:{S%60}')
``` | output | 1 | 82,550 | 4 | 165,101 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59 | instruction | 0 | 82,551 | 4 | 165,102 |
"Correct Solution:
```
s=int(input())
print("%d:%d:%d"%(s/3600,(s%3600)/60,(s%3600)%60))
``` | output | 1 | 82,551 | 4 | 165,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
S = int(input())
print (S//3600, (S%3600)//60, S%60, sep = ":")
``` | instruction | 0 | 82,552 | 4 | 165,104 |
Yes | output | 1 | 82,552 | 4 | 165,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
sec=int(input())
m=sec//60%60
h=sec//3600
s=sec%60
print(h,m,s,sep=":")
``` | instruction | 0 | 82,553 | 4 | 165,106 |
Yes | output | 1 | 82,553 | 4 | 165,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
S=int(input())
s=S%60
m=S//60%60
h=S//3600%60
print(h,m,s,sep=':')
``` | instruction | 0 | 82,554 | 4 | 165,108 |
Yes | output | 1 | 82,554 | 4 | 165,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
s=int(input())
h=s//3600
m=s%3600//60
s=s%3600%60
print(h,m,s,sep=":")
``` | instruction | 0 | 82,555 | 4 | 165,110 |
Yes | output | 1 | 82,555 | 4 | 165,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
import sys
S = input()
sec = int(S)
if(sec < 86400):
if(sec >= 0):
h = int(sec / 3600)
sec = sec % 3600
m = int(sec / 60)
s = sec % 60
print(h,end="")
print(":",end="")
print(m,end="")
print(":",end="")
print(s,end="")
``` | instruction | 0 | 82,556 | 4 | 165,112 |
No | output | 1 | 82,556 | 4 | 165,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
n = input()
h = n / 3600 #???
n %= 3600
m = n /60 #???
n %= 60
s = n #?§?
print(h + ":" + m + ":" + s)
``` | instruction | 0 | 82,557 | 4 | 165,114 |
No | output | 1 | 82,557 | 4 | 165,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
import argparse
parser = argparse.ArgumentParser(description='Process some integers.')
parser.add_argument('n', type=int, action='store')
args = parser.parse_args()
h = args.n / 3600
n = args.n % 3600
m = n / 60
s = n % 60
print('{}:{}:{}'.format(h,m,s))
``` | instruction | 0 | 82,558 | 4 | 165,116 |
No | output | 1 | 82,558 | 4 | 165,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.
Constraints
* $0 \leq S \leq 86400$
Input
An integer $S$ is given in a line.
Output
Print $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.
Example
Input
46979
Output
13:2:59
Submitted Solution:
```
S=input()
h=int(S)//3600
m=(int(S)-3600*h)//60
s=int(S)-60*m-3600*h
print(h,';',m,';',s)
``` | instruction | 0 | 82,559 | 4 | 165,118 |
No | output | 1 | 82,559 | 4 | 165,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,564 | 4 | 165,128 |
Tags: greedy
Correct Solution:
```
a,b = map(int,input().split())
m = []
a_m = []
s =0
k =0
while s<=a+b:
k+=1
s+=k
m.append(k)
del(m[-1])
for i in range(k-2,-1,-1):
if a>=m[i]:
a-=m[i]
a_m.append(m[i])
del(m[i])
print(len(a_m))
print(*a_m)
print(len(m))
print(*m)
``` | output | 1 | 82,564 | 4 | 165,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,565 | 4 | 165,130 |
Tags: greedy
Correct Solution:
```
import math
day1,day2=list(map(int,input().split()))
n=math.floor((-1+math.sqrt(1+8*(day1+day2)))/2)
l=range(n,0,-1)
day1_list=[]
for c in l:
if c<=day1:
day1-=c
day1_list.append(c)
print(len(day1_list))
print(" ".join(map(str,day1_list)))
day2_list=set(l)-set(day1_list)
print(len(day2_list))
print(" ".join(map(str,day2_list)))
``` | output | 1 | 82,565 | 4 | 165,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,566 | 4 | 165,132 |
Tags: greedy
Correct Solution:
```
a,b=map(int,input().split())
m=[];a_m=[];k=0;s=0
while s<=a+b:
k+=1;s+=k
m.append(k)
del m[-1]
for i in range(k-2,-1,-1):
if a>=m[i]:
a=a-m[i]
a_m.append(m[i])
del m[i]
print(len(a_m))
print(*a_m)
print(len(m))
print(*m)
``` | output | 1 | 82,566 | 4 | 165,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,567 | 4 | 165,134 |
Tags: greedy
Correct Solution:
```
import math
day1,day2=list(map(int,input().split()))
#n**2+n-2*(a+b)=0
n=math.floor((-1+math.sqrt(1+8*(day1+day2)))/2)
l=range(1,n+1)[-1::-1]
day1_list=[]
for c in l:
if c<=day1:
day1-=c
day1_list.append(c)
print(len(day1_list))
print(" ".join(map(str,day1_list)))
day2_list=set(l)-set(day1_list)
print(len(day2_list))
print(" ".join(map(str,day2_list)))
``` | output | 1 | 82,567 | 4 | 165,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,568 | 4 | 165,136 |
Tags: greedy
Correct Solution:
```
a,b=map(int , input().split())
curr=a
ind=1
f=[]
s=[]
while(curr>=ind):
f.append(ind)
curr-=ind
ind+=1
extra=-1
if curr and ind-curr<=ind:
f.append(ind)
extra=ind-curr
ind+=1
curr=b
while(curr>=ind):
s.append(ind)
curr-=ind
ind+=1
#print(extra)
if extra!=-1:
print(len(f) - 1)
for i in f:
if i != extra:
print(i, end=' ')
print('')
if curr>=extra:
print(len(s)+1)
print(extra,end=' ')
for i in s:
print(i,end=' ')
else:
print(len(s))
for i in s:
print(i,end=' ')
print('')
else:
print(len(f))
for i in f:
print(i,end=' ')
print('')
print(len(s))
for i in s:
print(i,end=' ')
print('')
``` | output | 1 | 82,568 | 4 | 165,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,569 | 4 | 165,138 |
Tags: greedy
Correct Solution:
```
from sys import stdout
from math import sqrt
n, k = map(int, input().split())
no = (-1 + int(sqrt(1 + 8 * n))) // 2
nn = n - no * (no + 1) / 2
if nn != 0:
nn = no + 1 - nn
d1, d2 = [], []
i = 1
while n > 0:
if i != nn:
n -= i
d1.append(i)
i += 1
print(len(d1))
print(*d1)
if nn != 0:
if k >= nn:
d2.append(int(nn))
k -= nn
while k > 0:
k -= i
if k >= 0:
d2.append(i)
i += 1
print(len(d2))
print(*d2)
``` | output | 1 | 82,569 | 4 | 165,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,570 | 4 | 165,140 |
Tags: greedy
Correct Solution:
```
a,b = map(int, input().split())
n = int((1+(1+8*(a+b))**0.5)/2-1)
con = [x for x in range(1, n+1)]
con=con[::-1]
con1=[]
con2=[]
a1=a
b1=b
a=max(a,b)
b=min(a1,b1)
for i in range(0,len(con)):
if a-con[i]>0:
con1.append(con[i])
a-=con[i]
con[i]=0
elif a-con[i]==0:
con1.append(con[i])
con[i]=0
break
con2=[]
for i in con:
if i!=0:
con2.append(i)
a2=len(con1)
b2=len(con2)
huy=con1[::-1]
huy1=con2[::-1]
if a1<=b1:
print(b2)
print(*huy1)
print(a2)
print(*huy)
else:
print(a2)
print(*huy)
print(b2)
print(*huy1)
``` | output | 1 | 82,570 | 4 | 165,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total. | instruction | 0 | 82,571 | 4 | 165,142 |
Tags: greedy
Correct Solution:
```
###### ### ####### ####### ## # ##### ### #####
# # # # # # # # # # # # # ###
# # # # # # # # # # # # # ###
###### ######### # # # # # # ######### #
###### ######### # # # # # # ######### #
# # # # # # # # # # #### # # #
# # # # # # # ## # # # # #
###### # # ####### ####### # # ##### # # # #
from __future__ import print_function # for PyPy2
# from itertools import permutations
# from functools import cmp_to_key # for adding custom comparator
# from fractions import Fraction
from collections import *
from sys import stdin
from bisect import *
from heapq import *
from math import log2
g = lambda : stdin.readline().strip()
gl = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gfl = lambda : [float(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
rr = lambda x : reversed(range(x))
mod = int(1e9)+7
inf = float("inf")
a, b = gil()
rev = False
if a > b:
rev = True
a, b = b, a
# solving for a
l, r = 1, int(1e9)
ans = 0
while l <= r:
mid = (l+r)//2
if (mid*(mid+1))//2 <= a:
ans = mid
l = mid + 1
else:
r = mid - 1
newSum = ((ans+1)*(ans+2))//2
miss = inf if newSum - a > ans+1 else newSum - a
# print('miss', miss)
if miss != inf:
ans += 1
aa, bb = [], []
for v in range(1, ans+1):
if v != miss:
aa.append(v)
sm = 0
start = ans+1
while sm + start < b:
bb.append(start)
sm += start
start += 1
if sm + miss <= b:
bb.append(miss)
if rev:
aa, bb = bb, aa
print(len(aa))
print(*aa)
print(len(bb))
print(*bb)
``` | output | 1 | 82,571 | 4 | 165,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
a,b=map(int,input().split())
limit=1;s=a+b;num=0
while s>=num+limit:
num+=limit
limit+=1
limit-=1
a_array=[];b_array=[]
for i in range(limit,0,-1):
if i<=a:
a_array.append(i)
a-=i
elif i<=b:
b_array.append(i)
b-=i
print(len(a_array))
print(*(a_array))
print(len(b_array))
print(*(b_array))
``` | instruction | 0 | 82,572 | 4 | 165,144 |
Yes | output | 1 | 82,572 | 4 | 165,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
def ans_1():
print(len(day1))
for j in day1:
print(j, end=' ')
def ans_2():
print(i - len(day1) - 1 - 1)
for j in range(i - 2, 0, -1):
if j not in day1:
print(j, end=' ')
a,b=map(int,input().split())
c,d=a,b
a,b=min(a,b),max(a,b)
total=a+b
count=0
i=1
pre=0
while count <= total:
count+=i
pre=i
i+=1
pre-=1
day1=set()
adda=0
last=0
while adda<a:
adda+=pre
day1.add(pre)
last=pre
pre-=1
if day1:
day1.remove(last)
day1.add(last-(adda-a))
if c<d:
ans_1()
print()
ans_2()
else:
ans_2()
print()
ans_1()
``` | instruction | 0 | 82,573 | 4 | 165,146 |
Yes | output | 1 | 82,573 | 4 | 165,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
a, b = map(int, input().split())
sum = a + b
m = 1
s = 0
while s + m <= sum:
s += m
m += 1
m -= 1
al = []
bl = []
for i in range(m, 0, -1):
if a - i >= 0:
al.append(i)
a -= i
elif b - i >= 0:
bl.append(i)
b -= i
print(len(al))
print(' '.join(map(str, al)))
print(len(bl))
print(' '.join(map(str, bl)))
``` | instruction | 0 | 82,574 | 4 | 165,148 |
Yes | output | 1 | 82,574 | 4 | 165,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
#
import collections, atexit, math, sys, bisect
sys.setrecursionlimit(1000000)
def getIntList():
return list(map(int, input().split()))
try :
#raise ModuleNotFoundError
import numpy
def dprint(*args, **kwargs):
print(*args, **kwargs, file=sys.stderr)
dprint('debug mode')
except Exception:
def dprint(*args, **kwargs):
pass
inId = 0
outId = 0
if inId>0:
dprint('use input', inId)
sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件
if outId>0:
dprint('use output', outId)
sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件
atexit.register(lambda :sys.stdout.close()) #idle 中不会执行 atexit
A, B = getIntList()
#print(N)
tot = 0
for i in range(1, 1000000):
tot+=i
if tot> A+B:
break
n = i-1
zr = [1 for i in range(n+1) ]
tot = 0
zz = []
for i in range(1,1000000):
tot += i
if tot >A:
tot -= i
break
zz.append(i)
if zz and zz[-1] <n:
for i in range( A - tot):
zz[-1-i] +=1
for x in zz:
zr[x] = 0
print(len(zz))
for x in zz:
print(x,end = ' ')
print()
print(n- len(zz))
for i in range(1,n+1):
if zr[i] ==1:
print(i,end = ' ')
print()
``` | instruction | 0 | 82,575 | 4 | 165,150 |
Yes | output | 1 | 82,575 | 4 | 165,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
a,b=map(int,input().split())
a,b=min(a,b),max(a,b)
total=a+b
count=0
i=1
pre=0
while count <= total:
count+=i
pre=i
i+=1
pre-=1
day1=set()
adda=0
last=0
while adda<a:
adda+=pre
day1.add(pre)
last=pre
pre-=1
day1.remove(last)
day1.add(last-(adda-a))
print(i-len(day1)-1-1)
for j in range(i-2,0,-1):
if j not in day1:
print(j,end=' ')
print()
print(len(day1))
for j in day1:
print(j,end=' ')
``` | instruction | 0 | 82,576 | 4 | 165,152 |
No | output | 1 | 82,576 | 4 | 165,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
from sys import stdin,stdout
def readlist():
a=[int(i) for i in stdin.readline().split()]
return a
def root(a):
p=(1+8*a)**0.5 - 1
p=p/2
return int(p)
c,d=readlist()
if c>d:
a=d
b=c
fl=1
else:
b=d
a=c
fl=0
p=root(a)
#print(p)
z=list(range(1,p+1))
extra=(a-(p*(p+1))//2)
i=len(z)-1
while(extra>0):
z[i]=z[i]+1
i=i-1
extra=extra-1
q=root(a+b)
z1=list(range(1,q))+[q+((a+b)-(q*(q+1))//2)]
#print(len(z1),z1,sum(z1))
z1=list(set(z1)-set(z))
#print(a,b,fl)
if a==1 and b==1:
print(1)
print(1)
print(0)
elif fl==1:
if b==0:
print(0)
print(' ')
else:
print(len(z1))
print(*z1)
if a==0:
print(0)
print(' ')
else:
print(len(z))
print(*z)
else:
if a==0:
print(0)
print(' ')
else:
print(len(z))
print(*z)
if b==0:
print(0)
print(' ')
else:
print(len(z1))
print(*z1)
``` | instruction | 0 | 82,577 | 4 | 165,154 |
No | output | 1 | 82,577 | 4 | 165,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
from collections import defaultdict
def main():
a,b=map(int,input().split())
z=0
p=[]
i=1
while z+i<=a:
p.append(i)
z+=i
i+=1
f=-1
j=i
if p:
j=p.pop()
p.append(j+a-z)
f=j+a-z
y=0
q=[]
while y+j<=b:
if j!=f:
q.append(j)
y+=j
j+=1
print(len(p))
print(*p)
print(len(q))
print(*q)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
if __name__ == "__main__":
main()
``` | instruction | 0 | 82,578 | 4 | 165,156 |
No | output | 1 | 82,578 | 4 | 165,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most a hours, and he will have b hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number k in k hours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most a hours in total, and fully read several lecture notes tomorrow, spending at most b hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
Input
The only line of input contains two integers a and b (0 ≤ a, b ≤ 10^{9}) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
Output
In the first line print a single integer n (0 ≤ n ≤ a) — the number of lecture notes Lesha has to read in the first day. In the second line print n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ a), the sum of all p_i should not exceed a.
In the third line print a single integer m (0 ≤ m ≤ b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print m distinct integers q_1, q_2, …, q_m (1 ≤ q_i ≤ b), the sum of all q_i should not exceed b.
All integers p_i and q_i should be distinct. The sum n + m should be largest possible.
Examples
Input
3 3
Output
1
3
2
2 1
Input
9 12
Output
2
3 6
4
1 2 4 5
Note
In the first example Lesha can read the third note in 3 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 3 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 9 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 12 hours in total.
Submitted Solution:
```
b = input().split()
a = int(b[0])
b = int(b[1])
x = []
s = 0
d = 0
if b < a :
a,b = b,a
d = 1
#a = 2
if b <= 7 and b >= 5 and b != 3 and b != 12:
1+'1'
def find(v,i) :
y = -1
x = len(v)
while x != y + 1 :
m = (x+y)//2
if v[m] > i :
x = m
elif v[m] < i :
y = m
else :
return False
return True
if a > 1 :
for i in range(1,a+1) :
if i*2 < a-s :
s = s + i
x.append(i)
else :
x.append(a-s)
break
else :
if a == 1 :
x.append(1)
y = []
s = 0
if b > 1 :
for i in range(1,b+1) :
if i*2 < b-s or i < 2 :
if find(x,i) :
s = s + i
y.append(i)
else :
i = b-s
while i != 1 :
if find(x,i) :
y.append(i)
break
i = i - 1
break
else :
if b == 1 and len(x)<1 :
y.append(1)
if d != 1 :
print(len(x))
for i in x :
print(i,end=' ')
if len(x) > 0:
print()
print(len(y))
for i in y :
print(i,end=' ')
else :
print(len(y))
for i in y :
print(i,end=' ')
if len(y) > 0:
print()
print(len(x))
for i in x :
print(i,end=' ')
``` | instruction | 0 | 82,579 | 4 | 165,158 |
No | output | 1 | 82,579 | 4 | 165,159 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Taro decided to watch one movie every day at a nearby movie theater during the summer vacation. (Taro has 31 days of summer vacation from August 1st to August 31st.)
The theater is set to show n movies during the summer vacation. Each movie is assigned a number from 1 to n, and the i-th movie will only be shown between August ai and August bi.
When Taro sees a movie, he gets 100 happiness if it's the first movie he sees. But if you've seen a movie even once in the past, you'll get 50 happiness.
Taro decided to make a plan for the summer vacation based on the schedule of the movie to be screened. Find the total value when watching the movie so that the total value of happiness that Taro can get is maximized.
It is guaranteed that one or more movies will be shown each day.
Constraints
* 1 ≤ n ≤ 100
* 1 ≤ ai ≤ bi ≤ 31 (1 ≤ i ≤ n)
Input
The input is given in the following format.
n
a1 b1
a2 b2
...
an bn
The first line is given one integer n. Of the n lines from the second line, the i line is given two integers ai and bi, separated by blanks.
Output
Output the maximum value of the total happiness that Taro can obtain.
Examples
Input
4
1 31
2 2
2 3
3 3
Output
1700
Input
5
1 10
10 20
20 21
22 31
4 20
Output
1800 | instruction | 0 | 83,322 | 4 | 166,644 |
"Correct Solution:
```
# coding:utf-8
import sys
import heapq
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()
n = II()
M = [LI() for _ in range(n)]
for a in zip(* M):
start = set(a)
break
M.sort()
# print(start)
ans = 0
index = 0
hq = []
for i in range(31):
if i + 1 in start:
while i + 1 in start and M[index][0] == i + 1:
heapq.heappush(hq, M[index][1])
index += 1
if index >= n:
break
while hq and hq[0] < i + 1:
if hq:
tmp = heapq.heappop(hq)
else:
break
if hq:
ans += 100
tmp = heapq.heappop(hq)
else:
ans += 50
# print(i+1, ans, hq)
print(ans)
``` | output | 1 | 83,322 | 4 | 166,645 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Taro decided to watch one movie every day at a nearby movie theater during the summer vacation. (Taro has 31 days of summer vacation from August 1st to August 31st.)
The theater is set to show n movies during the summer vacation. Each movie is assigned a number from 1 to n, and the i-th movie will only be shown between August ai and August bi.
When Taro sees a movie, he gets 100 happiness if it's the first movie he sees. But if you've seen a movie even once in the past, you'll get 50 happiness.
Taro decided to make a plan for the summer vacation based on the schedule of the movie to be screened. Find the total value when watching the movie so that the total value of happiness that Taro can get is maximized.
It is guaranteed that one or more movies will be shown each day.
Constraints
* 1 ≤ n ≤ 100
* 1 ≤ ai ≤ bi ≤ 31 (1 ≤ i ≤ n)
Input
The input is given in the following format.
n
a1 b1
a2 b2
...
an bn
The first line is given one integer n. Of the n lines from the second line, the i line is given two integers ai and bi, separated by blanks.
Output
Output the maximum value of the total happiness that Taro can obtain.
Examples
Input
4
1 31
2 2
2 3
3 3
Output
1700
Input
5
1 10
10 20
20 21
22 31
4 20
Output
1800 | instruction | 0 | 83,323 | 4 | 166,646 |
"Correct Solution:
```
# AOJ 1566 Movie
# Python3 2018.7.13 bal4u
n = int(input())
tbl = []
for i in range(n):
a, b = map(int, input().split())
tbl.append([b, a])
tbl.sort()
ans = saw = 0
seen = [0]*101
for i in range(1, 32):
for j in range(n):
if i < tbl[j][1] or tbl[j][0] < i: continue
if seen[j]: continue
ans += 100; seen[j] = 1; saw += 1
break;
print(ans+(31-saw)*50)
``` | output | 1 | 83,323 | 4 | 166,647 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Taro decided to watch one movie every day at a nearby movie theater during the summer vacation. (Taro has 31 days of summer vacation from August 1st to August 31st.)
The theater is set to show n movies during the summer vacation. Each movie is assigned a number from 1 to n, and the i-th movie will only be shown between August ai and August bi.
When Taro sees a movie, he gets 100 happiness if it's the first movie he sees. But if you've seen a movie even once in the past, you'll get 50 happiness.
Taro decided to make a plan for the summer vacation based on the schedule of the movie to be screened. Find the total value when watching the movie so that the total value of happiness that Taro can get is maximized.
It is guaranteed that one or more movies will be shown each day.
Constraints
* 1 ≤ n ≤ 100
* 1 ≤ ai ≤ bi ≤ 31 (1 ≤ i ≤ n)
Input
The input is given in the following format.
n
a1 b1
a2 b2
...
an bn
The first line is given one integer n. Of the n lines from the second line, the i line is given two integers ai and bi, separated by blanks.
Output
Output the maximum value of the total happiness that Taro can obtain.
Examples
Input
4
1 31
2 2
2 3
3 3
Output
1700
Input
5
1 10
10 20
20 21
22 31
4 20
Output
1800 | instruction | 0 | 83,324 | 4 | 166,648 |
"Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
As = []
Bs = []
movies = [[] for x in range(31)]
for n in range(N):
a, b = map(int, input().split())
a -= 1
b -= 1
As.append(a)
Bs.append(b)
for day in range(a, b+1):
movies[day].append(n)
picked = [False] * N
ans = 0
for day in range(31):
# ????????????????????????
unseen_movies = [m for m in movies[day] if not picked[m]]
# ???????????????????????????
if len(unseen_movies) == 0:
ans += 50
else:
# ????????????????????????????????????????????£??¨????????????????????????????????????
lastday = 1000
should_see = -1
for m in unseen_movies:
if Bs[m] < lastday:
lastday = Bs[m]
should_see = m
picked[should_see] = True
ans += 100
print(ans)
``` | output | 1 | 83,324 | 4 | 166,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem
Taro decided to watch one movie every day at a nearby movie theater during the summer vacation. (Taro has 31 days of summer vacation from August 1st to August 31st.)
The theater is set to show n movies during the summer vacation. Each movie is assigned a number from 1 to n, and the i-th movie will only be shown between August ai and August bi.
When Taro sees a movie, he gets 100 happiness if it's the first movie he sees. But if you've seen a movie even once in the past, you'll get 50 happiness.
Taro decided to make a plan for the summer vacation based on the schedule of the movie to be screened. Find the total value when watching the movie so that the total value of happiness that Taro can get is maximized.
It is guaranteed that one or more movies will be shown each day.
Constraints
* 1 ≤ n ≤ 100
* 1 ≤ ai ≤ bi ≤ 31 (1 ≤ i ≤ n)
Input
The input is given in the following format.
n
a1 b1
a2 b2
...
an bn
The first line is given one integer n. Of the n lines from the second line, the i line is given two integers ai and bi, separated by blanks.
Output
Output the maximum value of the total happiness that Taro can obtain.
Examples
Input
4
1 31
2 2
2 3
3 3
Output
1700
Input
5
1 10
10 20
20 21
22 31
4 20
Output
1800
Submitted Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
As = []
Bs = []
movies = [[] for x in range(31)]
for n in range(N):
a, b = map(int, input().split())
a -= 1
b -= 1
As.append(a)
Bs.append(b)
for day in range(a, b+1):
movies[day].append(n)
print(movies)
picked = [False] * N
ans = 0
for day in range(31):
# ????????????????????????
unseen_movies = [m for m in movies[day] if not picked[m]]
# ???????????????????????????
if len(unseen_movies) == 0:
ans += 50
else:
# ????????????????????????????????????????????£??¨????????????????????????????????????
lastday = 1000
should_see = -1
for m in unseen_movies:
if Bs[m] < lastday:
lastday = Bs[m]
should_see = m
picked[should_see] = True
ans += 100
print(ans)
``` | instruction | 0 | 83,325 | 4 | 166,650 |
No | output | 1 | 83,325 | 4 | 166,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem
Taro decided to watch one movie every day at a nearby movie theater during the summer vacation. (Taro has 31 days of summer vacation from August 1st to August 31st.)
The theater is set to show n movies during the summer vacation. Each movie is assigned a number from 1 to n, and the i-th movie will only be shown between August ai and August bi.
When Taro sees a movie, he gets 100 happiness if it's the first movie he sees. But if you've seen a movie even once in the past, you'll get 50 happiness.
Taro decided to make a plan for the summer vacation based on the schedule of the movie to be screened. Find the total value when watching the movie so that the total value of happiness that Taro can get is maximized.
It is guaranteed that one or more movies will be shown each day.
Constraints
* 1 ≤ n ≤ 100
* 1 ≤ ai ≤ bi ≤ 31 (1 ≤ i ≤ n)
Input
The input is given in the following format.
n
a1 b1
a2 b2
...
an bn
The first line is given one integer n. Of the n lines from the second line, the i line is given two integers ai and bi, separated by blanks.
Output
Output the maximum value of the total happiness that Taro can obtain.
Examples
Input
4
1 31
2 2
2 3
3 3
Output
1700
Input
5
1 10
10 20
20 21
22 31
4 20
Output
1800
Submitted Solution:
```
# AOJ 1566 Movie
# Python3 2018.7.13 bal4u
n = int(input())
tbl = []
for i in range(n):
a, b = map(int, input().split())
tbl.append([b, a])
tbl.sort()
ans = saw = 0
seen = [0]*32
for i in range(1, 32):
for j in range(n):
if i < tbl[j][1] or tbl[j][0] < i: continue
if seen[j]: continue
ans += 100; seen[j] = 1; saw += 1
break;
print(ans+(31-saw)*50)
``` | instruction | 0 | 83,326 | 4 | 166,652 |
No | output | 1 | 83,326 | 4 | 166,653 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,964 | 4 | 167,928 |
"Correct Solution:
```
n,m=map(int,input().split())
l=list(map(int,input().split()))
s=sum(l)
print(max(-1,n-s))
``` | output | 1 | 83,964 | 4 | 167,929 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,965 | 4 | 167,930 |
"Correct Solution:
```
I=lambda:list(map(int,input().split()))
n,m=I()
n=n-sum(I())
print(n if n>=0 else -1)
``` | output | 1 | 83,965 | 4 | 167,931 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,966 | 4 | 167,932 |
"Correct Solution:
```
n, m = map(int, input().split())
data = list(map(int, input().split()))
print(max(n-sum(data), -1))
``` | output | 1 | 83,966 | 4 | 167,933 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,967 | 4 | 167,934 |
"Correct Solution:
```
n, m = map(int, input().split())
a = list(map(int, input().split()))
print(max(-1, (n - sum(a))))
``` | output | 1 | 83,967 | 4 | 167,935 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,968 | 4 | 167,936 |
"Correct Solution:
```
n,m=map(int,input().split())
*a,=map(int,input().split())
ans=n-sum(a)
print([-1,ans][ans>=0])
``` | output | 1 | 83,968 | 4 | 167,937 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,969 | 4 | 167,938 |
"Correct Solution:
```
n,m=map(int,input().split())
a=sum(map(int,input().split()))
print(-1) if a>n else print(n-a)
``` | output | 1 | 83,969 | 4 | 167,939 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,970 | 4 | 167,940 |
"Correct Solution:
```
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
print(max(-1, N-sum(A)))
``` | output | 1 | 83,970 | 4 | 167,941 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9 | instruction | 0 | 83,971 | 4 | 167,942 |
"Correct Solution:
```
n, m = list(map(int, input().split()))
l = list(map(int, input().split()))
print(max(-1, n-sum(l)))
``` | output | 1 | 83,971 | 4 | 167,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9
Submitted Solution:
```
n,m = map(int,input().split())
a = list(map(int, input().split()))
b = sum(a)
print(max(-1,n-b))
``` | instruction | 0 | 83,972 | 4 | 167,944 |
Yes | output | 1 | 83,972 | 4 | 167,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has N days of summer vacation.
His teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.
He cannot do multiple assignments on the same day, or hang out on a day he does an assignment.
What is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?
If Takahashi cannot finish all the assignments during the vacation, print `-1` instead.
Constraints
* 1 \leq N \leq 10^6
* 1 \leq M \leq 10^4
* 1 \leq A_i \leq 10^4
Input
Input is given from Standard Input in the following format:
N M
A_1 ... A_M
Output
Print the maximum number of days Takahashi can hang out during the vacation, or `-1`.
Examples
Input
41 2
5 6
Output
30
Input
10 2
5 6
Output
-1
Input
11 2
5 6
Output
0
Input
314 15
9 26 5 35 8 9 79 3 23 8 46 2 6 43 3
Output
9
Submitted Solution:
```
n, m = map(int, input().split())
*a, = map(int, input().split())
print(max(-1, n-sum(a)))
``` | instruction | 0 | 83,973 | 4 | 167,946 |
Yes | output | 1 | 83,973 | 4 | 167,947 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.