POJ
辞穷
如果你真心想做某事,全世界都会帮你完成。
展开
-
POJ1013Counterfeit Dollar
题目:这里直接给出原文(英文)连接: http://poj.org/problem?id=1013 下面是简单的翻译: 有12枚硬币。其中有11枚真币和1枚假币。假币和真币重量不同,但不知道假币比真币轻还是重。现在,用一架天平称了这些币三次,告诉你称的结果,请你找出假币并且确定假币是轻是重(数据保证一定能找出来)。 输入 第一行是测试数据组数。 每组数据有三行,每行表示一次称量的结果。银原创 2017-04-07 19:22:25 · 414 阅读 · 0 评论 -
POJ1222 EXTENDED LIGHTS OUT(熄灯问题)
点击这里查看原题Sample Input2 0 1 1 0 1 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 0 1 0 1 0 1 1 1 0 0 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0 1 1 1 0 1 1 0 0 0 1 0 1 0 0 Sample OutputPUZZLE #1 1 0 1 0 0 1 1 1 0 1 0 1原创 2017-09-06 22:14:20 · 449 阅读 · 0 评论 -
POJ1724 ROADS
点击这里查看原题题目:DescriptionN cities named with numbers 1 … N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the ro原创 2017-09-09 21:09:12 · 261 阅读 · 0 评论 -
POJ1458 Common Subsequence
题目:点击这里查看原题 Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, …, xm > another sequence Z = < z1, z2, …, z原创 2017-09-09 21:13:41 · 233 阅读 · 0 评论 -
POJ1163 The Triangle
题目:Description 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5(Figure 1) Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that star原创 2017-09-09 21:17:35 · 291 阅读 · 0 评论