1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int dp[1<<12][501];
int f[13], a[13][13];

int GCD(int a, int b) {
	return b ? GCD(b, a%b) : a;
}

int main(int argc, char const *argv[]) {
	int t, n, m;
	scanf("%d", &t);
	f[0] = 1;
	for(int i=1; i<=12; ++i) {
		f[i] = f[i-1]*i;
	}
	while(t--) {
		scanf("%d %d", &n, &m);
		for(int i=1; i<=n; ++i) {
			for(int j=1; j<=n; ++j) {
				scanf("%d", &a[i][j]);
			}
		}
		memset(dp, 0, sizeof dp);
		dp[0][0] = 1;
		for(int i=0; i<(1<<n); ++i) {
			int cnt = 0;
			for(int j=1; j<=n; ++j) {
				if(i & (1<<(j-1))) cnt++;
			}
			for(int j=1; j<=n; ++j) {
				if(i & (1<<(j-1))) continue;
				for(int k=0; k<=m; ++k) {
					dp[i+(1<<(j-1))][min(k+a[cnt+1][j], m)] += dp[i][k];
				}
			}
		}
		if(dp[(1<<n)-1][m] == 0) printf("No solution\n");
		else {
			int gcd = GCD(f[n], dp[(1<<n)-1][m]);
			printf("%d/%d\n", f[n]/gcd, dp[(1<<n)-1][m]/gcd);
		}
	}
	
	return 0;
}