PAT甲级.1019. General Palindromic Number (20)

最新推荐文章于 2023-02-25 14:27:26 发布

原创最新推荐文章于 2023-02-25 14:27:26 发布 · 422 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#进制转换

PAT甲级专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个程序设计问题，即如何判断一个十进制整数在特定进制下是否构成回文数。文章提供了完整的代码实现，并通过具体的输入输出样例帮助理解。该算法首先将十进制数转换为目标进制，然后检查其是否正反读取一致。

1019. General Palindromic Number (20)

题目：

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.

Although palindromic numbers are most often considered in the decimal system, the concept of palindromicity can be applied to the natural numbers in any numeral system. Consider a number N > 0 in base b >= 2, where it is written in standard notation with k+1 digits ai as the sum of (aibi) for i from 0 to k. Here, as usual, 0 <= ai < b for all i and ak is non-zero. Then N is palindromic if and only if ai = ak-i for all i. Zero is written 0 in any base and is also palindromic by definition.

Given any non-negative decimal integer N and a base b, you are supposed to tell if N is a palindromic number in base b.

输入格式：

Each input file contains one test case. Each case consists of two non-negative numbers N and b, where 0 <= N <= 109 is the decimal number and 2 <= b <= 109 is the base. The numbers are separated by a space.

输出格式：

For each test case, first print in one line “Yes” if N is a palindromic number in base b, or “No” if not. Then in the next line, print N as the number in base b in the form “ak ak-1 … a0”. Notice that there must be no extra space at the end of output.

输入样例1：

27 2

输出样例1：

Yes
1 1 0 1 1

输入样例2：

121 5

输出样例2：

No
4 4 1

题意：

判断十进制整数n在b进制下是否是回文数

PAT链接

思路：

1.除基取余来转换进制

    do
    {
        ans[num++] = N % b;
        N = N / b;
    } while (N != 0);

2.判断位置i和位置num-1-i的数是否相同，有一个不相同就不是回文

 //判断是否是回文
    for (int i = 0; i <= num/2; ++i)
    {
        if(ans[i] != ans[num-1-i])
        {
            flag = 0;
            break;
        }
    }

代码：

/**
* @tag     PAT_A_1019
* @authors R11happy (xushuai100@126.com)
* @date    2016-8-19 23:05-23:17
* @version 1.0
* @Language C++
* @Ranking  240/3312
* @function 计算整数n在b进制下是否是回文数字
*/

#include <cstdio>
#include <cstdlib>
#include <cstring>

int main(int argc, char const *argv[])
{
    int ans[32]={0};
    int N, b;
    int num = 0;    //记录位数
    int flag = 1;   //标记是否为回文
    scanf("%d%d", &N, &b);
    //除基取余 来转换进制
    do
    {
        ans[num++] = N % b;
        N = N / b;
    } while (N != 0);
    //判断是否是回文
    for (int i = 0; i <= num/2; ++i)
    {
        if(ans[i] != ans[num-1-i])
        {
            flag = 0;
            break;
        }
    }
    if(flag)    printf("Yes\n");
    else    printf("No\n");
    for(int i = num-1; i > 0; i--)
    {
        printf("%d ", ans[i]);
    }
    printf("%d\n", ans[0]);
    return 0;
}

收获：

1.巩固了除基取余
2.末尾没有多余空格的处理

    for(int i = num-1; i > 0; i--)
    {
        printf("%d ", ans[i]);
    }
    printf("%d\n", ans[0]);