hdu 1792 A New Change Problem

题目描述
Now given two kinds of coins A and B,which satisfy that GCD(A,B)=1.Here you can assume that there are enough coins for both kinds.Please calculate the maximal value that you cannot pay and the total number that you cannot pay.
（译文：已知两种硬币A和B，满足GCD(A,B)=1。这里你可以假设两种硬币都有足够的硬币。请计算您无法支付的最大值和您无法支付的总数）
输入
The input will consist of a series of pairs of integers A and B, separated by a space, one pair of integers per line.
（译文：输入将由一系列的整数对a和B组成，由一个空格分隔，每行一对整数。）
输出
For each pair of input integers A and B you should output the the maximal value that you cannot pay and the total number that you cannot pay, and with one line of output for each line in input.
（译文：对于每对输入整数A和B，应该输出不能支付的最大值和不能支付的总数，并且输入中的每一行都有一行输出。）
样例：
输入：
2 3
3 4
输出：
1 1
5 3

题解：（找规律）
代码：

#include<stdio.h>
int main()
{
    int A,B;
    while(scanf("%d%d",&A,&B)!=EOF)
    {
        int m=A*B-A-B;
        int n=(A-1)*(B-1)/2;
        printf("%d %d\n",m,n);
    }
    return 0;
}