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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
#include <iostream>
#include <vector>
#define TEN 10
using namespace std;
/*
Example input/output:
44987434
544847
O: 8
129
329
O: 3
4332321
4232331
O: 1
987123
123
O: 6
77688988
89675421
O: 10
*/
bool checkData(int&,int&);
vector<int> createVector(int);
void swap(int&, int&);
int contains(const vector<int>&,const int digit,const size_t);
int contains(const vector<int>&,const vector<int>&, const int digit,const size_t);
unsigned leastOperations(const int n,const int k)
{
vector<int> nDigits = createVector(n);
vector<int> kDigits = createVector(k);
size_t numberOfOperations = NULL;
for (size_t i = 0; i < kDigits.size(); i++)
{
while (contains(kDigits, nDigits[nDigits.size() - 1], i) == -1 && nDigits.size() > i)
{
nDigits.pop_back();
numberOfOperations++;
}
int containsDigit = contains(nDigits,kDigits, kDigits[i], i);
if (containsDigit == i)
continue;
else if (containsDigit != -1)
swap(nDigits[i], nDigits[containsDigit]);
else
{
nDigits.push_back(kDigits[i]);
if (i != nDigits.size() - 1)
{
swap(nDigits[i], nDigits[nDigits.size() - 1]);
numberOfOperations++;
}
}
numberOfOperations++;
}
numberOfOperations += nDigits.size() - kDigits.size();
return numberOfOperations;
}
int main()
{
while (true)
{
int n, k;
cin >> n >> k;
if (checkData)
cout << leastOperations(n, k) << endl << endl;
}
}
bool checkData(int &n,int &k)
{
if (n < NULL && k < NULL)
{
n *= -1;
k *= -1;
}
return(n >= NULL && k >= NULL);
}
vector<int> createVector(int number)
{
vector<int> newVector;
size_t powTen = 1;
while (powTen * TEN <= number)
powTen *= TEN;
while (powTen > 0)
{
int digit = number / powTen;
newVector.push_back(digit);
number %= powTen;
powTen /= TEN;
}
return newVector;
}
void swap(int& f, int& s)
{
int temp = f;
f = s;
s = temp;
}
int contains(const vector<int> &v, int digit, size_t start)
{
for (size_t i = start; i < v.size(); i++)
if (v[i] == digit)
return i; //return index
return -1;
}
int contains(const vector<int> &nDigits,const vector<int> &kDigits, int digit, size_t start)
{
int index = -1;
bool firstOccurance = true;
bool conflict;
for (size_t i = start; i < nDigits.size(); i++)
{
conflict = false;
if (kDigits.size() > i)
{
if (nDigits[i] == kDigits[i] && nDigits[i] == digit)
{
conflict = true;
if (firstOccurance)
{
if (start == i)
return index = i;
index = i;
firstOccurance = false;
}
}
}
if (nDigits[i] == digit && !conflict)
{
return index = i;
firstOccurance = false;
}
}
return index;
}
|
