DZY Loves Partition
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1293 Accepted Submission(s): 481
Problem Description
DZY loves partitioning numbers. He wants to know whether it is possible to partition
n
into the sum of exactly
k
distinct positive integers.
After some thinking he finds this problem is Too Simple. So he decides to maximize the product of these k numbers. Can you help him?
The answer may be large. Please output it modulo 109+7 .
After some thinking he finds this problem is Too Simple. So he decides to maximize the product of these k numbers. Can you help him?
The answer may be large. Please output it modulo 109+7 .
Input
First line contains
t
denoting the number of testcases.
t testcases follow. Each testcase contains two positive integers n,k in a line.
( 1≤t≤50,2≤n,k≤109 )
t testcases follow. Each testcase contains two positive integers n,k in a line.
( 1≤t≤50,2≤n,k≤109 )
Output
For each testcase, if such partition does not exist, please output
−1
. Otherwise output the maximum product mudulo
109+7
.
Sample Input
4 3 4 3 2 9 3 666666 2
Sample Output
-1 2 24 110888111HintIn 1st testcase, there is no valid partition. In 2nd testcase, the partition is $3=1+2$. Answer is $1\times 2 = 2$. In 3rd testcase, the partition is $9=2+3+4$. Answer is $2\times 3 \times 4 = 24$. Note that $9=3+3+3$ is not a valid partition, because it has repetition. In 4th testcase, the partition is $666666=333332+333334$. Answer is $333332\times 333334= 111110888888$. Remember to output it mudulo $10^9 + 7$, which is $110888111$.
Source
Recommend
我就不多说了,尽可能靠近平均数才会最大, 可以用基本不等式证明。
:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
__int64 i,j,k,l,m,n,p,ans,a[110000];
int main()
{
scanf("%I64d",&p);
while(p--)
{
scanf("%I64d%I64d",&n,&m);
if(m*(m+1)>2*n)
{
printf("-1\n");
continue;
}
l=(n-m*(m-1)/2)/m;
for(i=1;i<=m;i++)
a[i]=l+i-1;
k=(n-m*(m-1)/2)%m;
for(i=0;i<k;i++)
a[m-i]++;
ans=1;
for(i=1;i<=m;i++)
{
ans*=a[i];
ans%=1000000007;
}
printf("%I64d\n",ans);
}
}