当前位置:网站首页>Noi / 1.5 37: mercenaries
Noi / 1.5 37: mercenaries
2022-07-05 15:35:00 【Graylan_】
describe
The maximum strength of mercenaries is M, The initial physical strength value is 0、 The combat effectiveness is N、 Have X An energy element .
When a mercenary's stamina is just M when , Before you can participate in a M Days of combat , At the end of the battle period, the physical strength will be 0. In the same combat period , Mercenaries fight every continuous battle n God , Combat effectiveness will rise 1 spot ,n For the combat effectiveness at the beginning of the current combat period .
After a combat period , Mercenaries need to use several energy elements to maximize their physical strength M, To participate in the next combat period . The physical strength restored by each energy element does not exceed the current combat effectiveness . Each energy element can only be used once .
Excuse me, : What is the maximum combat effectiveness of mercenaries .
Input
A line consists of three integers M、N、X, Two adjacent integers are separated by a single space .M、N、X No more than 10000 The positive integer .
Output
Output an integer , For the maximum combat effectiveness of mercenaries .
The sample input
5 2 10
Sample output
6
Problem analysis :
The combat effectiveness of soldiers is continuously increased through circulation , Set an intermediate value t Indicates that after the cycle ends , The greatest combat power of soldiers , When x<t,
namely x-t<0, The capability element is 0, Out of the loop , Finally, keep using n Record the change of value , In order to obtain the maximum combat power
Source code :
#include <iostream>
using namespace std;
int main()
{
int m,n,x,t;
cin>>m>>n>>x;
while(x>0)
{
t=m/n;
if(m%n!=0)
t++;
if(x<t)
break;
x-=t;
t=m/n;
n+=t;
}
cout<<n;
return 0;
}边栏推荐
- Transfer the idea of "Zhongtai" to the code
- Garbage collection mechanism of PHP (theoretical questions of PHP interview)
- The difference between SQL Server char nchar varchar and nvarchar
- mapper. Comments in XML files
- Database learning - Database Security
- P1451 calculate the number of cells / 1329: [example 8.2] cells
- Surpass palm! Peking University Master proposed diverse to comprehensively refresh the NLP reasoning ranking
- 亿咖通科技通过ISO27001与ISO21434安全管理体系认证
- Common MySQL interview questions (1) (written MySQL interview questions)
- Detailed explanation of C language branch statements
猜你喜欢

Surpass palm! Peking University Master proposed diverse to comprehensively refresh the NLP reasoning ranking

做研究无人咨询、与学生不交心,UNC助理教授两年教职挣扎史

MySQL之CRUD

Bugku cyberpunk

CSRF, XSS science popularization and defense

把 ”中台“ 的思想迁移到代码中去

Summary of the second lesson

Advanced level of static and extern

基于OpenHarmony的智能金属探测器

I spring and autumn blasting-2
随机推荐
Cartoon: what are the attributes of a good programmer?
Huiyuan, 30, is going to have a new owner
Explanation report of the explosion
Common MySQL interview questions
一文搞定vscode编写go程序
Garbage collection mechanism of PHP (theoretical questions of PHP interview)
【 note 】 résoudre l'erreur de code IDE golang
【簡記】解决IDE golang 代碼飄紅報錯
[brief notes] solve the problem of IDE golang code red and error reporting
Definition of episodic and batch
Maximum common subsequence
Bugku's steganography
Temporary cramming before DFS examination
Database learning - Database Security
sql server学习笔记
String modification problem solving Report
Magic methods and usage in PHP (PHP interview theory questions)
JS knowledge points-01
lvgl 显示图片示例
Calculate weight and comprehensive score by R entropy weight method