Блог пользователя simp_pro

Автор simp_pro, история, 21 месяц назад, По-английски
  • Проголосовать: нравится
  • +1
  • Проголосовать: не нравится

»
21 месяц назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

a[i+1] out of bounds.

»
21 месяц назад, # |
Rev. 3   Проголосовать: нравится 0 Проголосовать: не нравится

Your code seems to have a lot of issues, I just fixed it for runtime errors.

Shadowed declaration string a; and auto mul = [&] (int a, int b).

Can be divide by 0 int t = x/prod[i];.

What if prod is empty prod.back() = 1;

Can be accessed out of bound forn(_, take[i])

Can be overflow int ans = A * b;

  • »
    »
    21 месяц назад, # ^ |
    Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

    Thanks for replying. This prod[i] cannot be zero. I fixed the prod.back.forn(_, take[i]) canot overflow

    I have handled overflow using the gfg method. Is not this corrrect?

    • »
      »
      »
      21 месяц назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      I am not reviewing your logic, I just pointing out some code that has a potential runtime error.

      I see you create vector here with size of vector "cnt" vi prod(sz(cnt));. If cnt is an empty vector, prod is also an empty vector.

      Example

      In this code forn(_, take[i]), I see that you increase i in the outter loop and try to access the element take[i] without checking the size which can be out of bound. A counter-example would be k = 0 -> vector take is empty -> take[i] will give an error.

      This is a submission link that I try to fix your runtime error Submission. The overflow still exists, I don't know what method you use to handled overflow but it seems not working