Time Exceeded
Code
#include <cstdio>
using ll = long long;
inline ll sum_floor_div(ll N, ll M) {
ll res = 0;
for (ll d = 1, R; d <= M; d = R + 1) {
ll q = N / d;
R = N / q;
if (R > M) R = M;
res += q * (R - d + 1);
}
return res;
}
int main() {
int T; scanf("%d", &T);
while (T--) {
ll N; scanf("%lld", &N);
if (N == 1) {
puts("0");
continue;
}
ll ans = sum_floor_div(N, N - 1) - (N - 1);
printf("%lld\n", ans);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1207 D2. GCD equal Absolute Value (Hard Version)
- Contest
- Educational Round 1
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2025-07-14 16:24:46
- Judged At
- 2025-07-14 16:24:46
- Judged By
- Score
- 5
- Total Time
- ≥1099ms
- Peak Memory
- ≥428.0 KiB