SRM550 Div2 Easy(250)

TopCoder

EasyConversionMachine

originalWordをfinalWordに書き換えて、残り回数が偶数なら可能。

#include <string>
using namespace std;

class EasyConversionMachine{public:
string isItPossible( string originalWord, string finalWord, int k )
{
    for ( int i=0; i<(int)originalWord.length(); i++ )
        if ( originalWord[i]!=finalWord[i] )
            k--;
    if ( k>=0 && k%2==0 )
        return "POSSIBLE";
    else
        return "IMPOSSIBLE";
}};