2020 GDUT Rating Contest I (Div. 2) B.MooBuzz

最新推荐文章于 2020-03-12 21:20:53 发布

「已注销」

最新推荐文章于 2020-03-12 21:20:53 发布

阅读量116

点赞数

本文链接：https://blog.csdn.net/qq_39581539/article/details/104806087

版权

来源 codeforces 2020 GDUT Personal Training Contest I (Div. 2) B

题目：
Farmer John’s cows have recently become fans of playing a simple number game called “FizzBuzz”. The rules of the game are simple: standing in a circle, the cows sequentially count upward from one, each cow saying a single number when it is her turn. If a cow ever reaches a multiple of 3, however, she should say “Fizz” instead of that number. If a cow reaches a multiple of 5, she should say “Buzz” instead of that number. If a cow reaches a multiple of 15, she should say “FizzBuzz” instead of that number. A transcript of the first part of a game is therefore: 1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, FizzBuzz, 16

Having a slightly more limited vocabulary, the version of FizzBuzz played by the cows involves saying “Moo” instead of Fizz, Buzz, and FizzBuzz. The beginning of the cow version of the game is therefore

1, 2, Moo, 4, Moo, Moo, 7, 8, Moo, Moo, 11, Moo, 13, 14, Moo, 16

Given N (1≤N≤109), please determine the Nth number spoken in this game.

Test cases 2-5 satisfy N≤106.

Input
The input consists of a single integer, N.

Output
Please print out the Nth number spoken during the game.

Example
input
4
output
7
Note
The 4th number spoken is 7. The first 4 numbers spoken are 1, 2, 4, 7, since we skip over any time a cow says “Moo”.

题意：找出第n个不能被3和5整除的正整数。
思路：给定了范围，直接二分查找，设当前数字为mid,mid/3、mid/5就是1到当前数去掉3 和5倍数后是第几个数，但是这样会把15的倍数去掉两次，所以要再加上一个mid/15。

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
int n;
long long l=0,r=2000000000;
int main()
{
	cin>>n;
	while (l!=r)
	{
		int mid=(l+r)/2;
		if (mid-mid/3-mid/5+mid/15>=n) r=mid;
		else l=mid+1;
	}
	cout<<l;
	return 0;
}