题目描述
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
参考代码
#include <stdio.h>
int main()
{
int intInput;
int intQuo;
int intAri;
int intNumber;
int a[7]={12,0,2,3,6,7,9};
int intFirst;
while(scanf("%d",&intInput)!=EOF)
{
intFirst=0;
intQuo=intInput/7;
intAri=intInput%7;
if(0==intAri)
{
intFirst=3+15*(intQuo-1);
} else
{
intFirst=3+15*intQuo;
}
intNumber=intFirst+a[intAri];
printf("%dn",intNumber);
}
return 0;
}
解析
暂无