The link of the problem is below
Code first:
#include <iostream>
#include <cmath>
#include <deque>
using namespace std;
deque< pair<unsigned long long,unsigned long long> >ans;
int main()
{
int t; cin>>t;
while(t--)
{
ans.clear();
unsigned long long m,now=1,c=1;
cin>>m;
while(1)
{
c*=now;
unsigned long long w=pow(m,1.0/now)*pow(c,1.0/now)+1;
while(w--)
{
long double acu=1;
for(unsigned long long i=1;i<=now;i++)
{acu=(long double)acu/i; acu=(long double)acu*(w+i); }
unsigned long long hi=(unsigned long long )floor(acu+1e-8);
if(hi==m)
{
if(!((w+now)%2==0 && now==(w+now)/2)) ans.push_front(pair<unsigned long long,unsigned long long>(w+now,w+now-now));
ans.push_front(pair<unsigned long long,unsigned long long>(w+now,now));
}
if(acu<m) break;
}
if(w<=now++) break;
}
cout<<ans.size()<<endl;
for(size_t i=0;i<ans.size();i++) cout<<"("<<ans[i].first<<","<<ans[i].second<<")"<<((i==ans.size()-1)?"":" ") ;
cout<<endl;
}
return 0;
}
运用公式 C(n,k)=(n* n-1 * n-2 * … * n-k+1) / k!
思路就是枚举k ,尝试快速找到 n ;
技巧是:因为C(n,k)=C(n,n-k) 我们只关注前一个值,边界是k>(n-k+1);
用Pow函数来估算n , pow函数中不能直接m*c ,连ULL 都受不住;
因为w肯定在 n~n-k+1之间,(实际测算这个值离尾端更近),不断减小w的值,看有没有一个acu=m
最后当w+1 * w+2 * … * w+k < m 就跳出即可;
要小心 1/3*3 !=1 的陷阱 (+1e-8)
Ps:thanks for Vfleaking’s help
Link :
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=851&page=show_problem&problem=4524
文章有任何纰漏 , 或者有任何问题 , 请告知博主: QQ:812483101