题库
比赛
近期比赛
排名
话题
编译器
登录
题目描述
题解
我的提交
1059.Greatest Number
查看全部提交
提交状态
耗时
内存
语言
提交时间
1059.Greatest Number
时间限制:1000MS 内存限制:65535KB
题目描述
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?
输入描述
The input consists of several test cases. The first line of input in each test case contains two integers N (0
输出描述
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.
示例
输入样例
2 10 100 2 0 0
输出样例
Case 1: 8
提示
相关标签
发布题解
个题解
GNU C++ 9.3.0
GNU C 9.3.0
Java 1.8
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
登陆后才可以提交
测试输入
执行结果
2 10 100 2 0 0
请先执行代码
控制台
代码编辑器配置
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题,选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数,设置为0则不限制。
0
80
100
120