A - Holidays
Codeforces Round #350 (Div. 2)
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.
Example
Input
14
Output
4 4
Input
2
Output
0 2
Note
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.
題意：在火星上一周與地球相同，周一到周五為工作日徐块，周六周日為周末毕泌，已知火星一年有x天，求周末最多和最少有幾天
解法：總天數(shù)除以7，余數(shù)分三種情況討論，x<=2, 2<x<=5, 5<x
代碼：
#include<iostream>
using namespace std;
int main()
{
int n,r,x,y;
cin>>n;
r=n%7;
x=n/7*2;
y=x;
if(r<=2)
y+=r;
else if(r<=5)
y+=2;
else{
y+=2;
x+=r-5;
}
cout<<x<<" "<<y<<endl;
return 0;
}
