首页 > TAG信息列表 > cakes
Cake Baking
http://pdl.openjudge.cn/english/02/ 描述 A banana cake takes 250 flour, 2 bananas, 75 sugar and 100 butter, and a chocolate cake takes 200 flour, 75 cocoa, 150 sugar and 150 butter. The profit of a chocolate cake is 45 and the profit of a banana cake is 40.No.2 Cake Baking
原题： Cake Baking 1000ms 65536K 描述： A banana cake takes 250 flour, 2 bananas, 75 sugar and 100 butter, and a chocolate cake takes 200 flour, 75 cocoa, 150 sugar and 150 butter. The profit of a chocolate cake is 45 and the profit of a banana cake is 40. And【题解】CF1415F Cakes for Clones
一个蛋糕有两种接法：分身接 / 本体接。 考虑令 \(g_{i}\) 表示 \(i\) 用分身接，最早在什么时刻本体能到位放下分身。令 \(f_{i,j}\) 表示 \(i\) 用本体接，分身将被去用于接 \(j\)，这种方案是否可行。 考虑 \(g_i\) 的转移： \(i+1\) 用本体接：放完分身就跑过去，时间有多的话可以选择跑到B. Two Cakes---贪心--Codeforces Round #542 [Alex Lopashev Thanks-Round] (Div. 2)
Two Cakes time limit per test 1 second memory limit per test 256 megabytes 题目链接http://codeforces.com/contest/1130/problem/B emmm，题目大意：两个人买蛋糕,蛋糕一层比一层小,规定先买小,再买大,即先买1,再买2,…最后买n。有2n家店,每家店都是只出售一个等级蛋糕的一个CF1456D. Cakes for Clones
题目大意 一个无限长的数轴，初始0时间人在位置0，接下来在ti时位置xi会出现一个蛋糕，必须要在ti瞬间瞬间接住否则失败 人可以在任意时刻放分身，分身接蛋糕但不能动，至多同时存在一个分身，新放的会取代原来的 判断是否能接完所有蛋糕 n<=5000，坐标时间两两不同 题解 做法很多，但是想出一个阳DP algorithm to solve problem 3014 on poj.org by C++
For this problem, there are 3 ways to solve, two DP algorithms to solve and one mathematical way to solve. Question meaning：Put m pieces of cakes into n plates, a plate can have 0 or multiple pieces of cakes, how many ways are there? (for moreTwo Cakes
Sasha and Dima want to buy two n-tier cakes. Each cake should consist of n different tiers: from the size of 1 to the size of n. Tiers should go in order from the smallest to the biggest (from top to bottom). They live on the same street, there are 2⋅