153702025-02-19 09:18:02MrkzLeggyorsabb pénzkeresés (50)cpp17Wrong answer 6/5028ms776 KiB
#include <iostream>

using namespace std;
int N,P;
int main()
{
    cin>>N>>P;
    int F[N],mini=N,kezd=1,ossz=0,db=0;
    for(int i=1;i<=N;i++){
        cin>>F[i];
        db++;
        ossz+=F[i];
        if(ossz>=P){
            if(mini>db){
                mini=db;
                kezd=i;
            }
            db=0;
            ossz=0;
        }
    }
    cout<<mini;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base6/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/028ms576 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms500 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/24ms428 KiB
7Wrong answer0/24ms416 KiB
8Wrong answer0/24ms316 KiB
9Wrong answer0/24ms500 KiB
10Wrong answer0/24ms316 KiB
11Accepted2/228ms624 KiB
12Wrong answer0/228ms576 KiB
13Wrong answer0/228ms644 KiB
14Wrong answer0/228ms776 KiB
15Wrong answer0/228ms756 KiB
16Wrong answer0/228ms564 KiB
17Wrong answer0/228ms664 KiB
18Wrong answer0/228ms600 KiB
19Wrong answer0/228ms756 KiB
20Wrong answer0/228ms564 KiB
21Wrong answer0/228ms564 KiB
22Wrong answer0/228ms756 KiB
23Accepted2/228ms644 KiB
24Wrong answer0/228ms576 KiB
25Wrong answer0/228ms564 KiB
26Wrong answer0/228ms672 KiB
27Wrong answer0/228ms564 KiB