Submission #1311245


Source Code Expand

#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;

LL N, A, B;
LL ans;

int main()
{
	in >> N >> A >> B;
	if (A > B)
	{
		out << 0 << std::endl;
		return 0;
	}
	if (N == 1 && A != B)
	{
		out << 0 << std::endl;
		return 0;
	}
	if (N == 1)
	{
		out << 1 << std::endl;
		return 0;
	}
	N -= 2;
	ans = (B - A)*(B - A)  + 1 + 2 * (N - 2);
	out << ans << std::endl;
	return 0;
}

Submission Info

Submission Time
Task A - A+...+B Problem
User Bwambocos
Language C++14 (GCC 5.4.1)
Score 0
Code Size 532 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

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