-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
121 lines (110 loc) · 3.16 KB
/
Copy pathMain.java
File metadata and controls
121 lines (110 loc) · 3.16 KB
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.Map;
import java.util.NoSuchElementException;
public class Main {
private static final PrintStream ps = System.out;
private static final InputStream IS = System.in;
private static final byte[] BUFFER = new byte[1024];
private static int ptr = 0;
private static int buflen = 0;
public static void main(String[] args) {
int n = ni();
long sum = 0;
long ans = 0;
Map<Long, Integer> count = new HashMap<Long, Integer>();
count.put(0L, 0);
for (int i = 0; i < n; i++) {
long a = nl();
sum += a;
if (!count.containsKey(sum)) {
count.put(sum, 0);
} else {
int newval = count.get(sum) + 1;
ans += newval;
count.put(sum, newval);
}
}
ps.println(ans);
}
private static boolean hasNextByte() {
if (ptr < buflen)
return true;
else {
ptr = 0;
try {
buflen = IS.read(BUFFER);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0)
return false;
}
return true;
}
private static int readByte() {
if (hasNextByte())
return BUFFER[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public static boolean hasNext() {
while (hasNextByte() && !isPrintableChar(BUFFER[ptr]))
ptr++;
return hasNextByte();
}
public static String n() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public static long nl() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b)
throw new NumberFormatException();
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b))
return minus ? -n : n;
else
throw new NumberFormatException();
b = readByte();
}
}
public static int ni() {
long nl = nl();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
throw new NumberFormatException();
return (int) nl;
}
public static double nextDouble() {
return Double.parseDouble(n());
}
private static int[] nia(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni();
return a;
}
}