-
Notifications
You must be signed in to change notification settings - Fork 0
/
gcj_template.cpp
75 lines (58 loc) · 1.29 KB
/
gcj_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
// -------------------------------------
// STATUS:
// <<Problem Name>>
// -------------------------------------
#ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif
#define _USE_MATH_DEFINES
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <bitset>
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1 << 30;
FILE *fin, *fout;
inline char my_readChar() { char c; do { fscanf(fin, "%c", &c); } while(c == '\r' || c == '\n'); return c; }
// Add extra defines
//#define N 51
void solve(int problemIdx) {
}
void read(int problemIdx) {
}
void write(int problemIdx) {
}
int main(int argc, char** argv) {
fin = fopen("input.txt", "rt");
fout = fopen("output.txt", "wt");
//FILE *fout = stdout;
int problemCount;
fscanf(fin,"%d", &problemCount);
for(int problemIdx = 1; problemIdx <= problemCount; problemIdx++) {
read(problemIdx);
solve(problemIdx);
fprintf(fout, "Case #%d:", problemIdx);
write(problemIdx);
}
fclose(fin);
fclose(fout);
return 0;
}