特务依昂

摘要： Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are n commodities produced by the comp 阅读全文

摘要： Statements Vitaly works at the warehouse. The warehouse can be represented as a grid of n × mcells, each of which either is free or is occupied by a c 阅读全文

摘要： Farey Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18507 Accepted: 7429 Description The Farey Sequence Fn for any integer n wit 阅读全文

摘要： Longge's problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9190 Accepted: 3073 Description Longge is good at mathematics and he likes 阅读全文

摘要： N皇后问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32229 Accepted Submission(s): 13874 Problem 阅读全文

摘要： The wizards and witches of Hogwarts School of Witchcraft found Prof. Binn's History of Magic lesson to be no less boring than you found your own histo 阅读全文

摘要： Thanks a lot for helping Harry Potter in finding the Sorcerer's Stone of Immortality in October. Did we not tell you that it was just an online game ? 阅读全文

摘要： 1298 圆与三角形 题目来源： HackerRank 基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题 收藏 关注 给出圆的圆心和半径，以及三角形的三个顶点，问圆同三角形是否相交。相交输出"Yes"，否则输出"No"。（三角形的面积大于0）。 Input 第1行：一个数 阅读全文

摘要： 给出长度为N的数组，找出这个数组的最长递增子序列。(递增子序列是指，子序列的元素是递增的） 例如：5 1 6 8 2 4 5 10，最长递增子序列是1 2 4 5 10。 Input 第1行：1个数N，N为序列的长度(2 <= N <= 50000) 第2 - N + 1行：每行1个数，对应序列的元 阅读全文

摘要： There are K hours left before Agent Mahone leaves Amman! Hammouri doesn't like how things are going in the mission and he doesn't want to fail again. 阅读全文