# Codeforces Round #515 (Div. 3)

A. Vova and Train Description: Vova plans to go to the […]

# HDU 1890 Robotic Sort

Description: Somewhere deep in the Czech Technical Univ […]

# 洛谷 P3165 [CQOI2014]排序机械臂

Description: 为了把工厂中高低不等的物品按从低到高排好序，工程师发明了一种排序机械臂。它遵循一个简 […]

# 牛客网暑期ACM多校训练营（第三场） C Shuffle Cards

Description: Eddy likes to play cards game since there […]

# 洛谷 P3391 【模板】文艺平衡树（Splay）

Description: 您需要写一种数据结构（可参考题目标题），来维护一个有序数列，其中需要提供以下操作：翻 […]

# nyoj 1367 ZZNUOJ 2109 物流配送

Description: 物流配送是物流活动中一种非单一的业务形式，它与物品流动、资金流动紧密结合。备货是配送 […]

# 计蒜客 ACM-ICPC 2018 沈阳赛区网络预赛 D. Made In Heaven

Description: One day in the jail, F·F invites Jolyne Ku […]

# POJ 1330 Nearest Common Ancestors

Description: A rooted tree is a well-known data structu […]

# HDU 5692 Snacks

Description: 百度科技园内有n个零食机，零食机之间通过n−1条路相互连通。每个零食机都有一个值v， […]

# 计蒜客 ACM-ICPC 2018 南京赛区网络预赛 L. Magical Girl Haze

Description: There are N cities in the country, and M d […]

# HDU 1251 统计难题

Description: Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的 […]

# HDU 6447 YJJ’s Salesman

Description: YJJ is a salesman who has traveled through […]

# HDU 6446 Tree and Permutation

Description: There are N vertices connected by N−1 edge […]

# POJ 2195 Going Home

Description: On a grid map there are n little men and n […]

# HDU 3081 Marriage Match II

Description: Presumably, you all have known the questio […]

# POJ 3436 ACM Computer Factory

Description: As you know, all the computers used for AC […]

# HDU 6214 Smallest Minimum Cut

Description: Consider a network G=(V,E) with source s a […]

# HDU 3416 Marriage Match IV

Description: Do not sincere non-interference。 Like that […]

# HDU 3338 Kakuro Extension

Description: If you solved problem like this, forget it […]

# UVA 10480 Sabotage

Description: The regime of a small but wealthy dictator […]