Submission #11425252

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(ll i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;

int main(){
  ll n,a,b;
  cin >> n >> a >> b;
  if(a > b || n == 1){
    cout << 0 << endl;
    return 0;
  }
  else{
    cout << (b-a)*(n-2) + 1 << endl;
  }  
  return 0;
}

Submission Info

Judge Result