Beautiful Number
时间: 1ms 内存:64M
描述:
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?
输入:
The input consists of one or more test cases. For each test case, there is a single line containing an integer N.
输出:
For each test case in the input, output the result on a line by itself.
示例输入:
1
2
3
4
示例输出:
3
5
6
9
提示:
参考答案(内存最优[748]):
#include<stdio.h>
int main()
{
long int i,j,n;
while((scanf("%ld",&n))!=EOF)
{
j=0;
for(i=3; i<=10000000; i++)
if(i%3==0||i%5==0)
{
j++;
if(j==n)
{
printf("%ld\n",i);
break;
}
}
}
return 0;
}
参考答案(时间最优[0]):
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
int t=n/7;
int e=t*15;
n%=7;
while(n)
{
e++;
if(e%3==0||e%5==0)n--;
}
cout<<e<<endl;
}
return 0;
}
题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。