Submission #18916799

Source Code Expand

#include <iostream>
#include <atcoder/modint>

int main() {
    long long N, K;
    std::cin >> N >> K;
    atcoder::modint1000000007 ans = (N-K+2) * (N*N+N*K-2*K*K+N+2*K+6) / 6;
    std::cout << ans.val() << std::endl;
    return 0;
}

Submission Info

Submission Time
Task D - Sum of Large Numbers
User maple116
Language C++ (GCC 9.2.1)
Score 400
Code Size 244 Byte
Status AC
Exec Time 5 ms
Memory 3604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01, sample_02, sample_03
All hand_01, hand_02, max_01, max_02, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, random_09, random_10, random_11, random_12, sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
hand_01 AC 4 ms 3420 KiB
hand_02 AC 2 ms 3540 KiB
max_01 AC 3 ms 3604 KiB
max_02 AC 2 ms 3604 KiB
random_01 AC 3 ms 3568 KiB
random_02 AC 2 ms 3388 KiB
random_03 AC 2 ms 3600 KiB
random_04 AC 2 ms 3504 KiB
random_05 AC 2 ms 3536 KiB
random_06 AC 2 ms 3488 KiB
random_07 AC 2 ms 3416 KiB
random_08 AC 3 ms 3540 KiB
random_09 AC 2 ms 3412 KiB
random_10 AC 2 ms 3424 KiB
random_11 AC 2 ms 3364 KiB
random_12 AC 2 ms 3416 KiB
sample_01 AC 2 ms 3564 KiB
sample_02 AC 5 ms 3604 KiB
sample_03 AC 2 ms 3596 KiB