ZOJ.2829 Beautiful Number【水】 2015/09/22

Beautiful Number

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

---

Author: MAO, Yiqiang

Source: Zhejiang University Local Contest 2007, Preliminary

水，打表即可。

#include<iostream>#include<cstdio>#include<cstring>using namespace std;int p[100010],n;void init(){    int k = 1;    for( int i = 3 ; i <= 300000 ; ++i ){        if( i % 3 == 0 || i % 5 == 0 ){            p[k++] = i;        }        if( k > 100000 ) break;    }}int main(){    init();    while( ~scanf("%d",&n) ){        printf("%d\n",p[n]);    }    return 0;}