175742025-07-24 15:13:25szjZenehallgatáscpp17Accepted 50/5050ms1548 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, t, i, k, curr = 0;
    cin >> n >> k;
    vector<int>vec;
    for(i=0; i<n; i++)
    {
        cin >> t;
        curr+=t;
        vec.push_back(curr);
    }
    for(i=0; i<k; i++)
    {
        cin >> t;
        t = t%vec[n-1];
        cout << lower_bound(vec.begin(), vec.end(), t)-vec.begin()+1 << " ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/050ms1456 KiB
3Accepted2/22ms316 KiB
4Accepted2/21ms508 KiB
5Accepted2/21ms316 KiB
6Accepted3/31ms684 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms428 KiB
9Accepted2/250ms1536 KiB
10Accepted2/250ms1452 KiB
11Accepted2/250ms1404 KiB
12Accepted2/250ms1456 KiB
13Accepted2/250ms1456 KiB
14Accepted2/250ms1468 KiB
15Accepted2/250ms1356 KiB
16Accepted2/250ms1456 KiB
17Accepted2/250ms1336 KiB
18Accepted2/248ms1456 KiB
19Accepted2/248ms1348 KiB
20Accepted2/248ms1456 KiB
21Accepted2/248ms1316 KiB
22Accepted3/348ms1416 KiB
23Accepted3/348ms1336 KiB
24Accepted3/348ms1548 KiB