BFK_AUTO - Automatic Brainf##k Code Generator (Shortening AI)
In this problem, you'll make an automatic Brainf**k code generator. Given a text file (input data), your program should output brainf**k code that if executed it will print the text file (exactly same with given input data). The text file containts printable ASCII character only: { '<line feed>'(ASCII(10)) , '<space>'(ASCII(32)) , ... , '~'(ASCII(126)) }. It's guaranteed that the filesize of text file is less than 1MB.
Input
Text file containing printable ASCII only with size<1MB.
Output
Brainf**k code that print that text file.
Score
Your score is: Sum of all BF code length in all test data
Example
Input:
Hello World! Output:
++++++++++[>+++++++>++++++++++>+++>+<<<<-]
>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.Your Score (BF Code Length, valid command only):
111
Note: This is the first time I make my own judge, I've tested it hundred times with various test data, and so far no bug is found (found some but has been fixed). If you found a bug, you can send me info via PM or email, I'll fix that as soon as possible. Btw, here is the judge for this problem, maybe it'll be useful information for you. Good Luck and Have Fun :-D
hide comments
Mostafa 36a2:
2013-06-04 23:01:18
yes if you print '+' (ASCII value) times then . then > it means in average:
|
|
Aditya Pande:
2013-06-04 23:01:18
My brute force BF solution gives SIGXFSZ runtime error?
|
|
ওয়াসী (Wasi):
2013-06-04 23:01:18
Awesome one!
|
|
Mostafa 36a2:
2013-06-04 23:01:18
Genius!
|
|
Francky:
2013-06-04 23:01:18
@tjandra : I have some trouble with masterJudge, even if I only use a copy of the official masterJudge, it led to internal error. I made some experiments with Mitch, and the same thing didn't happen with him... very curious.
|
|
Mitch Schwartz:
2013-06-04 23:01:18
I don't know if you're still experimenting with the judge, but just to clarify: by "Time" I meant the running time of the user's submitted program, not the running time of the judge, which based on the low numbers might be what's reported there now.
|
|
Mitch Schwartz:
2013-06-04 23:01:18
I think the scoring needs to be adjusted. :)
Thanks! You probably remember that Robert Gerbicz's HS09xxx problems reported time per case before the judge was changed, and I think that judge is common on Polish SPOJ, so maybe you could gain access to the source and see how it was done. And btw I like the way you formatted the output info. Last edit: 2013-05-27 09:09:06 |
|
Mitch Schwartz:
2013-06-04 23:01:18
Could you please give more info about the BF interpreter that is part of the judge? There are many things that vary between implementations, as you know.
|
|
Mitch Schwartz:
2013-08-12 10:19:30
I love this concept. :) |
|
(Tjandra Satria Gunawan)(曾毅昆):
2013-06-04 23:01:18
Finally the file stream *spoj_u_info is activated for this problem. Now you can see some information of your code output by clicking the score or the result (WA,AC,TLE,etc..). This information is good for debuging and optimizing your solution ;-) |
Added by: | Tjandra Satria Gunawan |
Date: | 2013-05-25 |
Time limit: | 22s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | This problem is purely came from my own idea \(^_^)/ |