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<iostream>
#include<string>
#include<queue>
#include<map>
using namespace std;struct D{string s;int n;};main(){map<int,int>C;string s;int i,n,F;for(C[217]=98,C[201]='r',C[212]='g';cin>>s,s!="0";F?puts("NA"):printf("%d\n",n)){map<string,int>M;queue<D>q;D d={s,0};q.push(d);for(M[s]=1;q.size();){d=q.front();q.pop();s=d.s;n=d.n;for(i=F=0;++i<s.size();)if(s[i-1]-s[i]){D d={s,n+1};d.s[i-1]=d.s[i]=C[s[i-1]+s[i]];if(M.find(d.s)==M.end())q.push(d);F=M[d.s]=1;}if(!F)break;}}}

C++: #include <iostream>
#include <string>
#include <queue>
#include <utility>
#include <set>
using namespace std;
typedef pair<string,int> P;
int main() {
	string S;
	while(cin>>S) {
		set<string> ST;
		queue<P> Q;
		Q.push(P(S,0));
		string R,G,B;
		bool OK;
		while(!Q.empty()) {
			P p=Q.front();Q.pop();
			OK=true;
			for(int i=0;i<p.first.size()-1;i++) {
				string SS=p.first;
				if((p.first[i]=='r'&&p.first[i+1]=='g')||(p.first[i]=='g'&&p.first[i+1]=='r')) {
						SS[i]=SS[i+1]='b';
						if(ST.find(SS)==ST.end()){
							Q.push(P(SS,p.second+1));
							ST.insert(SS);
						}
						OK=false;
				}else if((p.first[i]=='r'&&p.first[i+1]=='b')||(p.first[i]=='b'&&p.first[i+1]=='r')) {
						SS[i]=SS[i+1]='g';
						if(ST.find(SS)==ST.end()){
							Q.push(P(SS,p.second+1));
							ST.insert(SS);
						}
						OK=false;
				}else if((p.first[i]=='g'&&p.first[i+1]=='b')||(p.first[i]=='b'&&p.first[i+1]=='g')) {
						SS[i]=SS[i+1]='r';
						if(ST.find(SS)==ST.end()){
							Q.push(P(SS,p.second+1));
							ST.insert(SS);
						}
						OK=false;
				}
			}
			if(OK) {cout<<p.second<<endl;break;}
		}
		if(!OK)cout<<"NA"<<endl;
	}
}

C++: #include <iostream>
#include <string>
#include <map>
#include <queue>
#include <cstring>
using namespace std;

int ar[11], ag[11], ab[11];
bool checked[59049];
int p3[11];
int change[9] = {0, 8, 4, 8, 4, 0, 4, 0, 8};

int conv(string s) {
    int ret = 0;
    for (int i=0; i<(int)s.size(); ++i) {
        ret *= 3;
        if (s[i] == 'g') ret += 1;
        if (s[i] == 'b') ret += 2;
    }
    return ret;
}

int rotate(int x, int n) {
    int ret = 0;
    for (int i=0; i<n; ++i) {
        ret = ret * 3 + (x % 3 + 1) % 3;
        x /= 3;
    }
    return ret;
}

int main() {
    p3[0] = 1;
    for (int i=1; i<=10; ++i) {
        p3[i] = p3[i-1] * 3;
    }
    ar[0] = ag[0] = ab[0] = 0;
    for (int i=1; i<=10; ++i) {
        ar[i] = ar[i-1];
        ag[i] = ag[i-1] * 3 + 1;
        ab[i] = ab[i-1] * 3 + 2;
    }
    string s;
    while (cin >> s, s != "0") {
        memset(checked, false, sizeof checked);
        int n = s.size();
        int first = conv(s);
        queue<pair<int,int> > q;
        q.push(make_pair(first, 0));
        checked[first] = true;
        int res = -1;
        while ( ! q.empty()) {
            int col = q.front().first;
            int t = q.front().second;
            q.pop();
            if (col == ar[n] || col == ag[n] || col == ab[n]) {
                res = t;
                break;
            }
            for (int i=0; i<n-1; ++i) {
                int replace = change[(col / p3[i]) % 9];
                int nx = (col / p3[i+2]) * p3[i+2] + replace * p3[i] + (col % p3[i]);
                if ( ! checked[nx]) {
                    q.push(make_pair(nx, t+1));
                    checked[nx] = true; nx = rotate(nx, n);
                    checked[nx] = true; nx = rotate(nx, n);
                    checked[nx] = true;
                }
            }
        }
        if (res < 0) {
            cout << "NA" << endl;
        } else {
            cout << res << endl;
        }
    }
    return 0;
}