Palindrome Numbers UVA - 12050（第几个回文数）

长度为k的回文串个数有9*10^(k-1)

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#define MOD 2018
#define LL long long
#define ULL unsigned long long
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _  ios_base::sync_with_stdio(0),cin.tie(0)
//freopen("1.txt", "r", stdin);
using namespace std;
const int maxn = , INF = 0x7fffffff;
int num[maxn], a[maxn];
void init()
{
    num[] = num[] = ;
    for(int i=; i<; i+=)
        num[i] = num[i+] = num[i-] * ;
}

int main()
{
    init();
    LL n;
    while(cin>> n && n)
    {
        mem(a, );
        int len = ;
        while(n - num[len] > )
        {
            n -= num[len];
            len++;
        }
        n--;
        for(int i=len/+; i<=len; i++)
        {
            a[i] = n%;
            n /= ;
        }
        a[len]++;
        for(int i=; i<=len/; i++)
            a[i] = a[len-i+];
        for(int i=; i<=len; i++)
            printf("%d", a[i]);
        printf("\n");

    }
    return ;
}