For a given n-bit positive integer a and positive integer k, to design an algorithm to identify the composition of the remaining number of the smallest number of new programs to delete a few.
对于给定的n位正整数a和正整数k,设计一个算法找出剩下数字组成的新数最小的删数方案。
So the key word here is that we asked you to identify the third excited state. So, what white is n equal 4 Ok to for the third excited state? 4 OK.
这里的关键的地方是我,要你们找到第三激发态,第三激发态的n等于多少?
应用推荐