#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int n,k;
while(scanf("%d%d",&n,&k) == 2){
if (n % 2 == 1){
int ans;
if (k % 2 == 0)ans = -1;
else {
ans = (int)ceil(n*1.0/k);
if (ans % 2 == 0)++ans;
}
printf("%d\n",ans);
}else {
int ans;
if(k%2==1){
if (k > n/2 && k <=n-1){
ans = (int)ceil(n*1.0/(n-k));
if (ans % 2 == 1)++ans;
}
else if (k <= n/2 ){
ans = (int)ceil(n*1.0/k);
if (ans %2==1)++ans;
}
}else{
if (k > n/2 && k < n-1)ans =3;
else if (k <= n/2){
ans = (int)ceil(n*1.0/k);
}
}
printf("%d\n",ans);
}
}
return 0;
}
翻硬币问题
最新推荐文章于 2022-03-24 10:46:07 发布