Official BOS Trial 2014 Thread (1 Viewer)

[anomalousdecay]

spoiler alert m9; I am trying to code it

Easy coding spoiler:

Tbh coding it is not too hard.

Set a 6 digit array, make a loop, make a value counter so that the counter adds up the contents of each array and the previous answer stored and now store this new value and keep the loop going until you get to the guard of the increments of the loop (That is, 10^6)

 

[Sy123]

Perhaps easy

 

[RealiseNothing]

Interpret 'all the numbers from 1 to 1 000 000' as every combination of digits in the 6 digit places

Each digit, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 can occupy it

Pick a random spot for these digits, it is found that if we fix a digit, say

1 xxx x2x

Where the x's are variable, there are 10^5 combinations for this, so the sum of all 2's in this column is 10^5 * 2

This is the same for every other digit, so you get 10^5(1+2+...+9)

The column is arbitrary, so 10^5(1+2+...+9)*6

And then add 1 at the end, getting 2700001

Is this more elegant?

Fairly close to my method.

Consider every number as a 6 digit number (i.e. 647 is 000647).

There are 1,000,000 6 digit numbers now = 6,000,000 digits altogether.

The average of the digits is 4.5, so answer is just

You add the 1 to make up for the 1,000,000 which is the only number with greater than 6 digits.

 

[RealiseNothing]

Fairly close to my method.

Consider every number as a 6 digit number (i.e. 647 is 000647).

There are 1,000,000 6 digit numbers now = 6,000,000 digits altogether.

The average of the digits is 4.5, so answer is just

You add the 1 to make up for the 1,000,000 which is the only number with greater than 6 digits.

In general, (number of digits) x (average of possible digits).

 

[seventhroot]

Easy coding spoiler:

Tbh coding it is not too hard.

Set a 6 digit array, make a loop, make a value counter so that the counter adds up the contents of each array and the previous answer stored and now store this new value and keep the loop going until you get to the guard of the increments of the loop (That is, 10^6)[//COLOR]

actually; what I did was have a loop that generates all the numbers and puts it into an array and sums them up as they go along.

 

[RealiseNothing]

Perhaps easy

Well can't you just say that once you hit single digit numbers?

 

[Sy123]

Well can't you just say that once you hit single digit numbers?

¯\_(ツ)_/¯

 

[faisalabdul16]

Guys you have crossed the limits of ego. Ego has not done and will not do anyone good. And no Carrot, its not a battle at all, I am just curious about this year's questions.

There's no ego, we are simply having fun.

it's friendly competition.


calm your farm.

Exactly!

Hm... A competition and friendly... Never possible. 'Friendly competition' = oxymoron.

Possible mate

I was expecting him to say something along the lines of 'Yes, MX2, Mechanics'.

Speed out.

Mechanics is not hard... I don't know why people make it out as being the hardest...

 

[seventhroot]

Mechanics is not hard... I don't know why people make it out as being the hardest...

hsc waters it down too much

 

[Sy123]

Good luck guys

 

[anomalousdecay]

actually; what I did was have a loop that generates all the numbers and puts it into an array and sums them up as they go along.

That's making your code longer to compile and run because you are using more memory for it before it all gets destroyed.

Now imagine you did this using a set of linked lists or pointers. Imagine the amount of malloc you would need to make and free. It would be too big to do. So its better off taking the values, destroying them and only keeping the one value you need out of every loop, that is the current count.

hsc waters it down too much

inb4JoeWolfe

 

[dunjaaa]

Well, well, well, its finally come hasn't it

 

[seventhroot]

That's making your code longer to compile and run because you are using more memory for it before it all gets destroyed.

Now imagine you did this using a set of linked lists or pointers. Imagine the amount of malloc you would need to make and free. It would be too big to do. So its better off taking the values, destroying them and only keeping the one value you need out of every loop, that is the current count.

no I override the array I am not making 1 million arrays lel

inb4JoeWolfe

in the tutorial he spent like 10 minutes explaining why it is bad lel; even the maths course pack disses the HSC

let's not derail it m9

 

[emilios]

Will stores on campus be open n stuff. Will be sufficiently rekt after 4U and will in need of coffee for 3U

 

[anomalousdecay]

no I override the array I am not making 1 million arrays lel



in the tutorial he spent like 10 minutes explaining why it is bad lel; even the maths course pack disses the HSC

let's not derail it m9

Yeah if you are overriding the array then you are doing what I was doing lol.

No he never explained it as bad. And no maths course pack just left it out aside.

 

[dunjaaa]

It'll be interesting to see the faces of each one of you. I don't think anyone besides istudent and QZP will recognise who I am tomorrow hehe

 

[emilios]

It'll be interesting see the faces of each one of you. I don't think anyone besides istudent and QZP will recognise who I am tomorrow hehe

mad creepz brahz

 

[enigma_1]

Are any girls going? Seems pretty male dominated, or maybe I'm mistaken :/

 

[emilios]

Are any girls going? Seems pretty male dominated, or maybe I'm mistaken :/

see above

 

[dunjaaa]

someones keen lol