Maxim Buys an Apartment
以三个为一组,如6个房间,2个人占用时,这样放可以有最大的选择;0 1 0 0 1 0;
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int Max=1e5+10;
int main()
{
ll n,k,maxs,mins;
scanf("%lld%lld",&n,&k);
if(k==0)
{
printf("0 0\n");
return 0;
}
if(n==k)
mins=0;
else mins=1;
if(k<=n/3)
maxs=k*2;
else maxs=n-k;
printf("%lld %lld\n",mins,maxs);
return 0;
}