摘要:
Overview The central script of the A* Pathfinding Project is the script 'astarpath.cs', it acts as a central hub for everything else. In the AstarPath 阅读全文
摘要:
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description If a and d are relatively prime positive integers, the 阅读全文
摘要:
原体例如以下: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the give 阅读全文
摘要:
Problem Description Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO". Input each test case contains two numbers 阅读全文