CodeForces 264A Escape from Stones dfs

CodeForces 264A Escape from Stones dfs

Question link: Click the open link

Question: There is an interval [0, 1] at the beginning.

Fill in I in the middle of each operation, and then choose to sit half or right half of the segment (the scheme is provided, and then output the I filled in from left to right)

(I = 1 2 3 ···)

# Include

 
  
Char s [1000005]; void dfs (int x) {if (s [x] = 0) return; if (s [x] = 'l ') {dfs (x + 1); printf ("% d \ n", x + 1);} else {printf ("% d \ n", x + 1 ); dfs (x + 1) ;}} int main () {scanf ("% s", s); dfs (0); return 0 ;}