Holidays

Holidays Time Limit:1000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Description

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.

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 1 000 000) — the number of days in a year on Mars.

Output

Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.

Sample Input

Input
14
Output
4 4
Input
2
Output
0 2
题目分析:
给定火星上每年多少天,算出最少与最多假期:
代码:
#include<stdio.h>
int main()
{
	int n,min,max,m,t;
	while(~scanf("%d",&n))
	{
		if(n<=5)
		{if(n>=2)
			printf("0 2\n");
			else
			printf("0 %d\n",n);
		}
		else
		{
			m=n%7;
			t=n/7;
			if(m<=2)
			{min=t*2;
			max=2*t+m;}
			if(m>2&&m<=5)
			{
				min=t*2;
				max=2*t+2;
			}
			if(m>5)
			{
				min=t*2+m-5;
				max=t*2+2;
			}
			printf("%d %d\n",min, max);
			
		}
	}
}

 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值