[Gym100016D] Group Stage

最少就和刚好剩下的n-m个打平

最多就选m+1个互相输赢各半 如果场数为奇数就平一场

#include<cstdio>      #include<algorithm>      #include<cstring>      #include<vector>      #include<queue>    #include<deque>    #include<iostream>  #define SF scanf      #define PF printf      using namespace std;  typedef long long LL; int main(){freopen("group.in","r",stdin);int n, m; SF("%d%d", &n, &m);PF("%d ", n-m);PF("%d", (n-m-1) * 3 + m / 2 * 3 + (m & 1));return 0;}