Codeforces Round #420 (Div. 2), problem: (E) Okabe and El Psy Kongroo Solution In C/C++

By |2017-08-06T21:27:27+00:00August 6th, 2017|Categories: C/C++, Programming|Tags: , , , , , , |

#include <stdio.h> #define m 1000000007u typedef long long unsigned llu; typedef unsigned u; u M[16][64][16][16]; u X[16],Y[16],*A,*B,*C; int main() { u q,n,e,i,j,k; for(n=-1;++n<16;) { for(i=-1;++i<=n;) for(j=-1;++j<=n;) M[n][0][i][j]=(i<j?j-i:i-j)<2; for(e=0;++e<64;) { for(i=-1;++i<=n;) for(j=-1;++j<=n;) for(k=-1;++k<=n;) M[n][e][i][j]= ( M[n][e][i][j]+ M[n][e-1][i][k]* (llu)M[n][e-1][k][j] )%m; } } llu x,y,z;*(A=X)=1;B=Y; for(scanf("%u%I64u",&q,&z);q--;) { [...]