The problem is from SPOJ Online Judge Bruteforce each number from x to n is easy to implement. The 1 second limit is enough for any inputs smaller than 100,000. The …
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input …
The problem is from SPOJ Online Judge Since the input of p and q is restricted to 0 and 1, so we can just check its string value. Bit XOR …
The problem is from SPOJ Online Judge It is a A+B problem, so the answer/solution is: print (tonumber(io.read()) + tonumber(io.read())) –EOF (The Ultimate Computing & Technology Blog) — 110 …
This is another simple problem for practising LUA programming. The simple puzzle is from SPOJ Online Judge (see problem description) This problem can be used to serve as a …
The problem is from SPOJ Online Judge This problem is for beginner, and we use this to continue practise our LUA skills. -- split a string into array function …
