Submission #3231104
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <complex> #include <stack> #include <queue> #include <map> #include <set> #include <bitset> #include <chrono> #include <random> #include <unordered_map> #include <cassert> #pragma GCC optimize("O3") #pragma comment(linker, "STACK:36777216") using namespace std; using i64 = int64_t; constexpr i64 MOD = 1e9 + 7; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); using vi = vector<i64>; using vvi = vector<vi>; using vvvi = vector<vvi>; using ii = pair<i64, i64>; int main() { i64 n, a, b; cin >> n >> a >> b; if (n == 1) { if (a != b) { cout << 0 << endl; return 0; } } if (a > b) { cout << 0 << endl; return 0; } cout << 1 + (b - a) * (n - 2) << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - A+...+B Problem |
User | xuzijian629 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 896 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 |