As mentioned earlier, the VIN number problem was no where near as hard as I expected it to be. It was actually manageable to be done in a rather easy manner, since we are not given anything similar to
| 1 | M | 8 | G | D | M | 9 | A | N/A | K | P | 0 | 4 | 2 | 7 | 8 | 8 |
We are actually given all its numerical values, which are:
| 1 | 4 | 8 | 7 | 4 | 4 | 9 | 1 | 0 | 2 | 7 | 0 | 4 | 2 | 7 | 8 | 8 |
You then multiple each of these values by the digital assignment, calculate your check digit, then substitute the check digit into the actual VIN calculating the new one. Rather easy actually. That also just about sums up the strings test. I studied quite a bit for it, since it seemed rather difficult last year, and I remember bombing it.
As well, also had the programming contest. Which sucked, alot. I spent about 75-90 minutes working on the recursion question. At one point in time, I also had it working, but then it just slipped away from me. Sadly enough. Came in 5th still. Ah well, see ya guys later. Going to go cut my wrists now. Ciao.
No comments:
Post a Comment