摘要：
int add(long long &x,long long y) { x+=y; x%=MOD; } Matrix mutil(Matrix x,Matrix y) { Matrix z; memset(z.a,0,sizeof(z.a)); for(int i=0;i<X;i++) { for(int k=0;k<X;k++) ... 阅读全文
摘要：
There are b blocks of digits. Each one consisting of the same n digits, which are given to you in the input. Wet Shark must choose exactly one digit f 阅读全文