HDU1393 Weird Clock

1393

Weird Clock

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3889 Accepted Submission(s): 1463

Problem Description

A weird clock marked from 0 to 59 has only a minute hand. It won’t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 1 <= d <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.

Now you are given the initial time s ( 1 <= s <= 59 ) and the coin’s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.

Input
There are several tests. Each test occupies a line containing two positive integers s and d.

The input is finished by a line containing 0 0.

Output
For each test print in a single line the minimum number of coins needed. If it is impossible to turn the hand back to 0, output “Impossible”.

Sample Input
30 1
0 0

Sample Output
1

Author
DU, Peng

Source
ZOJ Monthly, December 2002

Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1379 1396 1397 1394 1392

---

一道糟糕的题，题目设定是投入面值为d的硬币，指针将顺时针旋转d倍当前时间，一边说这种硬币是无限的，那会出现impossible的情况我是不理解的，我就将别人设定的1000为界拿来用了

#include<cstdio>
int main()
{
    int s,d,i,sd;
    while (scanf("%d%d",&s,&d)&&(s||d))
    {
        bool flag = true;
        for(i=0;i<=1000;i++,s+=s*d)
            if (!(s%=60))
            {
                printf("%d\n", i);
                flag = false;
                break;
            }
        if (flag)       
            printf("Impossible\n");     
    }
    return 0;
}