Problem:
Score : 100 points

Problem Statement

There are H rows and W columns of white square cells.

You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.

How many white cells will remain?

It can be proved that this count does not depend on what rows and columns are chosen.

Constraints

All values in input are integers.

1 \leq H, W \leq 20

1 \leq h \leq H

1 \leq w \leq W

Input

Input is given from Standard Input in the following format:

H W
h w

Output

Print the number of white cells that will remain.

Sample Input 1

3 2
2 1

Sample Output 1

1

There are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.

Sample Input 2

5 5
2 3

Sample Output 2

6

Sample Input 3

2 4
2 4

Sample Output 3

0

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int compare_int(const void *a, const void *b)
{
    return *(int*)a - *(int*)b;
//    return *(long long*)a - *(long long*)b;
}
//  qsort(A, b, sizeof(int), compare_int);

int main()
{
 
//  int a, b, c, d, e, X, Y;
  int a, b;
  //  double  c;
  long long  A[1000001]={};
  long long  B[1000001]={};
//  int  B[100003]={};
  int  L[1003]={};

  int  flag[10000003]={};

//  long long  a, b, c, d, X, Y;
  long long  c, d, X, Y;
char s[100001]={};
  long long JPY;
  double BTC;
char t[100001]={};
//  int N, M;
//  int A[1000000001]={};
//  long long  C[101]={};
  int i,j,k;
//  int flag=0;
  int tmp=0;
//  int min=1000000;
  long long min=100000000001;
  int len=0;
  int cnt=0;
  int cnt0=0;
  int cnt1=0;
  int num=0;
//  double ans=0.0;
  long long ans=0;
  int max=0;
  int sum=0;
//  char alp[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};

  //  a=0;
//  scanf("%lld %lld", &a, &b);
  scanf("%d%d", &a,&b);
  for(i=0;i<a;i++){
    scanf("%lld%lld", &A[i],&B[i]);
  }
  while(b+1>cnt){
    min=100000000001;
    num=0;
    for(i=0;i<a;i++){
      //min
      if((min>A[i]) && (flag[i]==0)){
        min=A[i];
        num=i;
      }
    }
    flag[num]=1;
    if(b<(cnt+B[num])){
      for(i=0;i<(B[num]+1);i++){
//        printf("cnt%d  ", cnt);

        if(b<=cnt){
          ans=ans+(A[num]*tmp);
          printf("%lld\n", ans);
          return 0;
        }
        else {
          cnt++;
          tmp++;
        }
      }
    }
    else{
      ans=ans+(A[num]*B[num]);
      cnt=cnt+B[num];
//      printf("%lld num%d\n", ans, num);
    }
//    printf("cnt%d  ", cnt);
  }
  



  //    if(max < cnt - max)  printf("Yes\n");
//    else  
  
return 0;
}