周练cf G - Restoring Painting 【数学规律】

最新推荐文章于 2017-07-24 21:27:57 发布

阿.荣.

最新推荐文章于 2017-07-24 21:27:57 发布

阅读量632

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/bmicnj/article/details/51534171

版权

数学专栏收录该内容

67 篇文章 0 订阅

订阅专栏

这是一篇关于数学和规律的挑战，描述了Vasya如何根据记忆中的一些线索来恢复一幅3x3的方形画作。画作每个单元格包含1到n的整数，四个2x2的子区域的数字之和都与左上角2x2区域的和相等。已知四个特定位置的数字，目标是找出满足所有条件的不同平方块的数量。输入包括n和四个特定数字，输出为满足条件的平方块数量。

摘要由CSDN通过智能技术生成

G - Restoring Painting

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

Submit Status

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 a, b, c and d are known and are located as shown on the picture below.

$\text{[math]}$

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 n, a, b, c and d (1 ≤ n ≤ 100 000, 1 ≤ 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

Input

3 3 1 2 3

Output

题意：这题算是个规律题，已知3*3方格中的a,b,c,d,每2*2的方格的和都相等，给出N，表示每个小方格的点的范围，问有多少符合题意的填缺方法。从左到右，从上到下空缺处记作e,f,g,h,i。

可以推出，g可以为1-N; e+b=f+c; e+a=h+d; e+a+b=c+d+i;

枚举e:1-N,计算f,h,i,是否在1-N内，最后乘N.

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n,a,b,c,d,e,f,h,i;
    long long ans;//1<=n<=100 000 ans可能超int 
    while(~scanf("%d",&n))
    {
        ans=0;
        scanf("%d%d%d%d",&a,&b,&c,&d);
        for(e=1;e<=n;e++)
        {
            f=e+b-c;
            h=e+a-d;
            i=e+a+b-c-d;
            if((f>=1&&f<=n)&&(h>=1&&h<=n)&&(i>=1&&i<=n))
                ans++;
            else
                continue;
        }
        ans*=n;
        printf("%lld\n",ans);
    }
    return 0;
}