I recently stumbled across a piece of music for the piano that confused me a little. original

rearranged

The first image is how I found the score, the second is how I rearranged it myself.

How I usually find pieces, is that the right hand takes the treble clef, and the left hand the bass clef. If this is the case then the top example would be very unpractical, but perhaps it is grouped by how the notes harmonically fit?

Personally I find it more comfortable when reading it like the bottom example. But there could be a good reason for the arrangement of the notes like above.

Is there a rule how to write/divide the notes between the clefs? Or are there guidelines for how this is usually written? And why is it done that way?

For those interested in the piece it is Ruins from Homestuck

There is some app that turns on mobile data. I turn it off but on sleep or power up it is back on. It is very annoying and potentially costly since I do not have a data plan. (this seems like an intentional way to rip off consumers... off should mean off)

Welcome to the grinder.

Your task is to make big rocks into small rocks by grinding them.

Take an input of a big rock of size n > 3 and grind it.

Continue to grind the rocks by dumping them into the grinder until the size of all the rocks are 2.

rocks are always grinded into equal even halves. If the result of a grinding is odd take result - 1.

Print the output of each grinding as you proceed.

Examples

input: 5

output: 22

The result are two rocks of size 2

input: 50

output:

2424 //two rocks of size 24
12121212 //four rocks of size 12
66666666 //8 rocks of size 6
2222222222222222

the result is 16 rocks of size 2

input: 30

output:

1414
6666
22222222

the result is 8 rocks of size 2

This is so the shortest code wins! Have fun and good luck!

What do you guys think of using Windows Azure for deploying a custom built game server. It's being built in C#, and I want to get a few things down before stretching too far into the project.

I like the idea of being scalable, but I also know that I will never get to the scale of anything to the scale of WOW, or something quite as big. It will just be an interesting journey to test something like this.

So, will Windows Azure work for that, or is there any other services that can provide something like that?

I read somewhere that if you take an action that causes an AoO, from the subsequent roll for that action, you have to subtract the eventually taken damage. Is it right?

If yes, does this apply too to the case where I move away from a threatened square, causing an AoO, to attack a creature? Do I have to subtract the damage from the AoO from my next attack roll?

I remember that I read this in the System Operational Reference Digest. There under Combat maneuvre (page 10) there is:

Bull Rush (standard action)
One size category larger or less or part of a charge

  1. Resolve AoO - Resolve AoO from the target. The Improved Bull Rush feat (or similar ability) avoids drawing AoO.
  2. Roll - Subtract any target’s AoO damage on the roll.
  3. Effect - Success: Push the target back 5 feet plus 5 more feet for each 5 by which the roll exceeds the CMD. You can move with the target if you have movement left.

Fail: Your move ends in front of the target.
You cannot bull rush a target into a solid square or obstacle.

The point 2. says: Subtract any target’s AoO damage on the roll. This for all CM with a roll (disarm, grapple, overrun, etc).

I currently have a full time job and I don't really like it. That said, I love my career choice. I've been a software engineer for over 5 years. I think my forte is that I care about clean code and doing things the right way. I've had other coworkers tell me they've never seen someone write code as fast as I do that's as clean as it is. I recently read this great article on becoming a consultant and it really inspired me.

The scariest part about becoming a consultant is I don't know what the migration path should be. I don't want to quit my day job then start looking for consulting work (especially because I don't even know where to look). But, for all I know that's the best way to do it.

Can anyone give me advice on how to gradually become a full time consultant?

Is there a way to block your friends from seeing who liked your photos on Facebook, but still see the number of likes? I mean "1000 people like X's photo" but not showing who.

I'm looking for a native OSX desktop application (needs to work offline) in which I can edit plain text documents, and preview how they'll look with markdown formatting applied.

At a minimum, I need it to be able to understand and display all the "official" markdown syntax, but save as straight-up .txt files.

I have a time authority and I want to securely set a client's time to this authority's time/date within a precision of $\delta$ seconds. The authority's public key is known to the client. This was my idea:

  1. A client sends a request with a 128-bit randomly generated nonce to the authority, and starts a timer.
  2. The server replies with $time\_data$ and $sign(time\_data || nonce)$. $time\_data$ is some representation of time with a high precision and constant length (for example 16 bytes).
  3. The client waits until a response is received or until $2\delta$ seconds have passed.
  4. The client stops the timer, having measured $\Delta t$ since it started, and verifies that ${\Delta t \over 2} < \delta$. Then it verifies the signature using the given time data and the latest sent nonce. If everything passes then it sets the time to $time\_data + {\Delta t \over 2}$. If not go back to step 1.

As far as I can see there is no attack on this scheme that allows any adversary to let the client accept a time that is not within $\delta$ seconds of the actual time of the authority. Am I missing something?

I'm also wondering if there's any way to improve precision above the minimum delay $\Delta t$ of the network without losing security of the synchronized time, similar to what NTP does with estimating network latency.

Some pools use a modified bitcoind that uses different rules for choosing the transactions to include in a block. Are there any pools that knowing one transaction to be included in a block would discard it if another transaction on the same inputs would arrive with a higher fee? That is to say, when faced with a double spend attack between a transaction that arrived earlier and a transaction that pays them more, the pool would choose the latter?