-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.c
61 lines (47 loc) · 795 Bytes
/
test.c
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
/*COMPETITIVE PROGRAMMING C++ TEMPLATE */
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <climits>
#include <iomanip>
#include <iterator>
#define all(x) x.begin(), x.end()
#define MOD 998244353
const unsigned int M = 1000000007;
const long double PI = 3.141592653589793236L;
typedef long long int ll;
typedef long double ld;
#define MAX 50
using namespace std;
void solveA()
{
vector<int> vec;
}
void solveB(){
}
void solveC(){
}
void solveD(){
}
void solveE(){
}
void solveF(){
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
cin >> T;
while (T--)
{
solveA();
}
return 0;
}