CF675B.Restoring Painting
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.
输入格式
The first line of the input contains five integers n , a , b , c and d ( 1<=n<=100000 , 1<=a,b,c,d<=n ) — maximum possible value of an integer in the cell and four integers that Vasya remembers.
输出格式
Print one integer — the number of distinct valid squares.
输入输出样例
输入#1
2 1 1 1 2
输出#1
2
输入#2
3 3 1 2 3
输出#2
6
说明/提示
Below are all the possible paintings for the first sample.
In the second sample, only paintings displayed below satisfy all the rules.