Codefroces 675 B. Restoring Painting(数学推公式)

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

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

X1

a

X2

b

X3

c

X4

d

X6

x1+b=x2+c;

x4+b=x5+c;

x1+a=x4+d;

x2+a=x5+d;

与x3的值无关,所以x3可以从1取到n,x1,x2,x4,x5的关系可知

#include<stdio.h>
int main()
{
int n,a,b,c,d;
long long x1,x2,x3,x4,x5;
long long sum;
while(~scanf("%d",&n))
{
scanf("%d%d%d%d",&a,&b,&c,&d);
sum=0;
for(x1=1;x1<=n;x1++)
{
x2=x1+b-c;
x4=x1+a-d;
x5=x2+a-d;
if(x2>=1&&x2<=n&&x4>=1&&x4<=n&&x5>=1&&x5<=n)
sum++;
}
printf("%lld\n",n*sum);
}
return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/z2664836046/article/details/51544096
上一篇codeforces 651B Beautiful Paintings(贪心)
下一篇杭电2087剪花布条
想对作者说点什么? 我来说一句

用maple来编程推导公式的资料

2011年03月06日 344KB 下载

没有更多推荐了,返回首页

关闭
关闭