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

/*           OJDL TestCase Generater             */
/*  Made by FHVirus with patience for cin/cout   */
/*
How this works:
1.  Generate a file (testcase#.in)
2.  Read that file as input and solve,
    output to another file(testcase#.out)

How to use it:
0.  Put this program into a folder where
    you want to store the testcases.
1.  Input number of subtasks
2.  For each subtask, input the number of
    desired testcase for the subtask, then
    the arguments for generate().
3.  Done!
*/
#include<iostream>
#include<fstream>
#include<string>
#include<chrono>
#include<random>
using namespace std;

auto seed = std::chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 mt(seed);

// For generate(), you can add additional arguments
// for generating a testcase.
// But for solve(), just write a normal solution
// like that in main() for most of the time.
void generate(ofstream &cout){}
void solve(ifstream &cin, ofstream &cout){}

int main(){
    int subtaskNumber, testcaseCount = 1;
    cin >> subtaskNumber;
    for(int t = 1; t <= subtaskNumber; ++t){
        int numOfTestCase;
        cin >> numOfTestCase;
        // You can add some other arguments for
        // generating testcases.

        cout << "Generating Subtask #" << t << '\n';
        for(; numOfTestCase; --numOfTestCase, ++testcaseCount){
            string in = to_string(testcaseCount) + ".in";
            string ou = to_string(testcaseCount) + ".out";
            {
                ofstream tsezi;
                tsezi.open(in);
                // Remember to add arguments here too.
                generate(tsezi);
                tsezi.close();
            }
            {
                ifstream tsezi;
                ofstream da_an;
                tsezi.open(in);
                da_an.open(ou);
                solve(tsezi, da_an);
                tsezi.close();
                da_an.close();
            }
        }
    }
    return 0;
}