Codeforces Round #373 (Div. 2) A. Vitya in the Countryside 解题报告

A. 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.

题目大意

给你一串连续的在0到15之间循环的数，叫你判断接下来一个数比第n个数是大还是小。

题解

本来想着水题就不写题解了，可还是不小心WA了一次，虽说早上起来不清醒，可这个小细节的错误还是要注意。
乱搞即可，注意特判n=1时，0与15的情况。

#include <cstdio>
#include <cstdlib>
#include <iostream>

using namespace std;

int n,a[100];
bool flag,cyc;

int main()
{
 cin >>n;
 if(n==1)
  {
  int b;
  cin >>b;
  if(b==0) cout <<"UP";
  else if(b==15) cout <<"DOWN";
  else cout <<"-1";
  cout <<endl;
  return 0;
  }
 for(int i=0;i<n;i++) cin >>a[i];
 if(a[n-2]==1&&a[n-1]==0) flag=true;
 else if(a[n-2]==14&&a[n-1]==15) flag=false;
 else if(a[n-2]<a[n-1]) flag=true;
 else flag=false;
 if(flag) cout <<"UP";
 else cout <<"DOWN";
 cout <<endl;

 return 0;
}