摘要:
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop o 阅读全文
摘要:
Given an array of integers A, a move consists of choosing any A[i], and incrementing it by 1. Return the least number of moves to make every value in 阅读全文
摘要:
C - ID Time limit : 2sec / Memory limit : 1024MB Score: 300 points Problem Statement In Republic of Atcoder, there are N prefectures, and a total of M 阅读全文
摘要:
B - Palace Time limit : 2sec / Memory limit : 1024MB Score: 200 points Problem Statement A country decides to build a palace. In this country, the ave 阅读全文
摘要:
A - Discount Fare Time limit : 2sec / Memory limit : 1024MB Score: 100 points Problem Statement There is a train going from Station A to Station B tha 阅读全文
摘要:
A chess knight can move as indicated in the chess diagram below: . This time, we place our chess knight on any numbered key of a phone pad (indicated 阅读全文