Set Definition

Set Definition

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8056		Accepted: 3672

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

Source

POJ Monthly--2005.08.28,Static

注意这里不能用sort排序，这样消耗的时间为O(nlongn)，得改成O(n):

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define MAXN 10000001
using namespace std;
int b[MAXN];
int sum;
int i=0,j=0,t=0;
int x,y;
void prime()
{
 while(t<=10000000)
 {
  x=b[i]*2+1;
  y=b[j]*3+1;
  if(x<y)
  {
    t++;
    b[t]=x;
    i++;
  }
  else if(y<x)
  {
    t++;
    b[t]=y;
    j++;
  }
  else
  {
    t++;
    b[t]=x;
    i++;
    j++;
  }
 }
}
int main()
{
int n;
b[0]=1;
prime();
//sort(b,b+t);
while(scanf("%d",&n)!=EOF)
{
printf("%d\n",b[n-1]);
  //cout<<b[n-1]<<endl;
}
return 0;
}