Time Exceeded
Code
#include <stdio.h>
int main() {
int t, n;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
int max = 0;
for (int l = 1; l <= n; l++) {
long long sum = (long long)l * (l + 1) / 2;
int div = 0;
for (long long i = 1; i * i <= sum; i++) {
if (sum % i == 0) div += (i * i == sum) ? 1 : 2;
}
if (div > max) max = div;
}
printf("%d\n", max);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1180 Maximum Divisor
- Contest
- Brain Booster #9
- Language
- C99 (GCC 13.2.0)
- Submit At
- 2025-04-06 17:05:55
- Judged At
- 2025-04-06 17:05:55
- Judged By
- Score
- 0
- Total Time
- ≥2599ms
- Peak Memory
- ≥420.0 KiB