《ACM程序设计》书中题目 U - 21 美丽数字

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 a[100001],i,j,n=1,k;
  for(i=1;;++i)
  { if(i%3==0||i%5==0)
   { a[n]=i;
     ++n;
   }
    if(n>100000)break;
  }
  while(cin>>k)
  { cout<<a[k]<<endl;
  }
}