Submission #1310275
Source Code Expand
#include<bits/stdc++.h> #define FOR(i, a, b) for(int(i)=(a);(i)<(b);(i)++) #define REP(i, n) FOR((i), 0, (n)) #define RFOR(i, b, a) for(int(i)=(b); (i)>=(a); (i)--) #define RREP(i, n) FOR((i), (n), 0) #define pb push_back #define mp make_pair using namespace std; const int INF=INT_MAX/4; const int MOD=1000000007; const double EPS=1e-14; const bool debug_flag=true; void debug(string str){ if(debug_flag){ cout<<str<<endl; } } void debugs(string str){ if(debug_flag){ cout<<str; } } int main(int argc, char* argv[]){ cin.tie(0); ios::sync_with_stdio(0); cout.precision(10); long N, A, B; cin>>N>>A>>B; if(A>B){ cout<<0<<endl; }else if(N==1 && A!=B){ cout<<0<<endl; }else if(N<=2){ cout<<1<<endl; }else{ cout<<A+(N-1)*B-(B+(N-1)*A)+1<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A+...+B Problem |
User | tata |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 846 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 |