-
Notifications
You must be signed in to change notification settings - Fork 0
/
competition_template.cpp
78 lines (63 loc) · 1.63 KB
/
competition_template.cpp
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
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <filesystem>
#include <fstream>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <string_view>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <utility>
#include <vector>
// $TASKNAME$
//
// when the problem has a solution
// what complexity is demanded given the size of data in the last tests set
// write std::cerr diagnostics
static void solve() {
int64_t ret{0};
std::cout << ret;
}
int main(int, char**)
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
int no_of_cases;
std::cin >> no_of_cases;
for (int g = 1; g <= no_of_cases; ++g) {
// /*attach_trap();*/ solve();
std::cout << "Case #" << g << ": "; solve(); std::cout << '\n';
//std::cout << "Case #" << g << ": " << (solve() ? "" : "IM") << "POSSIBLE\n";
//std::cout << "Case #" << g << ": " << std::fixed << std::setprecision(9); solve(); std::cout << '\n';
}
}
/*
Format:
clang-format -i $TASKNAME$.cpp
Compile:
cls && clang++.exe -Wall -Wextra -g -O0 -std=c++20 $TASKNAME$.cpp -o $TASKNAME$.exe
g++ -Wall -Wextra -g3 -Og -std=c++20 -fsanitize=address $TASKNAME$.cpp -o $TASKNAME$
Run:
py.exe interactive_runner.py py.exe $TASKNAME$_testing_tool.py 1 -- $TASKNAME$.exe
$TASKNAME$.exe < $TASKNAME$.in
Input:
Output:
*/