ps/snippets.json at master · Moongss/ps · GitHub

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
{
	"STUDY": {
		"prefix": ["edit"],
		"body": [
			"#include <bits/stdc++.h>",
			"#define endl \"\\n\"",
			"#define fastio cin.tie(0)->sync_with_stdio(0)",
			"using namespace std;",
			"",
			"#define x first",
			"#define y second",
			"#define all(v) v.begin(), v.end()",
			"#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())",
			"#define lower(v, x) (int)(lower_bound(all(v), x) - v.begin())",
			"#define upper(v, x) (int)(upper_bound(all(v), x) - v.begin())",
			"",
			"using ll = long long;",
			"using ld = long double;",
			"using pii = pair<int, int>;",
			"using pll = pair<ll, ll>;",
			"",
			"int main() {",
			"\tfastio;",
			"\t",
			"\treturn 0;",
			"}"
		],
		"description": "백준 C++"	// 설명
	},
	"PS": {	// 단축어 설명
		"prefix": ["boj", "ps"],	// 단축어 설정
		"body": [	// 작성될 코드들
			"#include <bits/stdc++.h>",
			"#include <ext/rope>",
			"#include <ext/pb_ds/assoc_container.hpp>",
			"#include <ext/pb_ds/tree_policy.hpp>",
			"#define endl \"\\n\"",
			"#define fastio cin.tie(0)->sync_with_stdio(0)",
			"",
			"#define x first",
			"#define y second",
			"#define all(v) v.begin(), v.end()",
			"#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())",
			"#define lower(v, x) (int)(lower_bound(all(v), x) - v.begin())",
			"#define upper(v, x) (int)(upper_bound(all(v), x) - v.begin())",
			"",
			"using namespace std;",
			"using namespace __gnu_cxx;",
			"using namespace __gnu_pbds;",
			"#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>",
			"#define ordered_mset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>",
			"",
			"using ll = long long;",
			"using ld = long double;",
			"using pii = pair<int, int>;",
			"using pll = pair<ll, ll>;",
			"",
			"int main() {",
			"\tfastio;",
			"\t",
			"\treturn 0;",
			"}"
		],
		"description": "백준 C++"	// 설명
	},
	"Cp": {	// 단축어 설명
	"prefix": [ "cp"],	// 단축어 설정
	"body": [	// 작성될 코드들
		"#include <bits/stdc++.h>",
		"#include <ext/rope>",
		"#include <ext/pb_ds/assoc_container.hpp>",
		"#include <ext/pb_ds/tree_policy.hpp>",
		"#define endl \"\\n\"",
		"#define fastio cin.tie(0)->sync_with_stdio(0)",
		"",
		"#define x first",
		"#define y second",
		"#define all(v) v.begin(), v.end()",
		"#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())",
		"#define lower(v, x) (int)(lower_bound(all(v), x) - v.begin())",
		"#define upper(v, x) (int)(upper_bound(all(v), x) - v.begin())",
		"#define sz(v) (int)v.size()",
		"#define YES {cout << \"YES\" << endl;}",
		"#define Yes {cout << \"Yes\" << endl;}",
		"#define NO {cout << \"NO\" << endl;}",
		"#define No {cout << \"No\" << endl;}",
		"using namespace std;",
		"using namespace __gnu_cxx;",
		"using namespace __gnu_pbds;",
		"#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>",
		"#define ordered_mset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>",
		"",
		"using ll = long long;",
		"using ld = long double;",
		"using pii = pair<int, int>;",
		"using pll = pair<ll, ll>;",
		"",
		"const ll inf = (1LL << 63) - 1;",
		"",
		"int t;",
		"int main() {",
		"\tfastio;",
		"\t",
		"\tcin >> t;",
		"\twhile(t--) {",
		"\t\t",
		"\t}",
		"\treturn 0;",
		"}"
	],
	"description": "백준 C++"	// 설명
	}
}