Algorithm
Problem Name: 2 AD-HOC - beecrowd | 1300
Problem Link: https://www.beecrowd.com.br/judge/en/problems/view/1300
Hours and Minutes
By Pablo Ariel Heiber, UBA 
Argentina
Timelimit: 1
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 (0 ≤ A ≤ 180) representing the angle to be checked.
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 | Sample Output |
|
90 |
Y |
Code Examples
#1 Code Example with C Programming
Code -
C Programming
#include <stdio.h>
#define MOD %
int main (int argc, char **argv)
{
int n;
while (scanf("%d", &n) != EOF)
printf("%c\n", !(n MOD 6) ? 'Y' : 'N');
return 0;
}
Input
65
66
67
128
0
180
Output
N
Y
N
N
Y
Y
#2 Code Example with C++ Programming
Code -
C++ Programming
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n)
if (n % 6 == 0) cout << "Y" << endl;
else cout << "N" << endl;
return 0;
}
Input
65
66
67
128
0
180
Output
N
Y
N
N
Y
Y
#3 Code Example with Javascript Programming
Code -
Javascript Programming
const { readFileSync } = require("fs")
const input = readFileSync("/dev/stdin", "utf8").split("\n")
function main() {
const responses = []
for (const angle of input) {
if (angle == "") break // EOF
const A = Number.parseFloat(angle)
if (A < 0 || A > 180) break
else if (A % 6 == 0) responses.push("Y")
else responses.push("N")
}
console.log(responses.join("\n"))
}
main()
Input
65
66
67
128
0
180
Output
N
Y
N
N
Y
Y
#4 Code Example with Python Programming
Code -
Python Programming
while True:
try:
n = int(input())
print('Y' if n % 6 == 0 else 'N')
except EOFError:
break
Input
65
66
67
128
0
180
Output
N
Y
N
N
Y
Y