zoukankan      html  css  js  c++  java
  • 1024 Palindromic Number

    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 (≤) is the initial numer and K (≤) 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

    题意:

      判断一个数字是不是回文数字,如果不是则输出经过多少步反转然后再相加可以变成回文数字。

    思路:

      大数加法

    Code:

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 string s;
     6 
     7 void add(string r) {
     8     int carry = 0;
     9     int len = r.length();
    10     for (int i = 0; i < len; ++i) {
    11         s[i] = s[i] + r[i] + carry - '0';
    12         carry = 0;
    13         if (s[i] > '9') {
    14             carry = 1;
    15             s[i] -= 10;
    16         }
    17     }
    18     if (carry == 1) s += '1';
    19     reverse(s.begin(), s.end());
    20 }
    21 
    22 int main() {
    23     int k, step;
    24     cin >> s >> k;
    25     for (step = 0; step < k; ++step) {
    26         string r = s;
    27         reverse(r.begin(), r.end());
    28         if (r == s || step == k) break;
    29         add(r);
    30     }
    31     cout << s << endl << step << endl;
    32     return 0;
    33 }

    参考:

      https://www.cnblogs.com/codervivi/p/12900312.html

  • 相关阅读:
    v-charts 绘制柱状图、条形图、水球图、雷达图、折线图+柱状图,附官网地址
    vue-cli3 assets目录下的SASS文件中添加背景图片报错Module not found: Error: Can't resolve './@/assets/images/login.png'解决办法
    Vue UI 框架(pc、移动端)
    单页面应用 VS 多页面应用
    DOM重点核心总结
    JS之三种动态创建元素的区别
    DOM节点操作
    自定义属性
    CSS面试题
    CSS中定义变量,并使用变量设置属性值
  • 原文地址:https://www.cnblogs.com/h-hkai/p/13158189.html
Copyright © 2011-2022 走看看