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

             


            雖然題目難度不是很大,但是對(duì)我啟發(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 閱讀(618) 評(píng)論(0)  編輯 收藏 引用 所屬分類: 格式.輸入輸出.數(shù)據(jù)類型
            <2009年7月>
            2829301234
            567891011
            12131415161718
            19202122232425
            2627282930311
            2345678

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久天天躁狠狠躁夜夜躁2O2O| 蜜桃麻豆www久久国产精品| 77777亚洲午夜久久多喷| 人妻无码αv中文字幕久久琪琪布| 亚洲精品蜜桃久久久久久| 777米奇久久最新地址| 国产一区二区精品久久凹凸 | 久久久久这里只有精品| 久久露脸国产精品| avtt天堂网久久精品| 狠狠人妻久久久久久综合| 亚洲成色WWW久久网站| 国产成人99久久亚洲综合精品| 91麻豆国产精品91久久久| 久久精品国产99国产精偷| 国产精品久久久久久久人人看 | 欧美性猛交xxxx免费看久久久| 国产偷久久久精品专区| 香港aa三级久久三级| 亚洲精品乱码久久久久久蜜桃图片 | 伊人久久综合无码成人网| 四虎影视久久久免费| 国内精品久久久久久久97牛牛| 久久www免费人成看国产片| 91精品国产色综合久久| 无遮挡粉嫩小泬久久久久久久| 久久久久无码国产精品不卡| 99久久精品无码一区二区毛片| 97久久精品无码一区二区| 久久精品国产免费观看三人同眠| 99久久亚洲综合精品成人| 欧美亚洲国产精品久久蜜芽| 久久精品黄AA片一区二区三区| 波多野结衣AV无码久久一区| 2021国内久久精品| 国产成人精品久久| 色综合久久中文字幕无码| 亚洲欧美日韩中文久久| 久久精品国产亚洲av麻豆小说 | 久久国产一区二区| 伊人久久大香线蕉精品|