int calEncodeNumber(int length) { constexpr auto MOD = 1000000369; constexpr auto MAX = 2000001; size_t ans = 1; vector<bool> visited(MAX); for (size_t i = 0; i < MAX; ++i) visited[i] = false; for (int i = 2; i <= length; ++i) { size_t count = 0; if (visited[i]) continue; for (int j = 2 * i; j <= length; j += i) { visited[j] = true; } for (size_t j = i; j <= length; j *= i) count++; ans = ans * (count + 1) % MOD; } return ans; }
点赞 8

相关推荐

2025-12-26 10:52
河北传媒学院 Java
点赞 评论 收藏
分享
牛客网
牛客网在线编程
牛客网题解
牛客企业服务