#include #include using namespace std; //input any +ve number you want to find string at that position or leave it empty for default (9 -> SLS) //in this program I have assumed L to be 1 and S to be 0 void checkleft(int a[],int r)/*this function checks if there is an L (in program L corresponds to 1)just left to the current position and if there is and the current position is changing from L to S then that position changes too */ { a[r]=0; if(a[r-1]==1) checkleft(a,r-1); else { a[r-1]=1; return; } } /* e.g. suppose we are at SLL (acc to my program we are at 011) we change our right most L to S (right most 1 to 0) checks whether the position just left to this position contains an L or not (1 or not) if L found(1 found) changes it to S (to 0) now as at this position L(the middle position in the given string) is being changed into S we check the next position just left to this and operate it in the same way */ int main() { int n=9,r; cin>>n; try { if(n<=0) throw n; float(log2(n+2))==log2(n+2)?r=log2(n+2)-1:r=log2(n+2);//this variable determines the number of letters in the string which is at the position n //e.g. r=1 for S, r=3 for SLS int a[r],k=r-1;//k is index for(int i=0;i

Nth Term (challenge #46)