last day (15 days later) » 

04:17
31
Q: Polyglot Anagrams Cops' Thread

Wheat WizardThis challenge has two threads. This is the cops' thread. The robbers' thread is located here. Your challenge is to choose an OEIS sequence and write two full programs in two different languages that produces that nth item in the sequence when given an n via STDIN, or an other forms of standard...

@LuisMendo That is fine but should be indicated.
@Emigna I would like for flags to be divulged if they are not standard flags for running in the language.
@DrMcMoylex Seeing as I have already done that myself, It is certainly allowed I will update the question
@jimmy23013 No.
@tuskiomi No they cannot. The polyglot needs to be in different language.
If the crack doesn't print the exact output, but still a understandable format of the sequence, does it count?
@EasterlyIrk As long as both are proper formats they do not have to be the same
@WheatWizard :/ even if the output formats were known?
@EasterlyIrk what do you mean?
04:17
@WheatWizard it was different from the output format of the real crack and the output of the given code.
@EasterlyIrk yes that is still a valid crack
@WheatWizard oh well
Can it be output like [<number>]?
:/
oh well
I have updated the specs to be specific
04:17
cool
It may trail with whitespace only
Did your hidden answer break that rule?
no
idea for new answer
just a bit more golfier to output the stack as [outputnumberhere], but i can also just output the number
kk night tho
ok good luck
 
14 hours later…
18:14
can I output the sequence in reverse order?
for example (n^2 sequence) n=3, 9 4 1 0; n=2, 4 1 0.
 
1 hour later…
19:31
@MukulKumar No most sequences are unbound to the left so It doesn't make any sense to go backwards

last day (15 days later) »