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 Round #353 (Div. 2)-B. Restoring Painting(数学)

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

K - *Restoring Painting

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

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

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

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was sto...

[CodeForces]-675B-Restoring Painting

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

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...

Codeforces 382 B. Number Busters(数论推公式)

B. Number Busters 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[][][][]来表示那个状...

poj3244(数学公式推导)

链接:点击打开链接 题意:给出n个三元组(nmin(xi-xj,yi-yj,zi-zj),求任意两点的D的和 代码: #include #include #include #include...

HDU 5073 Galaxy (2014 ACM/ICPC 鞍山赛区现场赛D题)

【题目链接】:click here~~ 【题目大意】: Problem Description Good news for us: to release the financial pressu...

数学推公式——较难——Codeforces Round #187 (Div. 2)

题目链接: http://codeforces.com/contest/315/problem/C C. Sereja and Contest time limi...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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