500.IntegerPalindrome TC-srm302

Problem Statement
	A positive integer is called a palindrome if it reads the same forward and backward. Integers containing leading zeros are not valid. For example, 12321 is a palindrome, but 123210 is not. You are given an intK. Return the K-th palindrome, where the 0th palindrome is 1, the 1st palindrome is 2, etc.
Definition
	Class: IntegerPalindrome Method: findByIndex Parameters: int Returns: long long Method signature: long long findByIndex(int K) (be sure your method is public)
Constraints
-	K will be between 0 and 1000000000 (109), inclusive
Examples
0)
	8 Returns: 9
1)
	9 Returns: 11
2)
	19 Returns: 111
3)
	235 Returns: 13731
4)
	23746 Returns: 137484731

(转)http://www.notonlysuccess.com/index.php/tc-srm302exercise/#more-547
询问从1开始第K大的回文数

long long findByIndex(int K)

可以发现每个回文数其实都是由他的一半部分构造成的，所以倒过来想，123可以变成12321和123321，所以有一下结论：

从小到大的回文数的(括号里是生成它的自然数)
1(1),2(2)...8(8),9(9)
11(1),22(2)...88,(8)99(9)
101(10),111(11)...989(98),999(99)
1001(10),1111(11)...9889(98),9999(99)
10001(100)......

也就是每个自然数可以变成两个回文数,并且是以9，90，900…为一组的，于是我们就可以早到第k大的回文数所在的组数并把它计算出来
这种先确定所在组，后在组中计算出的思想

#include<stdio.h>
#include<string.h>
typedef long long  lld;

class IntegerPalindrome{
public:
	lld findByIndex(int K)
	{
		if(K==0)
			return 1;
		K++;
		lld n=0;
		while((n*10+9)*2<K)
		{
			n=n*10+9;
		}
		lld m=n*10+9;
		lld ret;
		lld tmp;
		if(m-n>=K-n*2)
		{
			ret=K-n;
			tmp=ret/10;
			while(tmp)
			{
				ret=ret*10+tmp%10;
				tmp/=10;
			}
		}
		else
		{
			ret=(K-m);
			tmp=ret;
			while(tmp)
			{
				ret=ret*10+tmp%10;
				tmp/=10;
			}			
		}
		return ret;
	}

};