【codeforces】Pasha and Stick
有规律的。找到就ok
#include<stdio.h>
int main() {
int n;
while(scanf("%d",&n)!=EOF) {
int x;
if(n%2!=0)
printf("0\n");
else
{
if(n%4==0)
printf("%d\n",n/4-1);
else
printf("%d\n",n/4);
}
}
return 0;
}
有规律的。找到就ok
#include<stdio.h>
int main() {
int n;
while(scanf("%d",&n)!=EOF) {
int x;
if(n%2!=0)
printf("0\n");
else
{
if(n%4==0)
printf("%d\n",n/4-1);
else
printf("%d\n",n/4);
}
}
return 0;
}
目录 Dirichlet Process简介 Stick-Breaking构造 本文作者:合肥工业大学 管理学院 钱洋 email:1563178220@qq.
![这里写图片描述][20160721230034639] ![这里写图片描述][20160721230050982] ![这里写图片描述][2016072123010
Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (
题意:给定一长为L的木棍和n个切割点,每次切割的费用为切割的长度,求最小的费用。 思路:dp,子问题是区间(i,j)的最小费用,临界是(i,j)只有一个切割点。dp
这一题本能的想法就是把所有的单词都读入,统计一下每种单词的个数,判断是否构成欧拉通路,判断图是否连通。 可是可是题目给的不是数字而是单词,着我该怎么办??? 数字
There is a pile of n wooden sticks. The length and weight of each stick are known in adv
Wooden Sticks Problem Description There is
There is a pile of n wooden sticks. The length and weight of each stick are known in adv
[POJ1011 Sticks][] 剪枝好题,具体见代码: ![ContractedBlock.gif][] ![ExpandedBlockStart.gif]
题目连接:[http://acm.hust.edu.cn/vjudge/contest/view.action?cid=40692\problem/E][http_acm.hu
还没有评论,来说两句吧...