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

            ACM___________________________

            ______________白白の屋
            posts - 182, comments - 102, trackbacks - 0, articles - 0
            <2010年9月>
            2930311234
            567891011
            12131415161718
            19202122232425
            262728293012
            3456789

            常用鏈接

            留言簿(24)

            隨筆分類(332)

            隨筆檔案(182)

            FRIENDS

            搜索

            積分與排名

            最新隨筆

            最新評論

            閱讀排行榜

            評論排行榜

            //MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋

            題目地址 :
                     http://acm.hdu.edu.cn/showproblem.php?pid=1982

            PE了N次, 很糾結的一個題........  題目如下 :

            Problem Description
            Do you know Kaitou Kid? In the legend, Kaitou Kid is a master of disguise, and can take on the voice and form of anyone. He is not an evil person, but he is on the wrong side of the law. He's the very elusive phantom thief who never miss his prey although he always uses word puzzles to announce his targets before action.

            You are the leader of a museum. Recently, you get several priceless jewels and plan to hold an exhibition. But at the moment, you receive Kid's word puzzle... Fortunately, It seems Kid doesn’t want to trouble you, and his puzzle is very easy. Just a few minutes, You have found the way to solve the puzzle:

            (1) change 1 to 'A', 2 TO 'B',..,26 TO 'Z'
            (2) change '#' to a blank
            (3) ignore the '-' symbol, it just used to separate the numbers in the puzzle

            Input
            The first line of the input contains an integer C which means the number of test cases. Then C lines follow. Each line is a sentence of Kid’s word puzzle which is consisted of '0' ~ '9' , '-' and '#'. The length of each sentence is no longer than 10000.

            Output
            For each case, output the translated text.

            Sample Input
            4 9#23-9-12-12#19-20-5-1-12#1-20#12-5-1-19-20#15-14-5#10-5-23-5-12 1-14-4#12-5-1-22-5#20-8-5#13-21-19-5-21-13#9-14#20#13-9-14-21-20-5-19 1-6-20-5-18#20-8-5#15-16-5-14-9-14-7#15-6#20-8-5#5-24-8-9-2-9-20-9-15-14 7-15-15-4#12-21-3-11

            Sample Output
            I WILL STEAL AT LEAST ONE JEWEL AND LEAVE THE MUSEUM IN T MINUTES AFTER THE OPENING OF THE EXHIBITION GOOD LUCK


            剛開始是用的庫函數 strtok 對字符串進行處理,  直接敲完,沒有出現錯誤, 提交,悲劇開始了

            下面的是PE 的代碼 :
            //MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋

            #include 
            <iostream>
            #include 
            <cstdlib>
            #include 
            <cstring>
            using namespace std;
            char psw[10005];
            char sym[133];
            void setSym ( )
            {
                 
            int i;
                 
            char ch;
                 
            for ( ch = 'A', i = 1; i <= 26++ i , ++ ch )
                 {
                       sym[i] 
            = ch ;
                 } 

            string prs ( char *psw )
            {
                 
            string str;
                 
            int n = strlen ( psw );
                 
            int num = 0;
                 
            for ( int i = 0; i != n; ++ i )
                 {
                       
            if ( psw[i] != '-' )
                       {
                            num 
            = num * 10 + psw[i] - '0'
                       } 
                       
            else 
                       {
                            
            if ( num != 0 )
                            {
                                 str 
            += sym[num];
                            }
                            num 
            = 0
                       }
                 }
                 
            if ( num != 0 )
                 {
                      str 
            += sym[num];
                 }
                 
            return str;
            }
            int main ()
            {
                setSym ();
                
            int T;
                
            while ( scanf ( "%d\n",&T ) != EOF )
                {
                        
            while ( T -- )
                        {
                                gets ( psw );
                                
            string str;
                                
            char *ptr = strtok ( psw, "#" );
                                
            if ( strlen ( ptr ) != 0 )
                                     str 
            = prs ( ptr ); 
                                
            while ( ptr = strtok ( NULL, "#" ) )
                                {
                                       
            if ( strcmp ( ptr, "" ) != 0 )
                                       {
                                            str 
            += " ";
                                            str 
            += prs ( ptr ); 
                                       }
                                }
                                cout 
            << str << endl;; 
                        }           
                }
                
            return 0
            }

             最后在Ambition 大牛的提示下,成功AC, 因為strtok是忽視被截字符串的個數的 "-----######---##-#-#"
            這組數據應該輸出10個空格, 而我的代碼值能輸出3個.
            下面的是AC代碼 :
            //MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋

            #include 
            <iostream>
            #include 
            <cstdlib>
            #include 
            <cstring>
            using namespace std;
            char psw[20005];
            char temp[20005];
            char sym[133];
            void setSym ( )
            {
                 
            int i;
                 
            char ch;
                 
            for ( ch = 'A', i = 1; i <= 26++ i , ++ ch )
                 {
                       sym[i] 
            = ch ;
                 } 

            string prs ( char *psw )
            {
                 
            string str;
                 
            int n = strlen ( psw );
                 
            int num = 0;
                 
            for ( int i = 0; i != n; ++ i )
                 {
                       
            if ( psw[i] != '-' )
                       {
                            num 
            = num * 10 + psw[i] - '0'
                       } 
                       
            else 
                       {
                            
            if ( num != 0 )
                            {
                                 str 
            += sym[num];
                            }
                            num 
            = 0
                       }
                 }
                 
            if ( num != 0 )
                 {
                      str 
            += sym[num];
                 }
                 
            return str;
            }
            int main ()
            {
                setSym ();
                
            int T;
                
            while ( scanf ( "%d",&T ) != EOF )
                {
                        getchar ();
                        
            while ( T -- )
                        {
                                gets ( psw );
                                
            int len = strlen ( psw );
                                
            int beg = 0;
                                memset ( temp, 
            '\0'sizeof ( temp ) );
                                
            string str;
                                
            while ( psw[beg] != '\0' )
                                {
                                       
            int i = 0
                                       
            while ( psw[beg] != '#' && psw[beg] != '\0' )
                                       {
                                               temp[i
            ++= psw[beg++]; 
                                       }
                                       temp[i] 
            = '\0';
                                       
            string t = prs ( temp );
                                       
            if ( t.size() != 0 )
                                       {
                                            str 
            += t;
                                            
            if ( psw[beg] == '#' )
                                            {
                                                 str 
            += " "
                                            }  
                                       }
                                       
            else if ( psw[beg] == '#' )
                                       {
                                            str 
            += " "
                                       }
                                       beg 
            ++;
                                }
                                cout 
            << str << endl;
                                memset ( psw, 
            '\0'sizeof ( psw ) );
                        }           
                }
                
            return 0
            }

            弄了一個下午加一個晚上才 AC , 是自己把簡單問題想太復雜了............
            Roowe 神牛代碼 :
            //MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋

            #include 
            <iostream>
            #include 
            <stdio.h>
            #include 
            <string.h>
            #include 
            <ctype.h>
            using namespace std;
            char str[27]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
            char s[10001];
            int main()
            {
                
            int T,len,i,num;
                scanf(
            "%d",&T);
                getchar();
                
            while(T--)
                {
                    gets(s);
                    len
            =strlen(s);
                    
            for(i=0;i<len;i++)
                    {
                        
            if(isdigit(s[i]) && isdigit(s[i+1]))
                        {
                            num
            =10*(s[i]-'0')+s[i+1]-'0';
                            printf(
            "%c",str[num-1]);
                            i
            ++;
                            
            continue;
                        }
                        
            if(isdigit(s[i]) && !isdigit(s[i+1]))
                        {
                            num
            =s[i]-'0';
                            printf(
            "%c",str[num-1]);
                            
            continue;
                        }
                        
            if(s[i]=='#')   printf(" ");
                    }
                    printf(
            "\n");
                }
                
            return 0;
            }

            Feedback

            # re: HDOJ HDU 1982 Kaitou Kid - The Phantom Thief(1) ACM 1982 IN HDU   回復  更多評論   

            2010-09-19 09:06 by syx
            神牛這次和我離的不遠了啊!

            # re: HDOJ HDU 1982 Kaitou Kid - The Phantom Thief(1) ACM 1982 IN HDU [未登錄]  回復  更多評論   

            2011-05-12 12:03 by star
            #include "stdio.h"
            int main()
            {
            int t,x;
            char c;
            scanf("%d",&t);
            getchar();
            while(t--)
            {
            x=0;
            c=getchar();
            while(c!='\n')
            {
            if(c>='0'&&c<='9')
            {x*=10;x+=c-'0';}
            else
            {
            if(x>=1&&x<=26)
            printf("%c",x+'A'-1);
            if(c=='#')
            printf(" ");
            x=0;
            }
            c=getchar();
            }
            if(x>=1&&x<=26)
            printf("%c",x+'A'-1);
            printf("\n");
            }
            }
            一级女性全黄久久生活片免费 | 亚洲精品第一综合99久久| 四虎久久影院| 久久婷婷五月综合97色一本一本| 国产亚洲精品自在久久| 激情五月综合综合久久69| 久久久久久久久久久| avtt天堂网久久精品| 久久se精品一区二区影院| 久久久久亚洲AV片无码下载蜜桃 | 亚洲国产精品成人AV无码久久综合影院 | 漂亮人妻被黑人久久精品| 99久久精品国产高清一区二区| 久久精品视屏| 蜜桃麻豆www久久| 久久久久亚洲AV无码去区首| 色偷偷偷久久伊人大杳蕉| 色偷偷88888欧美精品久久久| 久久精品国产亚洲av日韩| 狠狠色丁香久久婷婷综合蜜芽五月| 奇米影视7777久久精品| 老司机午夜网站国内精品久久久久久久久| 久久久久久午夜精品| 久久香蕉国产线看观看乱码| 99久久精品免费看国产一区二区三区 | 久久国产热精品波多野结衣AV| 久久精品无码一区二区日韩AV| 97超级碰碰碰久久久久| 国产色综合久久无码有码| 午夜福利91久久福利| 久久久综合香蕉尹人综合网| 国产午夜精品久久久久九九| 久久国产色AV免费看| 人妻无码久久一区二区三区免费 | 久久精品国产清自在天天线| 99久久99久久| 日本福利片国产午夜久久| 伊人久久综在合线亚洲2019| 人人狠狠综合久久亚洲婷婷| 91精品久久久久久无码| 日韩精品久久久久久|