228412026-01-15 21:04:19helloworldVirágos rét (50 pont)cpp17Wrong answer 38/5017ms592 KiB
#include <stdlib.h>
#include <iostream>
using namespace std;

int N=0;
int M=0;
int a=0;
int db=0;




int main()
{
    cin>>N>>M;
    int szabad[N+1];
    for(int i=1; i<=N; i++){
        cin>>a;
        if(a==1){
            db++;
            szabad[db]=i;
        }
    }

    if(db<M)cout<<0<<" ";

    /*for(int i=1; i<=db; i++){
        cout<<szabad[i]<<" ";
    }
    cout<<"\n";*/

    /*else{
        for(int pos=1; (pos+M-1)<=db; pos++){
            int cur=M;
            while(pos+cur-1<=db){
                //cout<<szabad[pos]<<"-->"<<szabad[pos+cur-1]<<" ";
                cur++;
                lehetseges++;
            }
        }
        cout<<lehetseges;
    }*/


    //ciklusok nelkul
    if(db<M)cout<<0<<" ";
    else{
        int k=db-M+1;
        int lehetseges=(k*(k+1))/2;
        cout<<lehetseges;
    }

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/50
1Accepted0/01ms500 KiB
2Wrong answer0/01ms316 KiB
3Accepted0/017ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/22ms316 KiB
13Accepted3/31ms316 KiB
14Accepted2/217ms592 KiB
15Wrong answer0/217ms540 KiB
16Accepted3/317ms568 KiB
17Accepted3/317ms424 KiB
18Wrong answer0/317ms572 KiB
19Accepted3/317ms408 KiB
20Accepted3/317ms572 KiB
21Accepted3/317ms508 KiB
22Wrong answer0/317ms564 KiB