• <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>

            技術,瞎侃,健康,休閑……

            mahu@cppblog 人類的全部才能無非是時間和耐心的混合物
            posts - 11, comments - 13, trackbacks - 0, articles - 12
              C++博客 :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理

            Self Numbers

            Posted on 2006-06-16 23:32 mahudu@cppblog 閱讀(826) 評論(0)  編輯 收藏 引用 所屬分類: C/C++
            ???

            In 1949 the Indian mathematician D.R. Kaprekar discovered a class

            of numbers called self-numbers. For any positive integer n, define

            d(n) to be n plus the sum of the digits of n. (The d stands

            for digitadition, a term coined by Kaprekar.) For example, d(75) = 75 + 7 + 5 = 87. Given any positive integer n as a starting

            point, you can construct the infinite increasing sequence of integers

            n, d(n), d(d(n)), d(d(d(n))), .... For example, if you start with

            33, the next number is 33 + 3 + 3 = 39, the next is 39 + 3 + 9 = 51, the next

            is 51 + 5 + 1 = 57, and so you generate the sequence

            33, 39, 51, 57, 69, 84, 96, 111, 114, 120, 123, 129, 141, ...

            The number n is called a generator of d(n). In the

            sequence above, 33 is a generator of 39, 39 is a generator of 51, 51

            is a generator of 57, and so on. Some numbers have more than one

            generator: for example, 101 has two generators, 91 and 100. A number

            with no generators is a self-number. There are thirteen

            self-numbers less than 100: 1, 3, 5, 7, 9, 20, 31, 42, 53, 64, 75, 86,

            and 97.

            Write a program to output all positive self-numbers less than 10000

            in increasing order, one per line.

            Output

            1
            3
            5
            7
            9
            20
            31
            42
            53
            64
            |
            | <-- a lot more numbers
            |
            9903
            9914
            9925
            9927
            9938
            9949
            9960
            9971
            9982
            9993

            Solution

            #include?<iostream>
            using?namespace?std;

            const?long?N?=?10000;?????//最大自然數
            char?Arr[N?+?9*4]={0};???//是否是被排除的數字??+9*4是為了要再多放4位數

            long?DealNum(long?n)
            {
            ??
            long?sum?=?n;
            ??
            while?(n?!=?0)
            ??
            {
            ????sum?
            +=?n%10;
            ????n?
            /=?10;
            ??}

            ??
            return?sum;
            }


            int?main()
            {
            ??
            int?i;
            ??
            for(i?=?1;?i?<?N;?i++)
            ??
            {
            ????Arr[DealNum(i)]?
            =?1;
            ??}

            ??
            for(i?=?1;?i?<?N;?i++)
            ??
            {
            ????
            if?(!Arr[i])
            ????????cout
            <<i<<endl;
            ??}

            ??
            return?0;
            }


            久久精品国产精品亚洲精品| 久久国产免费直播| 久久综合伊人77777| 99久久国产亚洲综合精品| 久久久久久亚洲精品成人| 久久电影网一区| 无码人妻久久一区二区三区蜜桃 | 女同久久| 久久婷婷五月综合97色| 久久99精品久久久久久野外| 久久久久亚洲av无码专区喷水| 国产精品熟女福利久久AV| 亚洲国产精品一区二区久久hs| 久久99国产一区二区三区| 久久精品亚洲中文字幕无码麻豆| 亚洲精品99久久久久中文字幕| 久久综合欧美成人| 久久久久久久久久久久中文字幕| 亚洲国产高清精品线久久| 91精品国产91久久| 久久国产精品77777| 97久久国产露脸精品国产| 亚洲国产高清精品线久久| 久久久久亚洲AV无码去区首| 91精品国产色综久久| 久久国产精品无码HDAV| 无码人妻精品一区二区三区久久 | 热久久国产欧美一区二区精品| 91视频国产91久久久| 7777久久亚洲中文字幕| 久久久久亚洲Av无码专| 无码久久精品国产亚洲Av影片 | 久久99精品国产麻豆蜜芽| 69久久精品无码一区二区| 久久九九精品99国产精品| 亚洲av日韩精品久久久久久a| 精品无码久久久久国产动漫3d| 久久天天婷婷五月俺也去| 亚洲综合日韩久久成人AV| 久久夜色精品国产噜噜噜亚洲AV| 人妻无码αv中文字幕久久 |