Misdirection

There are NNN items on your shopping list, and you have NNN kinds of coupon that can save you some money on buying any of these items. At the mean time, you have DDD dollars in your pocket. How can you buy as many items as you can? Here you may use any cou

In a Group Programming Contest, each university is supposed to send n students who must compete independently. The universities are ranked according to the total score of their students. Your job is to generate the ranklist.It sounds like a simple problem

The standard form of a polynomial of degree nnn is P(x)=anxn+an−1xn−1+⋯+a1x+a0P(x)=a_nx_n+a_{n−1}x_{n−1}+⋯+a_1x+a_0P(x)=an​xn​+an−1​xn−1​+⋯+a1​x+a0​. Given that an=1a_n=1an​=1 and all the nnn roots r1,...,rn{ r_1, ..., r_n}r1​,...,rn​ of P(x)P(x)P(x) are i

The index of popularity (IP) of someone in his/her circle of friends is defined to be the number of friends he/she has in that circle. Now you are supposed to list the members in any given friend circle with top 3 IP’s.Input Specification:Each input file

In computer science, an AVL tree (Georgy Adelson-Velsky and Evgenii Landis’ tree, named after the inventors) is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees

This time your job is to output a sequence of NNN positive integers in a zigzag format with width MMM in non-decreasing order. A zigzag format is to fill in the first row with MMM numbers from left to right, then the second row from right to left, and so o

A happy number is defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits in base-ten, and repeat the process until the number either equals 1 (where it will stay), or it loops endles