大家好，又见面了，我是你们的朋友全栈君。
Faulty Odometer
http://acm.hdu.edu.cn/showproblem.php?pid=4278
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 725 Accepted Submission(s): 512
Problem Description
You are given a car odometer which displays the miles traveled as an integer. The odometer has a defect, however: it proceeds from the digit 2 to the digit 4 and from the digit 7 to the digit 9, always skipping over the digit 3 and 8. This defect shows up in all positions (the one’s, the ten’s, the hundred’s, etc.). For example, if the odometer displays 15229 and the car travels one mile, odometer reading changes to 15240 (instead of 15230).
Input
Each line of input contains a positive integer in the range 1..999999999 which represents an odometer reading. (Leading zeros will not appear in the input.) The end of input is indicated by a line containing a single 0. You may assume that no odometer reading will contain the digit 3 and 8.
Output
Each line of input will produce exactly one line of output, which will contain: the odometer reading from the input, a colon, one blank space, and the actual number of miles traveled by the car.
Sample Input
15
2005
250
1500
999999
0
Sample Output
15: 12
2005: 1028
250: 160
1500: 768
999999: 262143
Source
Recommend
liuyiding
类似于8进制转化为10进制
#include<stdio.h> int num[20],cnt; void change(int x){ cnt=0; while(x){ num[cnt++]=x%10; x/=10; } for(int i=0;i<cnt;i++) if(num[i]>=9) num[i]-=2; else if(num[i]>=4) num[i]-=1; } int main(){ int n; while(scanf("%d",&n) && n){ int ans=0; change(n); for(int i=cnt-1;i>=0;i--) ans=ans*8+num[i]; printf("%d: %d\n",n,ans); } return 0; }
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/107096.html原文链接：https://javaforall.net
![matlab做kmo检验的代码,急求 KMO测度和Bartlett 的球形度检验的计算原公式[通俗易懂]](https://javaforall.net/wp-content/uploads/2020/11/2020110817443450-480x300.jpg)
