TOJ 1987.Faulty Odometer（数论题）

题目链接：http://acm.tju.edu.cn/toj/showp1987.html

1987.    Faulty Odometer

---

Time Limit: 1.0 Seconds    Memory Limit: 65536K
Total Runs: 596    Accepted Runs: 399

---

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 3 to the digit 5, always skipping over the digit 4. This defect shows up in all positions (the one's, the ten's, the hundred's, etc.). For example, if the odometer displays 15339 and the car travels one mile, odometer reading changes to 15350 (instead of 15340).

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 4.

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

13
15
2003
2005
239
250
1399
1500
999999
0

Output for Sample Input

13: 12
15: 13
2003: 1461
2005: 1462
239: 197
250: 198
1399: 1052
1500: 1053
999999: 531440

Source: Rocky Mountain 2005

---

Submit   List    Runs   Forum   Statistics

纯数论题，想清楚结果的规律就好做，这道题如果找要除去几个其实不太好做，反而找剩下多少比较容易。

#include <stdio.h>
int main()
{
	int n,sum,tmp;
	while(scanf("%d",&n)&&n){
		sum=0;
		tmp=n;
		for(int i=1;n;n/=10,i*=9){
			if(n%10<4)
				sum+=n%10*i;
			else
				sum+=(n%10-1)*i;
		}
		printf("%d: %d\n",tmp,sum);
	}
}