the maximal value the total number（数论）

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.
InputThe input will consist of a series of pairs of integers A and B, separated by a space, one pair of integers per line.

OutputFor 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.
Sample Input
2 3
3 4
Sample Output
1 1
5 3
题意：求互质的a，b，求他们不能组合的最大值，和不能构造出的总和；
解题思路：
不能组合的最大值就为a，b的最小公倍数再减去a，b；
不能构造出的总和就为n=(a-1)* (b-1)/2;

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    int a,b;
    while(~scanf("%d%d" ,&a,&b))
        {
            cout<<a*b-(a+b)<<" "<<(a-1)*(b-1)/2<<endl;
        }
    return 0;
}