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

 1 #include <iostream>
 2 #include <vector>
 3 #include <cstdio> 
 4 using namespace std;
 5 vector<int> v;
 6 int main(){
 7     int n = 0, i = 3, num;
 8     while(1){
 9         if(n > 100000)
10             break;
11         if(i % 3 == 0 || i % 5 == 0){
12             v.push_back(i);
13             n++;
14         }
15         i++;
16     }
17     while(cin >> num){
18         printf("%d\n", v[num - 1]);
19     }
20     return 0;
21 }

 

转载于:https://www.cnblogs.com/qinduanyinghua/p/6530948.html