解题思路:
注意事项:
参考代码:
n,m = map(int,input().split())
op = [3,4,5,0,1,2]
clash = [[4 for i in range(6)] for i in range(6)]
mod = 10**9 + 7
for i in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
clash[a][op[b]] = 0
clash[b][op[a]] = 0
def mmul(a,b):
c = [[0 for i in range(len(b))]for i in range(len(a))]
for i in range(len(a)):
for j in range(len(b)):
for k in range(len(b)):
c[i][j] = (c[i][j] + a[i][k]*b[k][j]) % mod
return c
def mpow(a,x):
b = [[0 for i in range(len(a))]for i in range(len(a))]
for i in range(len(a)):
b[i][i] = 1
while x:
if x & 1:
b = mmul(b,a)
a = mmul(a,a)
x >>= 1
return b
print(sum(mmul([[4,4,4,4,4,4]],mpow(clash,n-1))[0])%mod)
0.0分
5 人评分
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:476 |
C语言程序设计教程(第三版)课后习题6.2 (C语言代码)浏览:711 |
C语言考试练习题_保留字母 (C语言代码)浏览:713 |
C语言程序设计教程(第三版)课后习题5.8 (C语言代码)浏览:1173 |
字符串输入输出函数 (C语言代码)浏览:2495 |
出圈】指针malloc版浏览:355 |
核桃的数量 (C语言代码)浏览:872 |
Tom数 (C语言代码)浏览:527 |
C二级辅导-同因查找 (C语言代码)浏览:568 |
理财计划 (C语言代码)浏览:468 |