2011-05-08 17:17:12 HWK
Thanks! I tried ideone.com. But there I get SIGSEGV for the eaxample input too. This works well with gfortran 4.4.3 and I don't see a possible cause. Maybe the different fortran versions cause it? With Mingw I also got a not traceable SIGSEGV.

I am very comfortable to increase the time limit for shorten but not in main challenge since the one of the reason i made this to task is to challenge the contestants to find the shortest solution with a time complexity of at-least O(n(logn)(loglogn)).

I looked into the status of your Fort solution (5044918),it's not the test 1 sig 11 is been generated in the test 0 and I dont' think the judge is processing it further.

2011-05-04 06:27:43 HWK
@.:: Debanjan ::. : For fun I tested a solution with Fortran. At home there are no problems (ubuntu gfortran 4.4.3) even with N=100000. Here it results in SIGSEGV in judge 1. Judge 0 seems to run. Could you see what causes the problem?

2010-11-18 18:47:44 HWK
I agree with Piotr. I found a shorter solution with Bash, which is too slow for the limit. But I think the challenge should be to write short code not fast. So why not extend the limit?