Submission #11242609


Source Code Expand

#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod= 1e+9+7;

int main() {
    ll N,A,B; cin>>N>>A>>B;
    if(A>B){
        cout<<0<<endl;
        return 0;
    }
    ll mn=(N-1)*A+B;
    ll mx=(N-1)*B+A;
    if(mx>mn){
    cout<<mx-mn+1<<endl;
    }
    else if(mn==mx){
        cout<<1<<endl;
    }
    else cout<<0<<endl;
}

Submission Info

Submission Time
Task A - A+...+B Problem
User pampam
Language C++14 (GCC 5.4.1)
Score 200
Code Size 463 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 12
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