237952026-01-29 18:46:11szentedLeggyorsabb pénzkeresés (50)cpp17Time limit exceeded 44/50261ms780 KiB
#include <iostream>

using namespace std;

int main()
{
    int n;
    int p;
    int a[100000];
    cin >> n;
    cin >> p;
    for(int i=0; i<n; i++){
        cin >> a[i];
    }

    int s=0;
    int mini_napok=n;
    int j=0;
    int napok=0;

    for(int i=0; i<n; i++){
        napok=0;
        j=i;
        s=0;
        while(s<p && j<n){
            s=s+a[j];
            j++;
            napok++;
        }
        if(napok<mini_napok && s>=p) mini_napok=napok;
    }
    cout << mini_napok;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base44/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0248ms588 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/27ms448 KiB
7Accepted2/217ms444 KiB
8Accepted2/224ms444 KiB
9Accepted2/27ms408 KiB
10Accepted2/220ms316 KiB
11Accepted2/228ms580 KiB
12Time limit exceeded0/2261ms780 KiB
13Accepted2/2182ms620 KiB
14Accepted2/271ms780 KiB
15Accepted2/2180ms616 KiB
16Accepted2/268ms776 KiB
17Accepted2/263ms580 KiB
18Accepted2/290ms564 KiB
19Time limit exceeded0/2223ms780 KiB
20Accepted2/2151ms616 KiB
21Accepted2/297ms564 KiB
22Accepted2/2129ms564 KiB
23Time limit exceeded0/2252ms564 KiB
24Accepted2/2127ms568 KiB
25Accepted2/2158ms536 KiB
26Accepted2/294ms556 KiB
27Accepted2/292ms592 KiB