Timeout error when submitting INTEST and TMUL problems

[acw1668]

I got 'time limit exceeded' error when I submitted the following problems, but the code runs very fast in my system.

450: INTEST

Src ID: 557274

439: TMUL

Src ID: 557259 557243 557241 557240

Also I got 'wrong answer' for the following problems and I want to know why they failed:

42: KAMIL

Src ID: 557229

6: ARITH

Src ID: 557187

My Account Info:
Login Name: acw1668

Thanks.

[noix]

I don't program in Ruby myself so I could be wrong...

I got 'time limit exceeded' error when I submitted the following problems, but the code runs very fast in my system.

#450: INTEST
Src ID: 557274

It seems Ruby, or the version we are using, or the way you use it, is to slow.
Programs are tested on relatively slow computers.
Maybe someone who knows Ruby has more interesting ideas...

439: TMUL

Src ID: 557259 557243 557241 557240

I also tried to solve this problem the easy way some time ago.
It surprised me a little, but a short Java program using Bignum was way too slow, while a simple "school" algorithm written in C was way faster. Not to mention Karatsuba or FFT.

Also I got 'wrong answer' for the following problems and I want to know why they failed:

#42: KAMIL
Src ID: 557229

I might be misreading your code, but it seems you assume there are only two words in the input. There are more.

6: ARITH

Src ID: 557187

Your program outputs exactly nothing.

Noix

[acw1668]

Hi noix,

Thanks for you reply.

For the problem KAMIL, you are right, I only tested 2 cases and I have corrected it and got AC.

For the problem ARITH, I still got WA. Any comment on my code?

n = gets.to_i
if (n > 0) and (n <= 1000)
	a = []
	n.times { a << gets.chomp }
	a.each { |s|
		i = s.index /[\+\-\*]/
		s1 = s[0...i]
		op = s[i..i]
		s2 = s[i+1..-1]
		output = [s1, op+s2]
		lenArr = [s1.length, s2.length+1]
		case op
			when "+"
				res = (s1.to_i + s2.to_i).to_s
			when "-"
				res = (s1.to_i - s2.to_i).to_s
			when "*"
				v1 = s1.to_i
				v2 = s2.to_i
				if s2.length > 1
					output << "-" * lenArr.max
					n = 0
					s2.reverse.each_byte { |v|
						v = v.chr.to_i
						res = (v1 * v).to_s + " " * n
						output << res
						lenArr << res.length
						n += 1
					}
				end
				res = (v1 * v2).to_s
		end
		lenArr << res.length
		len = lenArr.max
		output << "-" * len
		output << res
		output.each { |s| puts s.rjust(len) }
		puts
	}
end

Regards.