Submission #1309895


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
const int MaxN = 1e5;
typedef long long LL;
using namespace std;
LL n , a , b;
int main()
{
	while(~scanf("%lld%lld%lld" , &n , &a , &b)){
		LL ans = (n - 2) * b - (n - 2) * a;
		printf("%lld\n" , max(0LL , ans + 1));
	}
}

Submission Info

Submission Time
Task A - A+...+B Problem
User YJH143
Language C++14 (GCC 5.4.1)
Score 200
Code Size 311 Byte
Status AC
Exec Time 1 ms
Memory 128 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 128 KB
02.txt AC 0 ms 128 KB
03.txt AC 0 ms 128 KB
04.txt AC 0 ms 128 KB
05.txt AC 0 ms 128 KB
06.txt AC 0 ms 128 KB
07.txt AC 0 ms 128 KB
08.txt AC 0 ms 128 KB
s1.txt AC 0 ms 128 KB
s2.txt AC 0 ms 128 KB
s3.txt AC 0 ms 128 KB
s4.txt AC 0 ms 128 KB