Submission #9342

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9342	2014-09-28T05:43:56 Z	lemonsqueeze	Uniting (kriii2_U)	C++	1 / 4	12 ms	1868 KB

U

#include <cstdio>

const int N = 100000;
typedef long long int64;

const int64 MOD = 1000000007;

int n;
int64 s[N];

int main(void) {
	scanf("%d", &n);
	int64 sum = 0;
	for (int i = 0; i < n; i++) {
		scanf("%lld", &s[i]);
		sum += s[i];
	}
	int64 ans = 0, kase = 1;
	for (int i = 0; i < n; i++) {
		sum -= s[i];
		ans += sum * s[i];
	}
	printf("%lld\n", ans);
	for (int i = 1; i <= n; i++) {
		kase = (kase * (int64)i) % MOD;
	}
	printf("%lld\n", kase);
	return 0;
}

Subtask #1

1.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 ms	1868 KB	Output is partially correct
2	Partially correct	0 ms	1868 KB	Output is partially correct
3	Partially correct	0 ms	1868 KB	Output is partially correct
4	Partially correct	0 ms	1868 KB	Output is partially correct
5	Partially correct	0 ms	1868 KB	Output is partially correct
6	Partially correct	0 ms	1868 KB	Output is partially correct
7	Partially correct	0 ms	1868 KB	Output is partially correct
8	Partially correct	0 ms	1868 KB	Output is partially correct
9	Partially correct	0 ms	1868 KB	Output is partially correct
10	Partially correct	0 ms	1868 KB	Output is partially correct
11	Partially correct	0 ms	1868 KB	Output is partially correct
12	Partially correct	0 ms	1868 KB	Output is partially correct
13	Partially correct	0 ms	1868 KB	Output is partially correct
14	Partially correct	0 ms	1868 KB	Output is partially correct
15	Partially correct	0 ms	1868 KB	Output is partially correct
16	Partially correct	0 ms	1868 KB	Output is partially correct
17	Partially correct	0 ms	1868 KB	Output is partially correct
18	Partially correct	0 ms	1868 KB	Output is partially correct
19	Partially correct	0 ms	1868 KB	Output is partially correct
20	Partially correct	0 ms	1868 KB	Output is partially correct
21	Partially correct	0 ms	1868 KB	Output is partially correct
22	Partially correct	0 ms	1868 KB	Output is partially correct
23	Partially correct	0 ms	1868 KB	Output is partially correct
24	Partially correct	0 ms	1868 KB	Output is partially correct
25	Partially correct	4 ms	1868 KB	Output is partially correct
26	Partially correct	0 ms	1868 KB	Output is partially correct
27	Partially correct	4 ms	1868 KB	Output is partially correct
28	Partially correct	4 ms	1868 KB	Output is partially correct
29	Partially correct	4 ms	1868 KB	Output is partially correct
30	Partially correct	4 ms	1868 KB	Output is partially correct
31	Partially correct	4 ms	1868 KB	Output is partially correct
32	Partially correct	4 ms	1868 KB	Output is partially correct
33	Partially correct	4 ms	1868 KB	Output is partially correct
34	Partially correct	0 ms	1868 KB	Output is partially correct
35	Partially correct	4 ms	1868 KB	Output is partially correct
36	Partially correct	4 ms	1868 KB	Output is partially correct
37	Partially correct	4 ms	1868 KB	Output is partially correct
38	Partially correct	8 ms	1868 KB	Output is partially correct
39	Partially correct	4 ms	1868 KB	Output is partially correct
40	Partially correct	8 ms	1868 KB	Output is partially correct
41	Partially correct	4 ms	1868 KB	Output is partially correct
42	Partially correct	8 ms	1868 KB	Output is partially correct
43	Partially correct	8 ms	1868 KB	Output is partially correct
44	Partially correct	4 ms	1868 KB	Output is partially correct
45	Partially correct	8 ms	1868 KB	Output is partially correct
46	Partially correct	12 ms	1868 KB	Output is partially correct
47	Partially correct	8 ms	1868 KB	Output is partially correct
48	Partially correct	8 ms	1868 KB	Output is partially correct
49	Partially correct	4 ms	1868 KB	Output is partially correct
50	Partially correct	12 ms	1868 KB	Output is partially correct