牛客CSP-S提高组赛前集训营5 赛后总结

A.无形的博弈

心理题.

答案为\(2^n\),可感性理解结论的正确性.

#include<bits/stdc++.h>
#define LL long long
const LL Mod=998244353;
int n;

int main()
{
    scanf("%d",&n);
    LL Ans=1;
    for(int i=1;i<=n;i++)
        Ans=(Ans<<1)%Mod;
    printf("%lld",Ans);
    return 0;
}

B.十二桥问题

并没有做出来这道\(\text{*B}\)题,