心の コード

Description Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses bef

Description In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, a

Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are

Description Your task is to read a picture of a chessboard position and print it in the chess notation. Input The input consists of an ASCII-art picture of a chessboard with chess pieces on positio

Problem Description Kingdom Rush is a popular TD game, in which you should build some towers to protect your kingdom from monsters. And now another wave of monsters is coming and you need again to kn

题意不多说，直接解释需要模拟的东西吧。 题目中会给你一段题中创造的程序，这个程序除了最开始的BEGIN到END，内部就是从LOOP到END，中间的所有OP或者是其他嵌套的程序都是相加关系，最后的LOOP x是将内部的式子乘x，拿输入样例举例 BEGIN LOOP n OP 4 LOOP 3 LOOP n OP 1 EN

题意：给你一个N+1*N+1的棋盘（从0到N），给定了这局棋的下棋过程，黑子先下，且总的下棋步数为奇数，也就保证最后一个下的是黑棋。其中，每下一步棋如果它的周围（中国象棋或是国际象棋中一个日字的走法）8个点存在同色的棋，并且两个棋之间没有其他棋子连线所拦，那么就将这连个棋子连线。如果黑棋从左边界到右边界有一条线贯穿或白棋从上边界到下边界有一条线贯穿，贯穿的那方就获得胜利。原题意为问黑子的最后一步是