Hdu 1792 A New Change Problem 结论

 

Problem Description

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.

 

 

Input

The input will consist of a series of pairs of integers A and B, separated by a space, one pair of integers per line.

 

 

Output

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.

 

 

Sample Input

2 3

3 4

 

 

Sample Output

1 1

5 3

题意：
求两个互质数的最大不能组成的数和不能组成的数的个数....

网上找的公式.....

最大不能组成的数为a*b-a-b;

不能组成的数为(a-1)*(b-1)/2;

代码如下：
 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int a,b;
int main()
{
    while (scanf("%d%d",&a,&b)!=EOF)
    {
        printf("%d %d\n",a*b-a-b,(a-1)*(b-1)/2);
    }
    return 0;
}