集训队作业解题报告

1、题目来源Ural 1409 Two Gangsters问题描述瓶子放成一排，两个人打瓶子，一个人从左边开始，一个人从右边开始（从未失手），最终相遇的时候，两个人同时打暴一个瓶子。已知，每个人打暴的瓶子数，求每个人没打得瓶子数。算法输入a,b，输出 b-1,a-1。算法证明没什么好证明的。算法实现没任何实现问题。源代码var a,b:long; beginreadln(a,b);wriend.n(b-1, ,a-1);原题描述：1409. Two GangstersTime Limit: 1.0 second Memory Limit: 16 MBTwo gangsters Harry and

2、Larry had a rescountryside. They decided tospend some time shooting, so they put several beer cans (no moren 10)on a log. Harry started to shoot cans one after another from the leftmost to the right and Larry from the rightmost to the left. At some momentippened sot they shot one and the same can.Ha

3、rry got indignant and claimed of money because Larry deprived became furious and told Harryt Larry owed him a considerable sum him of shooting some more cans. Larry t he owed even greater sum of money toLarry because of the same reason. They started to argufy but nobody remembered how many cans ther

4、e were at the very beginning. And no one of them was going to search cans which was shot. Anyway, each of them remembered exactly how many cans he shot.Determine how many cans were not shot by Harry and how many cans were not shot by Larry.InputThe only input line contains twoegers the number of cans shot by Harry and by Larry respectively.Outputtwoegers the number of canst were not shot by Harry and thenumber of canst were not shot by Larry, respectively.SleProblem Problem ContestAuthor: Den RaskovalovSource: The 12th High School Pupils Collegi