Submission #1575974

---

Source Code Expand

void main(){
  import std.stdio, std.string, std.conv, std.algorithm;
  import std.range;

  auto str=readln.chomp.to!(char[]);

  int[char] cnt;
  foreach(c; str){
    if(!(c in cnt)) cnt[c]=1;
  }

  bool g(char[] s){
    char tg=s[0];
    bool ok=true;
    foreach(c; s) ok&=(c==tg);
    return ok;
  }

  int f(char c, char[] s){
    int ret=0;
    while(!g(s)){
      foreach(i; 0..(s.length-1)){
        if(s[i+1]==c) s[i]=c;
      }
      /* if(s.back!=c) */ s.popBack;
      ret++;
    }
    return ret;
  }

  int mi=100;
  foreach(c, v; cnt){
    mi=min(mi, f(c, str.dup));
  }

  writeln(mi);
}

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  foreach(i, ref e; x){
    e=l[i].to!(typeof(e));
  }
}

Submission Info

Judge Result