zoukankan      html  css  js  c++  java
  • A. Vitya in the Countryside

    A. Vitya in the Countryside
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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.

    一开始没注意只有0或15的情况,被hack了,QAQ

     1 #include<iostream>
     2 using namespace std;
     3 
     4 int S[32]={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};
     5 int n,m;
     6 int A[93];
     7 
     8 int main()
     9 {
    10     cin>>n;
    11     for(int i=1;i<=n;i++)
    12         cin>>A[i];
    13     if(n==1) 
    14         switch(A[1])
    15         {
    16             case 0:
    17                 cout<<"UP";
    18                 return 0;
    19             case 15:
    20                 cout<<"DOWN";
    21                 return 0;
    22             default:
    23                 cout<<-1;
    24                 return 0;
    25         }
    26     for(int i=1;i<=31;i++)
    27         if(A[n-1]==S[i-1]&&A[n]==S[i])
    28             m=i;
    29     if((1<=m&&m<=14)||(m==30))
    30     {
    31         cout<<"UP";
    32         return 0;
    33     }
    34     else
    35     if(15<=m&&m<=30)
    36     {
    37         cout<<"DOWN";
    38         return 0;
    39     }
    40     cout<<-1;
    41     return 0;
    42 }
  • 相关阅读:
    css的网页布局案例
    position定位及实际应用
    float浮动以及案例演示
    第二十三节 margin合并实例
    第二十二节 margin合并
    第二十一节 margin技巧
    第二十节 盒子练习
    第十九节 盒子真实尺寸
    第十八节 盒子案例
    第十七节 盒子模型
  • 原文地址:https://www.cnblogs.com/InWILL/p/5903023.html
Copyright © 2011-2022 走看看