Hi here is a problem for you to ponder on. Was asked in one of the ACM's competition I suppose. The problem is that consider a spiral matrix increasing in cloackwise fashion like this one..
7 8 9 ... 6 1 2 5 4 3 The position of element 1 is considered to b (0,0). Write a code to find the position of the element entered. For example, if 3 is entered, answer is (1,1). If 5 is entered, answer is (-1,1)... (The element can be any positive number...)
