153752025-02-19 09:42:23MrkzLeggyorsabb pénzkeresés (50)cpp17Wrong answer 0/501ms508 KiB
#include <iostream>
#include <fstream>
using namespace std;
int N,P;
int main()
{
    ifstream f("szamok.be");
    f>>N>>P;
    int F[N],mini=N,ossz=0,db=0;
    for(int i=1;i<=N;i++){
        f>>F[i];
    }
    for(int i=1;i<=N;i++){
        int j=i;
        ossz=0;
        db=0;
        while(ossz<=P){
            ossz+=F[j];
            j++;
            db++;
        }
        if(mini>db)
            mini=db;
    }
    cout<<mini;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms508 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms328 KiB
8Wrong answer0/21ms500 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms508 KiB
11Wrong answer0/21ms316 KiB
12Wrong answer0/21ms316 KiB
13Wrong answer0/21ms316 KiB
14Wrong answer0/21ms316 KiB
15Wrong answer0/21ms316 KiB
16Wrong answer0/21ms328 KiB
17Wrong answer0/21ms316 KiB
18Wrong answer0/21ms316 KiB
19Wrong answer0/21ms316 KiB
20Wrong answer0/21ms316 KiB
21Wrong answer0/21ms316 KiB
22Wrong answer0/21ms508 KiB
23Wrong answer0/21ms500 KiB
24Wrong answer0/21ms316 KiB
25Wrong answer0/21ms316 KiB
26Wrong answer0/21ms316 KiB
27Wrong answer0/21ms316 KiB