The answer in ALDS1_1_A of aizu online judge is correct, but it becomes WA.

#include<stdio.h>

void trace(intr[], intN){
    for(inti=0;i<N;i++){
      printf("%d", r[i]);
      if(i!=N-1){
        printf("";
      }
    }
    printf("\n");
}
int main() {
    
  intr[100];

  int N;
  scanf("%d", & N);
    for(inti=0;i<N;i++){
      scanf("%d", &r[i]);
    }

    trace(r,N);
    int j, i, v; 
    for(i=1;i<N;i++){
      v=r[i];
      j = i-1;

      while(v>=0&r[j]>v){
        r[j+1] = r[j];
        j--;
      }
      r[j+1] = v;
      trace(r,N);
    }
    
    return 0;
}