摘要：
Problem Statement You are given N integers A1, A2, ..., AN. Consider the sums of all non-empty subsequences of A. There are 2N−1 such sums, an odd num 阅读全文
摘要：
题目描述 有N个工作，M种机器，每种机器你可以租或者买过来. 每个工作包括若干道工序，每道工序需要某种机器来完成,你可以通过购买或租用机器来完成。 现在给出这些参数，求最大利润 输入输出格式 输入格式： 第一行给出 N,M(1<=N<=1200,1<=M<=1200) 下面将有N组数据。 每组数据第 阅读全文
摘要：
Problem Statement Takahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeati 阅读全文
摘要：
2212: [Poi2011]Tree Rotations Description Byteasar the gardener is growing a rare tree called Rotatus Informatikus. It has some interesting features: 阅读全文