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

            USACO 1.2 Dual Palindromes

            想不到更有效的方法,數據量不大,直接暴力

            #include <iostream>
            #include 
            <fstream>

            using namespace std;

            ifstream fin(
            "dualpal.in");
            ofstream fout(
            "dualpal.out");

            #ifdef _DEBUG
            #define out cout
            #define in cin
            #else
            #define out fout
            #define in fin
            #endif

            int buf[33];

            bool isPal(int num, int base)
            {
                
            int cnt = 0;
                
            while(num!=0){
                    buf[cnt
            ++= num%base;
                    num
            /=base;
                }

                
            int max = (cnt-1)/2;

                
            for(int i=0;i<=max;++i){
                    
            if(buf[i]!=buf[cnt-1-i])
                        
            return false;
                }

                
            return true;
            }

            bool duaPal(int num)
            {
                
            int cnt = 0;
                
            for(int base=2;base<=10;++base){
                    
            if( isPal(num,base) ){
                        cnt
            ++;
                        
            if(cnt==2)
                            
            return true;
                    }
                }

                
            return false;
            }

            void solve()
            {
                
            int n,s;
                
            in>>n>>s;

                
            while(n--){
                   
            while(!duaPal(++s));
                   
            out<<s<<endl;
                }        
            }

            int main(int argc,char *argv[])
            {
              solve(); 
              
            return 0;
            }





            附原題:
            Dual Palindromes
            Mario Cruz (Colombia) & Hugo Rickeboer (Argentina)

            A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neither leading nor trailing zeroes, so 0220 is not a palindrome.

            The number 21 (base 10) is not palindrome in base 10, but the number 21 (base 10) is, in fact, a palindrome in base 2 (10101).

            Write a program that reads two numbers (expressed in base 10):

            • N (1 <= N <= 15)
            • S (0 < S < 10000)
            and then finds and prints (in base 10) the first N numbers strictly greater than S that are palindromic when written in two or more number bases (2 <= base <= 10).

            Solutions to this problem do not require manipulating integers larger than the standard 32 bits.

            PROGRAM NAME: dualpal

            INPUT FORMAT

            A single line with space separated integers N and S.

            SAMPLE INPUT (file dualpal.in)

            3 25

            OUTPUT FORMAT

            N lines, each with a base 10 number that is palindromic when expressed in at least two of the bases 2..10. The numbers should be listed in order from smallest to largest.

            SAMPLE OUTPUT (file dualpal.out)

            26
            27
            28


            posted on 2009-06-05 15:09 YZY 閱讀(1058) 評論(0)  編輯 收藏 引用 所屬分類: AlgorithmUSACO

            導航

            <2009年6月>
            31123456
            78910111213
            14151617181920
            21222324252627
            2829301234
            567891011

            統計

            常用鏈接

            留言簿(2)

            隨筆分類

            隨筆檔案

            搜索

            積分與排名

            最新評論

            閱讀排行榜

            精品国产乱码久久久久久1区2区| 久久精品亚洲欧美日韩久久| 亚洲国产另类久久久精品小说| 久久天堂AV综合合色蜜桃网 | 亚洲精品乱码久久久久久蜜桃| 中文字幕精品久久久久人妻| 久久精品国产亚洲AV高清热| 三级片免费观看久久| 99国产精品久久| 亚洲&#228;v永久无码精品天堂久久| 久久亚洲国产精品成人AV秋霞| 久久中文娱乐网| 亚洲色大成网站www久久九| 99久久亚洲综合精品网站| 久久人妻少妇嫩草AV蜜桃| 国内精品免费久久影院| 久久99免费视频| 久久久噜噜噜久久熟女AA片| 久久丫忘忧草产品| 亚洲婷婷国产精品电影人久久| 国产精品免费久久久久电影网| 996久久国产精品线观看| 99久久精品免费看国产一区二区三区 | .精品久久久麻豆国产精品| 亚洲日本久久久午夜精品| 久久久久久久久久免免费精品 | 久久青青草原精品影院| 久久这里只有精品18| 亚洲中文字幕无码久久2020| 久久久久久久免费视频| 伊人久久亚洲综合影院| 狠狠色丁香久久婷婷综合蜜芽五月 | 色噜噜狠狠先锋影音久久| 1000部精品久久久久久久久| 91精品国产综合久久精品| 久久99精品国产麻豆宅宅 | 久久久久久国产精品无码下载| 亚洲人成电影网站久久| 性色欲网站人妻丰满中文久久不卡| 亚洲av日韩精品久久久久久a| 久久久久久久97|