Submission #18110609

---

Source Code Expand

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
int N;
char S[7];
char T[7];
int main(){
  int i;
  rd(N);
  rd(S);
  for(i=(0);i<(N);i++){
    T[i] = S[i];
  }
  sort(T, T+N);
  do{
    for(i=(0);i<(N);i++){
      if(T[i] != S[i]){
        break;
      }
    }
    if(i==N){
      continue;
    }
    for(i=(0);i<(N);i++){
      if(T[i] != S[N-1-i]){
        break;
      }
    }
    if(i==N){
      continue;
    }
    wt_L(T);
    wt_L('\n');
    return 0;
  }
  while(next_permutation(T,T+N));
  wt_L("None");
  wt_L('\n');
  return 0;
}
// cLay varsion 20201115-2

// --- original code ---
// int N;
// char S[7], T[7];
// {
//   rd(N,S);
//   rep(i,N) T[i] = S[i];
//   sort(T, T+N);
//   do{
//     rep(i,N) if(T[i] != S[i]) break;
//     if(i==N) continue;
//     rep(i,N) if(T[i] != S[N-1-i]) break;
//     if(i==N) continue;
//     wt(T), return 0;
//   }while(next_permutation(T,T+N));
//   wt("None");
// }

Submission Info

Judge Result