摘要：
The i ’th Fibonacci number f(i) is recursively defined in the following way: • f(0) = 0 and f(1) = 1 • f(i + 2) = f(i + 1) + f(i) for every i ≥ 0 Your 阅读全文
摘要：
D. Two Strings Swaps time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given two s 阅读全文
摘要：
Little girl Tanya climbs the stairs inside a multi-storey building. Every time Tanya climbs a stairway, she starts counting steps from 11 to the numbe 阅读全文
摘要：
Skyscraper "MinatoHarukas" Mr. Port plans to start a new business renting one or more floors of the new skyscraper with one giga floors, MinatoHarukas 阅读全文