Submission #1315648

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
//#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
ll n, a, b;
ll sum1=0, sum2=0;
int main() {
	cin >> n >> a >> b;
	b -= a;
	a = 0;
	if (n < 2) {
		if (a != b) {
			cout << 0 << endl;
			return 0;
		}
	}
	if (a > b) {
		cout << 0 << endl;
		return 0;
	}
	sum1 = b;
	sum2 = (n - 1)*b;
	cout << sum2 - sum1 + 1 << endl;
	return 0;
}

Submission Info

Judge Result