zoj Beautiful Number（打表）

题目链接：

　　http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2829

题目描述：

　　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

 /*问题 查询第几个漂亮数字是多少
 解题思路 一般来讲，最直观的做法是将创建一个10 0000的数组，将每个漂亮数存进数组,最后查询即可*/
 #include <cstdio>
 int bn[];
 int main()
 {
     int count=,i=;
     while()
     {
         if(i %  ==  || i %  == ){
             bn[count++]=i;
             if(count > )
                 break;
         }
         i++;
     }
     int n;
     while(scanf("%d",&n) != EOF)
     {
         printf("%d\n",bn[n]);
     }
     return ;
 }