Submission #3749400
Source Code Expand
#include <cstdio> #include <vector> #include <algorithm> #include <iostream> #include <cstring> using namespace std ; typedef long long ll ; # define rep (i , n ) for ( int i =0; i < n ; i++) # define _sort(arg) sort(begin(arg), end(arg)) int main() { cin.tie(NULL); ios::sync_with_stdio(false); int N, A, B; cin >> N >> A >> B; if (A > B) { cout << 0 << endl; return 0; } if ((N == 1) && (A != B)) { cout << 0 << endl; return 0; } int min = A * (N - 1) + B; int max = A + B * (N-1); cout << max - min + 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A+...+B Problem |
User | yly |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 595 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | WA | 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 |