Submission #1320451

---

Source Code Expand

//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
 
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
 
ll pwr(ll base, ll p, ll mod=MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}
 
 
ll gcd(ll a, ll b){
    if(b == 0)  return a;
    return gcd(b, a%b);
}

 
 
int main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n, a, b;
    cin>>n>>a>>b;

    if(a > b){
    	cout<<"0";
    	return 0;
    }

    if(n == 1){
    	if(a == b)	cout<<"1";
    	else	cout<<"0";
    	return 0;
    }
 
 	cout<<(a+b+(n-2)*b) - (a+b+(n-2)*a) + 1;
    return 0;
}
 
 
 

Submission Info

Judge Result