so, I start by sorting the plate counts. Then I start n = 0, increasing by one each round. I partition n in a sorted order. Then I split the Mth plate count K times where K is the Mth partition
or do you mean you don't understand which number to output?
" For each integer n from 1 upwards, output the number of n by n matrices with entries which are 0 or 1 which are permutations of some Hankel matrix following the definition above."
.... I tried to give a better wording and ended up with even more unclear one.
But eah, it's the " For each integer n from 1 upwards, output the number of n by n matrices with entries which are 0 or 1 which are permutations of some Hankel matrix following the definition above."
I don't know how many of you guys are trying the Code Jam, but I just managed an algorithm for the small test cases on problem B. Anyone know any particularly difficult test cases?
@Lembik the spec might read more nicely if you first defined the property (and gave it a made-up name like "Hankelable") and then said, "your task is to count these"
hm you still start with the task. I meant that it might be simpler if the post is structured like "This is a Hankel matrix. This is a Hankelable matrix. This is your task."
@AlexA. In Spain it's 4 years undergrad, 1 year for the master's, but they want to change it again to the 3+2 and people are really angry because the master's here are like twice as expensive. I myself started before the 4+1, so mine was a 5 year degree
And this is not because of the older system; it was because we have quite inept politicians who thought they could do better than anybody else, and decided to create a plan that was different from everybody else
okay, done problem D as well... I have no clue if it's correct, because the problem changes qualitatively for input numbers greater than the small test set :/
Background
A binary Hankel matrix is a matrix with constant skew-diagonals (positive sloping diagonals) containing only 0s and 1s. E.g. a 5x5 binary Hankel matrix looks like
a b c d e
b c d e f
c d e f g
d e f g h
e f g h i
where a, b, c, d, e, f, g, h, i are either 0 or 1.
Let's define a ma...
@MartinBüttner I just went through a long chat with a friend of mine. Apparently my idea is completely impossible in Javascript because of the lack of weak references. I have to compromise and use pull-based systems (events are read when they're needed)
There would be no problem if the signal tree would be static, but the data objects break that requirement.
The system would still be just fine for games, but that's it.
I've recently signed up to the oneplusone website https://account.oneplus.net/sign-up, and noticied this checkbox recaptcha
How does it work, and how can I use it on my sites? Much better than those criptic words/digits :)
The recaptcha site does not mention any new recaptcha method... https...
Background
A binary Hankel matrix is a matrix with constant skew-diagonals (positive sloping diagonals) containing only 0s and 1s. E.g. a 5x5 binary Hankel matrix looks like
a b c d e
b c d e f
c d e f g
d e f g h
e f g h i
where a, b, c, d, e, f, g, h, i are either 0 or 1.
Let's define a ma...
I've recently signed up to the oneplusone website https://account.oneplus.net/sign-up, and noticied this checkbox recaptcha
How does it work, and how can I use it on my sites? Much better than those criptic words/digits :)
The recaptcha site does not mention any new recaptcha method... https...
