Problem Description: There are N nodes and M edges, you can go through each node at most once, there are weights on the edges. Try to minimize the total weight going through 1 to N while maximizing the times you can go from 1 to N without passing through any nodes twice except node 1 […]

## P2515: Software Installation [HAOI2010]

Problem Description: You have computer with M amount of storage. There are N softwares you are going to install on the computer. The ith computer takes amount of storage and has a value of . There are also dependencies between softwares. Specifically, the ith software can be installed only if is installed. Every software can be only installed once, […]

## BZOJ-1002: Rotavirus [FJOI2007]

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 of nodes on the virus […]

## BZOJ-1001: Wolf and Rabbits

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 corner. The Wolf King needs […]

## BZOJ-1000: A + B Problem

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.., I guess everyone knows how […]