194392025-12-09 12:45:36markfsibianMekk Mester munkái (50 pont)cpp17Wrong answer 0/50234ms1416 KiB
#include <iostream>

using namespace std;

int v[100001], n, m;

int bins(int v[100001], int n, int t)
{
    t = t % v[n];
    int b = 1;
    int j = n;
    int k;
    int m = (b + j) / 2;
    while (b <= j)
    {
        k = (b + j) / 2;
        if (v[k] == t)
            return k;
        else if (v[k] > t)
            j = k - 1;
        else
            b = k + 1;
    }
    return b;
}

int main()
{
    cin >> n >> m;
    int a;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a;
        v[i] = v[i - 1] + a;
    }
    for (int i = 1; i <= m; ++i)
    {
        cin >> a;
        cout << bins(v, n, a) << " ";
    }
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms500 KiB
2Wrong answer0/019ms316 KiB
3Wrong answer0/114ms564 KiB
4Wrong answer0/114ms564 KiB
5Wrong answer0/214ms564 KiB
6Wrong answer0/214ms556 KiB
7Wrong answer0/214ms564 KiB
8Wrong answer0/214ms420 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/117ms460 KiB
11Wrong answer0/117ms420 KiB
12Wrong answer0/216ms448 KiB
13Wrong answer0/216ms544 KiB
14Wrong answer0/217ms432 KiB
15Wrong answer0/217ms420 KiB
16Wrong answer0/33ms316 KiB
17Wrong answer0/2233ms1176 KiB
18Wrong answer0/2234ms1216 KiB
19Wrong answer0/4230ms1272 KiB
20Wrong answer0/4229ms1332 KiB
21Wrong answer0/4224ms1416 KiB
22Wrong answer0/4234ms1332 KiB
23Wrong answer0/4224ms1332 KiB