2019

    Budget HDU-6575

    This is a rounding problem. Since it has only three number after the point, you just need to find the last number n and if it's more than four...

    Worker HDU-6576

    This problem is gcd or lcm problem.

    Binary Tree Traversal

    There are mainly three ways of binary tree traversal. In-order, Preorder and Post-order.

    For example we have a simple three-node tree like this.

    Haffman Coding

    Assume that we have a bunch of points, each point has a number means the occurrence times of the point.

    List Summary

    I’ve been studying Data Structure for a while and now I sum up some knowledges.

    Xiongnu's Land

    The core of the problem is Dichotomy which is Binary search the best range of the X.

    World Cup

    For me, the core of the problem is to figure out how the matches carry on exactly. It's the hardest part for me.

    Rising Sun

    Position of the house can be divided into two situation, Uphill slope and Downhill slope. And the two situations are used to calculate the Y position of the house.

    Voronoi Diagram Returns

    From the description above we can draw that the Voronoi Diagram is drawn not casually but with some rules and the role can only correspond to one kind of the diagram.

    Big N!

    Using C/C++ we can’t calculate very big number of prime factors. So we use string to store it.


TOP
COMMENT
made with ❤️ by o_oyao
©o_oyao 2019-2025

32724 | 2