本文共 1163 字,大约阅读时间需要 3 分钟。
Problem Description
Let’s define the function .Bo wanted to know the minimum number which satisfies .
note:
It is a pity that Bo can only use 1 unit of time to calculate this function each time.
And Bo is impatient, he cannot stand waiting for longer than 5 units of time.
So Bo wants to know if he can solve this problem in 5 units of time.
Input
This problem has multi test cases(no more than ).Each test case contains a non-negative integer .
Output
For each test case print a integer - the answer or a string “TAT” - Bo can’t solve this problem.Sample Input
233 233333333333333333333333333333333333333333333333333333333Sample Output
3 TAT超过5次就不行,所以临界值是2^32,就输出TAT。我一开始没把2^32本身算进去,死命WA。。。
#include#include #include #include #include #include #include
转载地址:http://kscvb.baihongyu.com/