POJ-2591（经典打表）

【Description】

Set S is defined as follows:
(1) 1 is in S;
(2) If x is in S, then 2x + 1 and 3x + 1 are also in S;
(3) No other element belongs to S.

Find the N-th element of set S, if we sort the elements in S by increasing order.

int d[10000005];
int main()
{
	d[1] = 1;
	int mul2 = 1;
	int mul3 = 1;
	int i;
	for (i = 2; i <= 10000000; ++i) {
		d[i] = MY_MIN(d[mul2] * 2 + 1, d[mul3] * 3 + 1);
		if (d[i] == d[mul3] * 3 + 1) {
			++mul3;
		}
		if (d[i] == d[mul2] * 2 + 1) {
			++mul2;
		}
	}
	int n;
	while (cin>>n)
		cout<<d[n]<<endl;
    return 0;
}