| 网站首页 | 业界新闻 | 小组 | 威客 | 人才 | 下载频道 | 博客 | 代码贴 | 在线编程 | 编程论坛
欢迎加入我们,一同切磋技术
用户名:   
 
密 码:  
共有 1368 人关注过本帖
标题:Vitya in the Countryside
只看楼主 加入收藏
BIT112016197
Rank: 1
等 级:新手上路
帖 子:9
专家分:0
注 册:2016-10-18
结帖率:66.67%
收藏
已结贴  问题点数:20 回复次数:5 
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.

Sample Input
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
Hint
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>
int main()
{int i,n;
scanf("%d",&n);
int a[92];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
if(n==1&&a[0]!=0) printf("-1\n");
if(n==1&&a[0]==0) printf("UP\n");
if(n!=1&&a[n-1]==0) printf("UP\n");
if(n!=1&&a[n-1]==15) printf("DOWN\n");
if(n!=1&&a[n-1]!=0&&a[n-1]!=15)
if(a[n-1]>a[n-2]) printf("UP\n");
else printf("DOWN\n");
return 0;
 }
总有一个用例通过不了,求解答
搜索更多相关主题的帖子: visible summer moment second should 
2016-10-21 13:33
rjsp
Rank: 20Rank: 20Rank: 20Rank: 20Rank: 20
等 级:版主
威 望:528
帖 子:9024
专家分:54030
注 册:2011-1-18
收藏
得分:20 
n==1,a[0]==15 时
2016-10-21 15:07
BIT112016197
Rank: 1
等 级:新手上路
帖 子:9
专家分:0
注 册:2016-10-18
收藏
得分:0 
回复 楼主 BIT112016197
加上这个还是用例33通过不了
2016-10-21 18:47
BIT112016197
Rank: 1
等 级:新手上路
帖 子:9
专家分:0
注 册:2016-10-18
收藏
得分:0 
回复 2楼 rjsp
谢谢,找了半天没发现
2016-10-21 18:50
rjsp
Rank: 20Rank: 20Rank: 20Rank: 20Rank: 20
等 级:版主
威 望:528
帖 子:9024
专家分:54030
注 册:2011-1-18
收藏
得分:0 
以下是引用BIT112016197在2016-10-21 18:47:00的发言:

加上这个还是用例33通过不了
贴代码,鬼知道你加在哪里
2016-10-21 21:24
rjsp
Rank: 20Rank: 20Rank: 20Rank: 20Rank: 20
等 级:版主
威 望:528
帖 子:9024
专家分:54030
注 册:2011-1-18
收藏
得分:0 
if 最后一个数等于0
    up
else if 最后一个数等于15
    down
else if n大于1
{
    if 最后两个数是升序
        up
    else
        down
}
else
    -1
2016-10-21 21:37
快速回复:Vitya in the Countryside
数据加载中...
 
   



关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.023699 second(s), 8 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved