B - Triangle Counting

https://vjudge.net/contest/242717#problem/B

Master Mind KongMing gave Fei Zhang a secrete master plan stashed in a pocket. The plan instructs how to deploy soldiers on the four corners of the city wall. Unfortunately, when Fei opened the pocket he found there are only four numbers written in dots on a piece of sheet. The numbers form 2×2 matrix, but Fei didn't know the correct direction to hold the sheet. What a pity!

Given two secrete master plans. The first one is the master's original plan. The second one is the plan opened by Fei. As KongMing had many pockets to hand out, he might give Fei the wrong pocket. Determine if Fei receives the right pocket.

Input

The first line of the input gives the number of test cases, T(1≤T≤104). T test cases follow. Each test case contains 4 lines. Each line contains two integers ai0 and ai1 (1≤ai0,ai1≤100). The first two lines stands for the original plan, the 3rd and 4th line stands for the plan Fei opened.

 

 

#include<stdio.h>
#include<iostream>
using namespace std;
#define mx 1000030
long long a[mx];
int main()
{
    int n;
    a[1]=a[2]=a[3]=0;
    a[4]=1;
    for(long long  i=5;i<mx;i++)///这里i为什么非要用long long 格式？？？int不行？？
    {
        a[i]=a[i-1]+((i-1)*(i-2)/2-(i-1)/2)/2;
    }
    while(1)
    {
        scanf("%d",&n);
        if(n<3)
        {
            break;
        }
        printf("%lld\n",a[n]);
    }
    return 0;

}