• <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 - 195,  comments - 30,  trackbacks - 0

            You have decided that PGP encryptation is not strong enough for your email. You have decided to supplement it by first converting your clear text letter into Pig Latin before encrypting it with PGP.

            Input and Output

            You are to write a program that will take in an arbitrary number of lines of text and output it in Pig Latin. Each line of text will contain one or more words. A ``word'' is defined as a consecutive sequence of letters (upper and/or lower case). Words should be converted to Pig Latin according to the following rules (non-words should be output exactly as they appear in the input):

            1. Words that begin with a vowel (a, e, i, o, or u, and the capital versions of these) should just have the string ``ay'' (not including the quotes) appended to it. For example, ``apple'' becomes ``appleay''.
            2. Words that begin with a consonant (any letter than is not A, a, E, e, I, i, O, o, U or u) should have the first consonant removed and appended to the end of the word, and then appending ``ay'' as well. For example, ``hello'' becomes ``ellohay''.
            3. Do not change the case of any letter.

            Sample Input

            This is the input.

            Sample Output

            hisTay isay hetay inputay.

             


            雖然題目難度不是很大,但是對我啟發(fā)挺大,碰到這種字符串處理的題,最好就是統(tǒng)一模式,
                              a=getchar():
                               while(flag)
                       {      while()//判斷是否符合條件
                             { ----   ,
                                    if((a=getchar())==EOF)//獲取a=getchar()
                                              flag=0;//判斷文件是否結(jié)束
                              }
                               while()//判斷是否符合條件
                             { ----   ,
                                    if((a=getchar())==EOF)//獲取a=getchar()
                                              flag=0;//判斷文件是否結(jié)束
                              }
                          }
            #include<iostream>
            #include
            <cstdlib>
            using namespace std;

              
            int main()
              {
             
            // freopen("s.txt","r",stdin);
             
            // freopen("key.txt","w",stdout);
              char a;
              
            int flag=0,e=1,mark;
              
            string temp;
              
            char mar;
              a
            =getchar();
              
            while (e)
              {
                       mark
            =0;
                        
            while((a>='a'&&a<='z')||(a>='A'&&a<='Z'))
                      {
                        temp
            ="ay";
                         
            if(flag==0)
                        {
                             flag
            ++;
                             
            if(a=='A'||a=='a'||a=='E'||a=='e'||a=='I'||a=='i'||a=='O'||a=='o'||a=='U'||a=='u')
                             cout
            <<a;
                             
            else 
                            {
                                mark
            =1;
                                mar
            =a;
                            }
                       }
                        
            else
                      cout
            <<a;
                      
            if((a=getchar())==EOF)
                            {
                                e
            =0;
                                
            break;
                             }    
                     }
                      
            if(mark==1)
                       {
                            cout
            <<mar;
                       }    
                      cout
            <<temp;
                       
            while(a<'A'||a>'z'||(a>'Z'&&a<'a'))
                       {
                            cout
            <<a;
                            
            if((a=getchar())==EOF)
                            {
                                e
            =0;
                                
            break;
                             }    
                       } 
                       flag
            =0;   
              }
              
            //system("PAUSE");
              return   0;
              }
            posted on 2009-07-03 18:04 luis 閱讀(620) 評論(0)  編輯 收藏 引用 所屬分類: 格式.輸入輸出.數(shù)據(jù)類型
            <2009年7月>
            2829301234
            567891011
            12131415161718
            19202122232425
            2627282930311
            2345678

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久国产亚洲精品| 777午夜精品久久av蜜臀| 久久精品国产91久久综合麻豆自制| 亚洲精品无码久久久久去q| 久久Av无码精品人妻系列| 93精91精品国产综合久久香蕉| 日本精品久久久久影院日本| 韩国免费A级毛片久久| 中文字幕无码久久久| 女人香蕉久久**毛片精品| 亚洲欧美日韩中文久久| 久久性生大片免费观看性| 久久久久高潮毛片免费全部播放| 久久综合九色欧美综合狠狠| 99精品久久久久中文字幕| 久久精品国产亚洲av麻豆蜜芽| 久久精品国产只有精品2020| 亚洲伊人久久大香线蕉综合图片| 久久久久亚洲AV无码专区桃色| 国产精品久久国产精麻豆99网站| 欧美精品国产综合久久| 久久久久无码中| 精品久久久久久久久久久久久久久| 久久久久久亚洲AV无码专区| 亚洲精品无码久久久久久| 伊人色综合久久天天网| 久久久不卡国产精品一区二区 | 国产精品视频久久| 久久国产精品无码HDAV| 久久久久国产精品麻豆AR影院| 精品国产日韩久久亚洲| 日本道色综合久久影院| 精品久久久无码人妻中文字幕| 麻豆久久| 久久青青草视频| 久久综合九色综合网站| 国内精品人妻无码久久久影院导航 | 人人狠狠综合久久亚洲婷婷| 亚洲欧美日韩中文久久| 久久久噜噜噜www成人网| 亚洲va中文字幕无码久久|