Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- using namespace std;
- // Definition for a binary tree node.
- struct TreeNode {
- int val;
- TreeNode *left;
- TreeNode *right;
- TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
- };
- class Solution {
- private:
- int n = 10;
- int mod = 10000;
- vector<string> input;
- public:
- void generate() {
- random_device rd;
- mt19937 mt(rd());
- uniform_int_distribution<int> dist(0, mod);
- for (int terminal = 0; terminal < n; ++terminal) {
- vector<string> curr = {
- to_string(dist(mt) + 1),
- to_string(dist(mt) + 1),
- to_string(dist(mt) + 1),
- };
- for (auto &str : curr ) {
- while(str.length() < 4) {
- str = "0" + str;
- }
- }
- input.emplace_back(curr[0] + "d*" + curr[1] + "e*" + curr[2] + "l");
- }
- for (auto str : input) {
- cout << str << endl;
- }
- }
- };
- int main() {
- ios::sync_with_stdio(false);
- Solution solution;
- solution.generate();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement