I list the SPOJ problems which seem to be broken.
Since some problems are very old, it is not easy to contact the psetters or authors in SPOJ.
So, I'm glad if someone would agree or disagree with that by solving or trying them.
I hope that every problem in SPOJ is really solvable.
[tutorial]
- http://www.spoj.com/problems/S3P3/ (Arithmetic and Geometric Sequences) [AC=0] (-> Hidden)
This problem has an ambiguous description.
However, there are a input file whose each number is less than 0.
I cannot understand what we should output in that case.
(other reasons; perhaps careless mistake)
- http://www.spoj.com/problems/NDN/ (ECPC) [AC=0] (-> Hidden)
This problem collects the links to the problems.
So, we definitely cannot solve this problem.
[classical]
- http://www.spoj.com/problems/HLP/ (Help in organizing)[AC=0] (-> Hidden)
I haven't solved (or tryed) this problem yet.
However, considering the comments and submissions from the talented users,
this problem seems to be broken.
This problem is one of the problems of https://www.hackerrank.com/bytecode.
No solvers in Hackerrank, too.
So, I think this problem is broken.
[partial]
- http://www.spoj.com/problems/CCBOND/ (BOND) [AC=0] (-> Hidden)
We cannot submit our solutions.