/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 0ms 284.0 KiB
#2 Time Exceeded ≥2600ms ≥428.0 KiB
#3 Time Exceeded ≥2598ms ≥284.0 KiB

Code

#include <stdio.h>
#include <math.h>

int main() {
    int t;
    scanf("%d", &t);

    while (t--) {
        int n;
        scanf("%d", &n);

        int maxDiv = 0;

        for (int l = 1; l <= n; l++) {
            
       long long sum = 1LL * l * (l + 1) / 2;
            int div = 0;
            for (long long i = 1; i * i <= sum; i++) {
                if (sum % i == 0) {
                    div++;  
                    if (i != sum / i) div++;
					}
            }

            if (div > maxDiv) {
                maxDiv = div;
            }
        }
        printf("%d\n", maxDiv);
    }

    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:10:15
Judged At
2025-04-06 17:10:15
Judged By
Score
0
Total Time
≥2600ms
Peak Memory
≥428.0 KiB