The problem is from codeforces: http://www.codeforces.com/problemset/problem/239/A It is a simple math problem: finding the numbers x that satisify where y, k, and n are given;
Algorithm complexity can be represented by Big O notation, for example, the following piece of code has complexity that sums up the array. s = 0 arr = for …
The polygons can be regular or irregular. For example, The following idea is the easiest way to compute its area (signed) for any given simple 2-D polygons, even for …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/236/A This simple problem can be solved easily. I use C# to practice the use of Hashset. Bruteforce O(n) each character and count the …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/237/A If there are two or more people coming to buy at the same time, and there is no enough cashers, just simply increase …
Brainfuck is a mini programming language that has only 8 keywords, i.e. 8 types of operations expressed by 8 characters. In , the Brainfuck is introduced and a python …
