2167.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2167 on 2006-03-13 at 12:22:27 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int VALID[] = { 0, 1, 2, 5, 9, 8, 6 };
const int VN = 7;
const int MAX = 512;

int main()
{
	int i;
	char n[MAX];

	while(gets(n) != NULL) {
		int l = strlen(n), x = (l+1) / 2;
		for(i = 0; i < x; i++) {
			char t = n[i] - '0';
			n[i] = n[l-i-1] - '0';
			n[l-i-1] = t;
		}
		while(l != 0) {
			int m = 0;
			for(i = l-1; i >= 0; i--) {
				m = m * 10 + n[i];
				n[i] = m / VN;
				m %= VN;
			}
			printf("%d", VALID[m]);
			if(n[l-1] == 0) l--;
		}
		putchar('\n');
	}
	
	return 0;
}