容易想到,先排两天假期在前面可以产生最大的假期,注意最小的假期,也需要注意最后不足一周的情况。
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#define MAX 100005
#define mod 998244353ll
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
int main() {
freopen("a.txt", "r", stdin);
freopen("b.txt", "w", stdout);
int n;
cin >> n;
if (n <= 2) {
cout << 0 << " " << n << endl;
return 0;
}
int s1, s2;
int t = n / 7;
s1 = t * 2;
if (n % 7 >= 6) s1++;
s2 = 2;
n -= 2;
t = n / 7;
s2 += t * 2;
if (n % 7 >= 6) s2++;
cout << s1 << " " << s2 << endl;
return 0;
}