HOJ 1610 Twenty Questions

http://acm.hit.edu.cn/hoj/problem/view?id=1610

N個物品 每個問題K個答案 問最多問幾個問題可以確定某個物品

取對數即可

#include <stdio.h>
#include <math.h>

int main()
{
    double n, k, m;

    while (scanf("%lf %lf", &k, &n) != EOF)
    {
        if(n == 0 && k == 0)
        break;
        m = ceil(log(n)/log(k)) +1;
        printf("%.0lf items, %.0lf answers per question, %.0lf questions\n", n, k, m);
    }

    return 0;
}