欧拉计划—45th

题目：

代码如下：

#include <stdio.h>
//三个递推公式  //因为n 的取值范围大于了 int n 最大值，故采用ll
long long Triangle(long long n){
  return n * (n + 1) / 2;
}
 
long long Pentagonal(long long n) {
  return n * (3 * n - 1) / 2;

}

long long Hexagonal(long long n) {
  return n * (2 * n - 1);
}
/*函数写法*/
long long binary_search(long long(*num)(long long), long long n, long long x) {   //使用函数指针
  long long head = 0, tail = n-1, mid;
  while(head <= tail) {
    mid = (head + tail) / 2;
    if (num(mid) == x) return mid;     //num[mid] 改为函数形式 num(mid)
    if (num(mid) < x) head = mid + 1;
    else tail = mid - 1;
  }
  return -1;
}


int main()	
{
  int n = 285;
  while(1){
    n++;
    long long val = Triangle(n);
    if(binary_search(Pentagonal,val, val) == -1) continue;
    if(binary_search(Hexagonal, val, val) == -1) continue;
    printf("%lld\n",val);
    break;
  }
}

/*为什么参数列表用两个val ： binary_search(Pentagonal,val, val)
因为值在五边形中查找，必然小于它的项数，故字节用两个val
*/