1024. Palindromic Number (25)

1024. Palindromic Number (25)
 
 

  
  

   
   

    
    时间限制
   
   
   
   

    
    400 ms
    
    

   
   
  
  
  
  

   
   

    
    内存限制
   
   
   
   

    
    65536 kB
    
    

   
   
  
  
  
  

   
   

    
    代码长度限制
   
   
   
   

    
    16000 B
    
    

   
   
  
  
  
  

   
   

    
    判题程序
   
   
   
   

    
    Standard
   
   
  
  
  
  

   
   作者
  
  
  
  

   
   CHEN, Yue
   
   

  
  
 
 
 
 

  
  
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.
  
  
Non-palindromic numbers can be paired with palindromic ones via a series of operations. First, the non-palindromic number is reversed and the result is added to the original number. If the result is not a palindromic number, this is repeated until it gives a palindromic number. For example, if we start from 67, we can obtain a palindromic number in 2 steps: 67 + 76 = 143, and 143 + 341 = 484.
  
  
Given any positive integer N, you are supposed to find its paired palindromic number and the number of steps taken to find it.
  
  
Input Specification:
  
  
Each input file contains one test case. Each case consists of two positive numbers N and K, where N (<= 1010) is the initial numer and K (<= 100) is the maximum number of steps. The numbers are separated by a space.
  
  
Output Specification:
  
  
For each test case, output two numbers, one in each line. The first number is the paired palindromic number of N, and the second number is the number of steps taken to find the palindromic number. If the palindromic number is not found after K steps, just output the number obtained at the Kth step and K instead.
  
  Sample Input 1:
  
  
67 3

  
  Sample Output 1:
  
  
484
2

  
  Sample Input 2:
  
  
69 3

  
  Sample Output 2:
  
  
1353
3
  
  
输入N  K
  
  
steps=0
  
  
①看N是不是对称，是③；否则steps++，②
  
  
②若steps<K，令 N ：=N + N的数字反过来①；否则③
  
  
③输出此时的N，和steps
 
 

评测结果
 
 
时间
结果
得分
题目
语言
用时(ms)
内存(kB)
用户
7月30日
 18:50
答案正确
25
1024
C++
 (g++ 4.7.2)
1
436
datrilla
测试点
 
 
测试点
结果
用时(ms)
内存(kB)
得分/满分
0
答案正确
1
308
3/3
1
答案正确
1
308
3/3
2
答案正确
1
436
3/3
3
答案正确
1
180
2/2
4
答案正确
1
308
2/2
5
答案正确
1
180
3/3
6
答案正确
1
180
3/3
7
答案正确
1
180
2/2
8
答案正确
1
308
4/4

#include<iostream>     
#include<string>
using namespace std;  
bool IsPalindromic(string str)
{
  int index,len;
  len = str.size()-1;
  for (index = 0; index <= len; index++, len--)
    if (str[index] != str[len])return false;
  return true;
}
void str1_str2(string*str, int from, int to)
{
  int c, index, len;
  char strctemp;
  len = str[from].size()-1;
  str[to] = "\0";
  for (index = 0,c=0; index <=len; index++)
  {
    c+=str[from][index] - '0' + str[from][len - index] - '0';
    strctemp = c % 10 + '0';
    str[to] = strctemp + str[to];
    c /= 10; 
  }
  if (c !=  0)
  {
    strctemp = c + '0';
    str[to] = strctemp + str[to]; 
  }
}
int main()
{   
  string str[2];
  bool Flag;
  int  index,  K, tag=0;
  cin >> str[tag] >> K;
  Flag = true;
  index = 0;
  do 
  {
    if (IsPalindromic(str[tag]))
    { 
      Flag = false;
    }
    else
    {
      str1_str2(str, tag, 1 - tag);
      tag = 1 - tag;
      index++;
    }
  }while (index < K&&Flag);
  cout << str[tag] << endl << index << endl;
  system("pause");   
  return 0;
}