蓝桥杯杨辉三角形【第十二届】【省赛】【A组】组合数二分法 C++

本文链接：https://blog.csdn.net/Prudento/article/details/123540601

资源限制

时间限制：1.0s 内存限制：256.0MB

#include<bits/stdc++.h>
using namespace std;
long long n;
long long C(int a,int b)
{
    long long sum=1;//计算组合数
    for(int i=a,j=1;j<=b;i--,j++)
    {
        sum=sum*i/j;
        
        if(sum>n)
        {
            return sum;
        }
        
        
    }
    return sum;
}
 
 
bool check(int k)//二分法
{
    long long l=2*k;
    long long r=max(l,n);
      while(l<r)
      {
        int mid=l+r>>1;
        
        
        if(C(mid,k)>=n)
        {
            r=mid;
        }
        else
        {
            l=mid+1;
        }
      }
      if(C(r,k)!=n)return false;
      else
      {
          cout<<(long long)((1+r)*r/2+(k+1));
          return true;
      } 
}
int main()
{
    cin>>n;
    for(int i=16;;i--)
    {
        
       if(check(i))break;
    }
    return 0;
}

参考

蓝桥杯2021年第十二届省赛-杨辉三角形_9898zy998的博客-CSDN博客_杨辉三角形蓝桥杯https://blog.csdn.net/zy98zy998/article/details/122293334?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164744568616780255235945%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=164744568616780255235945&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v1~rank_v31_ecpm-11-122293334.142%5Ev2%5Earticle_score_rank,143%5Ev4%5Econtrol&utm_term=%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92%E5%BD%A2%E3%80%90%E7%AC%AC%E5%8D%81%E4%BA%8C%E5%B1%8A%E3%80%91%E3%80%90%E7%9C%81%E8%B5%9B%E3%80%91%E3%80%90C%E7%BB%84%E3%80%91&spm=1018.2226.3001.4187