poj 2591 Set Definition

Set Definition

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8210		Accepted: 3740

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.

Input

Input will contain several test cases; each contains a single positive integer N (1 <= N <= 10000000), which has been described above.

Output

For each test case, output the corresponding element in S.

Sample Input

100
254

Sample Output

418
1461

#include<iostream>
using namespace std;
int v[10000005];
int main()
{
int i, j, x, y, m;
    i=j=m=0;
    v[m++]=1;
while(m<=10000000) {
        x=v[i]*2+1; y=v[j]*3+1;
if(x<y) {
            v[m++]=x;
            i++;
        }
else if(y<x) {
            v[m++]=y;
            j++;
        }
else {
            v[m++]=x;
            i++; j++;
        }
    }
int n;
while(scanf("%d", &n)!=EOF) {
        printf("%d\n", v[n-1]);
    }
}

转载于:https://www.cnblogs.com/w0w0/archive/2011/11/22/2258599.html