一下数据卡 $O(2^n)$ 的dfs，就是用 $30$ 个 $1$ 让 dfs 搜完所有状态，导致 TLE。

100
30
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

TLE 题解名单：（使用洛谷 ide 测试）

• https://www.luogu.com.cn/blog/user1326/solution-p1049
• https://www.luogu.com.cn/blog/lrj124/solution-p1049
• https://www.luogu.com.cn/blog/woeeeeee/solution-p1049
• https://33726.blog.luogu.org/solution-p1049
• https://www.luogu.com.cn/blog/shrshrshr/solution-p1049
• https://www.luogu.com.cn/blog/LaoJun-22/solution-p1049
• https://www.luogu.com.cn/blog/Adis-FireDevil/p1049-zhuang-xiang-wen-ti-2382019-post
• https://www.luogu.com.cn/blog/kub-inst/solution-p1049
• https://www.luogu.com.cn/blog/Taurus-1965212135/solution-p1049
• https://www.luogu.com.cn/blog/wangxiangyu/solution-p1049
• https://www.luogu.com.cn/blog/emm/solution-p1049
• https://www.luogu.com.cn/blog/Star-Wing/solution-p1049