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
题意;给你n天,5天为工作日,2天为休息日,问最多可以休息几天,最少可以休息几天
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,min,max;
while(scanf("%d",&n)!=EOF)
{
min=0;
max=0;
if(n%7==0)
{
min=n/7*2;
max=n/7*2;
}
else
{
if(n%7==1)
{
max=n/7*2+1;
min=n/7*2;
}
else if(n%7>1&&n%7<=5)
{
max=n/7*2+2;
min=n/7*2;
}
else if(n%7==6)
{
max=n/7*2+2;
min=n/7*2+1;
}
}
printf("%d %d\n",min,max);
}
return 0;
}