chaomaer-CSDN博客

原创 POJ 3087

简单模拟题CPP字符串截取函数，注意默认参数从左到右补全string substr (size_t pos = 0, size_t len = npos) const;#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include &l...

2018-04-04 11:24:22 286

原创 POJ 3414

#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <queue>#include <map>#include <utility>

2018-04-03 20:43:43 120

原创 POJ 3126

when involved with digits, be careful with the leading zeros.#include <cstdio>#include <string>#include <cstring>#include <cmath>#include <vector>#include <...

2018-04-03 16:57:51 132

原创兑换钱的dp问题

#include <iostream>#include <cmath>#include <string.h>// 题目叙述// 零钱的种类为1, 2, 4, 8, 2^k, 问有多少种组合方式使之成为为N元// 思路，根据N求出最多使用的钞票种类, i.e. kind = cell(sqrt(N))// 为了避免重复，我们把（a, a）变换为(a,...

2018-03-29 20:20:12 236

原创 POJ 3009

#include <iostream>#include <stdio.h>#include <string.h>#include <vector>#include <queue>#include <algorithm>using namespace std;const int MAXSIZE = 30;in...

2018-03-29 18:56:12 134

原创 POJ 1321

#include <iostream>#include <string.h>#include <stdio.h>#include <vector>#include <queue>using namespace std;int n,k;const int MAXSIZE = 8;char road[MAXSIZE][MAXS...

2018-03-28 16:18:21 189

原创 POJ

#include <iostream>#include <string.h>#include <stdio.h>#include <vector>#include <queue>using namespace std;const int MAXSIZE = 40;char road[MAXSIZE][MAXSIZE];i...

2018-03-28 14:51:39 151

原创 POJ 2488

#include <iostream>#include <stdio.h>#include <string.h>#include <vector>using namespace std;int visit[27][27];int p, q;int testcase;int count;int direction[8][2] = {...

2018-03-28 00:31:50 561

原创 Express calculator

又一种求四则运算的好方法LLVM toylanguage真的是一个非常好的学习资料。#include <iostream>#include <stdio.h>#include <queue>#include <algorithm>#include <map>#include <string>#includ...

2018-03-26 17:33:47 148

原创 POJ 3253

#include <iostream>#include <stdio.h>#include <queue>#include <algorithm>using namespace std;typedef long long int LL;priority_queue<LL,vector<LL>, greater<...

2018-03-26 09:50:12 110

原创 POJ 3253

#include <iostream>#include <istream>#include <string>#include <map>#include <sstream>#include <cstring>#include <algorithm>#include <vector&amp

2018-03-25 17:35:02 113

原创 how to split string in c++

