CF546A.Soldier and Bananas
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
A soldier wants to buy w bananas in the shop. He has to pay k dollars for the first banana, 2_k_ dollars for the second one and so on (in other words, he has to pay i·k dollars for the i-th banana).
He has n dollars. How many dollars does he have to borrow from his friend soldier to buy w bananas?
一名士兵想要在商店购买 w 根香蕉。他购买第 1 根香蕉需支付 k 美元,第 2 根需支付 2k 美元,依此类推(即购买第 i 根香蕉需支付 i⋅k 美元)。
他目前有 n 美元。为了买下 w 根香蕉,他需要向战友借多少美元?
输入格式
The first line contains three positive integers k, n, w (1 ≤ k, w ≤ 1000, 0 ≤ n ≤ 109), the cost of the first banana, initial number of dollars the soldier has and number of bananas he wants.
第一行包含三个正整数 k、n、w(1≤k,w≤1000,0≤n≤109),分别表示第一个香蕉的价格、士兵最初拥有的美元数以及他想买的香蕉数量。
输出格式
Output one integer — the amount of dollars that the soldier must borrow from his friend. If he doesn't have to borrow money, output 0.
输出一个整数——士兵必须向朋友借的钱数(单位:美元)。如果他不需要借钱,则输出 0。
输入输出样例
输入#1
3 17 4
输出#1
13
输入解题思路,AI测评打分。不知道怎么写?