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整除,做一下预处理,要不会超时,用map存下。
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<int, int> m;
int count=0,N,num=1;
while (1)
{
if (num%3==0||num%5==0)
{
count++;
m[count]=num;
}
num++;
if (count>100000)
break;
}
while (cin>>N)
cout<<m[N]<<endl;
return 0;
}