在c++中，不像java那样有split函数，我们可以用istringstream和getline来解决。1. explicit istringstream (ios_base::openmode which = ios_base::in);explicit istringstream (const string& str, ...

2018-03-25 15:07:03 183

原创 POJ 1840

#include<iostream>#include<string>#include<cstring>#include<cstdio>#include <vector>using namespace std;// coefficientsint a1, a2, a3, a4, a5;const int LOW = -50,...

2018-03-25 13:44:38 133

A name used in a template declaration or definition and that is dependent on a template-parameter is assumed not to name a type unless the applicable name lookup finds a type name or the name is qu...

2018-03-20 18:05:10 493

原创 POJ 2151

#include <iostream>#include <stdlib.h>#include <algorithm>#include <vector>#include <string.h>using namespace std;int m,t,n;float p[1010][40];float dp[1010][40]...

2018-03-20 16:06:03 243

原创 POJ 3274

#include <iostream>#include <stdlib.h>#include <algorithm>#include <vector>#include <string.h>using namespace std;int n, k;const int MAXN = 100002;const int MAXK...

2018-03-20 13:51:21 201

原创 POJ 3349

#include <iostream>#include <stdlib.h>#include <algorithm>#include <vector>using namespace std;const int SIZE = 100000;struct snow{ int a[6];};vector<snow> sn...

2018-03-20 10:15:05 107

原创回溯的一些思考

堆栈中有元素abcdef，每次出栈可以选择一个或者两个元素栈，当有两个元素出栈时可以选择其中一个重新入栈，当栈为空时，总共有多少种出栈方法？对于本题目的一些思考，对于回溯问题，要记得恢复现场。#include <iostream>#include <vector>#include <queue>using namesp...

2018-03-19 21:13:59 1129

原创 POJ 2299

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>#include <map>#include <set>

2018-03-19 12:12:58 123

原创 POJ 1035

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>#include <map>#include <set>

2018-03-18 17:30:55 128

原创 POJ 3080

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>#include <map>#include <set>

2018-03-18 16:17:16 343 1

原创 POJ 1080

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>#include <map>using namespace std;int tes

2018-03-16 20:57:40 164

原创 POJ 1260

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>using namespace std;const int SIZE = 102;const ...

2018-03-15 20:28:49 264

原创 poj 1836

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>using namespace std;const int SIZE = 1003;doubl...

2018-03-15 19:08:14 191

原创 poj 3267

#include <iostream>#include <stdio.h>#include <algorithm>#include <vector>#include <string>#include <cstring>using namespace std;vector<string> strli

2018-03-15 16:50:43 198

原创 nyoj 传纸条（一）

#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <string>#include <vector>using namespace std;const int size = 52;// thi...

2018-03-14 20:18:01 197

原创 LCS

题目链接#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <string>#include <vector>using namespace std;// longest common sequence// three cases// 1) dp[i][j] = 0

2018-03-14 11:35:06 178

原创 poj 1837

#include <iostream>#include <string>#include <stdio.h>#include <string.h>using namespace std;// if you can think of the state as distance*weight, then the problem is easy...

2018-03-11 14:55:51 160

原创 poj 2955

#include <iostream>#include <string>#include <stdio.h>#include <string.h>using namespace std;string s;int n;const int size = 100;int dp[size][size];bool match(int i,in...

2018-03-11 14:17:46 147

原创 nyoj 括号匹配（二）

#include <iostream>#include <string.h>#include <stdio.h>#include <string>using namespace std;const int size = 100;string s;int testcase;int n;int dp[size][size];const...

2018-03-11 13:17:30 181

原创 poj 1088

The first dp problem#include <iostream>#include <string.h>using namespace std;const int size = 100;int road[size][size];int len[size][size];int row, col;int direction[4][2] = {{0,...

2018-03-10 20:34:29 139

原创 poj 2240

#include &lt;iostream&gt;#include &lt;map&gt;#include &lt;string.h&gt;#include &lt;string&gt;using namespace std;const int size = 31;int n;map&lt;string, int&gt; str2ix;

2018-03-10 16:53:45 176

原创 poj 1125

#include <iostream>#include <string.h>using namespace std;const int size = 101;int road[size][size];const int INF = 0x3f3f3f3f;int n;int main(){ while (scanf("%d", &n)&&...

2018-03-10 15:54:51 171

原创 poj 2253

#include &amp;amp;lt;iostream&amp;amp;gt;#include &amp;amp;lt;math.h&amp;amp;gt;#include &amp;amp;lt;string.h&amp;amp;gt;#include &amp;amp;lt;stdio.h&amp;amp;gt;#include &amp;amp;l

2018-03-10 15:10:35 180

原创 poj 1062

#include &amp;lt;iostream&amp;gt;#include &amp;lt;string.h&amp;gt;using namespace std;int min(int x,int y){ return x&amp;gt;y?y:x;}int m, n;const int size = 101;const int INF = 0x3f3f3f3f;int road[size][s

2018-03-10 13:25:21 130

原创 poj 3259

#include &lt;iostream&gt;#include &lt;string.h&gt;#include &lt;vector&gt;using namespace std;const int size = 501;const int INF = 0x3f3f3f3f;int f, n,m, w;struct Node{ int a,b,c; Node(i...

2018-03-08 16:04:44 117

原创 poj 1060

#include &amp;lt;iostream&amp;gt;#include &amp;lt;string.h&amp;gt;#include &amp;lt;vector&amp;gt;using namespace std;struct Node{ int a,b; double r,m; Node(int a,int b, double r, double m):a(

2018-03-08 14:51:39 190

原创 ccf csp 俄罗斯方块

#include &lt;iostream&gt;#include &lt;string.h&gt;using namespace std;const int row = 15, col = 10;const int size = 4;int road[row+size][col];int block[size][size];int startcol;bool iscollisi...

2018-03-05 16:40:51 530

原创 recursive decent calculator parser

#include <iostream>#include <assert.h>using namespace std;/** * calculator parser * express -> express+term | express-term | term * term -> term*primary | term/primary | prima...

2018-03-04 22:12:23 239

空空如也

空空如也