palindrom question



Im coding to guess nth palindrome number.
for example 12th palindrome number is 33
I have been tried to write the code to find next palindrome number
i used vector to represent palindrome number and guess next one
11211-> [1,1,2,1,1]
it work much better than brute force all the numbers to check its palindrome
im testing number up to 2*10^9
it work ok up to some 10^6 numbers but after that it become slow
anyone suggest other methods or fix my code to make it(much) faster?



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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
#include <iostream>
#include <vector>
using namespace std;


long long jegop(long long a, long long b){
     if( b ==0) return 1;
	long long i,c;
    
	c=a;
    
	for( i = 0 ; i < b - 1 ; i++ ){
        
		c = c * a;
        
	}
    
	return c;
    
}

void make_vector(vector<long long>& vec,long long num){
    
    
  
    long long i=1;
    long long digit;
   // cout << "begin i : " << i <<" and " << num <<endl;
   // cout <<" vector.size() : " << vec.size() <<endl;
    long long tempNum= num;
    while(true){
        
        if( tempNum <= jegop(10,i)){
           // cout << "breaking..."<<endl;
            break;
        }
           
        else {
            
           // cout << tempNum << " and " << jegop(10,i) << endl;
            i++;
        }
    }
    
    
    
    while(true){
        if (num ==0 ) break;
       
            //cout << " i...." << i <<endl;
            if( num >= jegop(10,i-1)){
                digit = num / jegop(10,i-1);
                //cout << "push backing..." << digit <<endl;
                vec.push_back(digit);
                num = num - (digit * jegop(10,i-1));
                i--;
            }else{
               // cout << "pushing back 0..."<<endl;
                vec.push_back(0);
                i--;
                
                
            }
            
       
    }
    
        
}

void print(vector<long long>& vec){
    for(long long i=0; i < vec.size(); i++){
        
        cout << vec[i]; 
        
    }
    cout <<endl;
}
bool find_zero_inVector(vector<long long>& vec){
    
    for(long long i=0 ; i < vec.size(); i++){
        if( vec[i] == 0 ) return true;
    }
    return false;
}

void increment_pair(vector<long long>& vec,long long a, long long b){
    
    vec[a] = vec[a]+1;
    vec[b] = vec[b]+1;
    
    
}

bool check_All_nine(vector<long long>& vec){
    
    for(long long i=0 ; i < vec.size() ; i++){
        if( vec[i] != 9) return false;
    }
    
    return true;
}

void clean(vector<long long>& vec){
    while( vec.size() !=0){
        
        vec.pop_back();
    }
    
}

void change_four_digit(vector<long long>& vec,long long temp){
    //cout << "temp->" << temp <<endl;
    for(long long i=0 ; i < temp ; i++){
        if( i==0 || i== temp-1) vec.push_back(1);
        else vec.push_back(0);
        
    }
    
    
}

long long vec_to_long(vector<long long>& vec){
    long long temp = vec.size();
    long long result=0;
    
    for(long long i=0 ; i < vec.size() ; i++){
        
        result += vec[i] * jegop(10,temp-1);
        temp--;
    }
    
    return result;
    
}



long long generate_nextPalindrome(vector<long long>& vec){
    
    //prlong long(vec);
    long long mid = vec.size()/2;
    //cout << "vec_size->" << vec.size() <<endl;
    if( vec.size()%2 ==1){// if palindrome is odd digits
        //cout << "one...."<<endl;
        long long begin = 0;
        long long end = vec.size()-1;
        while( true ){
            if(( vec[begin] != vec[end]  || begin==end)){
               // cout <<vec[begin] << " AND " << vec[end] <<endl;
                if( vec[begin] <9) {
                  // cout <<" two..."<<endl;
                    //cout << "vec[begin] : " << vec[begin] <<endl;
                    vec[begin] = vec[begin] +1;
                }
                else if( vec[begin]>=9){
                   // cout <<" one..."<<endl;
                    if( check_All_nine(vec)==false){
                       // cout << "begin " << begin <<endl;
                        
                        vec[begin] =0;
                        begin--;
                        end++;
                        while( true){
                            if(vec[begin] !=9 && vec[end] !=9) {
                                //cout <<"fuking..."<<endl;
                                 increment_pair(vec, begin, end);
                                break;
                            }
                            else{
                                
                                vec[begin] =0;
                                vec[end] =0;
                                
                            }
                            begin--;
                            end++;
                        }
                       
                    }else{
                        long long temp = vec.size();
                        clean(vec);
                        change_four_digit(vec,temp+1);
                        
                        
                        
                        
                        
                    }
                    
                    
                }
              
                                
                break;
            }else if(vec[begin] == vec[end] && begin != end){  
                //cout << begin << " and " << end <<endl;
                begin++;
                end--;
            }
            
        }
        
        
    }else if(vec.size()%2 ==0) {// if palindrom is even number 
        //cout <<" two...." <<endl;
        long long begin = 0;
        long long end = vec.size()-1;
        while( true ){
          //  cout << "begin origin: " << begin <<" end origin :  "<< end <<endl;
            if( begin+1 == end){
            
                //cout << "begin : " << begin <<" end :  "<< end <<endl;
                if( vec[begin] !=9 ){
                    
                    //cout << "dkfjslkj..."<<endl;
                    increment_pair(vec,begin,end);
                }else if( vec[begin] ==9 && begin!=0 && check_All_nine(vec)==false){
                   // cout <<"doing...."<<endl;
                    
                    while( true){
                        if(vec[begin] !=9 && vec[end] !=9){
                            //cout << begin << " and " << end <<endl;
                            increment_pair(vec,begin,end);

                            break;
                        }
                        else{
                            
                            vec[begin] =0;
                            vec[end] =0;
                            
                        }
                        begin--;
                        end++;
                    }
                                       
                }else if( check_All_nine(vec)== true){
                    //cout <<"here..."<<endl;
                    long long temp = vec.size();
                    clean(vec);
                    change_four_digit(vec,temp+1);
                    
                    
                    
                    
                }
                
                
                break;
            }
            begin++;
            end--;
        }
        
        
        
        
    }
   // cout <<"Next palindrom :";
    
    //print(vec);
    //cout << " vec_to_long long :  "<< vec_to_long long(vec)<<endl;
    long long re = vec_to_long(vec);
    return re;
}



int main (int argc, const char * argv[])
{    // cout <<"......... "<< jegop(10,9) <<" and " << jegop(10,10) << endl;
    long long num=0;
    long long result=0;
  
      /*
    while(true){
        
        cin>>num;
        clean(vec);
        make_vector(vec,num);
        cout << "vector size: " << vec.size() <<endl;
        generate_nextPalindrome(vec);
    }
     
  */
    
    while(true){
        vector<long long> vec;

        cin >> num;
        if( num ==0) return 0;
        result =0;
        //clean(vec);
        make_vector(vec,1);
    
        if( num != 1 && num <=1000000){
        for(long long i=1 ; i < num ; i++){
            result = generate_nextPalindrome(vec);
            //cout << "result ::" << result <<endl;
            clean(vec);
            make_vector(vec,result);
            
            
            }
            cout << result <<endl;

        }
        else if( num==1) {
            
        cout << 1 <<endl;
                            
        
    }
}
}


Last edited on
Topic archived. No new replies allowed.