zoj 2829 Beautiful Number

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

 #include <iostream>
 #include <vector>
 #include <cstdio>
 using namespace std;
 vector<int> v;
 int main(){
     int n = , i = , num;
     while(){
         if(n > )
             break;
         if(i %  ==  || i %  == ){
             v.push_back(i);
             n++;
         }
         i++;
     }
     while(cin >> num){
         printf("%d\n", v[num - ]);
     }
     return ;
 }