85582024-01-21 21:17:08qertendVirágos rét (50 pont)cpp17Wrong answer 42/5019ms4128 KiB
#include <iostream>
using namespace std;

int main(int argc, char const *argv[])
{
    int retekSzama, K;
    cin >> retekSzama >> K;
    int szabadRetek = 0;
    int ret;
    for (int i = 0; i < retekSzama; i++) {
        cin >> ret;
        if (ret == 1) szabadRetek++;
    }
    int N = szabadRetek-K+1;
    if (szabadRetek >= K) cout << ((N)*(N+1)/2); //write the sum of all positive integers up to N (inclusive)
    else cout << (0);

    return 0;
}

SubtaskSumTestVerdictTimeMemory
base42/50
1Accepted0/03ms2152 KiB
2Accepted0/03ms2304 KiB
3Accepted0/019ms2372 KiB
4Accepted2/23ms2776 KiB
5Accepted2/23ms2736 KiB
6Accepted2/23ms2732 KiB
7Accepted3/33ms2856 KiB
8Accepted3/33ms3068 KiB
9Accepted3/33ms3348 KiB
10Accepted2/23ms3444 KiB
11Accepted3/33ms3572 KiB
12Accepted2/23ms3772 KiB
13Accepted3/33ms3888 KiB
14Accepted2/218ms3856 KiB
15Wrong answer0/218ms3968 KiB
16Accepted3/319ms4128 KiB
17Accepted3/318ms4116 KiB
18Wrong answer0/319ms4024 KiB
19Accepted3/319ms4000 KiB
20Accepted3/319ms4000 KiB
21Accepted3/319ms4032 KiB
22Wrong answer0/319ms4008 KiB