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
Submission Time | |
---|---|
Task | A - A+...+B Problem |
User | satyaki3794 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 835 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |