UVa OJ 108 – Maximum Sum
Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=44 Hints Violence Solution code
UVa OJ
UVa OJ 10200 – Prime Time
Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=14&page=show_problem&problem=1141 Hints Attention to accuracy issues Solution code
UVa OJ 10000 – Longest Paths
Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=941 Hints Floyd–Warshall algorithm Solution code
UVa OJ 106 – Fermat vs. Pythagoras
Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=42 Hints Beginning of Chapter 13th in Elementary Number Theory and its applications 6ed, Kenneth H. Rosen, 2011 Solution code
UVa OJ 105 – The Skyline Problem
Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=41 Solution code
UVa OJ 104 – Arbitrage
Problem link https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=40 Hints Floyd-Warshall algorithm Solution code Bibliography JeraKrs. uva 104 – Arbitrage(最短路Floyd). CSDN blog. 2013-10-13 16:20:27 Ruslan Ledesma-Garza, Arbitrage, Published on May 26, 2016, edited on Oct 25, 2016
UVa OJ 103 – Stacking Boxes
Problem link: https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=39 Hints DFS+DP记忆化搜索 Solution code
UVa OJ 102 – Ecological Bin Packing
Problem link: https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=38 Solution code
UVa OJ 101 – The Blocks Problem
Problem link: https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=37 Hints Simulation Solution code 1: Solution code 2
UVa OJ 10714 – Ants
Browse problem UVa Online Judge. 10714 – Ants. PKU JudgeOnline. No. 1852 – Ants Solution Thinking If all the ants are going to the nearest end of the pole, it is easy to find the earliest time needed. 只要所有的蚂蚁都走到杆的最近端，求出所需的最短时间就很简单。 Find the latest time （找出最长时间） If there are two or more […]