Submission #1309996
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <cstring> #include <sstream> #include <map> #include <set> #include <cmath> #include <queue> #include <stack> #include <list> #include <numeric> #include <bitset> #include <ext/algorithm> #include <ext/numeric> #define ffor(_a,_f,_t) for(int _a=(_f),__t=(_t);_a<__t;_a++) #define all(_v) (_v).begin() , (_v).end() #define sz size() #define pb push_back #define SET(__set, val) memset(__set, val, sizeof(__set)) #define FOR(__i, __n) ffor (__i, 0, __n) typedef long long LL; using namespace std; int main() { LL N, A, B; cin >> N >> A >> B; if ((N == 1 && A != B) || A > B) { cout << 0 << endl; return 0; } LL mmin = (N - 1) * A + B, mmax = A + (N - 1) * B; cout << mmax - mmin + 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A+...+B Problem |
User | boba5551 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 833 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 |