Submission #11638828
Source Code Expand
#include <bits/stdc++.h> #define rep(i, n) for (ll i=0;i<(n); i++) template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } #define ALL(x) (x).begin(),(x).end() #define Sort(a) sort(ALL(a)) #define Rev(a) reverse(ALL(a)) using namespace std; //using ll=long long; typedef long long ll; typedef long double ld; typedef pair<ll, ll> pi; const long double PI=3.14159265358979323846; template<class T> bool contain(const std::string& s, const T& v) { return s.find(v) != std::string::npos; } int main(){ ll n,a,b; cin>>n>>a>>b; ll ans=0; if(a<=b && n>1){ ans = (n-2)*(b-a)+1; } if(n==1 && a==b) ans =1; cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - A+...+B Problem |
User | Mngshmok |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 804 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 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 | 3 ms | 384 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 |