题目大意:有这样一些数 :11, 33, 66, 1010, 1515, 2121, 2828, 3636, 4545,公式是
ti=12i(i+1)
给你一个n,问满足
tr
为完全平方数并且r大于等于n的最小的r是多少
题目思路:打表,筛一下满足的r有哪些,我们可以想到,要满足 ti 是个完全平方数,那么奇数是个完全平方数,偶数/2也是个完全平方数,那么我们去用完全平方数反解 ti 和 i <script type="math/tex" id="MathJax-Element-265">i</script>就好了,具体可以看init里面的打表代码,筛完之后直接找就好了
#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll num[30] = {
1
,8
,49
,288
,1681
,9800
,57121
,332928
,1940449
,11309768
,65918161
,384199200
,2239277041
,13051463048
,76069501249
,443365544448
,2584123765441
,15061377048200
,87784138523761
,511643454094368
,2982076586042449
,17380816062160328
,101302819786919521
,590436102659356800
,3441313796169221281
};
void init(){
int cnt = 1;
for(ll i = 1;i <= 3*1e9;i++){
ll n = i*i-1;
if(n%2 == 0) n/=2;
ll num = sqrt(1.0*n);
if(num*num == n){
cout<<cnt<<" ";
cnt++;
cout<<" :1: "<<i*i-1<<endl;
}
n = i*i+1;
if(n%2 == 0) n/=2;
num = sqrt(1.0*n);
if(num*num == n){
cout<<cnt<<" ";
cnt++;
cout<<" :2: "<<i*i<<endl;
}
}
}
int main(){
ll T,k;
scanf("%lld",&T);
for(ll Case = 1;Case <= T;Case++){
scanf("%lld",&k);
for(ll i = 0;i <= 26;i++){
if(num[i] >= k){ printf("Case #%lld: %lld\n",Case,num[i]);break;}
}
}
return 0;
}