上一页 1 ··· 13 14 15 16 17 18 19 20 21 ··· 28 下一页

2015年10月27日

nyoj 5 Binary String Matching(kmp)

摘要: Binary String Matching描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as ... 阅读全文

posted @ 2015-10-27 18:20 焰 阅读(170) 评论(0) 推荐(0) 编辑

2015年10月24日

Light OJ 1148

摘要: 1148 - Mad CountingMob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population of the town. Now the naive app... 阅读全文

posted @ 2015-10-24 20:14 焰 阅读(219) 评论(0) 推荐(0) 编辑

codeforces 7c line(扩展欧几里得)

摘要: C. LineA line on the plane is described by an equationAx + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers f... 阅读全文

posted @ 2015-10-24 20:02 焰 阅读(212) 评论(0) 推荐(0) 编辑

HDU 2732 Leapin' Lizards(最大流)

摘要: Leapin' LizardsProblem DescriptionYour platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking ... 阅读全文

posted @ 2015-10-24 19:57 焰 阅读(143) 评论(0) 推荐(0) 编辑

2015年10月20日

NYOJ 1242 Interference Signal

摘要: Interference Signal描述Dr.Kong’s laboratory monitor some interference signals. The interference signals can be digitized into a series of positive integ... 阅读全文

posted @ 2015-10-20 16:47 焰 阅读(209) 评论(0) 推荐(0) 编辑

2015年10月17日

NYOJ 1241 Distribution

摘要: Distribution描述One day , Wang and Dong in the Dubai desert expedition, discovered an ancient castle. Fortunately, they found a map of the castle.The ma... 阅读全文

posted @ 2015-10-17 22:00 焰 阅读(170) 评论(0) 推荐(0) 编辑

2015年10月10日

HDU 3549 Flow Problem(最大流)

摘要: Flow ProblemProblem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for... 阅读全文

posted @ 2015-10-10 20:48 焰 阅读(145) 评论(0) 推荐(0) 编辑

2015年10月9日

HDU 2767 Proving Equivalences(强连通缩点)

摘要: Proving EquivalencesProblem DescriptionConsider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove tha... 阅读全文

posted @ 2015-10-09 19:16 焰 阅读(182) 评论(0) 推荐(0) 编辑

HDU 3836 Equivalent Sets(强连通缩点)

摘要: Equivalent SetsProblem DescriptionTo prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, ... 阅读全文

posted @ 2015-10-09 18:32 焰 阅读(257) 评论(0) 推荐(0) 编辑

2015年10月8日

POJ 2762 Going from u to v or from v to u?(强连通+缩点+拓扑排序)

摘要: Going from u to v or from v to u?DescriptionIn order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has n rooms, and one-... 阅读全文

posted @ 2015-10-08 11:12 焰 阅读(297) 评论(0) 推荐(0) 编辑

上一页 1 ··· 13 14 15 16 17 18 19 20 21 ··· 28 下一页

导航