1 / 8
Jan 2007

I'll add my two cents that while I've never competed in ByteCode, judging from past ByteCode problems available on SPOJ, it's one of the best-written independent programming contests around.

How about conducting the same contest again at SPOJ? I just want to compete at SPOJ in a real time contest once. Is the contest holding system here allows such kind of contests?

The system here allows lots of kinds of contests wink Perhaps you should get yourself contest-setting privileges and write up a contest for us smile

I would have conducted many contests if only i were good at writing good problems.

Here's a suggestion:

Problem code: BUSYBVR

<- insert a short description of Turing machines ripped from Wikipedia or something ->

Despite their apparent simplicity, Turing machines are the yardstick by which computability is judged: if something is computable by a Turing machine, it's considered computable; otherwise, it's not computable at all.

In this problem, we want you to find out the maximum number of ones that any Turing machine with k states will leave on an initially blank tape (all zeroes) before halting.

Input

The first line of the input file is the number of test cases T (about 100).
It's then followed by T lines consisting of a single number k, 1 <= k <= 100.

Output

For each integer k, your program should output the maximum number of ones that any Turing machine with k states will leave on a blank tape.

Sample Input

2
2
4

Sample Output

4
13

I'm a problem setter; would you like me to post that as a problem? It sounds interesting.
I would of course attribute full credit to you smile

Suggested Topics

Want to read more? Browse other topics in Off-topic or view latest topics.