eeeaaaaa的专栏

Problem FLighting System DesignInput: Standard InputOutput: Standard Output You are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation &

题意：不经过为0的格子（1的格子都要经过），问能形成几个环。。

论文上的题目。。《浅析竞赛中一类数学期望问题的解决方法》

题意：求次长上升子序列。

题意：给C(m,3)个队伍之间取胜的概率，然后获胜了可以选择与对手换队伍，也可以不换，问最大的胜率

题意：就是每行找出一个数，要求找的这些数连续（就是只能往）

题意：给一个数字，问有多少个小于等于

题意：找出1-n中有多少个数含有

题意：给出n个点，组成一棵数，树的每一层的节点的叶子节点的个数要相同，问有多少个满足条件的数。。DP,对于n个节点，先分离出一个节点当做根节点，然后假设它有i个孩子，如果(n-1)%i==0,这就说明他的孩子可以平均分配到i棵子树中去，所以数量就加上这棵子树的数量。。。所以状态转移方程：if((n-1)%i==0)   dp[n]+=dp[(n-1)/j]....这些前面都打表处理掉就好。

题意：求一些格子不能经过，可以经过的格子要经过的回路个数。。插头DP入门题。。

Card CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2656 Accepted Submission(s): 1251Special JudgeProblem DescriptionIn y

Help Me EscapeTime Limit: 2 Seconds Memory Limit: 32768 KBBackgroundIf thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto thee shall be hi

A Spy in the MetroTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionDownload as PDFSecret agent Maria was sent to Algorithms City

题意：有n个原子，每两个原子碰撞就会 产生能量，并且一个原子

题意：给两个串，要求找出另一个串，

Brackets sequenceTime Limit: 4500MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionDownload as PDFLet us define a regular brackets sequence in t

链接：UVA10817

题目链接：uva1169

Stupid Tower DefenseTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 838 Accepted Submission(s): 250Problem DescriptionFSF is a

Easy 2048 AgainTime Limit: 2 Seconds Memory Limit: 65536 KBDark_sun knows that on a single-track road (which means once he passed this area, he cannot come back again), there are some underground

A - Twenty QuestionsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatusPracticeUVA 1252Appoint description: DescriptionDownload as PDFConsider a closed w

题意：一个服务员从0点开始送餐，要求送到所有点回来

题意：给一个m X n的矩阵，1代表能放牛，0代表不能放牛，放牛不能xiangl

题意：一个去旅行，要求花费最小走完所有的城市，可以选择任意一个城市chuf

题意:求一个回路（就是从这点出发，每个点值允许经过一次，），

Problem ABlocksInput: Standard InputOutput: Standard OutputTime Limit: 10 SecondsSome of you may have played a game called 'Blocks'. There are n blocks in a row, each box has a col

题意：给一张地图，可以放