arpitbbhayani / spoj

SPOJ solutions
http://arpitbhayani.me/programming.html
3 stars 5 forks source link

Regarding POLYMUL #1

Open abaugus opened 9 years ago

abaugus commented 9 years ago

Your Polymul code has got time complexity of O(N^2) which will never pass according to the constraints set on spoj.

arpitbbhayani commented 9 years ago

Solution taken down. Thanks a lot for the info. :)