- 博客(7)
- 资源 (2)
- 收藏
- 关注
原创 Codeforces Round #297 (Div. 2) E - Anya and Cubes
题解#include using namespace std;typedef long long LL;int N, K;LL S;int a[26];LL A[26];map sum[26];void dfs(int p, int k, LL s){ if(s > S || k > K) return; if(p == N / 2) { sum[k][s] ++;
2015-03-27 18:35:07 435
原创 Light OJ 1129 (Tire树)
Light OJ 1129详细: view#include#includeusing namespace std;bool ok;int ch[100010][10];int val[100010];int ord;char ss[10005][15];void init(){ memset(ch[0],0,sizeof(ch[0
2015-03-22 22:38:08 410
原创 Codeforces Round #296 (Div. 2) B C题
题解: view#include#include#include#include#include#includeusing namespace std;const int maxn=200005;vector pos1[30],pos2[30];char s1[maxn],s2[maxn];map, int> mp;int main(){ //fr
2015-03-19 10:10:03 406
原创 Hashmap C++实现
了解一下hashmap的写法!(有时候出题人会故意卡这个~~) const int HASH = 1000007;struct HASHMAP{ int head[HASH],next[MAXN],size; long long state[MAXN]; void init() { size = 0; memset(he
2015-03-12 22:08:10 1313
原创 Codeforces Round #294 (Div. 2) D题:A and B and Interesting Substrings
read more 代码: #include#include#include#include#include#include#include#includeusing namespace std;typedef long long LL;typedef unsigned long long ULL;const int N=5+1e5;LL val[26
2015-03-06 17:51:34 489
原创 codeforce round #295(div2) C题
详解: view 代码:#include#include#includeusing namespace std;char ss[100005];const int MOD=7+1e9;int cal(char ch){if(ch=='A') return 0;else if(ch=='C') return 1;else if(ch=='G') retu
2015-03-05 12:58:10 432
原创 POJ 1321 棋盘问题
搜索简单题,加深一下对dfs的理解! dfs(int c,int cnt) c代表当前所处的列数,cnt表示当前已经选好了cnt个棋子。 还是看代码吧!还是挺好理解的! #include#include#include#include#include#include#include#define sf scanf#define pf printfus
2015-03-02 18:48:26 407
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人