King of Gamers

NC236490. King of Gamers

描述

Little G is going to play $n$ games.

Little G is the king of gamers. If he wants to win, he will definitely win a game. But if he doesn't care about winning or losing, he will lose a game because of his bad luck. Little G has an expected winning rate of $x=\frac{a}{b}$ . When playing the $i$ -th game, if his current winning rate is lower than or equal to $x$ , he will be eager to win and win the game easily. Otherwise, he will enjoy the game and lose it.

Given $n,a,b$ , Little G is wondering how many games he will win.

Note that when playing the first game, the winning rate is regarded as $0$ .

It is guaranteed that the answer is either $\lfloor n*x \rfloor$ or $\lfloor n*x \rfloor +1$ .

输入描述

The input consists of multiple test cases.

The first line consists of a single integer $T$ ( $1\le T \le 100000$ ) - the number of test cases.

In the following $T$ lines, each line consists of three integers $n,a,b$ ( $1\le n\le 10^9, 0\le a\le b\le 10^9,b\neq 0$ ), denoting a test case.

输出描述

Print  lines. Print one integer in each line, representing the answer of a test case.

示例1

输入:

输出:

2
5
1

原站题解

上次编辑到这里，代码来自缓存点击恢复默认模板

C++ 解法, 执行用时: 433ms, 内存消耗: 1272K, 提交时间: 2022-06-18 20:37:47

#include<bits/stdc++.h>
using namespace std;
long long T,n,a,b;
int main(){
	cin>>T;
	while(T--)
	{
		cin>>n>>a>>b;
		cout<<(n-1)*a/b+1<<'\n';
	}
}

pypy3 解法, 执行用时: 952ms, 内存消耗: 30088K, 提交时间: 2022-04-17 18:30:50

for i in range(int(input())):
    n,a,b = map(int,input().split())
    print(int((n-1)*a/b)+1)

Python3 解法, 执行用时: 1147ms, 内存消耗: 5400K, 提交时间: 2022-04-21 10:41:59

T=int(input())
while T:
    T-=1
    n,a,b=map(int,input().split())
    print((n-1)*a//b+1)

上一题

下一题

详情