2019

    HDU-1040 As Easy As A+B

    This is a sorting problem, you can either use quick sort or bubble sort or other sorts.

    HDU-1037 Keep on Truckin'

    Just estimate each number, if it is lower than 168, then this underpass is unable to be passed. If no number is less than 168 ,then there is no crash.

    HDU-1032 The 3n+1 problem

    Turn the pseudo code in to real code. And an important thing is that the value of i and j is not fixed that i < j. So we have to judge the value of i j.

    HDU-1012 u Calculate e

    The range of the number is very small, only 0 to 9, store all the factorial of n, and then calculate then one by one.

    HDU-1008 Elevator

    This is an easy problem and you just need to stimulate the hole process.

    HDU-1000 A+B Problem

    The easiest problem

    CodeForces-1169B Pairs

    First, you get the fist pair of numbers. And then find a pair of numbers that is totally different with the first pair.

    CodeForces-1180B Nick and Array

    To make the most product, you just need to change all numbers to negative first. And then find the smallest number and make it positive.

    CodeForces-1180A Alex and a Rhombus

    This problem has a regular formula. First you count the outermost layer has how many squares. Then the second outermost layer. Until the second smallest layer.

    CodeForces-580C Kefa and Park

    The algorithm of the problem is BFS or DFS. I use BFS. Traverse all the points by layer and count it's alongside cats.


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

|