Lucy is playing a game named Celltexttt{Cell}Cell. The game is played on an infinite two-dimensional plane. At the beginning, every grid point (x,y)(0≤x≤n,0≤y≤m)(x,y)(0leq x leq n ,0leq y leq m)(x,y
Lucy is playing a game named Celltexttt{Cell}Cell. The game is played on an infinite two-dimensional plane. At the beginning, every grid point (x,y)(0≤x≤n,0≤y≤m)(x,y)(0leq x leq n ,0leq y leq m)(x,y)(0≤x≤n,0≤y≤m) has exactly one cell, while other points are empty. Lucy will play the game for kkk seconds. During each second, every cell divides itself into 444 copies and the copies then spread. Assume that a cell locates at point (x,y)(x,y)(x,y) at the start of the second, and at the end of the second, its 444 copies will locate at coordinates (x+1,y),(x−1,y),(x,y+1),(x,y−1)(x+1,y),(x-1,y),(x,y+1),(x,y-1)(x+1,y),(x−1,y),(x,y+1),(x,y−1) respectively. The original cell completes its life mission and disappears. Assume that the cells will reproduce following the above rules second by second. Lucy wants to know that, if everything goes on well, how many cells will be at the coordinate (n,m)(n,m)(n,m) at the end of the kkk-th second. As the answer may be enormous, you just need to print it modulo 998244353998244353998244353.
标签： HBC237533点击消除 数据结构 栈 字符串Cell题解
