思路:
- 题意:有一片纸,你可以对它进行向上、向下、向左、向右对折这四种操作。再将对折之后的纸片按中心十字架剪开。时问你能剪出来的纸片的期望个数为多少?
- 官方题解:
- 若a表示横向对折次数,b表示纵向对折次数,则最终纸片数为(2^a + 1)*(2^b+1)
- 大佬推公式。
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 998244353;
const int N = 2e5 + 5;
int t, n;
int qmi(int a, int k)
{
int res = 1;
while(k){
if(k & 1) res = (ll)res * a % mod;
k >>= 1;
a = (ll)a * a % mod;
}
return res;
}
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n;
int a = (qmi(2, n) + 1) % mod;
int b = 2 * qmi(3,n)%mod * qmi(qmi(2,n),mod-2) % mod;
cout<<(a+b)%mod<<endl;
}
return 0;
}