171672025-05-27 23:25:05MolnárVirágos rét (50 pont)cpp17Wrong answer 42/5018ms956 KiB
#include <iostream>

using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    int* ret = new int[N];
    int viragdb=0;
    for (int i = 0;i < N;i++) {
        cin >> ret[i];
    }
    for (int i = 0;i < N;i++) {
        if (ret[i])viragdb++;
    }
    int db=0;
    if (viragdb - K >= 0) {
        db = (viragdb - K + 2) * (viragdb - K+1) / 2;
    }
    cout << db;
    return 0;
}

//http://tehetseg.inf.elte.hu/nemes/2024/nt24-2f2.pdf
//2024, 2. korosztaly
//egydimenzios tombok
SubtaskSumTestVerdictTimeMemory
base42/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/017ms820 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms548 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms556 KiB
10Accepted2/21ms508 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms508 KiB
13Accepted3/31ms316 KiB
14Accepted2/217ms752 KiB
15Wrong answer0/217ms820 KiB
16Accepted3/318ms916 KiB
17Accepted3/317ms820 KiB
18Wrong answer0/317ms920 KiB
19Accepted3/317ms884 KiB
20Accepted3/318ms956 KiB
21Accepted3/317ms896 KiB
22Wrong answer0/317ms804 KiB