z-cycle bad problem statement

I think z-cycle has bad problem statement in both serbian and english language...

it says: Find the cycle with the lowest weight that contains the nodes 1 and N and whose path goes through every node at most once

but I think that in solution you need to consider: Find the cycle with the lowest weight that contains the nodes 1 and N and whose path goes through every edge at most once

because I've sent both solutions ( which I think I coded correctly ) and that one that have considered edges have passed...

Please someone check this, and if I am right, please correct problem statement...

http://z-trening.com/forum.php?show_board=10002&ref_id=10002&view_topic=111638

Yes, as i've seen admin's solution he checks for that, every edge at most once, not every node at most once.

And the problem is, that this task is locked for moderators, which means we can't edit the task descriptions, or change the test cases, because it has already been used in a competition. I've already informed admin about this task, now i'm waiting