卖萌型选手
https://ac.nowcoder.com/acm/contest/321/G
題解:STL+預處理+數學
/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG //#define RI register int using namespace std; typedef long long ll; typedef __int128 lll; const int N=10000000; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; ll t,n,m,k,q; ll a[N]; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif int cnt=0;for(ll i=0;i*(i+1)*(2*i+1)/6<=1e18;i++){a[i]=i*(i+1)*(2*i+1)/6;cnt++;}scanf("%lld",&t);while(t--){scanf("%lld",&n);k=lower_bound(a,a+cnt,n)-a;if(a[k]!=n)--k;cout <<a[k]<< endl;}//cout << "Hello world!" << endl;return 0; }?
總結