CodeForces675BRestoring Painting(数学规律计算)

探讨一个数学问题,即如何填充一个3x3的九宫格,使得每个2x2子矩阵的元素之和相等,已知四个边角元素的值及每个单元格的最大可能值。

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 abc 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 nabc and d (1 ≤ n ≤ 100 0001 ≤ 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
题意:给你一个九宫格和其中位于上下左右的四个数还有每个格中的最大值。要求填空使所有的2x2格子的总和等于左上角2x2格子的总和。
思路:一共需要填五个数,观察可以发现左上角和左下角2x2格子有两个公共值。
x1 a x2
b  x3 c
x4 d x5
既x1+a=x4+d;同理,x1+b=x2+c,x2+a=x5+d;只要知道一个数就可以知道除了中间的数外所有的数。这时候只要一个for循环使x1从1到n,判断x2,x4,x5是否符合题意就行。算出sum后要*n,因为中间可以有n种数。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值