You are viewing a single comment's thread. Return to all comments →
int utopianTree(int n) { int x = (n+1)/2 + 1; return (n%2==1) ? pow(2, x) - 2: pow(2, x) - 1; }
Seems like cookies are disabled on this browser, please enable them to open this website
Utopian Tree
You are viewing a single comment's thread. Return to all comments →