A10446 | Holidays
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
On the planet Mars a year lasts exactly $n$ days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.
输入格式
The first line of the input contains a positive integer $n$ ( $1<=n<=1000000$ ) — the number of days in a year on Mars.
输出格式
Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.
输入输出样例
输入 #1
14
输出 #1
4 4
输入 #2
2
输出 #2
0 2
In the first sample there are $14$ days in a year on Mars, and therefore independently of the day a year starts with there will be exactly $4$ days off .
In the second sample there are only $2$ days in a year on Mars, and they can both be either work days or days off.
In the second sample there are only $2$ days in a year on Mars, and they can both be either work days or days off.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted