---学习ing---

摘要： In this problem you will meet the simplified model of game Pudding Monsters. An important process in developing any game is creating levels. A game fi 阅读全文

摘要： （第三次与中奖擦肩而过？ 【A A game】 题意：双人博弈：有N堆，每堆数量石子为M。给定K，每次可以把某一堆均分为石子数不小于K的几堆，（如果大于K，下次还可以用来分）。不可分的人输。 思路：不会。 【B：Jump】 题意：有N个人，每个人有两个数字xi和yi，选择其中一个可以使用，现在从1开 阅读全文

摘要： "Holiday is coming, holiday is coming, hurray hurray!" shouts Joke in the last day of his college. On this holiday, Joke plans to go to his grandmothe 阅读全文

摘要： Taplu and Abhishar loved playing scrabble. One day they thought of inventing a new game using alphabet tiles. Abhishar wrote a string using tiles and 阅读全文

摘要： After the success of 2nd anniversary (take a look at problem FTOUR for more details), this 3rd year, Travel Agent SPOJ goes on with another discount t 阅读全文

摘要： Jonathan Irvin Gunawan is a very handsome living person. You have to admit it to live in this world. To become more handsome, Jonathan the Handsome ha 阅读全文

摘要： A tree is a connected graph that doesn't contain any cycles. The distance between two vertices of a tree is the length (in edges) of the shortest path 阅读全文

摘要： Stack is a basic data structure. Where 3 operation can be done- Push: You can push object to the stack Pop: You can pop the object to the stack Top: Y 阅读全文

摘要： Factorial numbers are getting big very soon, you'll have to compute the number of divisors of such highly composite numbers. Input The first line cont 阅读全文

摘要： cathetus（直角边）； hypotenuse（斜边） spoj：Structures 给定三角形的直角边，问可以有多少种三角形。 T<=10 , N<=1e15 ，times<=1s. spoj：Shared cathetus (easy) 给定三角形的直角边，问可以有多少种三角形。T<=1e 阅读全文