Submission #1771849

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <climits>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <bitset>
#include <string>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <deque>
#include <ctime>
#define s(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define ss(n) scanf("%s",n)
#define s2(a,b) scanf("%d%d",&a,&b)
#define SET(p)      memset(p,-1,sizeof(p))
#define CLR(p)      memset(p,0,sizeof(p))
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LL long long
#define ULL unsigned long long
#define R freopen("in","r",stdin)
#define W freopen("out","w",stdout)
using namespace std;

int main() {
	int n,a,b;
	cin>>n>>a>>b;
	if(a>b){
		puts("0");
	} else {
		if(n==1) {
			if(a==b){
				puts("1");
			} else {
				puts("0");
			}
		} else if(n==2) {
			puts("1");
		} else {
			long long ans = 1LL*(b-a)*(n-2) + 1;
			printf("%lld\n", ans);
		}
	}
}

Submission Info

Judge Result