Submission #9602

# Submission time Handle Problem Language Result Execution time Memory
9602 2014-09-28T07:34:44 Z lemonsqueeze The last wizard (kriii2_T) C++
1 / 4
12 ms 1564 KB
#include <stdio.h>

long long t;
int n, m=10, a;
int p[10000];
int v[10000][10];

int l[10000];
const int MOD = 1000000007;

long long comb[30][30];

long long solve (int x, long long r)
{
	long long res = 0;

	if (x==n) {
		res = 1;
		for (int i=0; i<n; i++) for (int j=0; j<l[i]; j++)
			res = (res * p[i]) % MOD;
		for (int i=0; i<r; i++)
			res = (res * a) % MOD;
		for (int i=0; i<m; i++) {
			long long s=1;
			for (int j=0; j<n; j++) s = (s + v[j][i] * l[j]) % MOD;
			res = (res * s) % MOD;
		}

		return res;
	}

	for (int i=0; i<=r; i++) {
		l[x] = i;
		res = (res + solve (x+1, r-i) * comb[r][i]) % MOD;
	}

	return res;
}

int main ()
{
	scanf ("%lld%d%d", &t, &n, &a);
	for (int i=0; i<n; i++) {
		scanf ("%d", &p[i]);
		a -= p[i];

		for (int j=0; j<10; j++) scanf ("%d", &v[i][j]);
	}

	comb[0][0] = 1;
	for (int i=1; i<=t; i++) {
		comb[i][0] = 1;
		for (int j=1; j<=i; j++)
			comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
	}

	printf ("%lld\n", solve (0, t));

	return 0;
}

/*
1 2 3
1 1 1 1 1 0 0 0 0 0 0
1 0 0 0 0 1 0 0 0 0 0

10 3 22
4 1 4 2 5 0 0 0 1 0 1
7 2 0 3 2 0 7 1 0 2 0
9 0 1 0 0 1 0 1 1 7 0  


*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1564 KB Output is correct
2 Correct 0 ms 1564 KB Output is correct
3 Correct 0 ms 1564 KB Output is correct
4 Correct 0 ms 1564 KB Output is correct
5 Correct 0 ms 1564 KB Output is correct
6 Correct 0 ms 1564 KB Output is correct
7 Correct 0 ms 1564 KB Output is correct
8 Correct 0 ms 1564 KB Output is correct
9 Correct 0 ms 1564 KB Output is correct
10 Correct 0 ms 1564 KB Output is correct
11 Correct 0 ms 1564 KB Output is correct
12 Correct 0 ms 1564 KB Output is correct
13 Correct 0 ms 1564 KB Output is correct
14 Correct 0 ms 1564 KB Output is correct
15 Correct 0 ms 1564 KB Output is correct
16 Correct 0 ms 1564 KB Output is correct
17 Correct 0 ms 1564 KB Output is correct
18 Correct 0 ms 1564 KB Output is correct
19 Correct 0 ms 1564 KB Output is correct
20 Correct 0 ms 1564 KB Output is correct
21 Correct 0 ms 1564 KB Output is correct
22 Correct 0 ms 1564 KB Output is correct
23 Correct 0 ms 1564 KB Output is correct
24 Correct 0 ms 1564 KB Output is correct
25 Correct 0 ms 1564 KB Output is correct
26 Correct 0 ms 1564 KB Output is correct
27 Correct 0 ms 1564 KB Output is correct
28 Correct 0 ms 1564 KB Output is correct
29 Correct 0 ms 1564 KB Output is correct
30 Correct 0 ms 1564 KB Output is correct
31 Correct 0 ms 1564 KB Output is correct
32 Correct 0 ms 1564 KB Output is correct
33 Correct 0 ms 1564 KB Output is correct
34 Correct 0 ms 1564 KB Output is correct
35 Correct 0 ms 1564 KB Output is correct
36 Correct 0 ms 1564 KB Output is correct
37 Correct 0 ms 1564 KB Output is correct
38 Correct 0 ms 1564 KB Output is correct
39 Correct 0 ms 1564 KB Output is correct
40 Correct 0 ms 1564 KB Output is correct
41 Correct 0 ms 1564 KB Output is correct
42 Correct 0 ms 1564 KB Output is correct
43 Correct 0 ms 1564 KB Output is correct
44 Correct 0 ms 1564 KB Output is correct
45 Correct 0 ms 1564 KB Output is correct
46 Correct 0 ms 1564 KB Output is correct
47 Correct 0 ms 1564 KB Output is correct
48 Correct 0 ms 1564 KB Output is correct
49 Correct 0 ms 1564 KB Output is correct
50 Correct 0 ms 1564 KB Output is correct
51 Correct 0 ms 1564 KB Output is correct
52 Correct 0 ms 1564 KB Output is correct
53 Correct 0 ms 1564 KB Output is correct
54 Correct 0 ms 1564 KB Output is correct
55 Correct 0 ms 1564 KB Output is correct
56 Correct 0 ms 1564 KB Output is correct
57 Correct 0 ms 1564 KB Output is correct
58 Correct 0 ms 1564 KB Output is correct
59 Correct 0 ms 1564 KB Output is correct
60 Correct 0 ms 1564 KB Output is correct
61 Correct 0 ms 1564 KB Output is correct
62 Correct 0 ms 1564 KB Output is correct
63 Correct 0 ms 1564 KB Output is correct
64 Correct 0 ms 1564 KB Output is correct
65 Correct 0 ms 1564 KB Output is correct
66 Correct 0 ms 1564 KB Output is correct
67 Correct 0 ms 1564 KB Output is correct
68 Correct 0 ms 1564 KB Output is correct
69 Correct 0 ms 1564 KB Output is correct
70 Correct 0 ms 1564 KB Output is correct
71 Correct 0 ms 1564 KB Output is correct
72 Correct 0 ms 1564 KB Output is correct
73 Correct 0 ms 1564 KB Output is correct
74 Correct 0 ms 1564 KB Output is correct
75 Correct 0 ms 1564 KB Output is correct
76 Correct 0 ms 1564 KB Output is correct
77 Correct 0 ms 1564 KB Output is correct
78 Correct 0 ms 1564 KB Output is correct
79 Correct 0 ms 1564 KB Output is correct
80 Correct 0 ms 1564 KB Output is correct
81 Correct 0 ms 1564 KB Output is correct
82 Correct 0 ms 1564 KB Output is correct
83 Correct 0 ms 1564 KB Output is correct
84 Correct 0 ms 1564 KB Output is correct
85 Correct 0 ms 1564 KB Output is correct
86 Correct 0 ms 1564 KB Output is correct
87 Correct 0 ms 1564 KB Output is correct
88 Correct 0 ms 1564 KB Output is correct
89 Correct 0 ms 1564 KB Output is correct
90 Correct 0 ms 1564 KB Output is correct
91 Correct 0 ms 1564 KB Output is correct
92 Correct 0 ms 1564 KB Output is correct
93 Correct 0 ms 1564 KB Output is correct
94 Correct 0 ms 1564 KB Output is correct
95 Correct 4 ms 1564 KB Output is correct
96 Correct 0 ms 1564 KB Output is correct
97 Correct 0 ms 1564 KB Output is correct
98 Correct 0 ms 1564 KB Output is correct
99 Correct 0 ms 1564 KB Output is correct
100 Correct 8 ms 1564 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 1560 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -