q
过山车
http://www.nowcoder.com/questionTerminal/065abfa6dfa34860b81cfbb0ab24ebda
eary(简单)
代码如下
#include<iostream>
using namespace std;
int main(){
long long n,k,min=0,max=0;
cin>>n>>k;
if(n==k||k==0);
else{
min=1;
if(n>=3k){
max=k2;
}
else{
max=n-k;
}
}
cout<<min<<" "<<max<<endl;
return 0;
}</iostream>