245502026-02-12 17:44:04AkosVagyokEmborZenehallgatáscpp17Wrong answer 0/50300ms6452 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 i = 1; i <= sszam; i++) {
        for (int j = 1; j <= zsz; j++) {
            cout << "a";
        }
    }
}



int main()
{
    be();
    nagy();
    
    
}

SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms508 KiB
2Time limit exceeded0/0286ms5684 KiB
3Wrong answer0/248ms1340 KiB
4Wrong answer0/246ms1372 KiB
5Wrong answer0/246ms1280 KiB
6Wrong answer0/348ms1332 KiB
7Wrong answer0/348ms1336 KiB
8Wrong answer0/346ms1332 KiB
9Time limit exceeded0/2287ms5684 KiB
10Time limit exceeded0/2287ms5292 KiB
11Time limit exceeded0/2300ms6056 KiB
12Time limit exceeded0/2279ms5684 KiB
13Time limit exceeded0/2286ms5932 KiB
14Time limit exceeded0/2286ms5804 KiB
15Time limit exceeded0/2300ms6316 KiB
16Time limit exceeded0/2286ms6028 KiB
17Time limit exceeded0/2279ms5796 KiB
18Time limit exceeded0/2279ms5680 KiB
19Time limit exceeded0/2298ms6320 KiB
20Time limit exceeded0/2282ms5940 KiB
21Time limit exceeded0/2282ms5796 KiB
22Time limit exceeded0/3284ms5944 KiB
23Time limit exceeded0/3300ms6452 KiB
24Time limit exceeded0/3286ms5940 KiB