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/1 (Arithmetic and Geometric Sequences) [AC=0] (-> Hidden)
This problem has an ambiguous description.
http://www.spoj.com/problems/COLLIDER/ (COLLIDER) [AC=0] (-> Hidden)
No description !http://www.spoj.com/problems/JIMMY/(Lazy Jimmy) [AC=0] (-> Hidden)
This problem is almost a duplicate of http://www.spoj.com/problems/ROOT/1.(ROOT) (I got AC)
So, I submitted a very similar code, but it got WA.http://www.spoj.com/problems/ACMNSIT3/ (Problem 3) [AC=0] (-> Hidden)
The example is wrong.http://www.spoj.com/problems/PANKI/ (Strings of Panki) [AC=1] (-> Hidden)
http://www.spoj.com/problems/PANKI222/(Strings of Panki_23) [AC=0] (-> Hidden)
The task seems to be very simple, but there are very few solvers.
My solution assumed that "aa bb cc yy AA BB CC YY" would be converted to "AA Bb Cc Yy AA Bb Cc Yy".http://www.spoj.com/problems/SODUJ/ (Sum of Digits) [AC=0] (-> Fixed)
This problem always returns "internal error".
We cannot solve this problem.http://www.spoj.com/problems/CENTURY/ (Century Or Not) [AC=0] (-> Hidden)
It seems that the I/O files are broken.http://www.spoj.com/problems/AVGRAINA/ (Raina Batting Average) [AC=0] (-> Hidden)
I assumed that the answer is ( sum abs(n) ) / ( the number of n such that n >= 0).
However, there are a input file whose each number is less than 0.
I cannot understand what we should output in that case.
-
http://www.spoj.com/problems/NAJEP/ (Easy Puzzle) [AC=0] (-> Hidden)
It seems that the I/O files are broken.
(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/1 (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.
-
http://www.spoj.com/problems/MEETUP/(EXPLORE TIME)[AC=0] (-> Hidden)
This problem seems to have a wrong definition. (We cannot print the answer which is the same as the example.)
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/1 (BOND) [AC=0] (-> Hidden)
We cannot submit our solutions.
-
http://www.spoj.com/problems/TPCROBOT/ (ROBOT) [AC=0] (-> Hidden)
We cannot submit our solutions.
created
last reply
- 2
replies
- 483
views
- 2
users
- 17
links