题目链接 正解:组合数+$dp$. 今天考试的题,考试的时候感觉自己有点脑残过头了.. 似乎发现了所有$1$其实都是一样的,然后不知道怎么强制每种物品只选一个.. 然后就写了一个所有物品可以选任意个的$dp$,尝试与答案找一找规律,并没有找到,看完$std$发现只要再加一个转移就能过了..所以还是讲讲正解吧.. 首先所有$1$都是一样的,所以我们并不需要状压,直接开一个背包就行. 设$f[i][j]$表示用了$i$个物品,$1$的个数为$j$的方案数,注意这个是有序状态,即使用顺序不同方案也不同…

http://poj.org/problem?id=3718 (题目链接) 题意 给出${2}$个长度为${n}$的${01}$串,问是否存在${m}$个长度为${n}$的有三个位置为${1}$的$01$串它们的异或和正好等于那两个$01$串的异或和.求方案数. Solution 我们把那两个$01$串异或起来得到一个$S$,那么问题就变成了是否存在$m$个长度为$n$的有且仅有三个位置为$1$的$01$串的异或和等于$S$. 我们这样进行考虑,假设$S$有$v$个位置上为$1$,先求出异或出来…

    今年双十一淘宝推出了虚拟现实VR购物"BUY+",用户可以在虚拟环境中选购商品.那作为竞争对手的京东将使出什么绝招呢?在近日上海举办的谷歌开发者大会上得到了答案.会上京东推出了一款基于谷歌Tangao技术开发的国内首款AR购物应用.       这款名为JD Dream的AR应用吸引了无数人的目光,来自谷歌的工程师现场演示了JD Dream中AR购物的功能.目前这部分功能针对于家居家装,用户可挑选该场馆中的虚拟家居产品,并在手机上看到真实空间中1:1的摆放效果.用户可移动和旋转…

状压DP Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw on, for all of his paper was filled with squares…

反复听着Dream It Possible,想起自己的华为岁月,百感交集!…

Mondriaan's Dream Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 13519   Accepted: 7876 Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series…

http://www.ximalaya.com/#/17209107/sound/6883165 Dreaming. Do you or don’t you? Do you dream about the future or just have a fantasy(白日梦,幻想) dream after a couple of late night tacos(炸玉米饼)? Dreams get us going. Dreams direct(管理:指挥) our lives, our focu…

状压DP Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 9938 Accepted: 5750 Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series…

Big Chocolate 题目链接:http://acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=19127 Big Chocolate Mohammad has recently visited Switzerland . As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate…

Dividing a Chocolate zoj 2705 递推,找规律的题目: 具体思路见:http://blog.csdn.net/u010770930/article/details/9769333 #include <stdio.h> #include <iostream> using namespace std; ]; int main() { int i,j,maxx; long long m,n; a[]=; a[]=; while(~scanf("%lld…