第五题 装饰。事后想的,未作过多测试,大家帮忙看下。🤗 int calnumkind(int m, int n){ if (m == 1) return n; int sum = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (i * pow((double)j, m - 1) <= n)//只验证m个数中最大值是否超过n,即i*j^(m-1)<=n? sum=(sum+1)%998244353; else break; } return sum; }
点赞 评论
牛客网
牛客企业服务