HDOJ 1393 Weird Clock(明白题意就简单了)
2016-04-11 01:38
330 查看
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
明白题意之后就简单了,
思路:一个钟面只有一根分针。对于一个数字d,把钟面上的分针指向的时间s往后拨s的d倍。问给定d,重复这样的操作多少次能回拨到0。若不能则输出Impossible。
注意:此处的s是不断更新的!!!!!!!!!!!
因为钟面只有60分钟,所以最多不会超过60次,直接暴力就可。
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
明白题意之后就简单了,
思路:一个钟面只有一根分针。对于一个数字d,把钟面上的分针指向的时间s往后拨s的d倍。问给定d,重复这样的操作多少次能回拨到0。若不能则输出Impossible。
注意:此处的s是不断更新的!!!!!!!!!!!
因为钟面只有60分钟,所以最多不会超过60次,直接暴力就可。
import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int s= sc.nextInt(); int d = sc.nextInt(); if(s==0&&d==0){ return ; } int num=s; for(int i=1;i<65;i++){ num = (num+(num*d))%60; if(num==0){ System.out.println(i); break; } if(i>63){ System.out.println("Impossible"); break; } } } } }
相关文章推荐
- Handler机制实例
- DDOS攻击详解——常见网站攻击手段原理与防御
- 机器学习-logistic Regression(逻辑回归)
- 《Java程序设计》第一次实验实验报告
- Android material Design 之CoordinatorLayout详解
- 关于php上传文件
- How to derive mean and variance of a Gaussian?
- Android实现通过手机找回密码
- NY1057 寻找最大值(三)
- MapReduce实现手机上网流量统计
- hadoop2.4.1伪分布配置
- (LinkedList)2. Add Two Numbers
- Mac上的Sublime Text 3的中文乱码(亲测有效)
- LeetCode 267. Palindrome Permutation II(对称排列)
- 树莓派——挂载USB驱动器
- LeetCode 219. Contains Duplicate II
- 使用js实现数组逆序
- ssh 免登陆
- krpano 教程 - 标签中devices设备类型属性的说明
- SQLite3优化