摘要:
有编号1-n的n个格子,机器人从1号格子顺序向后走,一直走到n号格子,并需要从n号格子走出去。机器人有一个初始能量,每个格子对应一个整数Aii,表示这个格子的能量值。如果Aii > 0,机器人走到这个格子... 阅读全文
摘要:
Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The laby... 阅读全文
摘要:
You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, ... 阅读全文