一个与公约数的变形 牛客网多校联赛第五场G题

Give two positive integer c, n. You need to find a pair of integer (a,b) satisfy 1<=a,b<=n and the greatest common division of a and b is c.And you need to maximize the product of a and b

输入描述:

The first line has two positive integer c,n

输出描述:

Output the maximum product of a and b.

If there are no such a and b, just output -1

 

备注:

1<=c,n<=10^9

示例1

输入

2 4

输出

8

说明

a=2,b=4

这个题这要找对方法就好了，首先输入出，完了由n/c来判断有几个这样的数，如果大一2的话，去最后的两个，如果=1就是平方，否则输出-1；

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>

using namespace std;
typedef long long ll;
const ll maxn=1e7+10;
ll c,n;
int main()
{
	ios::sync_with_stdio(false);
	cin>>c>>n;
	ll a=n/c;
	if(a==1)cout<<c*c*a*a<<endl;
	else if(a>=2)cout<<c*c*a*(a-1)<<endl;
	else cout<<-1<<endl;
 	return 0;
}

加油吧少年。