-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathsettings.js
89 lines (86 loc) · 3.28 KB
/
settings.js
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
var Tag = ['', '2-sat', 'binary search', 'bitmasks', 'brute force',
'chinese remainder theorem', 'combinatorics', 'constructive algorithms',
'data structures', 'dfs and similar', 'divide and conquer', 'dp', 'dsu',
'expression parsing', 'fft', 'flows', 'games', 'geometry', 'graph matchings',
'graphs', 'greedy', 'hashing', 'implementation', 'math', 'matrices',
'meet-in-the-middle', 'number theory', 'probabilities', 'schedules',
'shortest paths', 'sortings', 'string suffix structures', 'strings',
'ternary search', 'trees', 'two pointers'
];
var ProTil = ['', '2-satisfiability', 'Binary search', 'Bitmasks', 'Brute force',
'Сhinese remainder theorem', 'Combinatorics', 'Constructive algorithms',
'Heaps, binary search trees, segment trees, hash tables, etc', 'Dfs and similar',
'Divide and Conquer', 'Dynamic programming', 'Disjoint set union',
'Parsing expression grammar', 'Fast Fourier transform', 'Graph network flows',
'Games, Sprague–Grundy theorem', 'Geometry, computational geometry',
'Graph matchings, König\'s theorem, vertex cover of bipartite graph', 'Graphs',
'Greedy algorithms', 'Hashing, hashtables',
'Implementation problems, programming technics, simulation',
'Mathematics including integration, differential equations, etc',
'Matrix multiplication, determinant, Cramer\'s rule, systems of linear equations',
'Meet-in-the-middle', 'Number theory: Euler function, GCD, divisibility, etc',
'Probabilities, expected values, statistics, random variables, etc',
'Scheduling Algorithms', 'Shortest paths on weighted and unweighted graphs',
'Sortings, orderings', 'Suffix arrays, suffix trees, suffix automatas, etc',
'Prefix- and Z-functions, suffix structures, Knuth–Morris–Pratt algorithm, etc',
'Ternary search', 'Trees', 'Two pointers'
];
module.exports = {
cookie_secret: 'gzhu',
db: 'mongodb://127.0.0.1:27017/acdream_db',
reg_close_time: 300000/* 在比赛开始前多少毫秒关闭注册 */,
problemset_pageNum: 50,
status_pageNum: 20,
ranklist_pageNum: 20,
standings_pageNum: 50,
contest_pageNum: 20,
regform_pageNum: 20,
stats_pageNum: 20,
contestRank_pageNum: 50,
topic_pageNum: 15,
comment_limit: 20,
root_path: __dirname + '/',
data_path: __dirname + '/data/',
T: Tag,
P: ProTil,
languages: ['All', 'C', 'C++', 'Java'],
xss_options: {
whiteList: {
a: ['target', 'href', 'title', 'id', 'name'],
blockquote: ['cite'],
br: [],
b: [],
caption: [],
dd: [],
div: ['style'],
dl: [],
dt: [],
em: [],
font: ['color', 'size', 'face'],
footer: [],
h1: ['style'],
h2: ['style'],
h3: ['style'],
header: [],
hr: [],
i: [],
img: ['style', 'src', 'alt'],
li: ['style'],
ol: [],
p: ['style'],
pre: ['style', 'class'],
section: [],
small: [],
span: ['style', 'class'],
strong: [],
table: ['style', 'class', 'cellpadding', 'cellspacing', 'summary', 'width', 'border', 'align', 'valign'],
tbody: ['align', 'valign'],
td: ['style', 'width', 'colspan', 'align', 'valign'],
tfoot: ['align', 'valign'],
th: ['width', 'colspan', 'align', 'valign', 'scope'],
thead: ['align', 'valign'],
tr: ['rowspan', 'align', 'valign'],
ul: []
}
}
};