Warm up 13 [H] Hours and Minutes

Hours and Minutes

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB

Total submit users: 44, Accepted users: 44

Problem 12755 : No special judgement

 

Problem description

Heidi has a discrete analog clock in the shape of a circle, as the one in the figure. Two hands rotate around the center of the circle, indicating hours and minutes. The clock has 60 marks placed around its perimeter, with the distance between consecutive marks being constant.
The minute hand moves from its current mark to the next exactly once every minute. The hour hand moves from its current mark to the next exactly once every 12 minutes, so it advances five marks each hour. We consider that both hands move discretely and instantly, which means they are always positioned exactly over one of the marks and never in between marks.
At midnight both hands reach simultaneously the top mark, which indicates zero hours and zero minutes. After exactly 12 hours or 720 minutes, both hands reach the same position again, and this process is repeated over and over again. Note that when the minute hand moves, the hour hand may not move; however, when the hour hand moves, the minute hand also moves.
Heidi likes geometry, and she likes to measure the minimum angle between the two hands of the clock at different times of the day. She has been writing some measures down, but after several years and a long list, she noticed that some angles were repeated while some others never appeared. For instance, Heidi's list indicates that both at three o'clock and at nine o'clock the minimum angle between the two hands is 90 degrees, while an angle of 65 degrees does not appear in the list. Heidi decided to check, for any integer number A between 0 and 180, if there exists at least one time of the day such that the minimum angle between the two hands of the clock is exactly A degrees. Help her with a program that answers this question.

Input

Each test case is described using one line. The line contains an integer A representing the angle to be checked (0 ≤ A ≤ 180).

Output

For each test case output a line containing a character. If there exists at least one time of the day such that the minimum angle between the two hands of the clock is exactly A degrees, then write the uppercase letter "Y". Otherwise write the uppercase letter "N".

Sample Input

90
65
66
67
128
0
180

Sample Output

Y
N
Y
N
N
Y
Y

Problem Source

Latin American 2012

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1000005
#define mod 1000000007
#define ll long long
#define INF 0x7fffffff
#define FF(i,n)for(int i=0;i<n;i++)
int n, m;
char s[maxn];
char str[maxn];
int p[maxn];
int fun(int x){
    int a[5];
    int i = 0;
    while (x){
        a[i++] = x % 10;
        x /= 10;
    }
    for (int j = 0; j < i;j++)
    for (int k = j+1; k < i;k++)
    if (a[k] == a[j])return 0;
    return 1;
}
int main(){
    int cas = 1;
    int t;
    /*scanf("%d", &t);
    while (t--){
        
    }*/
    while (~scanf("%d", &n)){
        t = 0;
        int flag = 0;
        for (int i = 0; i <= 360; i+=6){
            if (i == n)flag = 1;
        }
        if(flag)printf("Y\n");
        else printf("N\n");
    }
    return 0;
}