多加点分吧我翻译辛苦,我也是理工的,你也是理工的吧
The Alaska Highway runs 1422 miles from Dawson Creek,British Columbia to Delta Junction,Alaska.
阿拉斯加洲高速公路连通了德森克里洲和底特律洲,两地相距1422英里
Brenda would like to be the first person to drive her new electric car the length of the highway.
布忍达想成为第一个开电车走通这一条路的人
Her car can travel up to 200 miles once charged at a special charging station.
他的车加满油这后可以行驶200英里
There is a charging station in Dawson Creek,
where she begins her journey,
在他的出发地点德森克里洲有一个加油站
and also several charging stations along the way.
在开去阿拉斯加洲的路上也会有很多的加油站
Can Brenda drive her car from Dawson City to Delta Juntion and back?
布忍达可以顺利的从德森克里洲开到底特律洲然后返回吗?
输入
The input contains several scenario.
输入有多组数据
Each scenario begins with a line containing n,a positive number indicating the number of charging stations.
每一个数据开头一行有一个整数N,代表有N个加油站点
n lines follow,each giving the location of a filling station on the highway,including the one in Dawson City.
接下来N行给出加油站点的位置,包括第一个站点德森克里洲的位置
The location is an integer between 0 and 1422,inclusive,indicating the distance in miles from Dawson Creek.
每一个位置用一个大于等于0小于等于1422之间的整数表示,表示这个加油站点到底特律洲的距离
No two filling stations are at the same location.A line containing 0 follows the last scenario.
没有两个站点的位置是一样的,最后一行是一个0,表示所有的数据输入完毕
输出
For each scenario,output a line containing POSSIBLE if Brenda can make the trip.Otherwise,output a line containing the word IMPOSSIBLE.
对于每一个数据,如果有可能开去又回来的话就输出POSSIBLE
否则输出IMPOSSIBLE