• <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年8月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            2930311234

            常用鏈接

            留言簿(24)

            隨筆分類(332)

            隨筆檔案(182)

            FRIENDS

            搜索

            積分與排名

            最新隨筆

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            //MiYu原創(chuàng), 轉(zhuǎn)帖請(qǐng)注明 : 轉(zhuǎn)載自 ______________白白の屋

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

            PE了N次, 很糾結(jié)的一個(gè)題........  題目如下 :

            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


            剛開始是用的庫(kù)函數(shù) strtok 對(duì)字符串進(jìn)行處理,  直接敲完,沒(méi)有出現(xiàn)錯(cuò)誤, 提交,悲劇開始了

            下面的是PE 的代碼 :
            //MiYu原創(chuàng), 轉(zhuǎn)帖請(qǐng)注明 : 轉(zhuǎn)載自 ______________白白の屋

            #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, 因?yàn)閟trtok是忽視被截字符串的個(gè)數(shù)的 "-----######---##-#-#"
            這組數(shù)據(jù)應(yīng)該輸出10個(gè)空格, 而我的代碼值能輸出3個(gè).
            下面的是AC代碼 :
            //MiYu原創(chuàng), 轉(zhuǎn)帖請(qǐng)注明 : 轉(zhuǎn)載自 ______________白白の屋

            #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
            }

            弄了一個(gè)下午加一個(gè)晚上才 AC , 是自己把簡(jiǎn)單問(wèn)題想太復(fù)雜了............
            Roowe 神牛代碼 :
            //MiYu原創(chuàng), 轉(zhuǎn)帖請(qǐng)注明 : 轉(zhuǎn)載自 ______________白白の屋

            #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   回復(fù)  更多評(píng)論   

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

            # re: HDOJ HDU 1982 Kaitou Kid - The Phantom Thief(1) ACM 1982 IN HDU [未登錄](méi)  回復(fù)  更多評(píng)論   

            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");
            }
            }
            欧美午夜A∨大片久久 | 久久精品国产亚洲AV不卡| 久久精品国产亚洲av麻豆蜜芽| 热久久这里只有精品| 97久久国产露脸精品国产| 一本大道久久a久久精品综合| 亚洲国产精品高清久久久| 久久精品国产亚洲av水果派 | 久久综合九色综合精品| 国产精品久久久久久影院| 996久久国产精品线观看| 午夜精品久久久久久久| 一本大道加勒比久久综合| 国产精品天天影视久久综合网| 久久久久免费精品国产| 日韩av无码久久精品免费| 亚洲国产精品久久久久网站| 中文国产成人精品久久亚洲精品AⅤ无码精品 | 色偷偷久久一区二区三区| 久久久久成人精品无码中文字幕 | 狠狠色婷婷久久一区二区三区| 97精品国产97久久久久久免费| 99久久免费只有精品国产| 久久精品国产WWW456C0M| 国产精品久久波多野结衣| 亚洲国产日韩综合久久精品| 99久久精品免费看国产一区二区三区 | 亚洲精品高清国产一久久| 久久成人国产精品| 亚洲国产成人久久综合野外| 亚洲中文字幕无码久久2017| 综合久久一区二区三区| 国产福利电影一区二区三区,免费久久久久久久精 | avtt天堂网久久精品| 久久久精品国产亚洲成人满18免费网站| 亚洲七七久久精品中文国产| 久久免费99精品国产自在现线 | 久久99精品久久久久久齐齐| 亚洲综合久久综合激情久久| 一本一道久久精品综合| 色综合合久久天天综合绕视看|