CF1080D Olya and magical square

思路：

构造。

实现：

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 ll sum[];
 int main()
 {
     int cnt = ;
     for (int i = ; i <= ; i++)
     {
         sum[i] = (sum[i - ] + (1ll << cnt));
         cnt += ;
     }
     int t;
     ll n, k;
     cin >> t;
     while (t--)
     {
         cin >> n >> k;
         if (n >= ) { cout << "YES " << n -  << endl; continue; }
         if (n == )
         {
             if (k == ) cout << "YES 0" << endl;
             else cout << "NO" << endl;
             continue;
         }
         ll minn = , d = , s1 = , s2 = ;
         bool flg = false;
         int i = n - ;
         for ( ; i >= ; i--)
         {
             minn += (1ll << s1) - ;
             s1++;
             d += ((1ll << s2) - ) * sum[i];
             s2++;
             ll maxn = minn + d;
             if (k >= minn && k <= maxn) { flg = true; break; }
         }
         if (flg) cout << "YES " << i << endl;
         else cout << "NO" << endl;
     }
     return ;
 }