A. Soldier and Bananas
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.
Examples
input
3 17 4
output
13
题目大意:士兵想买w个bananas,口袋里已有钱数n,按照第一个banana k,第二个banana 2k ....的价格,求其需要找友人借多少钱。
解题思路:水题,不需要思路。
以下为解题代码(java实现)
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner = new Scanner(System.in);
int k = scanner.nextInt();
int n = scanner.nextInt();
int w = scanner.nextInt();
int sum = 0;
for(int i = 1;i <= w;i++){
sum += i*k;
}
if(sum > n){
System.out.println(sum-n);
}else{
System.out.println(0);
}
scanner.close();
}
}