[UVa 11384]Help is needed for Dexter

题解

我们对于$n$，保留$lfloor {n over 2} floor$，以上的部分减去$lceil {n over 2} ceil$这样每次将区间缩小$1 over 2$，保证最优解。

//It is made by Awson on 2017.9.16
#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Abs(a) ((a) < 0 ? (-(a)) : (a))
using namespace std;

int n;

int f(int n) {
    return n != 1 ? f(n/2)+1 : 1;
}
void work(int n) {
    printf("%d
", f(n));
}
int main() {
    while (~scanf("%d", &n))
        work(n);
    return 0;
}