A. Soldier and Bananas
2015-06-02 19:58
274 查看
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
解题说明:此题是一道数学题,计算前几个找到计算公式就能够进行求解。
#include <stdio.h>
int main()
{
int k,n,w;
int temp;
scanf("%d%d%d",&k,&n,&w);
temp=(w*(w+1)*k)/2-n;
if(temp<0)
{
temp=0;
}
printf("%d\n",temp);
return 0;
}
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
3 17 4
output
13
解题说明:此题是一道数学题,计算前几个找到计算公式就能够进行求解。
#include <stdio.h>
int main()
{
int k,n,w;
int temp;
scanf("%d%d%d",&k,&n,&w);
temp=(w*(w+1)*k)/2-n;
if(temp<0)
{
temp=0;
}
printf("%d\n",temp);
return 0;
}
相关文章推荐
- Qt_5_4_1_MSVC2013_OpenGL和opencv2.10
- 使用openssl的md5库
- Linux库函数(6.2)
- PHP回调函数--call_user_func_array
- shiro框架不需要重启动态更新权限资源
- Ubuntu 14.1 配置NFS
- Can't create table 'ecdatabase.#sql-818_bc' (errno: 150)
- ajax阻塞UI线程
- linux中lvm的缩减
- 正则表达式关于多个数字匹配的问题
- fragment 里需要activity。Android-The method findViewById(int) is undefined for the type first (Fragment)
- 商业计算中Java高精度计算BigDecimal类
- Linux下Tomcat重新启动
- HDOJ贪心算法
- 安卓--数据存储
- 北京络捷斯特第三方物流信息系统技术解析(八) 作业管理-入库作业
- Palindrome Partitioning——回溯算法的又一经典
- poj 1185 状压DP
- [LeetCode]Word Ladder
- HDU 2227 Find the nondecreasing subsequences(DP)