- 博客(11)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 Codeforces 394C. Dominoes
题目C. Dominoestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuring the break, we decided to relax a
2014-02-21 22:13:43
851
原创 codeforces 394B Very Beautiful Number
题目B. Very Beautiful Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTeacher thinks that we make
2014-02-21 22:10:35
1135
原创 codeforces 394E Lightbulb for Minister
题目E. Lightbulb for Ministertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Minister for e
2014-02-21 21:59:42
1022
原创 nbut [1545] New Year 2014
题目问题描述In the New Year 2014, Xiao Ming is thinking about the question: give two integers N and K, Calculate the number of the numbers of satisfy the following conditions:1. It is a
2014-02-21 11:14:34
678
原创 3933:The Almost Lucky Numbers
地址题目描述John and Brus believe that the digits 4 and 7 are lucky and all others are not. According to them, an almost lucky number is a number that contains at most one non-lucky digit in
2014-02-19 15:43:15
1017
原创 SWUST OJ 1025
地址:http://acm.swust.edu.cn/oj/problem/1025/DescriptionTT lives in a dream world.All countries in the world are circular or rectangular.There is a moat on the territorial border of each
2014-02-18 09:51:12
5595
原创 hdu 4027
Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 7611 Accepted Submission(s): 1735Problem Description
2014-02-12 21:32:23
947
原创 cug 1436 A Strange Dream
1436: A strange dreamTime Limit: 5 Sec Memory Limit: 128 MBSubmit: 17 Solved: 2[Submit][Status][Web Board]DescriptionOne day, Leo has a strange dream. In this dream, there are n scenes
2014-02-12 11:33:14
1062
原创 HDU 2640
题目#include #include #include using namespace std;int t,n,m,dp[2][13][13],num,ok[13],cnt[13];char map[105][10];/* 状态是每个物体的第三行... 由于第二行的特殊性,加上不能重叠,可以知道第三行状态很少一共有: 00000000
2014-02-11 14:38:46
887
原创 poj 1321
题目状态dp,dp[i][j]表示进行到第i行，前i-1行的状态是j的最优答案，j中1的个数表示放了多少个，注意对于一行，可放可不放#include #include #include #include using namespace std;int n,k;char map[9][9];int all;int dp[2][(1<<8)+1];inline
2014-02-09 09:47:02
691
原创 poj 2923
题目记忆化搜索+状态枚举 dp[0][i]表示i状态需要C1车运几次 dp[1][i]表示状态i需要C2车运几次//http://poj.org/problem?id=2923#include #include #include #include using namespace std;#define INF 1000vectora;int t,n,
2014-02-04 09:16:15
774
空空如也
求教，hadoop-2.2.0升级hadoop-2.6.0。
2015-09-06
TA创建的收藏夹 TA关注的收藏夹
TA关注的人