华东交通大学2016届新生选拔赛:1003 Vitya in the Countryside
来源:互联网 发布:毛笔字软件哪个好 编辑:程序博客网 时间:2024/05/08 16:40
Vitya in the Countryside
Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)
Total Submission(s) : 31 Accepted Submission(s) : 12
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
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.
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.
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.
Sample Input
53 4 5 6 7712 13 14 15 14 13 1218
Sample Output
UPDOWN-1
代码:
#include<iostream>#include<algorithm>#include<cstring>#include<cctype>#include<cstdio>#include<set>#include<cmath>#include<string>using namespace std;int main(){ int n; int a[95]; while(~scanf("%d",&n)){ for(int i=1;i<=n;i++) scanf("%d",&a[i]); if(a[n]==0) printf("UP\n"); else if(a[n]==15) printf("DOWN\n"); else if(n==1 && a[n]!=15 && a[n]!=0) printf("-1\n"); else if(a[n]>a[n-1]) printf("UP\n"); else if(a[n]<a[n-1]) printf("DOWN\n"); } return 0;}
0 0
- 华东交通大学2016届新生选拔赛:1003 Vitya in the Countryside
- 华东交通大学2016届新生选拔赛:1001 最大的空地
- 华东交通大学2016届新生选拔赛:1002 二进制
- 华东交通大学2016届新生选拔赛:1004 扑克牌
- 华东交通大学2016届新生选拔赛:1005 Acboy
- 华东交通大学2016届新生选拔赛:1007 爱吃肉的保罗
- 华东交通大学2016届新生选拔赛:1008 消消乐
- 华东交通大学2016届新生选拔赛:1010 我是签到题
- 华东交通大学2016届新生选拔赛:1006 我是大水题哦
- 华东交通大学2016届新生选拔赛:1009 pyw的贪心问题
- A. Vitya in the Countryside
- codeforces A. Vitya in the Countryside
- Codeforces 719A-Vitya in the Countryside
- CodeForces 719 A. Vitya in the Countryside
- Codeforces-719A-Vitya in the Countryside
- CodeForces 719A. Vitya in the Countryside
- codeforces 719A Vitya in the Countryside
- Codeforces 719A A. Vitya in the Countryside
- tmux常用命令
- POJ 2823 Sliding Window
- Android四大组件—Activity
- 430TIMERA捕获比较
- strcpy/strncpy/strcpy_s比较
- 华东交通大学2016届新生选拔赛:1003 Vitya in the Countryside
- Session,Cookie
- CocosCreater的俄罗斯方块游戏实现
- android studio2.2创建第一个工程速度太慢
- CPU地址空间,IO端口和IO内存
- jquery的一些标签的总结
- Ubuntu下Python深度学习TensorFlow+Theana+Keras配置文档
- Java学习篇之迭代器并发修改异常问题
- 430喂狗