poj 2591

最新推荐文章于 2017-12-05 21:23:00 发布

wang28103

最新推荐文章于 2017-12-05 21:23:00 发布

阅读量623

点赞数

分类专栏： acm 文章标签： output integer each system input

本文链接：https://blog.csdn.net/wang28103/article/details/2846458

版权

acm 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

原题:

Set Definition

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4496		Accepted: 1944

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

分析:

又是一道简单题, 我用的是打表的方法,将答案存在一个数组a 中. 在计算时用 i 和 j 分别记录下一个2*x + 1 和3*x + 1 的x 的下标, 比较2*x + 1 和3*x + 1 的大小, 小的存入a 数组, 这样a 数组中的数就已经从大到小排好序了. 最后根据输入只要输出答案就可以了!

参考代码:

     //2591
#include <iostream>
using namespace std;
unsigned int a[10000002];
int n;
int main(void)
{
    int i,j,k,t1,t2;
    a[1] = 1;
    i = j = 1;
    for(k=2;k<=10000001;k++)
      {
          t1 = 2*a[i]+1;
          t2 = 3*a[j]+1;

          a[k] = min(t1,t2);
          if(a[k]==t1)
           {
              i++;
           }
          if(a[k]==t2)
           {
              j++;
           }
      }

    while(cin>>n)
     {
        cout<<a[n]<<endl;
     }

system("pause");
return 0;
}

我用了157MS,看到有的高手30MS, 请到访的高手赐教,谢谢!