Tag: problems for beginners
The problem is from SPOJ Online Judge The puzzle asks to you check if the given sequence of integers consists of strictly two parts: the first part descending and …
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 …
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 …
This problem is from Timus Online Judge. The original problem description can be found here. There are k steaks that can be cooked at the same time. So …
