当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

7161:Luxury cruise ship

题目描述
Kayzin plans to buy a luxury cruise ship which will cost N coins. But Kayzin didn't have enough coins, so Kayzin decided to start saving coins.

Kayzin will put 7 or 31 or 365 coins into his piggy bank each day. Now Kayzin wants to know at least how many days he will need to "exactly"(No more and no less) scrape together the money for buying a luxury cruise.

If Kayzin can't "exactly" scrape together the money for buying a luxury cruise, print -1.
输入解释
The first line contains an integer $T(T≤1000)$ . Then $T$ test cases follow.

For one case, the first line contains an integer $N$ $(1≤N≤10^{18})$ , $N$ denotes the coins that a luxury cruise ship will cost.
输出解释
Print an integer for each case, indicating the minimum number of days Kayzin needs.

If Kayzin can't "exactly" scrape together the money for buying a luxury cruise, print -1.
输入样例
5
14
38
55
403
996
输出样例
2
2
-1
3
16

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-7161

最后修改于 2022-09-15T06:17:06+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 524288/524288K(Java/Others)