For each function f(n)f(n) and time tt in the following table, determine the largest size nn of a problem that can be solved in time tt, assuming that the algorithm to solve the problem takes f(n)f(n) microseconds.
译:假设求解问题的算法需要f(n)毫秒,对下面中的每个函数f(n)和时间t,确定可以在时间t内求解的问题的最大规模n。
注:在算法中,计算机1s一般可执行最大操作10^6。
此图来自
*[https://ita.skanev.com/01/problems/01.html]: