AtCoder Grand Contest 015（Ａ A - A+...+B Problem）

Problem Statement

Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?

Constraints

• 1≤N,A,B≤10⁹
• A and B are integers.

---

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the number of the different possible sums.

---

Sample Input 1

Copy

4 4 6

Sample Output 1

Copy

5

There are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.

 

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 
 5 int main(){
 6     ll n, a, b;
 7     cin >> n >> a >> b;
 8     if(a > b || (a < b && n == 1)){
 9         cout << 0 << endl;
10     }else if(a == b || (a < b && n == 2)){
11         cout << 1 << endl;
12     }else if(a < b && n >= 2){
13         cout << (n-1)*b+a-(n-1)*a-b+1<<endl;
14     }
15     return 0;
16 }

 

转载于:https://www.cnblogs.com/xingkongyihao/p/6915139.html