Created
August 8, 2019 03:58
-
-
Save harshraj22/85897cc07e0f7e02fe5351086431108b to your computer and use it in GitHub Desktop.
print('hai3')
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import numpy as np | |
md = 998244353 | |
for _ in range(int(input().strip())): | |
n,m,k = map(int,input().strip().split()) | |
g = [[] for x in range(n)] | |
# print(g) | |
for __ in range(m): | |
a,b = map(int,input().strip().split()) | |
a -= 1 | |
b -= 1 | |
g[a].append(b) | |
g[b].append(a) | |
gb = [[] for x in range(n*k)] | |
for i in range(len(g)): | |
for j in g[i]: | |
for dd in range(k): | |
# try: | |
if i+dd*n not in gb[j+dd*n]: | |
gb[i+dd*n].append(j+dd*n) | |
gb[j+dd*n].append(i+dd*n) | |
# except: | |
# print('error at ',i,j,dd) | |
# gb[i+dd*n].append(j+dd*n) | |
# g[j+dd*n].append(i+dd*n) | |
lelo = [[]*(n*k) for x in range(n*k-1)] | |
for i in range(len(lelo)): | |
for j in range(n*k): | |
if j not in gb[i] and j not in lelo[i]: | |
lelo[i].append(j) | |
# lelo[j].append(i) | |
print(g,gb,lelo,sep='\n') | |
h = [[0]*(n*k-1) for x in range(n*k-1)] | |
for row in range(len(h)): | |
for col in range(len(h)): | |
if row == col: | |
h[row][col] = len(lelo[row]) | |
else : | |
if col in lelo[row]: | |
h[row][col]=-1 | |
else: | |
h[row][col]=0 | |
print(h) | |
print(int(np.linalg.det(h))%md) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment