Codeforces 719A A. Vitya in the Countryside
2016-09-23 21:45
330 查看
A. Vitya in the Countryside
Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down.
Moon cycle lasts 30 days. The size of the visible part of the moon (in Vitya’s units) for each day is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, and then cycle repeats, thus after the second 1 again goes 0.
As there is no internet in the countryside, Vitya has been watching the moon for n consecutive days and for each of these days he wrote down the size of the visible part of the moon. Help him find out whether the moon will be up or down next day, or this cannot be determined by the data he has.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 92) — the number of consecutive days Vitya was watching the size of the visible part of the moon.
The second line contains n integers ai (0 ≤ ai ≤ 15) — Vitya’s records.
It’s guaranteed that the input data is consistent.
Output
If Vitya can be sure that the size of visible part of the moon on day n + 1 will be less than the size of the visible part on day n, then print “DOWN” at the only line of the output. If he might be sure that the size of the visible part will increase, then print “UP”. If it’s impossible to determine what exactly will happen with the moon, print -1.
Examples
input
output
input
output
DOWN
input
output
Note
In the first sample, the size of the moon on the next day will be equal to 8, thus the answer is “UP”.
In the second sample, the size of the moon on the next day will be 11, thus the answer is “DOWN”.
In the third sample, there is no way to determine whether the size of the moon on the next day will be 7 or 9, thus the answer is -1.
用了一个比较蠢的方法。
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output
Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down.
Moon cycle lasts 30 days. The size of the visible part of the moon (in Vitya’s units) for each day is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, and then cycle repeats, thus after the second 1 again goes 0.
As there is no internet in the countryside, Vitya has been watching the moon for n consecutive days and for each of these days he wrote down the size of the visible part of the moon. Help him find out whether the moon will be up or down next day, or this cannot be determined by the data he has.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 92) — the number of consecutive days Vitya was watching the size of the visible part of the moon.
The second line contains n integers ai (0 ≤ ai ≤ 15) — Vitya’s records.
It’s guaranteed that the input data is consistent.
Output
If Vitya can be sure that the size of visible part of the moon on day n + 1 will be less than the size of the visible part on day n, then print “DOWN” at the only line of the output. If he might be sure that the size of the visible part will increase, then print “UP”. If it’s impossible to determine what exactly will happen with the moon, print -1.
Examples
input
5 3 4 5 6 7
output
UP
input
7 12 13 14 15 14 13 12
output
DOWN
input
1 8
output
-1
Note
In the first sample, the size of the moon on the next day will be equal to 8, thus the answer is “UP”.
In the second sample, the size of the moon on the next day will be 11, thus the answer is “DOWN”.
In the third sample, there is no way to determine whether the size of the moon on the next day will be 7 or 9, thus the answer is -1.
用了一个比较蠢的方法。
n = int(raw_input()) a = map(int, raw_input().split()) moon = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3] if n <= 1: if a[0] == 15: print 'DOWN' elif a[0] == 0: print 'UP' else: print -1 exit() for i in range(len(moon)): if a[len(a)-2]==moon[i] and a[len(a)-1]==moon[i+1]: if moon[i+2] > moon[i+1]: print 'UP' else: print 'DOWN' break
相关文章推荐
- 【codeforces】 466C Number of Ways
- codeforces 603C. Lieges of Legendre sg函数
- Codeforces-699B One Bomb
- [dfs树] Codeforces 521E #295 (Div. 1) E. Cycling City
- codeforces 825 E Minimal Labels
- Wrath CodeForces - 892B 简单最小路径
- Codeforces 467C George and Job
- Codeforces 433C Ryouko's Memory Note
- codeforces水题100道 第九题 Codeforces Beta Round #63 (Div. 2) Young Physicist (math)
- codeforces 645 E. Intellectual Inquiry
- CodeForces 825E Educational #25 E:拓扑排序+优先队列
- Codeforces 149C(脑洞)
- 【构造】 Codeforces 468A 24 Game
- codeforces 416E. President's Path( graph dp)
- codeforces水题100道 第十九题 Codeforces Round #109 (Div. 2) A. I_love_%username% (brute force)
- Codeforces 754 D Fedor and coupons
- Codeforces 492A - Vanya and Cubes (求和公式)
- CodeForces 672D Robin Hood(二分 + 思维)
- Codeforces 450A Jzzhu and Children(水题)
- Codeforces 609D 被二分教做人