package com.company;

class Solution {

    // 下面第二种做法貌似是OJ原来的做法,但是是错误的

    // 看了这个解答 https://discuss.leetcode.com/topic/66856/major-flaw-in-current-algorithm-fixed

    public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {

        // 有5种状态

        int circle = minutesToTest / minutesToDie + ;

        int ret = ;

        long num = ;

        while (num < buckets) {

            num *= circle;

            ret++;

        }

        return ret;

    }


    // 以下答案不太对

    public int poorPigs2(int buckets, int minutesToDie, int minutesToTest) {

        if (minutesToDie == ) {

            return ;

        }

        int circle = minutesToTest / minutesToDie;

        if (circle == ) {

            return ;

        }

        int batch = (buckets + (circle - )) / circle;

        int ret = ;

        long num = ;

        while (num < batch) {

            num *= ;

            ret++;

        }

        if (num == batch && circle != ) {

            return ret + ;

        }

        else {

            return ret;

        }

    }

}

public class Main {

    public static void main(String[] args) throws InterruptedException {

        System.out.println("Hello!");

        Solution solution = new Solution();

        // Your Codec object will be instantiated and called as such:

        int ret = solution.poorPigs(, , );

        System.out.printf("ret:%d\n", ret);

        System.out.println();

    }

}