Problem Description: There are N nodes and M directed roads with weight in an acyclic graph. At each node, there is a probability of 1 / K to go to each next node, where K number of roads that are connected to current node. Starting at 1, calculate the total […]

Estimated reading time: 2 minutes

Problem Description: Mowing the Lawn [Neal Wu, 2008] After winning the annual town competition for best lawn a year ago,Farmer John has grown lazy; he has not mowed the lawn since thenand thus his lawn has become unruly. However, the competition isonce again coming soon, and FJ would like to […]

Estimated reading time: 4 minutes

Problem Description: FJ is about to take his N (1 <= N <= 30,000) cows to the annual “Farmer of the Year” competition. In this contest every farmer arranges his cows in a line and herds them past the judges. The contest organizers adopted a new registration scheme this year: […]

Estimated reading time: 7 minutes

Problem Description: You are given a sakura tree(try to be descriptive). At each node of the tree(actually a tree structure!), there is a weight and children nodes. The rabbits want to remove as many nodes as possible on the sakura tree(don’t know why) while following the several rules. For each […]

Estimated reading time: 4 minutes

Problem Description: You start at a point (sx,sy). There are T gravestones at on the map. You can destroy(diss joy?) a gravestone by touch the four sides that are adjacent to it. After destroying a gravestone, the gravestone turns into a wall, which you cannot pass through. As a Übermensch, […]

Estimated reading time: 2 minutes

Problem Description: Given a sequence comprised of numbers from 1 – N in order. There are M operations. Each operation will flip a sequence [l,r]. Please output the finally formed sequence. Input Format: One line with the number N and M. The next M lines contain two numbers l and […]

Estimated reading time: 4 minutes

Problem Description: There are many variety to the rotavirus. Some of them follow the structure in the image below(graph 1.1), where there are connections between every node on the circumference with the center and with its neighbour. Specifically, we define the N-sided virus as a virus that for every pairs […]

Estimated reading time: 8 minutes

Since the original problem is in another language, I will just translate it into English(may not be as “descriptive”). Problem Description: The Wolf King wants to catch Rabbits, a given graph is listed below. The Rabbits live in (1,1), the northwest corner, and they want to go to the southeast […]

Estimated reading time: 5 minutes

Hi, this is the very first Blog I wrote! Since I am an OIer, this is going to be about programming problems! Let’s begin with a simple one. Problem Description: Given two numbers A, B, print the output of A + B ( A,B ≤ ). Sample Input: 1 2 Sample Output: 3 Ideas: Emm.., […]

Estimated reading time: 1 minute