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;
}

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

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

数学推公式 + 暴力枚举
  • qingshui23
  • qingshui23
  • 2016年05月28日 17:44
  • 2899

Codefroces 675 B. Restoring Painting

7.8.D 数学公式推导验证
  • qq_26071477
  • qq_26071477
  • 2016年07月08日 23:22
  • 241

B. Restoring Painting

time limit per test 1 second memory limit per test 256 megabytes input standard input ...
  • jj12345jj198999
  • jj12345jj198999
  • 2017年01月19日 21:54
  • 192

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

B. Restoring Painting time limit per test 1 second memory limit per test 256 megabytes ...
  • zsc2014030403015
  • zsc2014030403015
  • 2016年05月17日 10:29
  • 242

Restoring Painting

Restoring Painting CodeForces - 675B Vasya works as a watchman in the gallery. Unfortunately, on...
  • a311609000531
  • a311609000531
  • 2017年09月05日 20:03
  • 30

【CodeForces】675B - Restoring Painting(数学推导)

题目链接:点击打开题目 B. Restoring Painting time limit per test 1 second memory limit per test...
  • wyg1997
  • wyg1997
  • 2016年05月26日 20:38
  • 333

【CodeForces】[675B]Restoring Painting

起初没看懂为何左下角与右上角的块被限制 直到发现 指的是所有的2×2都要等于左上角的2×2在九宫格 x a x b x c x d x 中间的一个是四个2×2共有部分不需要考虑 所以可以...
  • u011493189
  • u011493189
  • 2016年05月30日 03:22
  • 164

K - *Restoring Painting(思维)

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was sto...
  • l18339702017
  • l18339702017
  • 2017年07月21日 17:08
  • 131

CodeForces 675B Restoring Painting

G - Restoring Painting Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64...
  • yao1373446012
  • yao1373446012
  • 2016年05月27日 20:00
  • 201

【Codeforces】675B - Restoring Painting

点击打开题目 B. Restoring Painting time limit per test 1 second memory limit per test 256 megabyt...
  • Bear1998
  • Bear1998
  • 2016年05月28日 18:34
  • 268
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codefroces 675 B. Restoring Painting(数学推公式)
举报原因:
原因补充:

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