lectures/cpcfi_template.cpp at main · CPCFI-org/lectures · 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
114
115
116
117
118
119
120
121
122
123
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define endl                        '\n'
#define fastIO()                    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define FO(i, b)                    for (int i = 0; i < (b); i++)
#define FOR(i, a, b)                for (int i = (a); i < (b); i++)
#define rFOR(i, a, b)               for (int i = (a); i > (b); i--)
#define TR(v, arr)                  for (auto& (v) : (arr))
#define debug(x)                    cout << #x << " = "; _debug(x); cout << endl;
#define pb                          push_back
#define mp                          make_pair
#define F                           first
#define S                           second
#define all(x)                      x.begin(), x.end()
#define sz(x)                       (int) x.size()
#define LB(arr, x)                  lower_bound(all(arr), x)-(arr).begin()
#define UB(arr, x)                  upper_bound(all(arr), x)-(arr).begin()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll MOD = 1e9 + 7;
const ll INF = 1e9;

void setIO(){
	string file = __FILE__;
	file = string(file.begin(), file.end()-3);
	string in_file = file+"in";
	string out_file = file+"out";

	FILE *exist_in_file;
	exist_in_file = freopen(in_file.c_str(), "r", stdin);
	if(!exist_in_file){
		exist_in_file = freopen(in_file.c_str(), "w", stdout);
		fclose(exist_in_file);
	}
	freopen(in_file.c_str(), "r", stdin);
	freopen(out_file.c_str(), "w", stdout);
}

template <typename T>
void _debug(T& x){
	cout << x;
}

template <typename T1, typename T2>
void _debug(pair<T1, T2>& pair){
	cout << "{"; _debug(pair.F); cout << ","; _debug(pair.S); cout << "}";
}

template <typename T>
void _debug(vector<T>& vec){
	int n = sz(vec);
	if(n == 0){cout << "[ ]"; return;}
	cout << "[";
	FO(i, n-1){
		_debug(vec[i]); cout << " ";
	}
	_debug(vec[n-1]); cout << "]";
}

void _debug(vector<string>& vec){
	int n = sz(vec);
	cout << endl;
	FO(i, n){
		cout << vec[i] << endl;
	}
}

template <typename T>
void _debug(vector<vector<T>>& A){
	int n = sz(A);
	cout << endl;
	FO(i, n){
		_debug(A[i]); cout << endl;
	}
}

template <typename T>
void print(T& x){
	cout << x << endl;
	return;
}

template <typename T>
void print(vector<T>& vec, int a=0, int b=-1){
	if(b == -1){b = sz(vec);}
	if(b == 0){return;}
	FOR(i, a, b-1){
		cout << vec[i] << " ";
	}
	cout << vec[b-1] << endl;
	return;
}

const int N = 1e5;

void solve() {
	int n; cin >> n;
	vi nums(n);
	FO(i, n) cin >> nums[i];
	debug(nums);
	return;
}

int main() {
	fastIO();
	if(getenv("LOCAL")){setIO();}
	int T=1;
	FO(tc, T){
		// cout << "Case #" << tc+1 << ":";
		solve();
	}
	return 0;
}