| Submit | All submissions | Best solutions | Back to list |
|
Problem hidden on 2012-05-11 19:03:44 by :D
PL_QUINE - Brainf_cked! |
A quine is a computer program which produces a copy of its own source code as its only output. The standard terms for these programs in the computability theory and computer science literature are self-replicating programs, self-reproducing programs, and self-copying programs.
Your task is to write a palindromic quine of source length greater than 1 byte,you can use any programming language you want, as long as it is Brainf**k.
Input
There is no input to this problem.
Output
The ouput is your code itself,for example if your code is "abcba" then the required output is "abcba".
Score
Score is the length of your code.
PS: You can contact me if you have any doubts about the special Judge or your solution.
| Added by: | :(){ :|: & };: |
| Date: | 2011-03-13 |
| Time limit: | 3s |
| Source limit: | 10000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | BF |
| Resource: | A variation of QUINEI |
hide comments
|
2012-05-12 08:54:33 :D
Yes, I'm also not sure what author meant "palindromic". At first I also thought about symmetric. In case of a palindrome it should be impossible to use loops, unless the interpreter would allow an unmatched brackets. Wiki says that shouldn't be the case. Unless I get some info from the author, it will stay hidden. |
|
|
2012-05-12 07:25:15 Mitch Schwartz
I believe blashyrkh's proof is valid regarding bff, the standard BF interpreter on SPOJ (I looked at the source and did not see anything exploitable). But it's possible the author uses a different interpreter with special judge, in which case we should be told which one. |
|
|
2012-05-11 17:04:53 :D
I hid it for now. I would like to verify if a solution exists. Please contact me via e-mail. Last edit: 2012-05-11 17:08:27 |
|
|
2011-11-16 09:03:03 Christian Helbling
What bf-interpreter/-compiler is used for judging? |
|
|
2011-08-23 13:11:20 blashyrkh
IMHO: If [<[[<[ is a palindrome then palindromic quine can not contain cycles ([ and ] operators). And then it can't produce output larger than source code. Output size and source size will be equal only if all commands are '.', but such a program is not a quine. IMHO, this task is impossible. |
|
|
2011-07-14 20:35:42 Jared Deckard
I believe the latter is correct karen. Surely there is a valid solution. Maybe there is a less documented operator required to solve this problem. I would read up on the specs for this BF compiler. |
|
|
2011-04-13 16:29:05 Terence
Is it string palindromic or visual palindromic? If it is strick string palindromic, it will end up with unmatched square brackets(leading ']'s or trailing '['s). Otherwise, does it match [] and <>, or just match [], leaving '<' and '>' matching itself (as other characters)? Re(debanjan):Could you please explain what do you mean by string palindromic and visual palindromic? Last edit: 2011-04-17 10:17:37 |
RSS