• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            付翔的專欄
            在鄙視中成長 記錄成長的點滴
            posts - 106,  comments - 32,  trackbacks - 0

            Reverse and Add



            The  reverse and add  function starts with a number, reverses its digits and adds the reverse to the original. If the sum is not a palindrome (meaning it does not give the same number read from left to right and right to left), we repeat this procedure until it does.

            For example, if we start with 195 as the initial number, we get 9,339 as the resulting palindrome after the fourth addition:

            195
            786
            1,473
            5,214
            591
            687
            3,741
            4,125
            + ---
            + ---
            + ---
            + ---
            786
            1,473
            5,214
            9,339

            This method leads to palindromes in a few steps for almost all of the integers. But there are interesting exceptions. 196 is the first number for which no palindrome has been found. It has never been proven, however, that no such palindrome exists.

            You must write a program that takes a given number and gives the resulting palindrome (if one exists) and the number of iterations/additions it took to find it.

            You may assume that all the numbers used as test data will terminate in an answer with less than 1,000 iterations (additions), and yield a palindrome that is not greater than 4,294,967,295.

            Input

            The first line will contain an integer N ( 0 < N$ \le$100), giving the number of test cases, while the next N lines each contain a single integer P whose palindrome you are to compute.

            Output

            For each of the N integers, print a line giving the minimum number of iterations to find the palindrome, a single space, and then the resulting palindrome itself.

            Sample Input

            3
            195
            265
            750

            Sample Output

            4 9339
            5 45254
            3 6666
            一個簡單的處理問題 直接用加法模板 過的 這個服務(wù)器由于是gcc標(biāo)準(zhǔn) 所有很多以前用習(xí)慣的函數(shù) 都不支持 如 strrev  還得自己寫個
            不過還好 不難

            貼上代碼
            #include <stdio.h>
            #include 
            <string.h>
            #include 
            <stdlib.h>
            const int maxn = 110;

            void add(char a[],char b[],char back[])
            {
                
            int i,j,k,up,x,y,z,l;
                
            char *c;
                
            if (strlen(a)>strlen(b)) l=strlen(a)+2else l=strlen(b)+2;
                c
            =(char *) malloc(l*sizeof(char));
                i
            =strlen(a)-1;
                j
            =strlen(b)-1;
                k
            =0;up=0;
                
            while(i>=0||j>=0)
                    {
                        
            if(i<0) x='0'else x=a[i];
                        
            if(j<0) y='0'else y=b[j];
                        z
            =x-'0'+y-'0';
                        
            if(up) z+=1;
                        
            if(z>9) {up=1;z%=10;} else up=0;
                        c[k
            ++]=z+'0';
                        i
            --;j--;
                }
                
            if(up) c[k++]='1';
                i
            =0;
                c[k]
            ='\0';
                
            for(k-=1;k>=0;k--)
                    back[i
            ++]=c[k];
                back[i]
            ='\0';
            }
            char *strrev(char *s)
            {
                
            if (s == NULL || s[0== '\0')
                    
            return s;    
                
            for (char t, *= s, *= s + strlen(s) - 1; p < q; p++, q--)
                    t 
            = *p, *= *q, *= t;
                
                
            return s;
            }
            bool isReverse(char str[])
            {
                
            char *temp;
                temp 
            = (char*)malloc(sizeof(char)*(strlen(str) +3));
                strcpy(temp,str);
                strrev(temp);
                
            //temp = strrev(str);
                if(strcmp(str,temp)==0)
                    
            return true;
                
            return false;
            }
            int main()
            {
                
            char str1[maxn],str2[maxn],back[maxn];
                
            int i,n,num,T;
                scanf(
            "%d\n",&T);
                
            while(T--)
                {
                    i 
            = 0;
                    gets(str1);
                    strcpy(str2,str1);
                    strrev(str2);
                    strcpy(back,
            "0");
                    
            while(!isReverse(str1))
                    {
                        add(str1,str2,back);
                        strcpy(str1,back);
                        strcpy(str2,str1);
                        strrev(str2);
                        i 
            ++;
                    }
                    printf(
            "%d %s\n",i,str1);

                }
                
                
            return 0;
            }


            posted on 2010-07-23 19:43 付翔 閱讀(287) 評論(0)  編輯 收藏 引用 所屬分類: ACM 數(shù)據(jù)結(jié)構(gòu)

            <2010年10月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(2)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            CSDN - 我的blog地址

            博客

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久久久97国产精华液好用吗| 中文字幕久久久久人妻| 国产精品美女久久久久网| 人妻精品久久无码专区精东影业| 无码超乳爆乳中文字幕久久 | 性做久久久久久久久浪潮| 婷婷久久综合九色综合绿巨人 | 久久久久久久波多野结衣高潮 | 蜜臀av性久久久久蜜臀aⅴ| 久久99热国产这有精品| 色99久久久久高潮综合影院| 久久亚洲私人国产精品vA| 久久激情五月丁香伊人| 久久精品人成免费| 欧美国产成人久久精品| 欧美精品一本久久男人的天堂| 色综合合久久天天给综看| 996久久国产精品线观看| 中文字幕日本人妻久久久免费 | 狠狠久久综合伊人不卡| 亚洲国产精品久久电影欧美| 青青久久精品国产免费看| 一本色道久久88加勒比—综合| 久久天天躁狠狠躁夜夜躁2014| 国产成人精品久久亚洲| 国产精品久久网| 久久香综合精品久久伊人| 久久久久久国产精品美女| 久久久久久国产a免费观看不卡| 国产精品岛国久久久久| 久久久久亚洲av无码专区喷水 | 国产69精品久久久久777| 久久久久久久波多野结衣高潮| 久久99精品国产99久久6| 久久亚洲国产中v天仙www| 国产国产成人精品久久| 久久九九全国免费| 99久久精品国产一区二区| 国产A级毛片久久久精品毛片| 国产精品热久久无码av| 久久精品不卡|