ACM程序设计 书中题目U(美丽的数字)

Description

Mike is very lucky, as he has two beautiful numbers, 3 and 5. But he is so greedy that he wants infinite beautiful numbers. So he declares that any positive number which is dividable by 3 or 5 is beautiful number. Given you an integer N (1 <= N <= 100000), could you please tell mike the Nth beautiful number?

Input

The input consists of one or more test cases. For each test case, there is a single line containing an integer N.

Output

For each test case in the input, output the result on a line by itself.

Sample Input

1
2
3
4

Sample Output

3
5
6
9

题的意思是，能被3或5整除的数字是美丽的数字，求第n个美丽的数字的值。

我的思路很简单，开始怕超时，但并没有。

把所有美丽的数字找出来存在一个数组里，输出的时候直接下标减一就结束了。

代码如下：

#include <bits/stdc++.h>
using namespace std;
int main()
{
        int n=0,i=3,num;
        vector<int> v;
        while(true)
        {
                if(n>100000)
                        break;
                if(i%3==0||i%5==0)
                {
                        v.push_back(i);
                        n++;
                }
                i++;
        }
        while(cin>>num)
                cout<<v[num-1]<<endl;
}