- 博客(31)
- 问答 (3)
- 收藏
- 关注
RSS订阅原创 codeforces#318ABCD
点击查看题目 A#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace
2015-08-31 19:20:29
691
原创 。
在最近的几次比赛中我感觉自己能力越来越不行了。最近几次的比赛中我越来越感觉到自己思维的局限，一旦我有一个想法我就会一直陷在这个想法之中，有时候这个想法是对的，但是大多数时候这个想法并不对，这让我很苦恼，有时候我进入一种想法之后我就再也出不来了。 我觉得以后我在思考的时候要先想想自己是不是错了而不要想自己是不是对了，这种思想应该铭记于心，这种游戏玩的脑子，别总是想到对的方面要全面思考自己的逻辑是不是
2015-08-30 03:56:51
424
2
原创 POJ 1077 Eight IDA*
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;int a[10];int goal[][2] = {{0,0},{0,0},{0,1},{0,2},{1,0},{1,1},{1,2},{2,0},{2,1},{2,2}};int move[4][2]={{-1,0},{0,-1},{0
2015-08-27 21:33:44
868
1
原创 POJ2676 2918 Sudoku 暴搜
#include <cstdio>#include <iostream>#include <iostream>#include <algorithm>using namespace std;int s[][2] = {{1,1},{1,4},{1,7},{4,1},{4,4},{4,7},{7,1},{7,4},{7,7}};int a[10][10];int ch[] = {0,0,
2015-08-25 22:13:32
754
原创 POJ3734Blocks矩阵快速幂加dp思想
#include <cstdio>#include <algorithm>#include <iostream>#include <vector>using namespace std;typedef vector<int> vec;typedef vector<vec> mat;const int M=10007;typedef long long LL;mat mul(mat &A
2015-08-25 19:40:39
639
原创 AIZU2303marathon match 概率
#include <cstdio>#include <iostream>#include <cstring>#include <cmath>using namespace std;#define LL long longdouble p[200];int t[200];int v[200];LL C[100][100];double dp[105][55];int main(){
2015-08-25 09:23:46
494
原创 CF#315 C
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#de
2015-08-24 14:39:24
606
原创 hdu 4007 平行矩形包含点数
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#de
2015-08-24 08:23:09
628
原创 CF#317D dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-23 20:49:02
645
原创 hdu 5418 状压dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-22 23:04:26
843
原创 多校连萌15-8-12#A
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-22 22:21:54
636
原创 hdu 4372 第一类斯特林数
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-21 21:27:23
691
原创 POJ 2785 折半枚举
#include <cstdio>#include <iostream>#include <algorithm>#define LL long long using namespace std;int a[4][4005];int b[2][4005*4005];int main(){ int n; while(cin >> n){ for(int i
2015-08-21 16:59:36
676
原创 POJ 3276 反转问题
#include <cstdio>#include <iostream> #include <cstring>using namespace std;int n;int a[5005][2];int flag[5005];int fun(int x){ int sum = 0; int res = 0; memset(flag,0,sizeof(flag));
2015-08-20 22:00:43
574
原创 NUBT 1580 素数分解 母函数法解
#include <cstdio>#include <iostream>#include <queue>#include <cmath>using namespace std;int pre[209];int ans[209];int tmp[409];int main(){ int sq= (int)sqrt(209.0); for(int i = 0;i <= 2
2015-08-16 14:13:55
815
原创 hdu 5375 dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-12 13:18:08
584
1
原创 hdu 5371 manachar
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-12 13:14:55
549
原创 hdu 2665 划分树
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-10 22:20:27
559
原创 hihocoder 1032 manachar 求回文串O(n)
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-10 09:59:39
534
原创 hdu 1078 记忆化搜索
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-09 16:17:31
454
原创 hdu 1058 水题+”英文题“
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-09 14:57:33
627
原创 hdu 1506 dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-08 22:34:46
386
原创 hdu 5215 判断奇偶环
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-08 21:19:40
656
原创 hdu 1864 实数离散化+动态规划+滚动数组
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-07 23:50:06
488
原创 hdu2955 dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-07 15:53:07
467
原创 hdu 5360 贪心
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-06 21:38:34
502
原创 hdu 1421 1159 1087 1160 5366 1257 light OJ 1110 uva 562 简单dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-05 10:18:06
581
原创 hdu 5348 搜索
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-05 08:25:55
723
2
原创 hdu2222ac自动机或者裸字典树
ac自动机代码#include <cstdio>#include <iostream>#include <queue>#include <cstring>using namespace std;#define id(a) (a-'a')const int maxnode=10000*50+10;int ch[maxnode][26];int f[maxnode];int val[ma
2015-08-03 21:17:21
963
1
原创 hdu3336 KMP
#include <cstdio>#include <iostream>#include <cstring>using namespace std;int len;char p[200005];int nex[200005];int sum[200005];int main(){ int t; cin >> t; while(t--){ cin
2015-08-03 10:16:27
423
原创 uva11732 字典树
#include <cstdio>#include <iostream>#include <cstring>using namespace std;#define LL long long const int maxnode = 4000*1000+10;int head[maxnode];int next[maxnode];int tot[maxnode];int va[max
2015-08-01 15:18:38
510
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人