Hello,
I have implemented an algorithm, with Python, for resolving DISUBSTR problem, which is quite efficient.
For example for the string 'A'*1000 (the maximum size) it takes 0.85s on my computer.
But It still gets an exceed runtime limit (whichn is 1s).
So I really do think that this problem is impossible with Python!
Is it not possible to modulate the time limit with the language?
Don't worry, I still appreciate SPOJ site because it is the only one where it is possible to write program in the best language ... python
Regards
created
last reply
- 5
replies
- 244
views
- 4
users
- 1
link