151092025-02-13 08:33:48buzaszendvicsVirágos rét (50 pont)cpp17Wrong answer 38/5018ms632 KiB
#include <iostream>

using namespace std;

bool napok[100001];

int main()
{
    int n, k, m = 0;
    cin >> n >> k;

    for (int i = 0; i < n; i ++)
    {
        cin >> napok[i];
        m += napok[i];
    }

    cout << (m - k + 1) * (m - k + 2) / 2;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/018ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms324 KiB
7Accepted3/31ms568 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms316 KiB
13Accepted3/31ms316 KiB
14Accepted2/217ms472 KiB
15Wrong answer0/217ms456 KiB
16Accepted3/318ms572 KiB
17Accepted3/317ms316 KiB
18Wrong answer0/318ms408 KiB
19Accepted3/318ms600 KiB
20Accepted3/318ms632 KiB
21Accepted3/318ms316 KiB
22Wrong answer0/318ms496 KiB