hdu 2662 Coin

Problem Description

Moon has many coins, but only contains two value types which is 5 cents and 7 cents, Some day he find that he can get any value which greater than 23 cents using some of his coins. For instance, he can get 24 cents using two 5 cents coins and two 7 cents coins, he can get 25 cents using five 5 cents coins, he can get 26 cents using one 5 cents coins and three 7 cents coins and so on.

Now, give you many coins which just contains two value types just like Moon, and the two value types identified by two different prime number i and j. Can you caculate the integer n that any value greater than n can be created by some of the given coins.

Input

The first line contains an integer T, indicates the number of test cases.
For each test case, there are two different prime i and j separated by a single space.(2<=i<=1000000, 2<=j<=1000000)

Output

For each test case, output one line contains the number n adapt the problem description.

 

Sample Input

1 5 7

Sample Output

23

 

题意：给你两个素数，求最小的一个数n，满足n之后都可以由这两个素数组合出来。

解题思路：数学思维不行，让我想了一天没想出来，明明是做状态压缩dp的，怎么做起了数学题

 

设所求为n，那么n+a、n+b可以用a、b线性表出，而n不可。
所以 n+a=x1*a+y1*b，n+b=x2*a+y2*b
所以 n=(x1-1)*a+y1*b n=x2*a+(y2-1)*b
因为n不能被线性表出，所以x1=0，y2=0
所以 n+a=y1*b，n+b=x2*a
所以 n+a=y1*b，n+a=(x2+1)*a-b
所以 (x2+1)*a-b是b的倍数
因为a、b互质，所以(x2+1)是b的倍数
因为求最小的n，所以选最小的x2值，所以取(x2+1)为b
所以 n+a=b*a-b，n=a*b-a-b

 

/*************************************************************************
	> File Name: hdu2662.cpp
	> Author: baozi
	> Mail: 337025502@qq.com
	> Last modified: 2018年07月27日 星期五 17时01分
	> status:AC 
 ************************************************************************/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll long long
int t;
ll n,m;
int main(){
	int i,j;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		ll ans=n*m-n-m;
		printf("%lld\n",ans);
	}
	return 0;
}