CodeForces-719A. Vitya in the Countryside(模拟)
2016-11-30 18:32
357 查看
A. Vitya in the Countryside
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.
判断月亮是在变大还是在变小。
边界情况好多。。。
代码
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.
判断月亮是在变大还是在变小。
边界情况好多。。。
代码
#include<stdio.h> #include<iostream> #include<algorithm> #include<string.h> const int maxn=105; int main() { int N; scanf("%d",&N); int first; scanf("%d",&first); if(N==1) { if(first==0) { printf("UP\n"); return 0; } if(first==15) { printf("DOWN\n"); return 0; } printf("-1\n"); return 0; } int second; for(int i=1; i<N; i++) { second=first; scanf("%d",&first); } if(first==15) { printf("DOWN\n"); return 0; } if(first==0) { printf("UP\n"); return 0; } if(first>second) { printf("UP\n"); return 0; } if(first<second) { printf("DOWN\n"); return 0; } printf("-1\n"); return 0; }
相关文章推荐
- CodeForces - 658A Bear and Reverse Radewoosh (模拟)水
- Codeforces Round #378 (Div. 2) C && Codeforces 733C (模拟)详解(两种写法)
- Codeforces 793C Mice Problem 几何(模拟)
- 【并查集】【模拟】Codeforces 698B & 699D Fix a Tree
- [codeforces-315D div2]模拟
- CodeForces 493B Vasya and Wrestling 【模拟】
- 【模拟】Codeforces 710A King Moves
- Codeforces 841 Generous Kefa(模拟)
- CodeForces - 845D Driving Test(模拟,栈)
- 【模拟】Codeforces 691C Exponential notation
- CodeForces 518C - Watto and Mechanism(模拟)
- Codeforces 149B Martian Clock【模拟】
- CodeForces 615C Running Track【暴力模拟】
- Codeforces 606 B Testing Robots【模拟】
- CodeForces 722B. Verse Pattern(模拟)
- codeforces730D Running Over The Bridges(模拟)
- CodeForces 734D - Anton and Chess (模拟)
- Codeforces - 887D Ratings and Reality Shows (暴力模拟)
- Codeforces 670E Correct Bracket Sequence Editor (list模拟)
- CodeForces 714B. Filya and Homework(模拟)