测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A9939. Soldier and Bananas

编程题 普及/提高-

题目描述

A soldier wants to buy $w$ bananas in the shop. He has to pay $k$ dollars for the first banana, $2k$ 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?

输入格式

The first line contains three positive integers $k,n,w$ ( $1<=k,w<=1000$ , $0<=n<=10^{9}$ ), the cost of the first banana, initial number of dollars the soldier has and number of bananas he wants.

输出格式

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$ .

输入输出样例

输入 #1
3 17 4
输出 #1
13
上一题 去做题 下一题