HDU——1393Weird Clock(水题,注意题意)
来源:互联网 发布:紫菜三角梅淘宝店铺 编辑:程序博客网 时间:2024/06/16 20:09
Weird Clock
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3109 Accepted Submission(s): 1137
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.
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.
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 10 0
Sample Output
1
题意:一个0~59分的时钟,只有分针,给你一个初始时刻s和单次转动次数d。叫你求出多少次以后可以转到0刻度。刚开始我是想着转n个d次,则有(s+n*d*s)%60==0这样一条公式,但是怎么提交都是错,后来看讨论区说是题意问题,再看看题目也没发现啥。最后看了题解,发现每转一次d将把当前的刻度视为单位转动刻度,而非一直是最开始的刻度,比如25 5,第一次到达(25+5*25)%60=30分,第二次则会到达(30+5*30)%60=0刻度,因此第二次就到了。若是刚开始错误的公式(s+n*d*s)%60==0,则n会等于7代码:
#include<iostream>#include<cstdio>using namespace std;int main(void){int s,d,n;bool ok;while (~scanf("%d%d",&s,&d)&&(s||d)){ok=true;n=0;//计数器要初始化为0,对应一开始就到达0刻度的情况 while (s%60!=0){s=(s+s*d)%60;n++;if(n>=61){ok=false;//标记变量 break;}}if(ok)cout<<n<<endl;elsecout<<"Impossible"<<endl;}return 0;}
0 0
- HDU——1393Weird Clock(水题,注意题意)
- HDU 1393 Weird Clock
- HDU 1393 Weird Clock
- hdu 1393 Weird Clock
- hdu 1393 Weird Clock
- HDU 1393 Weird Clock
- HDU 1393 Weird Clock (模拟)
- HDOJ 1393 Weird Clock(明白题意就简单了)
- 杭电 HDU ACM 1393 Weird Clock
- HDOJ 1393 Weird Clock
- hdoj.1393 Weird Clock 20140825
- Weird Clock
- Weird Clock
- zoj 1476 Weird Clock
- HDU1393:Weird Clock
- hdu1393 Weird Clock
- HOJ 1006 Weird clock
- HOJ 1006 Weird Clock
- NDK 编译和使用静态库、动态库; Android.mk 文件语法详解; Android.mk高级写法
- Oracle表值函数的两种写法
- 静态区间第k大(分桶法和平方分割)
- org.apache.hadoop.ipc.Client: Retrying connect to server
- mpg123 把mp3文件解码到标准输出设备(stdout)
- HDU——1393Weird Clock(水题,注意题意)
- JAVA应用程序获取当前路径
- 忙些更好
- Java类中代码的加载顺序
- [C语言]查找链表的中间元素
- 各种排序算法的总结和比较
- [从头学数学] 第88节 折线统计图
- codeforces626E.Simple Skewness(三分)
- SAP外向交货单中的批次拆分应用于免费货物的小问题