PAT 甲级 1024 Palindromic Number

原创 2016年05月31日 08:16:39

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
由于数字会超longlong int 所以用数组
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <map>
#include <string>

using namespace std;
typedef long long int LL;
char b[20005];
int a[20005];
int c[20005];
int k;
int len;
int add()
{
  int i=0;
  int j=0;
  int num=0;
  while((i<len&&j<len)||num!=0)
  {
    a[i]=(a[i]+c[j]+num);
    num=a[i]/10;
    a[i]%=10;
    i++;
    j++;
  }
  return i;
}
void fun()
{
  int cnt=0;
  for(int i=len-1;i>=0;i--)
    c[cnt++]=a[i];
}
int judge()
{
  int i=0;int j=len-1;
  while(i<=j)
  {
    if(a[i]!=a[j])
      return 0;
    i++,j--;
  }
  return 1;
}
void output(int x)
{
  for(int i=len-1;i>=0;i--)
    printf("%d",a[i]);
  cout<<endl;
  cout<<x<<endl;
}
int main()
{
  scanf("%s",b);
  scanf("%d",&k);
  int l=strlen(b);
  len=l;
  for(int i=0;i<len;i++)
    a[i]=b[i]-'0';
  if(judge())
  {
    output(0);
    return 0;
  }

  for(int i=1;i<=k;i++)
  {
    fun();
    len=add();
    if(judge())
    {
      output(i);
      return 0;
    }
  }
  output(k);
  return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

1024. Palindromic Number (25)-PAT甲级真题(大整数相加)

1024. Palindromic Number (25) A number that will be the same when it is written forwards or backwar...

浙大PAT 1024. Palindromic Number (25)

1024. Palindromic Number (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 160...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

PAT 1024. Palindromic Number

PAT 1024,回文数及大整数加法

pat-a1024. Palindromic Number (25

水题。。按步骤写就过了。。 #include #include #include using namespace std; bool ispro(string t){ int len=t.size...

PAT_A 1024. Palindromic Number (25)

1024. Palindromic Number (25)回文数

PAT (Advanced Level) 1024. Palindromic Number (25) 字符串反转相加

A number that will be the same when it is written forwards or backwards is known as a Palindromic Nu...

【PAT】1024. Palindromic Number (25)

1、题目地址:http://www.patest.cn/contests/pat-a-practise/10242、分析在做这答题的过程中很可能出现下面的思路:#include "stdio.h" l...

PAT A 1024. Palindromic Number (25)

题目

PAT (Advanced Level) Practise 1024 Palindromic Number (25)

1024. Palindromic Number (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 160...

PAT_1024: Palindromic Number

A number that will be the same when it is written forwards or backwards is known as a Palindromic Nu...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)