# ACM

## URAL 1205. By the Underground or by Foot?

1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1205 1205. By the Underground or by Foot? Time limit: 1.0 second Memory limit: 64 MB Imagine yourself in a big city. You want to get from point A…

1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1389 1389. Roadworks Time limit: 1.0 second Memory limit: 64 MB Once upon a time there was a king. One day the king counted up the collected taxe…

## UVA 11292. Dragon of Loowater

1. 题目 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2267 Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a majo…

## URAL 1982. Electrification Plan

1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1982 1982. Electrification Plan Time limit: 0.5 second Memory limit: 64 MB Some country has n cities. The government has decided to electrify all…

## HDU 5240. Exam

1. 题目 http://acm.hdu.edu.cn/showproblem.php?pid=5240 Exam Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 694    Accepted Submission(s): 348 Pr…

## URAL 1303. Minimal Coverage

1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1303 1303. Minimal Coverage Time limit: 1.0 second Memory limit: 64 MB Given set of line segments [Li, Ri] with integer coordinates of their end …

## URAL 1203. Scientific Conference

1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1203 1203. Scientific Conference Time limit: 1.0 second Memory limit: 64 MB Functioning of a scientific conference is usually divided into severa…

## POJ 1068: Parencodings

1. 题目描述 Description Let S = s1 s2…s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2…pn where pi is the number of left p…