整除问题
https://www.nowcoder.com/practice/8e29045de1c84d349b43fdb123ab586a
def jc(n): # 求阶乘
ans = 1
for i in range(1, n + 1):
ans *= i
return ans
num = list(map(int, input().split(" ")))
n = num[0]
a = num[1]
k = 0
nj = jc(n)
while True:
ak = pow(a, k)
ak1 = pow(a, k + 1)
if nj % ak == 0 and nj % ak1 != 0:
break
else:
k = k + 1
print(k)
相关推荐
球球与墩墩：这不是前端常考的对象扁平化吗，面试官像是前端出来的
const flattern = (obj) => {
const res = {};
const dfs = (curr, path) => {
if(typeof curr === 'object' && curr !== null) {
const isArray = Array.isArray(curr);
for(let key in curr) {
const newPath = path ? isArray ? `${path}[${key}]` : `${path}.${key}` : key;
dfs(curr[key], newPath);
}
} else {
res[path] = curr
}
}
dfs(obj);
return res;
}
查看3道真题和解析