[CodeForces]-675B-Restoring Painting

B - Restoring Painting

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 675B

Appoint description:  System Crawler  (Aug 10, 2016 9:54:33 PM)

Description

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He remembers some facts about it.

• The painting is a square 3 × 3, each cell contains a single integer from 1 to n, and different cells may contain either different or equal integers. 
• The sum of integers in each of four squares 2 × 2 is equal to the sum of integers in the top left square 2 × 2. 
• Four elements a, b, c and d are known and are located as shown on the picture below. 

Help Vasya find out the number of distinct squares the satisfy all the conditions above. Note, that this number may be equal to 0, meaning Vasya remembers something wrong.

Two squares are considered to be different, if there exists a cell that contains two different integers in different squares.

Input

The first line of the input contains five integers n, a, b, c and d (1 ≤ n ≤ 100 000, 1 ≤ a, b, c, d ≤ n) — maximum possible value of an integer in the cell and four integers that Vasya remembers.

Output

Print one integer — the number of distinct valid squares.

Sample Input

Input

2 1 1 1 2

Output

2

Input

3 3 1 2 3

Output

6

Hint

Below are all the possible paintings for the first sample.  

In the second sample, only paintings displayed below satisfy all the rules.      

题目大意：就是一个3*3的方阵中，出可以填入的范围1-n，再给分别给定上左右下的数，求如何能使得其他2*2方格的和等于左上角的2*2方格的值；

题目分析：我们另A= a + b ; B = a + c ; C = b + d ; D =  c + d ; 我们的目的就是使得以上的加上剩余的方格后的值要相等即可；

所以总的方案数ans = 中间的可填数n （因为中间无论填什么都不会影响4个方阵的差值，因为都是其组成部分）* 余下3个空格的可填数即可 ； 分析可知，如果A,B,C,D的最大值减去最小值的差值都大于n的话，那就没有一种方案可以填，因为无论怎么填都不可以使其相等；==n同理 ；剩下小于n的情况，可填数为n-x (余下3个方格的可填方案）; 得解； 

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std ; 

long long Mmax(long long A ,long long B ,long long C ,long long D){
	long long t = 0  ; 
	t = max(A,B);
	t = max(t,C);
	t = max(t,D);
	return t ;  
}

long long Mmin(long long A ,long long B,long long C ,long long D){
	long long t ; 
	t = min(A,B);
	t = min(t,C);
	t = min(t,D);
	return t ; 
} 

int main()
{
	long long n ,a ,b, c, d ;
	scanf("%I64d%I64d%I64d%I64d%I64d",&n,&a,&b,&c,&d);
	//printf("n,a,b,c,d·Ö±ðÊÇ£º%I64d %I64d %I64d %I64d %I64d\n",n,a,b,c,d);
	long long A = a+b ; 
	long long B = a+c ; 
	long long C = b+d ; 
	long long D = c+d ;
		
	long long x = Mmax(A,B,C,D) - Mmin(A,B,C,D) ; 
	//cout<<"×î´ó×îСֵµÃ²îֵΪ£º"<<x<<endl ;
	long long ans = 0 ; 
	if(x>=n){
		cout<<"0"<<endl; 
	} 
	else if(x<n){
		ans = n * (n-x);
		cout<<ans<<endl ;
	}
	
	return 0 ; 
}