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
pub fn min_digit(mut n: i32) -> i32 {
let mut r = 10;
while n != 0 {
if n%10 < r {
r=n%10;
}
n /= 10;
}
r
}
pub fn max_digit(mut n: i32) -> i32 {
let mut r = 0;
while n != 0 {
if n%10 > r {
r=n%10;
}
n /= 10;
}
r
}
pub fn replace_digit(mut n: i32, replaced: i32, replace_with: i32) -> i32 {
let radix = 10;
let mut reversed = 0;
while n != 0 {
if n%10 != replaced {
reversed = reversed * radix + n % radix;
} else {
reversed = reversed * radix + replace_with % radix;
}
n /= radix;
}
reversed=reverse_n(reversed);
reversed
}
pub fn remove_n(mut n: i32, removed: i32) -> i32 {
let radix = 10;
let mut reversed = 0;
while n != 0 {
if n%10 != removed {
reversed = reversed * radix + n % radix;
}
n /= radix;
}
reversed=reverse_n(reversed);
reversed
}
pub fn cat_rite(mut n: i32, cat: i32) -> i32 {
let mut count = 0;
let mut nn = 1;
n = reverse_n(n);
while count != cat {
count = count +1;
nn=add_digit(nn, 0);
}
n = n%nn;
n
}
pub fn cat_left(mut n: i32, cat: i32) -> i32 {
let mut count = 0;
let mut nn = 1;
while count != cat {
count = count +1;
nn=add_digit(nn, 0);
}
n = n%nn;
n
}
pub fn add_digit(mut n: i32, digit: i32) -> i32 {
n=n*10;
n=n+digit;
n
}
pub fn count_n(mut n: i32) -> i32 {
let mut count = 0;
if n <0 {
n=n*-1
}
while n>0 {
n=n/10;
count = count +1;
}
count
}
pub fn last_diget(mut n: i32) -> i32 {
if n <0 {
n = n*-1
}
n %10
}
pub fn first_diget(num: i32) -> i32 {
if num/10 == 0 {
return num;
}
first_diget(num/10)
}
pub fn reverse_n(mut n: i32) -> i32 {
let radix = 10;
let mut reversed = 0;
while n != 0 {
reversed = reversed * radix + n % radix;
n /= radix;
}
reversed
}