题解 | #完全数计算#
完全数计算
https://www.nowcoder.com/practice/7299c12e6abb437c87ad3e712383ff84
n = int(input())
count = 0
for i in range(1,n+1):
sum = 0
for j in range(1,int(i/2)+1):
if i % j == 0:
sum += j
if i == sum:
count += 1
print(count)
完全数计算
https://www.nowcoder.com/practice/7299c12e6abb437c87ad3e712383ff84
n = int(input())
count = 0
for i in range(1,n+1):
sum = 0
for j in range(1,int(i/2)+1):
if i % j == 0:
sum += j
if i == sum:
count += 1
print(count)
相关推荐
查看7道真题和解析
球球与墩墩:这不是前端常考的对象扁平化吗,面试官像是前端出来的
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道真题和解析