Data-structure---Tree/set.cpp at main · regismeyssonnier/Data-structure---Tree · GitHub

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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <string>
#include <iomanip>
#include <set>
#include <stack>
using namespace std;


#define ll long long int

#define MAX_N 20001
#define ll long long int
using namespace std;
int n, m;


void solve(int ca) {

	int a = 88211;

	cout << a << endl;

	set<int> s;
	int mxn = -1000000;
	int size = 0;
	int i = a;
	int maxi = -1000000;
	while (i > 0) {
		s.insert(i % 10);
		mxn = max(mxn, i % 10);
		maxi = i % 10;
		size++;
		i = i / 10;

	}

	int mex = 0;
	for (auto e : s) {
		if (mex == e) {
			mex++;
		}
		else {
			break;
		}
	}


	s.insert(mex);
	int mex2 = 0;
	for (auto e : s) {
		//if (e >= maxi) {
			if (mex2 == e) {
				mex2++;
			}
			else {
				break;
			}
		//}
	}

	int mex3 = mxn;
	for (auto e : s) {
		if (e >= mxn) {
			if (mex3 == e) {
				mex3++;
			}
			else {
				break;
			}
		}
	}

	cout << mex << " " << mex2 << " " << mex3 << endl;

	int v = 0;
	if (mex == 0) {
		v = mex3;
		if (mxn == 9) {
			v *= mex2;
		}

		for (int i = 0; i < size-1; i++) {
			v *= 10;
		}
		cout << v << endl;
	}
	else {
		v = mex3;
		if (mex3 == 10) {
			//v = mex3 * 10;
			v += mex;
		}
		for (int i = 0; i < size-1; i++) {
			v *= 10;
			v += mex;
		}

		cout << v << endl;
	}


}

int main() {
	// your code goes here
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	int t=1;
	//cin >> t;
	int i = 1;
	while (i <= t) {
		solve(i); i++;
	}


	return 0;
}