• <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ù)類型
            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久精品视频91| 精品久久人妻av中文字幕| 中文字幕久久欲求不满| 99久久久久| 久久久久久久久66精品片| 久久精品亚洲精品国产色婷| 久久精品国产亚洲AV大全| 精品久久久久久无码中文野结衣| 久久这里只精品99re66| 精品午夜久久福利大片| 狠狠色丁香久久婷婷综合图片| 亚洲精品乱码久久久久久| 国产精品亚洲美女久久久| 久久久久久久久久久| 国产精品美女久久久免费| 欧美亚洲色综久久精品国产| 欧美久久久久久午夜精品| 国产精品久久久久无码av| 精品国产乱码久久久久久人妻 | 久久综合九色欧美综合狠狠| 欧美午夜精品久久久久免费视| 久久精品国产一区二区| 久久亚洲综合色一区二区三区| 久久久久亚洲AV无码观看| 色偷偷91久久综合噜噜噜噜| 久久精品草草草| 精品蜜臀久久久久99网站| 亚洲愉拍99热成人精品热久久| 久久久青草青青国产亚洲免观| 成人免费网站久久久| 欧美黑人激情性久久| 午夜精品久久久久久中宇| 免费无码国产欧美久久18| 久久久久亚洲精品无码网址| 国产精品免费久久久久影院| 中文字幕久久欲求不满| 91秦先生久久久久久久| 97精品伊人久久久大香线蕉| 国产L精品国产亚洲区久久| 国产AⅤ精品一区二区三区久久| 久久综合综合久久狠狠狠97色88|