palindrom numbers.txt

以前ACM在哈工程HRBEU做的一些简单题目

#include <iostream>
#include <vector>
using namespace std;
int main() {
    while(1)
    {
        int number;
        cin >> number;
        if ( number == 0 )break;
        vector< int > result;
        for ( int i = 2; i <= 16; ++i ) {
            vector< int > newnum;
           int num = number;
            while ( num != 0 ) {
                newnum.push_back( num % i );
                num /= i;
            }

            int left = 0 , right = newnum.size( ) - 1;
            for ( ; left < right; ++left , --right ) {
                if ( newnum[ left ] != newnum[ right ] ) {
                    goto NOT;
                }
            }
            
            result.push_back( i );
        
            NOT:;
        }
    
        if ( result.size( ) > 0 ) {
            cout << "Number " << number << " is palindrom in basis ";
            vector< int >::iterator p = result.begin( );
            cout << *p;
            ++p;
            for ( ; p != result.end( ); ++p ) {
                cout << " " << *p;
            }
            cout << endl;
            
        } else {
            cout << "Number " << number << " is not a palindrom" << endl;
        }
        
        result.clear( );

    }
    
    return 0;
}