답안 #8385

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
8385	2014-09-13T16:14:48 Z	tncks0121	Uniting (kriii2_U)	C++	1 / 4	8 ms	1088 KB

U

#define _CRT_SECURE_NO_WARNINGS
 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h> 
#include <time.h>
 
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;

int N;
ll res1;

int main() {
	scanf("%d", &N);
	
	ll sum = 0;	
	for(int i = 1; i <= N; i++) {
		int si; scanf("%d", &si);
		res1 += sum * si;
		sum += si;
	}

	printf("%lld\n0\n", res1, sum);


	return 0;
}

Subtask #1

1.0 / 4.0

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