Problems
Contests
Topic
IDE
Events
PacketHub
Login
Description
Editorial
My Submission
1059.Greatest Number
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1059.Greatest Number
Time Limit:1000MS Memory Limit:65535KB
Description
Saya likes math, because she think math can make her cleverer. One day, Kudo invited a very simple game: Given N integers, then the players choose no more than four integers from them (can be repeated) and add them together. Finally, the one whose sum is the largest wins the game. It seems very simple, but there is one more condition: the sum shouldn't larger than a number M. Saya is very interest in this game. She says that since the number of integers is finite, we can enumerate all the selecting and find the largest sum. Saya calls the largest sum Greatest Number (GN). After reflecting for a while, Saya declares that she found the GN and shows her answer. Kudo wants to know whether Saya's answer is the best, so she comes to you for help. Can you help her to compute the GN?
Input
The input consists of several test cases. The first line of input in each test case contains two integers N (0<N≤1000) and M(0<M≤ 1000000000), which represent the number of integers and the upper bound. Each of the next N lines contains the integers. (Not larger than 1000000000) The last case is followed by a line containing two zeros.
Output
For each case, print the case number (1, 2 ...) and the GN. Your output format should imitate the sample output. Print a blank line between each test case.
Sample test
Sample input
2 10 100 2 0 0
Sample output
Case 1: 8
Note
Tags
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
2 10 100 2 0 0
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
Login before submit
