Submission #15,110

2025-02-13 08:34:47

cpp17

Wrong answer 42/50

18ms

556 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];
    }

    if (m >= k) cout << (m - k + 1) * (m - k + 2) / 2;
    else cout << 0;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	42/50
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	0/0	18ms	316 KiB
		4	Accepted	2/2	1ms	508 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	2/2	1ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	2/2	1ms	316 KiB
		13	Accepted	3/3	1ms	316 KiB
		14	Accepted	2/2	17ms	556 KiB
		15	Wrong answer	0/2	17ms	452 KiB
		16	Accepted	3/3	18ms	476 KiB
		17	Accepted	3/3	17ms	488 KiB
		18	Wrong answer	0/3	18ms	316 KiB
		19	Accepted	3/3	17ms	452 KiB
		20	Accepted	3/3	17ms	484 KiB
		21	Accepted	3/3	17ms	316 KiB
		22	Wrong answer	0/3	17ms	444 KiB