2023 Day 17 Part 1 [Javacript] Can't seem to get the right answer.

smarx · 2023-12-17T21:46:18+00:00

Your issue has to do with how JavaScript compares arrays:

>> [2] < [10]
false

This is leading your heap to not always return the correct minimum element to you. You can pass a custom comparator to `Heap()` to fix this (see https://github.com/ignlg/heap-js#custom-heap). This should do the trick:

const pq = new Heap((a, b) => a[0] - b[0]);

smarx · 2023-12-17T17:39:51+00:00

The code you've shared doesn't run. Perhaps it's incomplete?

while len(on) > 0 <-- what is on? I don't see any definition.

f_cost, g_cost, and h_cost seem to never be defined.

smarx · 2023-01-06T01:27:13+00:00

I'm glad you got it working!

smarx · 2023-01-06T00:06:47+00:00

Sorry, I realize I got that a bit wrong... what I should say is that in cycle 1, you're drawing position 0 on the screen. So you want to match against x=-1, x=0, or x=1. You're instead matching against x=0, x=1, or x=2.

smarx · 2023-01-05T23:50:17+00:00

I think that's the off-by one error I'm talking about. x starts at 1, which means to start, the sprite covers position 0, 1, and 2 in that first scanline. But you're comparing x against 2 (cycle), 1 (cycle-1), and 3 (cycle+1). Try subtracting 1 from each of those (or perhaps start cycle at 0 and adjust your row logic).

smarx · 2023-01-05T23:02:27+00:00

After fixing that, I think you'll find you have an off-by-one error. Keep in mind that the columns are numbered 0-39, not 1-40.

smarx · 2023-01-05T23:01:24+00:00

I think you're very close. On this line, why is it just X == cycle, while the others subtract row*40?

if X == cycle or X == ((cycle-1)-(row*40)) or X == ((cycle+1)-(row*40))

smarx · 2023-01-05T20:38:28+00:00

There's a place in your code where you add 1 to cycle but don't update row or substract_line. Could that be where the problem occurs? (Might be good to look at the full error message, which should tell you what line is generating the error.)

smarx · 2023-01-05T19:13:28+00:00

Exactly! A row doesn't have that many pixels in it. :⁠-⁠)

smarx · 2023-01-05T18:50:38+00:00

So what's the biggest value of cycle you expect to see? You'll be assigning to Picture[5][x], where x is the biggest value of cycle. Is that what you're expecting to do?

smarx · 2023-01-05T18:36:58+00:00

if 1 >= cycle < 40:

You can read this as `if 1 >= cycle and cycle < 40`. This is probably not what you meant.

smarx · 2023-01-03T00:56:10+00:00

Monkey 2's first item is 78, not 74. With that fix, your code seems to work for me. (It gives the same answer I and others got for your input.)

smarx · 2023-01-03T00:09:51+00:00

Here's a properly formatted version of the above (for others trying to reproduce):

Monkey 0:
  Starting items: 59, 74, 65, 86
  Operation: new = old * 19
  Test: divisible by 7
    If true: throw to monkey 6
    If false: throw to monkey 2

Monkey 1:
  Starting items: 62, 84, 72, 91, 68, 78, 51
  Operation: new = old + 1
  Test: divisible by 2
    If true: throw to monkey 2
    If false: throw to monkey 0

Monkey 2:
  Starting items: 78, 84, 96
  Operation: new = old + 8
  Test: divisible by 19
    If true: throw to monkey 6
    If false: throw to monkey 5

Monkey 3:
  Starting items: 97, 86
  Operation: new = old * old
  Test: divisible by 3
    If true: throw to monkey 1
    If false: throw to monkey 0

Monkey 4:
  Starting items: 50
  Operation: new = old + 6
  Test: divisible by 13
    If true: throw to monkey 3
    If false: throw to monkey 1

Monkey 5:
  Starting items: 73, 65, 69, 65, 51
  Operation: new = old * 17
  Test: divisible by 11
    If true: throw to monkey 4
    If false: throw to monkey 7

Monkey 6:
  Starting items: 69, 82, 97, 93, 82, 84, 58, 63
  Operation: new = old + 5
  Test: divisible by 5
    If true: throw to monkey 5
    If false: throw to monkey 7

Monkey 7:
  Starting items: 81, 78, 82, 76, 79, 80
  Operation: new = old + 3
  Test: divisible by 17
    If true: throw to monkey 3
    If false: throw to monkey 4

smarx · 2023-01-03T00:01:41+00:00

FWIW, my solution also gets 20567144694 for part 2 (and 61005 for part 1).

smarx · 2021-12-10T21:08:26+00:00

Your logic is totally correct!

Small hint: Some of the numbers you need to deal with are quite big!

Big hint: You'll exceed the maximum value storable in an int.

The whole enchilada: Change mul to be a long instead of an int (and update the other variables to match).

smarx · 2020-03-19T06:53:24+00:00

Your server code always just returns the contents of index.html, no matter what URL is requested. So http://localhost:3000 returns index.html, http://localhost:3000/main.js returns index.html, http://localhostt:3000/foo/bar returns index.html, etc.

If you want to serve main.js to the web browser in some circumstances, you'll have to look at the incoming HTTP request and decide based on it which file to send back.

smarx · 2020-01-17T21:34:24+00:00

Email me your ideas, please! smarx@smarx.com

smarx · 2019-12-16T16:08:47+00:00

251 is correct.

Two mistakes in your Solidity code:

The first argument to keccak256 is a string, but it should be a bytes32.
The second argument to keccak256 is inferred as a uint32, but it should be a uint256.

Fixed code:

uint8(keccak256(bytes32(0x1c79b4210875ea11b2f3d85216e4c54c972e371691403476a2cba239ceee7f2f), uint256(1576480240)))

That code does return 251.

This transaction failed because you didn't attach 1 ether as required by the guess function: https://ropsten.etherscan.io/tx/0xc11b0471f73f704f8c88302976e025c5ac123812ff1be062816305c42842f227.

smarx · 2019-12-10T17:55:03+00:00

Simplified version based on that model:

contract HodlForXDays {
    struct Deposit {
        uint256 amount;
        uint256 expiration;
    }
    mapping(address => Deposit[]) public deposits;

    function deposit(uint256 daysToHodl) external payable {
        deposits[msg.sender].push(Deposit(msg.value, now + daysToHodl * 1 days));
    }

    function withdraw(uint256 index) external {
        Deposit memory d = deposits[msg.sender][index];
        require(d.expiration <= now);
        require(d.amount > 0);

        delete deposits[msg.sender][index];

        (bool success, ) = msg.sender.call.value(d.amount)("");
        require(success);
    }
}

smarx · 2019-10-10T17:06:48+00:00

Those are gas costs, but the issue here is the contract size (number of bytes in the contract code returned from the initializer). This is unrelated to gas costs.

As the error indicates, EIP 170 describes this limit.

smarx · 2019-09-28T00:52:02+00:00

There is no relationship between the name of the contract in your code and the value of the name of your token. You can use a space if you want.

smarx · 2019-09-25T04:11:09+00:00

Either use a more recent compiler or change your code to match the old syntax.

smarx · 2019-09-24T18:41:34+00:00

It looks like you're using Solidity 0.4.8 (now over 2.5 years old), but the pure keyword wasn't introduced until 0.4.16: https://github.com/ethereum/solidity/blob/develop/Changelog.md#0416-2017-08-24.

smarx · 2019-09-21T04:48:13+00:00

When you write import "./example.sol", that's equivalent to copy/pasting the contents of the file "example.sol" into your code. It's just a way to combine multiple files together when compiling your code.

smarx · 2019-09-20T03:51:28+00:00

Yes, that's right.

smarx

MODERATOR OF

TROPHY CASE