amrendra.in

codechef.com

CodeChef User | CodeChef

https://www.codechef.com/users/thecodegame

Code, Compile and Run. FAQ for problem setters. Top Contributors on Discuss. Raquo; Amrendra Kumar. Life begins at the end of your comfort zone. Global Rank / Country Rank. Your rank is calculated by considering 'India' as your country code. Program should read from standard input. And write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions]. Tab on the problem page. Below are the possible results:. The time now is:. At the start of the month and ...

thecodegame.wordpress.com

Prime Numbers by Sieve of Eratosthenes | theCodeGame

https://thecodegame.wordpress.com/2013/03/29/prime-numbers-by-sieve-of-eratosthenes

Let the coding begin …. Prime Numbers by Sieve of Eratosthenes. March 29, 2013. The algorithm works as follows. 1 Create a vector v of consecutive integers {2,3, LIMIT}. 2 Select p as the first prime number in the vector v, p=2. 3 Remove all multiples of p from the vector v. 4 set p equal to the next integer in vector v which has not been removed. 5 Repeat steps 3 and 4 until p. LIMIT, all the remaining numbers in the vector v are prime numbers. More about the algorithm here. And tagged Prime Numbers.

thecodegame.wordpress.com

Catalan Numbers | theCodeGame

https://thecodegame.wordpress.com/2012/09/14/catalan-numbers

Let the coding begin …. September 14, 2012. Catalan numbers form a sequence of natural numbers that occur in various counting problems. 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 4861946401452…. and so on. This sequence is very popular in many combinatorial problems. More on application of Catalan Numbers here. N 1) = 2n! We can also use this formula.

thecodegame.wordpress.com

Morris InOrder Tree Traversal, Tree Traversal without using extra space and without recursion | theCodeGame

https://thecodegame.wordpress.com/2012/09/13/morris-inorder-tree-traversal-tree-traversal-without-using-extra-space-and-without-recursion

Let the coding begin …. Morris InOrder Tree Traversal, Tree Traversal without using extra space and without recursion. September 13, 2012. We have the regular tree traversals that uses either recursion (function stack), or intentionally created stack to do the traversal in iterative way. But what do we do when we need to do a tree traversal without any extra space and without recursion. Can we think of getting to this node back by some way. Does Threaded Binary Tree. Here’s the C code. Ptr){ return; } / ...

thecodegame.wordpress.com

N numbers into 2N places | theCodeGame

https://thecodegame.wordpress.com/2012/09/13/n-numbers-into-2n-places

Let the coding begin …. N numbers into 2N places. September 13, 2012. Place N number from 1 to N, in 2N positions in such a way so that there are Exactly n. Number of cells between two placed locations of number n. One of the possible placement for 7 numbers in 14 positions is :. 0){ return permute(pos 1); } / go through all numbers FOR(i,1,N 1){ / if number is not used if(! Numbers[i]){ / if second place is in bound if(pos i 1 len&! This entry was posted in Backtracking. Catalan Numbers →.

thecodegame.wordpress.com

thecodegame | theCodeGame

https://thecodegame.wordpress.com/author/thecodegame

Let the coding begin …. Prime Numbers by Sieve of Eratosthenes. March 29, 2013. The algorithm works as follows. 1 Create a vector v of consecutive integers {2,3, LIMIT}. 2 Select p as the first prime number in the vector v, p=2. 3 Remove all multiples of p from the vector v. 4 set p equal to the next integer in vector v which has not been removed. 5 Repeat steps 3 and 4 until p. LIMIT, all the remaining numbers in the vector v are prime numbers. More about the algorithm here. Posted in Prime Numbers.