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

原创 2016年05月31日 11:16:12
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;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

[CodeForces]-675B-Restoring Painting

B - Restoring Painting Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64...

Codeforces Round #353 (Div. 2)-B. Restoring Painting(数学)

B. Restoring Painting time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces Round #353 (Div. 2) B. Restoring Painting __ map or set 、思维题

自己画一个3*3的方格图, 然后标上 a, b, c, d 然后发现左上角标上x, 中间标上y,然后剩余3个空格可以表示出来。 故可以O(n)的来做 扫一遍,过程中用ans[][][][]来表示那个状...

K - *Restoring Painting

点击打开链接 Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive pai...

Codeforces #353 div.2 Infinite Sequence&Restoring Painting&Money Transfers前三题题解

题目链接: A :http://codeforces.com/problemset/problem/675/A B :http://codeforces.com/problemset/proble...

CF #278 (Div. 2) B.(暴力枚举+推导公式+数学构造)

B. Candy Boxes time limit per test 1 second memory limit per test 256 megabytes inp...

[ACM] POJ 1845 Sumdiv(求A的B次方的所有因子的和,一大堆数学公式...,可做模板)

解题思路: 题意是求A的B次方的所有因子的和。学到了一堆数学公式。。 下面知识点和思路转载于:http://blog.csdn.net/lyy289065406/article/details/664...

821B - Okabe and Banana Trees——数学公式

Think: 1题意:沿着一条线段,在这条线段下点可在线段上,找一个矩形,矩形的边分别与x轴,y轴平行,使得这个矩形的所有整数点的sum_x + sum_y,矩形可退化为一条线段或一个点 2方法:...

数学公式编辑器mathtype6.9b

  • 2017年11月09日 11:52
  • 9.8MB
  • 下载

Codefroces 429 B. Working out

Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codefroces 675 B. Restoring Painting(数学推公式)
举报原因:
原因补充:

(最多只允许输入30个字)