1024. Palindromic Number (25)(-selfdone)
来源:互联网 发布:数据库两张表关联查询 编辑:程序博客网 时间:2024/09/21 06:17
- Palindromic Number (25)
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
#include<stdio.h>#include<string.h>typedef struct{ int digit[1010],len;}BigInt;BigInt transfer(char str[]){//将字符串转换为BinInt BigInt c={0}; c.len=strlen(str); int i; for(i=0;i<c.len;i++){ c.digit[i]=str[i]-'0'; } return c;}BigInt add(const BigInt a,const BigInt b){ BigInt c={0}; int carry=0; int i; for(i=0;i<a.len||i<b.len;i++){ int temp=a.digit[i]+b.digit[i]+carry; c.digit[c.len++]=temp%10; carry=temp/10; } if(carry!=0){ c.digit[c.len++]=carry; } return c;}BigInt reverse(const BigInt a){ BigInt c={0}; c.len=a.len; int i; for(i=0;i<a.len;i++){ c.digit[i]=a.digit[a.len-i-1]; } return c;}int judge(const BigInt a){ int i,flag=1; for(i=0;i<a.len/2;i++){ if(a.digit[i]!=a.digit[a.len-i-1]) flag=0; } return flag;}void print(const BigInt a){ int i; for(i=a.len-1;i>=0;i--){ printf("%d",a.digit[i]); }}int main(){ char str[1010]; int k,cnt=0; scanf("%s %d",str,&k); BigInt a,b; a=transfer(str); while(!judge(a)&&cnt<k){ b=reverse(a); a=add(a,b); cnt++; } print(a); printf("\n%d",cnt); return 0;}
- 1024. Palindromic Number (25)(-selfdone)
- 1019. General Palindromic Number (20)(-selfdone-easy)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 邮件排队发送机制
- iOS音频播放(二):AudioSession
- WEB 端批量移动设备管理控制工具 STF 的环境搭建和运行
- ehcache 集群使用 rmi方式
- MTK11B GPRS Network connection
- 1024. Palindromic Number (25)(-selfdone)
- filter设计模式-复杂的责任链-消除for循环小技巧.
- Handler post(Runnable runnable)和sendMessage(Message msg)的区别比较
- kvm安装学习笔记01
- 导入项目后src包变成文件夹
- ASP .Net Core 使用 Dapper 轻型ORM框架
- Ubuntu 终端中的字体,变成同一种颜色?
- Halcon中OCR的实现及关键函数解析
- 爬山