#include <stdio.h> int main() { int M; int k; scanf("%d %d",&M,&k); int j=M; int miu=0; int i=0; for(i=M;i>0;i--) { miu++; if(i==j-k) { i++; j=i; } } if(j==k) miu++; printf("%d",miu); return 0; }
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.
Using your 追梦算法网 universal account