Go: package main

import (
    "bufio"
    "os"
    "fmt"
)

var sc = bufio.NewScanner(os.Stdin)

/**************  Cell  *****************/
type Cell struct {
    item interface{}
    next *Cell
    prev *Cell
}

func NewCell(x interface{}, ne *Cell, pr *Cell) *Cell {
    newCp := new(Cell)
    newCp.item = x
    newCp.next = ne
    newCp.prev = pr
    return newCp
}
/************  End Cell  ***************/

/**************  Queue  ****************/
type Queue struct {
    size int
    front *Cell
    rear *Cell
}

func NewQueue() *Queue {
    return new(Queue)
}

func (q *Queue) Push(x interface{}) {
    newNode := NewCell(x, nil, nil)
    if q.size == 0 {
        q.front = newNode
        q.rear = newNode
    } else {
        newNode.prev = q.rear
        q.rear.next = newNode
        q.rear = newNode
    }
    q.size++
}

func (q *Queue) PopLeft() interface{} {
    if q.size == 0 {
        return nil
    } else {
        x := q.front.item
        if q.size == 1 {
            q.front = nil
            q.rear = nil
        } else {
            q.front = q.front.next
            q.front.prev = nil
        }
        q.size--
        return x
    }
}

func (q *Queue) IsEmpty() bool {
    return q.size == 0
}

func (q *Queue) Length() int {
    return q.size
}

type State struct {
    color string
    cnt int
}

func main() {
    for {
        sc.Scan()
        init := sc.Text()
        if init == "0" {
            break
        }
        bfs(init)
    }
}

func bfs(init string) {
    dic := make(map[string]int)
    que := NewQueue()
    que.Push(State{init, 0})
    length := len(init)
    isSolved := false
    for !que.IsEmpty() {
        state := que.PopLeft().(State)
        _, ok := dic[state.color]
        if ok {
            continue
        } else {
            dic[state.color] = state.cnt
        }

        if isSingleColor(state.color) {
            fmt.Println(state.cnt)
            isSolved = true
            break
        }

        for i := 0;i < length - 1; i++ {
            color1, color2 := string(state.color[i]), string(state.color[i + 1])
            if color1 != color2 {
                color3 := other(color1, color2)
                if i <= length - 2 {
                    que.Push(State{state.color[:i] + color3 + state.color[i + 2:], state.cnt + 1})
                } else {
                    que.Push(State{state.color[:i] + color3, state.cnt + 1})
                }
            }
        }
    }
    if !isSolved {
        fmt.Println("NA")
    }
}

func other(color1, color2 string) string {
    if color1 == "r" {
        if color2 == "g" {
            return "bb"
        } else if color2 == "b" {
            return "gg"
        }
    } else if color1 == "g" {
        if color2 == "r" {
            return "bb"
        } else if color2 == "b" {
            return "rr"
        }
    } else if color1 == "b" {
        if color2 == "r" {
            return "gg"
        } else if color2 == "g" {
            return "rr"
        }
    }
    return ""
}

func isSingleColor(color string) bool {
    for _, c := range color {
        if string(c) != string(color[0]) {
            return false
        }
    }
    return true
}

C++: #include <bits/stdc++.h>

#define FOR(i, n, m) for(int i = (n);i < (m);i++)
#define REP(i, n) for(int i = 0;i < (n);i++)
#define PII pair<int, int>

using namespace std;

string worm;

int all(string a){
    char b = a[0];
    int cnt = 0;
    for(int i = 1;a[i] != '\0';i++){
        if(a[i] != b)
            cnt++;
    }
    return cnt;
}

int solve(){
    queue< pair<string, int> > que;
    map<string, int> m;
    que.push(pair<string, int>(worm, 0));
    string worm1, tmp;
    int num;

    if(all(worm) == 0){
        return 0;
    }

    while(que.size()){
        worm1 = que.front().first;
        num = que.front().second;
        que.pop();

        if(m[worm1]) continue;

        if(all(worm1) == 1){
            continue;
        }else if(all(worm1) == 0){
            return num;
        }

        if(num >= 10){
            return -1;
        }
        for(int i = 0;i < strlen(worm1.c_str())-1;i++){
            tmp = worm1;
            if(worm1[i] != worm1[i+1]){
                if((worm1[i] == 'b' && worm1[i+1] == 'g') || (worm1[i] == 'g' && worm1[i+1] == 'b')){
                    tmp[i] = tmp[i+1] = 'r';
                    que.push(pair<string, int>(tmp, num+1));
                }else if((worm1[i] == 'b' && worm1[i+1] == 'r') || (worm1[i] == 'r' && worm1[i+1] == 'b')){
                    tmp[i] = tmp[i+1] = 'g';
                    que.push(pair<string, int>(tmp, num+1));
                }else{
                    tmp[i] = tmp[i+1] = 'b';
                    que.push(pair<string, int> (tmp, num+1));
                }
            }
        }
    }

    return -1;
}

int main(void){
    cin >> worm;
    while(worm[0] != '0'){
        int result = solve();
        if(result >= 0){
            cout << result << endl;
        }else{
            cout << "NA" << endl;
        }
        cin >> worm;
    }

    return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

int main(){
  while(true){
    string s;
    cin>>s;
    if(s=="0")break;
    string sr(s.size(),'r');
    string sg(s.size(),'g');
    string sb(s.size(),'b');
    map<string,int> mp;
    queue<string> q;
    q.push(s);
    mp[s]=0;
    int f=0;
    if(s==sr||s==sb||s==sg){
      cout<<0<<endl;
    }else{
      //for(int i=0;i<1e6;i++){
      while(!q.empty()){
        string x=q.front();
        q.pop();
        for(int j=0;j<s.size()-1;j++){
          string y=x;
          if(y[j]=='r'&&y[j+1]=='g'){
            y[j]='b';
            y[j+1]='b';
          }else if(y[j]=='b'&&y[j+1]=='g'){
            y[j]='r';
            y[j+1]='r';
          }else if(y[j]=='r'&&y[j+1]=='b'){
            y[j]='g';
            y[j+1]='g';
          }else if(y[j]=='g'&&y[j+1]=='b'){
            y[j]='r';
            y[j+1]='r';
          }else if(y[j]=='g'&&y[j+1]=='r'){
            y[j]='b';
            y[j+1]='b';
          }else if(y[j]=='b'&&y[j+1]=='r'){
            y[j]='g';
            y[j+1]='g';
          }
          //cout<<mp[x]+1<<" "<<y<<endl;
          if(y==sr||y==sb||y==sg){
            cout<<mp[x]+1<<endl;
            f=1;
            break;
          }
          if(mp[y]==0){
            mp[y]=mp[x]+1;
            q.push(y);
          }
        }
        if(f)break;
      }
      if(!f)cout<<"NA"<<endl;
    }
  }
}