codeforces 719A Vitya in the Countryside
来源:互联网 发布:更改手机图标软件 编辑:程序博客网 时间:2024/05/20 01:34
点击打开链接
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.
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.
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.
53 4 5 6 7
UP
712 13 14 15 14 13 12
DOWN
18
-1
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.
题意:判断下一个值是上升还是下降,不能判断输出-1,分析最后两位,找特殊,剩下的就符合常规了。
#include<stdio.h>#include<stdlib.h>int main(){ int n,s[100]; scanf("%d",&n); for(int i=0; i<n; i++) { scanf("%d",&s[i]); } if(n==1) { if(s[0]==15) printf("DOWN\n"); else if(s[0]==0) printf("UP\n"); else printf("-1\n"); } else { if(s[n-2]==14&&s[n-1]==15) { printf("DOWN\n"); return 0; } if(s[n-2]==1&&s[n-1]==0) { printf("UP\n"); return 0; } if(s[n-2]<s[n-1]) { printf("UP\n"); return 0; } else { printf("DOWN\n"); return 0; } } return 0;}
- 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
- codeforces A. Vitya in the Countryside
- 【32.89%】【codeforces 719A】Vitya in the Countryside
- CodeForces-719A. Vitya in the Countryside(模拟)
- A. Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A.Vitya in the Countryside
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside
- CodeForces 719A Vitya in the Countryside(月有阴晴圆缺,第二次打CF)
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside 解题报告
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside 水题
- Codeforces Round #373 (Div. 2) A. Vitya in the Countryside —— 基础题
- 华东交通大学2016届新生选拔赛:1003 Vitya in the Countryside
- 记Dorado7学习(1)
- 百度编辑器ueditor上传图片顺序乱掉修改方法
- KVM地址翻译流程及EPT页表的建立过程
- JAVA中内部类的继承和覆盖问题
- 编写可维护的javascript(二):注释
- codeforces 719A Vitya in the Countryside
- HDU
- Spark2.x---4. Deploy模块解析
- CSS深入理解vertical-align和line-height的基友关系
- 希尔排序
- equals使用和重写
- test
- Hive
- Android机用移动数据流量获取也能获取mac地址的终极方法。(第二种方法)