307553: CF1373A. Donut Shops
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Donut Shops
题意翻译
有两个甜甜圈店。 第一家店零售甜甜圈:每个甜甜圈的价格为 $a$ 美元。 第二家店散装出售甜甜圈:一盒 $b$ 个甜甜圈的价格为 $c$ 美元。 **只能整盒买。** 在第一家商店中购买几个甜甜圈比在第二家商店中便宜? 在第二家商店中购买几个甜甜圈比在第一家商店中便宜? 如果其中某个答案不存在,输出 $-1$。 如果有多个可能的答案,请输出任意一个。 输出的值应 $\leq 10^9$。 可以证明,如果存在答案,那么在 $10^9$ 内也必定存在答案。题目描述
There are two rival donut shops. The first shop sells donuts at retail: each donut costs $ a $ dollars. The second shop sells donuts only in bulk: box of $ b $ donuts costs $ c $ dollars. So if you want to buy $ x $ donuts from this shop, then you have to buy the smallest number of boxes such that the total number of donuts in them is greater or equal to $ x $ . You want to determine two positive integer values: 1. how many donuts can you buy so that they are strictly cheaper in the first shop than in the second shop? 2. how many donuts can you buy so that they are strictly cheaper in the second shop than in the first shop? If any of these values doesn't exist then that value should be equal to $ -1 $ . If there are multiple possible answers, then print any of them. The printed values should be less or equal to $ 10^9 $ . It can be shown that under the given constraints such values always exist if any values exist at all.输入输出格式
输入格式
The first line contains a single integer $ t $ ( $ 1 \le t \le 1000 $ ) — the number of testcases. Each of the next $ t $ lines contains three integers $ a $ , $ b $ and $ c $ ( $ 1 \le a \le 10^9 $ , $ 2 \le b \le 10^9 $ , $ 1 \le c \le 10^9 $ ).
输出格式
For each testcase print two positive integers. For both shops print such $ x $ that buying $ x $ donuts in this shop is strictly cheaper than buying $ x $ donuts in the other shop. $ x $ should be greater than $ 0 $ and less or equal to $ 10^9 $ . If there is no such $ x $ , then print $ -1 $ . If there are multiple answers, then print any of them.
输入输出样例
输入样例 #1
4
5 10 4
4 5 20
2 2 3
1000000000 1000000000 1000000000
输出样例 #1
-1 20
8 -1
1 2
-1 1000000000