每日一题A

首先应该先读懂题意,直接按题目要求做即可。 把n > =sum 的情况单列出来即可。

Description
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?


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


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


Sample Input
Input
3 17 4
Output
13


#include<stdio.h>


int main()
{
    int k, w, n;
    scanf("%d%d%d", &k,&n,&w);
    int i;
    int sum;
    for(i=1, sum = 0 ; i <= w; i++)
    {
        sum += i * k;
    }
    if(sum - n > 0)
        printf("%d\n", sum - n);
    else
        printf("0\n");
    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值