Dec 2013
1 / 10
Dec 2013
Jul 2014
kuszi
Dec '13

If you are an author of a suitable problem, please post in this topic specifying the appropriate category.

  • created

    Dec '13

  • last reply

    Jul '14
  • 9

    replies

  • 1.8k

    views

  • 4

    users

  • 7

    links

13 days later
mostafa_sof
Dec '13

Hello , and thanks for such useful contest in spoj ...
I have two questions please
1- can you determine when the problem is considerd "Easy" ?
2- should I add my problem and hide it in the main problem set then write the path here ?

thank you

kuszi
Dec '13

ad 1)
Good question! But I have no good answer.

IMHO
1. no convoluted formulations.
2. no (severe? ) efficiency constraints.
3. correct, straightforward solution should be no longer than 100 lines of code (preferably around 10)
4. [edit: 2014-01-09] the matter of the problem should not involve advanced concepts.

ad 2) Yes, setting the problems please set: "Placement in main problemset" to "none" and please leave "Available for use in 3rd party contests" box ticked.

mostafa_sof
Dec '13

Thank's for the reply
maybe after several requests you will make the rules of adding .
this is the first ..(i think smile )
is some thing like this is useful ?
spoj.com/problems/TESTXOR/5
if yes , i'm asking to add it (of cource you can edit the discreption , and make it better)

Best Regards
Mostafa

9 days later
kuszi
Jan '14

@mostafa - first of all thank you very much for your suggestions, and inspiring discussion.

And now complaints:
TESTXOR - I like the idea; for me it suits perfectly to BSCPROG.
But, please compare spoj.com/problems/TESTXOR/
to spoj.com/BSCPROG/problems/BSCXOR/
I would prefere not to write a logic functions tutorial.

TESTCON0 - my first complain is the same as in TESTXOR (we are not writing a hexadecimal numeral system tutorial)
and the second the problem is IMHO too difficult if the language does not support unbounded integer arithmetics,
maybe it would be enough to convert small integers?

6 months later