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

            ArcTan

            dfs
            隨筆 - 16, 文章 - 117, 評論 - 6, 引用 - 0
            數據加載中……

            SRM550 DIV2 250PT(字符串水題)

            Problem Statement

                 We have a string originalWord. Each character of originalWord is either 'a' or 'b'. Timmy claims that he can convert it to finalWord using exactly k moves. In each move, he can either change a single 'a' to a 'b', or change a single 'b' to an 'a'.

            You are given the strings originalWord and finalWord, and the int k. Determine whether Timmy may be telling the truth. If there is a possible sequence of exactly k moves that will turn originalWord into finalWord, return "POSSIBLE" (quotes for clarity). Otherwise, return "IMPOSSIBLE".

            Definition

                
            Class: EasyConversionMachine
            Method: isItPossible
            Parameters: string, string, int
            Returns: string
            Method signature: string isItPossible(string originalWord, string finalWord, int k)
            (be sure your method is public)
                

            Notes

            - Timmy may change the same letter multiple times. Each time counts as a different move.

            Constraints

            - originalWord will contain between 1 and 50 characters, inclusive.
            - finalWord and originalWord will contain the same number of characters.
            - Each character in originalWord and finalWord will be 'a' or 'b'.
            - k will be between 1 and 100, inclusive.

            Examples

            0)
                
            "aababba"
            "bbbbbbb"
            2
            Returns: "IMPOSSIBLE"
            It is not possible to reach finalWord in fewer than 4 moves.
            1)
                
            "aabb"
            "aabb"
            1
            Returns: "IMPOSSIBLE"
            The number of moves must be exactly k=1.
            2)
                
            "aaaaabaa"
            "bbbbbabb"
            8
            Returns: "POSSIBLE"
            Use each move to change each of the letters once.
            3)
                
            "aaa"
            "bab"
            4
            Returns: "POSSIBLE"
            The following sequence of 4 moves does the job:
            aaa -> baa -> bab -> aab -> bab
            4)
                
            "aababbabaa"
            "abbbbaabab"
            9
            Returns: "IMPOSSIBLE"

            This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.


            字符串水題!

            249.23PT!!!

            #include <cstdio>
            #include 
            <cstdlib>
            #include 
            <cstring>
            #include 
            <cmath>
            #include 
            <ctime>
            #include 
            <cassert>
            #include 
            <iostream>
            #include 
            <sstream>
            #include 
            <fstream>
            #include 
            <map>
            #include 
            <set>
            #include 
            <vector>
            #include 
            <queue>
            #include 
            <algorithm>
            #define min(x,y) (x<y?x:y)
            #define max(x,y) (x>y?x:y)
            #define swap(t,x,y) (t=x,x=y,y=t)
            #define clr(list) memset(list,0,sizeof(list))

            using namespace std;

            class EasyConversionMachine{
            public:
                
            string isItPossible(string originalWord, string finalWord, int k)
                {
                    
            int n=originalWord.size();
                    
            int tot=0;
                    
            for (int i=0;i<n;i++)
                        
            if (originalWord[i]!=finalWord[i])
                            tot
            ++;
                    
            if (tot<=&& (k-tot)%2==0) //傻叉,這里剛剛開始搞反了,testing WA了一次
                        
            return "POSSIBLE";
                    
            return "IMPOSSIBLE";
                }
            };

            posted on 2012-07-22 10:02 wangs 閱讀(272) 評論(0)  編輯 收藏 引用 所屬分類: ACM-水題Topcoder

            7777精品久久久大香线蕉| 欧美伊人久久大香线蕉综合69| 久久久国产精华液| 久久无码人妻一区二区三区午夜 | 久久99久国产麻精品66| 亚洲AV日韩精品久久久久久久| 久久久久久久波多野结衣高潮| 成人午夜精品无码区久久| 久久91精品国产91久久麻豆| 久久人人爽人人爽人人片av麻烦| 亚洲AV日韩精品久久久久| 国产成人综合久久久久久| 国产麻豆精品久久一二三| 国产日韩久久免费影院| 久久这里只有精品18| 久久99精品久久久久久野外| 久久久久亚洲AV成人片| 久久经典免费视频| 99久久国产亚洲高清观看2024| 久久久久精品国产亚洲AV无码| 国产成人综合久久精品尤物| 色8久久人人97超碰香蕉987| 香蕉久久永久视频| 久久久免费观成人影院| 久久国产成人精品麻豆| 久久天天躁狠狠躁夜夜躁2O2O| 久久综合色区| 久久男人AV资源网站| 久久99久久99小草精品免视看| 97久久国产露脸精品国产| 色播久久人人爽人人爽人人片AV| 97精品国产97久久久久久免费| 国产精品久久永久免费| 久久99精品国产99久久6| 97精品国产91久久久久久| 久久精品aⅴ无码中文字字幕不卡| 午夜视频久久久久一区 | 一本色道久久88综合日韩精品 | 亚洲AV乱码久久精品蜜桃| 久久亚洲精品无码aⅴ大香| 久久精品成人免费国产片小草|