245452026-02-12 17:35:19AkosVagyokEmborZenehallgatáscpp17Wrong answer 0/5071ms1272 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> zenek, st;
int zsz, sszam;
void be() {
    cin >> zsz>>sszam;
    zenek.resize(zsz+1);
    st.resize(sszam + 1);
    for (int i = 1; i <= zsz; i++) {
        cin >> zenek[i];
        if (i != 1) {
            zenek[i] += zenek[i-1];
        }
    }
    for (int i = 1; i <= sszam; i++) {
        cin >> st[i];        
    }
    int index = 0;
}
void nagy() {
    for (int k = 1; k <= sszam; k++) {
        
    }
}



int main()
{
    be();
    nagy();
    cout << 5 % zenek[zenek.size() - 1];
    
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/071ms1192 KiB
3Wrong answer0/22ms316 KiB
4Wrong answer0/22ms316 KiB
5Wrong answer0/22ms336 KiB
6Wrong answer0/32ms316 KiB
7Wrong answer0/32ms360 KiB
8Wrong answer0/32ms368 KiB
9Wrong answer0/271ms1196 KiB
10Wrong answer0/271ms1192 KiB
11Wrong answer0/271ms1260 KiB
12Wrong answer0/271ms1196 KiB
13Wrong answer0/268ms1200 KiB
14Wrong answer0/268ms1272 KiB
15Wrong answer0/268ms1268 KiB
16Wrong answer0/268ms1272 KiB
17Wrong answer0/267ms1196 KiB
18Wrong answer0/264ms1200 KiB
19Wrong answer0/264ms1192 KiB
20Wrong answer0/263ms1076 KiB
21Wrong answer0/261ms1192 KiB
22Wrong answer0/363ms1192 KiB
23Wrong answer0/361ms1188 KiB
24Wrong answer0/361ms1196 KiB